Pagini recente » Borderou de evaluare (job #510764) | Borderou de evaluare (job #515060) | Borderou de evaluare (job #889582) | Cod sursa (job #2412031) | Borderou de evaluare (job #1493620)
Borderou de evaluare (job #1493620)
Raport evaluator
Compilare:
user.cpp: In function ‘void dijkstra(int)’:
user.cpp:29:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(i=0; i<g[dad].size(); i++)
^
user.cpp: In function ‘void lant(int, int*)’:
user.cpp:54:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(i=0; i<g[dad].size() && !gasit; i++)
^
user.cpp: In function ‘int main()’:
user.cpp:78:38: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("trilant.in", "r", stdin);
^
user.cpp:79:40: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("trilant.out", "w", stdout);
^
user.cpp:81:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &n, &m);
^
user.cpp:82:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d %d", &a, &b, &c);
^
user.cpp:85:41: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d %d", &x, &y, &cost);
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 0ms | 1628kb | Killed by signal 11(SIGSEGV). | 0 | 0 |
11 | 0ms | 1640kb | Nodul comun X trebuie sa fie prezent in toate drumurile pe prima pozitie | 0 |
2 | 0ms | 1620kb | Killed by signal 11(SIGSEGV). | 0 | 0 |
12 | 0ms | 1624kb | Killed by signal 11(SIGSEGV). | 0 |
3 | 4ms | 1700kb | Killed by signal 11(SIGSEGV). | 0 | 0 |
13 | 20ms | 2088kb | Killed by signal 11(SIGSEGV). | 0 |
4 | 4ms | 1704kb | Killed by signal 11(SIGSEGV). | 0 | 0 |
14 | 8ms | 1800kb | Killed by signal 11(SIGSEGV). | 0 |
5 | 8ms | 1784kb | Nodul comun X trebuie sa fie prezent in toate drumurile pe prima pozitie | 0 | 0 |
15 | 8ms | 1912kb | Killed by signal 11(SIGSEGV). | 0 |
6 | 628ms | 9552kb | Killed by signal 11(SIGSEGV). | 0 | 0 |
16 | 0ms | 1636kb | Corect | 5 |
7 | 520ms | 8368kb | Killed by signal 11(SIGSEGV). | 0 | 0 |
17 | 0ms | 1640kb | Cost prea mare | 0 |
8 | 500ms | 7656kb | Killed by signal 11(SIGSEGV). | 0 | 0 |
18 | 132ms | 5824kb | Nodul comun X trebuie sa fie prezent in toate drumurile pe prima pozitie | 0 |
9 | 632ms | 9144kb | Killed by signal 11(SIGSEGV). | 0 | 0 |
19 | 116ms | 5564kb | Nodul comun X trebuie sa fie prezent in toate drumurile pe prima pozitie | 0 |
10 | 696ms | 9504kb | Killed by signal 11(SIGSEGV). | 0 | 0 |
20 | 116ms | 5588kb | Nodul comun X trebuie sa fie prezent in toate drumurile pe prima pozitie | 0 |
Punctaj total | 0 |