Pagini recente » Borderou de evaluare (job #1134411) | Borderou de evaluare (job #1733240) | Borderou de evaluare (job #739100) | Borderou de evaluare (job #2199568) | Borderou de evaluare (job #1859013)
Borderou de evaluare (job #1859013)
Raport evaluator
Compilare:
user.cpp: In function ‘void dfs(int, int)’:
user.cpp:19:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(i = 0; i < v[nod].size(); i++){
^
user.cpp:39:72: warning: array subscript has type ‘char’ [-Wchar-subscripts]
if(d[vecin][ii] < d[maxf[nod][j].f ][maxf[nod][j].s]){
^
user.cpp:50:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(i = 0; i < v[nod].size(); i++){
^
user.cpp:54:70: warning: array subscript has type ‘char’ [-Wchar-subscripts]
if(e[vecin][0] > d[ maxf[nod][j].f ][ maxf[nod][j].s ] + 2){
^
user.cpp:56:71: warning: array subscript has type ‘char’ [-Wchar-subscripts]
e[vecin][0] = d[ maxf[nod][j].f ][ maxf[nod][j].s ] + 2;
^
user.cpp:59:74: warning: array subscript has type ‘char’ [-Wchar-subscripts]
if(e[vecin][1] > d[ maxf[nod][j].f ][ maxf[nod][j].s ] + 2){
^
user.cpp:60:75: warning: array subscript has type ‘char’ [-Wchar-subscripts]
e[vecin][1] = d[ maxf[nod][j].f ][ maxf[nod][j].s ] + 2;
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 4ms | 4712kb | Incorect | 0 | 0 |
2 | 4ms | 4720kb | Incorect | 0 | 0 |
3 | 4ms | 4760kb | Incorect | 0 | 0 |
4 | 4ms | 4712kb | Incorect | 0 | 0 |
5 | 4ms | 4760kb | Incorect | 0 | 0 |
6 | 4ms | 4756kb | Incorect | 0 | 0 |
7 | 4ms | 4756kb | OK | 5 | 5 |
8 | 4ms | 4708kb | OK | 5 | 5 |
9 | 16ms | 5096kb | Incorect | 0 | 0 |
10 | 4ms | 4716kb | Incorect | 0 |
11 | 4ms | 4712kb | Incorect | 0 |
12 | 4ms | 4716kb | OK | 5 |
13 | 4ms | 4708kb | OK | 5 |
14 | 4ms | 4712kb | Incorect | 0 |
15 | 4ms | 4712kb | OK | 5 |
16 | 4ms | 4716kb | OK | 5 |
17 | 104ms | 8304kb | Incorect | 0 |
18 | 124ms | 8408kb | OK | 5 |
19 | 124ms | 8456kb | OK | 5 |
20 | 128ms | 8632kb | OK | 5 |
Punctaj total | 10 |