Pagini recente » Borderou de evaluare (job #2880997) | Borderou de evaluare (job #2431832) | Borderou de evaluare (job #42167) | Borderou de evaluare (job #1940889) | Borderou de evaluare (job #2073939)
Borderou de evaluare (job #2073939)
Raport evaluator
Compilare:
user.cpp: In function ‘void Bellman_ford(int)’:
user.cpp:29:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0; i<g[top].size(); i++)
^
user.cpp: In function ‘int main()’:
user.cpp:56:42: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("bellmanford.in", "r", stdin);
^
user.cpp:57:44: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("bellmanford.out", "w", stdout);
^
user.cpp:59:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &n, &m);
^
user.cpp:63:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d", &x, &y, &c);
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 0ms | 876kb | Incorect | 0 | 0 |
2 | 0ms | 864kb | OK | 5 | 5 |
3 | 0ms | 876kb | Incorect | 0 | 0 |
4 | 0ms | 880kb | Incorect | 0 | 0 |
5 | 0ms | 908kb | Incorect | 0 | 0 |
6 | 0ms | 884kb | Incorect | 0 | 0 |
7 | 0ms | 892kb | Incorect | 0 |
8 | 20ms | 1296kb | Incorect | 0 | 0 |
9 | 44ms | 1648kb | Incorect | 0 |
10 | 4ms | 884kb | OK | 5 |
11 | 32ms | 1604kb | Incorect | 0 | 0 |
12 | 100ms | 2612kb | Incorect | 0 |
13 | 76ms | 2144kb | Incorect | 0 |
14 | 152ms | 3188kb | Incorect | 0 |
15 | 180ms | 3672kb | Incorect | 0 | 0 |
16 | 140ms | 3068kb | Incorect | 0 |
17 | 0ms | 904kb | Incorect | 0 |
18 | 200ms | 4004kb | Incorect | 0 | 0 |
19 | 248ms | 4668kb | Incorect | 0 |
20 | 20ms | 904kb | OK | 5 |
Punctaj total | 5 |