Borderou de evaluare (job #2317987)

Utilizator TeddyDinutaDinuta Eduard Stefan TeddyDinuta Data 13 ianuarie 2019 12:35:40
Problema GrEA Status done
Runda Fmi No Stress 8 Compilator cpp-64 | Vezi sursa
Scor 0

Raport evaluator

Compilare: main.cpp: In function 'int main()': main.cpp:8:33: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result] freopen("grea.in","r",stdin); ^ main.cpp:9:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result] freopen("grea.out","w",stdout); ^ main.cpp:10:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d",&n,&k); ^ main.cpp:14:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result] scanf(" %c",&a[i][j]); ^ main.cpp:25:33: warning: array subscript is above array bounds [-Warray-bounds] ans[1][i]=min(ans[2][i-k]+1,ans[1][i-1]+1); ~~~~~^ main.cpp:26:22: warning: array subscript is above array bounds [-Warray-bounds] if(poz[2][i-1]>=i-k) ~~~~~^ main.cpp:27:44: warning: array subscript is above array bounds [-Warray-bounds] ans[1][i]=min(ans[1][i],ans[2][poz[2][i-1]]+1); ~~~~~^ main.cpp:31:22: warning: array subscript is above array bounds [-Warray-bounds] if(poz[2][i-1]>=i-k) ~~~~~^ main.cpp:32:44: warning: array subscript is above array bounds [-Warray-bounds] ans[1][i]=min(ans[1][i],ans[2][poz[2][i-1]]+1); ~~~~~^ main.cpp:35:15: warning: array subscript is above array bounds [-Warray-bounds] if(a[2][j]=='0') ~~~^ main.cpp:39:50: warning: array subscript is above array bounds [-Warray-bounds] ans[2][j]=min(ans[1][j-k]+1,ans[2][j-1]+1); ~~~~~^ main.cpp:39:22: warning: array subscript is above array bounds [-Warray-bounds] ans[2][j]=min(ans[1][j-k]+1,ans[2][j-1]+1); ~~~~~^ main.cpp:41:23: warning: array subscript is above array bounds [-Warray-bounds] ans[2][j]=min(ans[2][j],ans[1][poz[1][j-1]]+1); ~~~~~^ main.cpp:44:29: warning: array subscript is above array bounds [-Warray-bounds] ans[2][j]=ans[2][j-1]+1; ~~~~~^ main.cpp:44:19: warning: array subscript is above array bounds [-Warray-bounds] ans[2][j]=ans[2][j-1]+1; ~~~~~^ main.cpp:46:19: warning: array subscript is above array bounds [-Warray-bounds] ans[2][j]=min(ans[2][j],ans[1][poz[1][j-1]]+1); ~~~~~^ main.cpp:52:22: warning: array subscript is above array bounds [-Warray-bounds]
Feedback Test Timp executie Memorie folosita Mesaj Punctaj/test
15ms262kbIncorect. Doresti sa deblochezi acest test pentru 4.99?0
212ms524kbIncorect. Doresti sa deblochezi acest test pentru 4.99?0
316ms786kbIncorect. Doresti sa deblochezi acest test pentru 4.99?0
419ms917kbIncorect. Doresti sa deblochezi acest test pentru 4.99?0
521ms1048kbIncorect. Doresti sa deblochezi acest test pentru 4.99?0
622ms1048kbIncorect. Doresti sa deblochezi acest test pentru 4.99?0
720ms917kbIncorect. Doresti sa deblochezi acest test pentru 4.99?0
849ms1441kbIncorect. Doresti sa deblochezi acest test pentru 4.99?0
951ms1441kbIncorect. Doresti sa deblochezi acest test pentru 4.99?0
1055ms1441kbWall time limit exceeded0
1160ms1441kbWall time limit exceeded0
1255ms2490kbWall time limit exceeded0
1348ms2097kbIncorect. Doresti sa deblochezi acest test pentru 4.99?0
1453ms2359kbIncorect. Doresti sa deblochezi acest test pentru 4.99?0
1556ms2490kbWall time limit exceeded0
1656ms2490kbWall time limit exceeded0
1762ms2490kbWall time limit exceeded0
1855ms2490kbWall time limit exceeded0
1952ms2490kbWall time limit exceeded0
2057ms2490kbWall time limit exceeded0
Punctaj total0

Ceva nu functioneaza?