Pagini recente » Borderou de evaluare (job #778232) | Borderou de evaluare (job #1950091) | Borderou de evaluare (job #2340329) | Borderou de evaluare (job #698150) | Borderou de evaluare (job #2317987)
Borderou de evaluare (job #2317987)
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]
 | Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
✓ | 1 | 5ms | 262kb | Incorect. Doresti sa deblochezi acest test pentru 4.99? | 0 |
✓ | 2 | 12ms | 524kb | Incorect. Doresti sa deblochezi acest test pentru 4.99? | 0 |
✓ | 3 | 16ms | 786kb | Incorect. Doresti sa deblochezi acest test pentru 4.99? | 0 |
✓ | 4 | 19ms | 917kb | Incorect. Doresti sa deblochezi acest test pentru 4.99? | 0 |
✓ | 5 | 21ms | 1048kb | Incorect. Doresti sa deblochezi acest test pentru 4.99? | 0 |
✓ | 6 | 22ms | 1048kb | Incorect. Doresti sa deblochezi acest test pentru 4.99? | 0 |
✓ | 7 | 20ms | 917kb | Incorect. Doresti sa deblochezi acest test pentru 4.99? | 0 |
✓ | 8 | 49ms | 1441kb | Incorect. Doresti sa deblochezi acest test pentru 4.99? | 0 |
✓ | 9 | 51ms | 1441kb | Incorect. Doresti sa deblochezi acest test pentru 4.99? | 0 |
✓ | 10 | 55ms | 1441kb | Wall time limit exceeded | 0 |
✓ | 11 | 60ms | 1441kb | Wall time limit exceeded | 0 |
✓ | 12 | 55ms | 2490kb | Wall time limit exceeded | 0 |
✓ | 13 | 48ms | 2097kb | Incorect. Doresti sa deblochezi acest test pentru 4.99? | 0 |
✓ | 14 | 53ms | 2359kb | Incorect. Doresti sa deblochezi acest test pentru 4.99? | 0 |
✓ | 15 | 56ms | 2490kb | Wall time limit exceeded | 0 |
✓ | 16 | 56ms | 2490kb | Wall time limit exceeded | 0 |
✓ | 17 | 62ms | 2490kb | Wall time limit exceeded | 0 |
✓ | 18 | 55ms | 2490kb | Wall time limit exceeded | 0 |
✓ | 19 | 52ms | 2490kb | Wall time limit exceeded | 0 |
✓ | 20 | 57ms | 2490kb | Wall time limit exceeded | 0 |
Punctaj total | 0 |