Pagini recente » Algoritmiada 2012 - Runda 3, Clasele 11-12 | Cod sursa (job #2008655) | Cod sursa (job #665778) | Cod sursa (job #985236) | Borderou de evaluare (job #1566351)
Borderou de evaluare (job #1566351)
Raport evaluator
Compilare:
user.cpp: In function ‘void solve()’:
user.cpp:46:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < nodes.size(); i++)
^
user.cpp:8:19: warning: left shift count >= width of type [enabled by default]
#define INF (1 << 60)
^
user.cpp:47:18: note: in expansion of macro ‘INF’
dp[nodes[i]] = INF;
^
user.cpp:67:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < nodes.size(); i++) {
^
user.cpp: In function ‘int main()’:
user.cpp:8:19: warning: left shift count >= width of type [enabled by default]
#define INF (1 << 60)
^
user.cpp:125:17: note: in expansion of macro ‘INF’
cost[i][j] = INF;
^
user.cpp:8:19: warning: left shift count >= width of type [enabled by default]
#define INF (1 << 60)
^
user.cpp:175:13: note: in expansion of macro ‘INF’
solution = INF;
^
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
| 1 | 0ms | 412kb | Incorect | 0 | 0 |
| 2 | 0ms | 424kb | Incorect | 0 | 0 |
| 3 | 0ms | 424kb | Incorect | 0 | 0 |
| 4 | 0ms | 428kb | Incorect | 0 | 0 |
| 5 | 0ms | 428kb | Incorect | 0 |
| 6 | 0ms | 428kb | Incorect | 0 | 0 |
| 7 | 0ms | 432kb | Incorect | 0 |
| 8 | 0ms | 432kb | Incorect | 0 | 0 |
| 9 | 0ms | 428kb | Incorect | 0 |
| 10 | 0ms | 428kb | Incorect | 0 | 0 |
| 11 | 0ms | 416kb | Incorect | 0 | 0 |
| 12 | 0ms | 416kb | Incorect | 0 | 0 |
| 13 | 0ms | 416kb | Incorect | 0 | 0 |
| 14 | 0ms | 436kb | Incorect | 0 | 0 |
| 15 | 0ms | 428kb | Incorect | 0 |
| 16 | 0ms | 432kb | Incorect | 0 | 0 |
| 17 | 0ms | 428kb | Incorect | 0 |
| 18 | 0ms | 428kb | Incorect | 0 | 0 |
| 19 | 0ms | 428kb | Incorect | 0 |
| 20 | 0ms | 432kb | Incorect | 0 |
| Punctaj total | 0 |