Pagini recente » Borderou de evaluare (job #2319509) | Borderou de evaluare (job #2221539) | Borderou de evaluare (job #1612890) | Borderou de evaluare (job #2319479) | Borderou de evaluare (job #2251938)
Borderou de evaluare (job #2251938)
Raport evaluator
Compilare:
user.cpp: In function ‘std::pair<int, int> FindnthAncestor(int, int, int)’:
user.cpp:36:9: warning: unused variable ‘depth’ [-Wunused-variable]
int depth=0;
^~~~~
user.cpp:68:1: warning: control reaches end of non-void function [-Wreturn-type]
}
^
user.cpp: In function ‘int main()’:
user.cpp:72:24: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
fscanf(IN,"%d ",&N);
^
user.cpp:76:45: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
fscanf(IN,"%d %d %d %d",&a,&b,&x,&y);
^
user.cpp:103:31: warning: ‘last’ may be used uninitialized in this function [-Wmaybe-uninitialized]
fprintf(OUT,"%d\n",Ans+last+min(depth1,depth2));
~~~^~~~~
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 0ms | 1316kb | Incorect | 0 |
| 2 | 0ms | 1316kb | Incorect | 0 |
| 3 | 0ms | 1316kb | Incorect | 0 |
| 4 | 0ms | 1316kb | Incorect | 0 |
| 5 | 0ms | 1312kb | OK | 4 |
| 6 | 0ms | 1312kb | Incorect | 0 |
| 7 | 0ms | 1316kb | Incorect | 0 |
| 8 | 0ms | 1312kb | Incorect | 0 |
| 9 | 0ms | 1312kb | Incorect | 0 |
| 10 | 0ms | 1316kb | Incorect | 0 |
| 11 | 0ms | 1316kb | OK | 4 |
| 12 | 0ms | 1316kb | OK | 4 |
| 13 | 28ms | 1316kb | Incorect | 0 |
| 14 | 24ms | 1312kb | Incorect | 0 |
| 15 | 20ms | 1320kb | Incorect | 0 |
| 16 | 16ms | 1312kb | Incorect | 0 |
| 17 | 8ms | 1312kb | Incorect | 0 |
| 18 | 4ms | 1312kb | Incorect | 0 |
| 19 | 8ms | 1312kb | Incorect | 0 |
| 20 | 8ms | 1316kb | Incorect | 0 |
| 21 | 4ms | 1316kb | Incorect | 0 |
| 22 | 0ms | 1316kb | Incorect | 0 |
| 23 | 0ms | 1312kb | Incorect | 0 |
| 24 | 0ms | 1316kb | Incorect | 0 |
| 25 | 0ms | 1312kb | Incorect | 0 |
| Punctaj total | 12 |