Borderou de evaluare (job #421563)

Utilizator ciprianfFarcasanu Alexandru Ciprian ciprianf Data 21 martie 2010 14:39:57
Problema Pirati Status done
Runda Algoritmiada 2010, Runda 4, Clasele 11-12 Compilator cpp | Vezi sursa
Scor 0

Raport evaluator

Compilare: main.cpp: In function 'int main()': main.cpp:58:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result] freopen("pirati.in", "r", stdin); ^ main.cpp:59:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result] freopen("pirati.out", "w", stdout); ^ main.cpp:60:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d%d\n", &m, &n, &k); ^ main.cpp:62:31: warning: ignoring return value of 'char* fgets(char*, int, FILE*)', declared with attribute warn_unused_result [-Wunused-result] fgets(S[i] + 1, NMAX, stdin); ^ main.cpp:73:40: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d%d%d", &x1, &y1, &x2, &y2); ^ main.cpp: In function 'void fill2(int, int)': main.cpp:19:13: warning: iteration 7 invokes undefined behavior [-Waggressive-loop-optimizations] if(x+lin[t] && x + lin[t]<= m && y+col[t] && y+col[t]<=n && S[x+lin[t]][y+col[t]] =='0') ~~~~~^ main.cpp:18:19: note: within this loop for(int t = 0; t < 8; ++t) ~~^~~ main.cpp: In function 'void fill(int, int)': main.cpp:26:15: warning: iteration 7 invokes undefined behavior [-Waggressive-loop-optimizations] if(S[x+lin[t]][y+col[t]]=='1') ~~~~~^ main.cpp:25:19: note: within this loop for(int t = 0; t < 8; ++t){ ~~^~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
121ms12845kbKilled by Signal 110
222ms12976kbKilled by Signal 110
332ms13205kbKilled by Signal 110
427ms13238kbKilled by Signal 110
531ms14024kbKilled by Signal 110
629ms13762kbKilled by Signal 110
725ms14024kbKilled by Signal 110
830ms14680kbKilled by Signal 110
927ms13893kbKilled by Signal 110
1026ms14024kbKilled by Signal 110
1126ms12713kbKilled by Signal 110
1221ms12713kbKilled by Signal 110
Punctaj total0

Ceva nu functioneaza?