Borderou de evaluare (job #2293853)

Utilizator MoldooooooooMoldoveanu Stefan Moldoooooooo Data 1 decembrie 2018 17:26:52
Problema Bile Status done
Runda Arhiva de probleme Compilator cpp-64 | Vezi sursa
Scor 10

Raport evaluator

Compilare: main.cpp: In function 'int main()': main.cpp:25:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation] if(1>Max)Max=1; V=0; ^~ main.cpp:25:25: note: ...this statement, but the latter is misleadingly indented as if it is guarded by the 'if' if(1>Max)Max=1; V=0; ^ main.cpp:18:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result] freopen("bile.in", "r", stdin); ^ main.cpp:19:37: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result] freopen("bile.out", "w", stdout); ^ main.cpp:20:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &N); Pair a; a.first=a.second=-1; Pair p; ^ main.cpp:21:74: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result] for(i=1; i<=N*N; ++i) {scanf("%d%d", &List[i].first, &List[i].second); Head[List[i].first][List[i].second]=a; Count[List[i].first][List[i].second]=1; Peak[List[i].first][List[i].second]=1;} ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
12ms131kbOK10
23ms262kbIncorect0
35ms393kbIncorect0
48ms524kbKilled by Signal 110
520ms917kbIncorect0
622ms1048kbKilled by Signal 110
723ms1179kbKilled by Signal 110
830ms1179kbKilled by Signal 110
940ms1179kbKilled by Signal 110
1028ms1179kbKilled by Signal 110
Punctaj total10

Ceva nu functioneaza?