Pagini recente »
Borderou de evaluare (job #751612)
Borderou de evaluare (job #751612)
Raport evaluator
Compilare:
main.cpp: In function 'int main()':
main.cpp:16:21: warning: array subscript 10 is above array bounds of 'int [10]' [-Warray-bounds=]
16 | for(a[10][10][10]={-1},F>>n;l<n;F>>i>>j>>k,m=max(max(max(a[i][j][k],a[i][k][j]),max(a[j][i][k],a[j][k][i])),max(a[k][i][j],a[k][j][i])),m>=0?t=max(t,l-m+1):a[i][j][k]=l,++l);
| ~~~~~~~~~~~~^
main.cpp:5:9: note: while referencing 'a'
5 | int n,c,a[10][10][10],i,j,k,l,t,m;
| ^
main.cpp:16:13: warning: array subscript 10 is above array bounds of 'int [10][10][10]' [-Warray-bounds=]
16 | for(a[10][10][10]={-1},F>>n;l<n;F>>i>>j>>k,m=max(max(max(a[i][j][k],a[i][k][j]),max(a[j][i][k],a[j][k][i])),max(a[k][i][j],a[k][j][i])),m>=0?t=max(t,l-m+1):a[i][j][k]=l,++l);
| ~~~~^
main.cpp:5:9: note: while referencing 'a'
5 | int n,c,a[10][10][10],i,j,k,l,t,m;
| ^
| Test |
Timp execuție |
Memorie folosită |
Mesaj |
Punctaj/test |
|
1
|
1 ms
|
241 kb
|
OK
|
2
|
|
2
|
1 ms
|
245 kb
|
OK
|
2
|
|
3
|
1 ms
|
245 kb
|
OK
|
2
|
|
4
|
1 ms
|
245 kb
|
OK
|
2
|
|
5
|
1 ms
|
245 kb
|
OK
|
2
|
|
6
|
1 ms
|
249 kb
|
OK
|
2
|
|
7
|
39 ms
|
245 kb
|
OK
|
2
|
|
8
|
58 ms
|
249 kb
|
OK
|
2
|
|
9
|
76 ms
|
249 kb
|
OK
|
2
|
|
10
|
79 ms
|
245 kb
|
OK
|
2
|
|
11
|
1 ms
|
245 kb
|
OK
|
3
|
|
12
|
1 ms
|
245 kb
|
OK
|
3
|
|
13
|
2 ms
|
507 kb
|
OK
|
3
|
|
14
|
1 ms
|
245 kb
|
OK
|
3
|
|
15
|
1 ms
|
245 kb
|
OK
|
3
|
|
16
|
1 ms
|
249 kb
|
OK
|
3
|
|
17
|
39 ms
|
245 kb
|
OK
|
3
|
|
18
|
69 ms
|
245 kb
|
OK
|
3
|
|
19
|
69 ms
|
249 kb
|
OK
|
3
|
|
20
|
68 ms
|
249 kb
|
OK
|
3
|
|
21
|
1 ms
|
245 kb
|
OK
|
5
|
|
22
|
1 ms
|
245 kb
|
Incorect
|
0
|
|
23
|
1 ms
|
245 kb
|
Incorect
|
0
|
|
24
|
1 ms
|
245 kb
|
OK
|
5
|
|
25
|
1 ms
|
245 kb
|
Incorect
|
0
|
|
26
|
1 ms
|
249 kb
|
Incorect
|
0
|
|
27
|
52 ms
|
245 kb
|
Incorect
|
0
|
|
28
|
59 ms
|
249 kb
|
Incorect
|
0
|
|
29
|
79 ms
|
249 kb
|
Incorect
|
0
|
|
30
|
78 ms
|
245 kb
|
Incorect
|
0
|
|
Punctaj total
|
60
|