Pagini recente » Borderou de evaluare (job #2168365) | Borderou de evaluare (job #2698558) | Borderou de evaluare (job #3001888) | Borderou de evaluare (job #1348889) | Borderou de evaluare (job #1242751)
Borderou de evaluare (job #1242751)
Raport evaluator
Compilare:
user.cpp: In function ‘bool cmp1(const int&, const int&)’:
user.cpp:13:18: warning: array subscript is above array bounds [-Warray-bounds]
return a[x][2]<a[y][2]; else
^
user.cpp:13:26: warning: array subscript is above array bounds [-Warray-bounds]
return a[x][2]<a[y][2]; else
^
user.cpp: In function ‘bool cmp2(const int&, const int&)’:
user.cpp:19:15: warning: array subscript is above array bounds [-Warray-bounds]
if (a[x][2]==a[y][2])
^
user.cpp:19:24: warning: array subscript is above array bounds [-Warray-bounds]
if (a[x][2]==a[y][2])
^
user.cpp: In function ‘int main()’:
user.cpp:45:33: warning: array subscript is above array bounds [-Warray-bounds]
r[m2[1]]+=a[m2[1]][2]; ++z[m2[1]][2];
^
user.cpp:45:48: warning: array subscript is above array bounds [-Warray-bounds]
r[m2[1]]+=a[m2[1]][2]; ++z[m2[1]][2];
^
user.cpp:45:48: warning: array subscript is above array bounds [-Warray-bounds]
user.cpp:48:42: warning: array subscript is above array bounds [-Warray-bounds]
if ((2*m1[1]+2*r[m1[1]]+a[m1[1]][2])<max(m1[2]+r[m1[2]], m2[1]+r[m2[1]]))
^
user.cpp:51:39: warning: array subscript is above array bounds [-Warray-bounds]
++z[m1[1]][1]; ++z[m1[1]][2];
^
user.cpp:51:39: warning: array subscript is above array bounds [-Warray-bounds]
user.cpp:56:40: warning: array subscript is above array bounds [-Warray-bounds]
r[m2[1]]+=a[m2[1]][2]; ++z[m2[1]][2];
^
user.cpp:56:55: warning: array subscript is above array bounds [-Warray-bounds]
r[m2[1]]+=a[m2[1]][2]; ++z[m2[1]][2];
^
user.cpp:56:55: warning: array subscript is above array bounds [-Warray-bounds]
user.cpp:67:79: warning: array subscript is above array bounds [-Warray-bounds]
while (((a[m1[k]][1]+r[m1[k]]==a[m1[k+1]][1]+r[m1[k+1]]) && (a[m1[k]][2]>a[m1[k+1]][2])) && (k<n))
^
user.cpp:67:93: warning: array subscript is above array bounds [-Warray-bounds]
while (((a[m1[k]][1]+r[m1[k]]==a[m1[k+1]][1]+r[m1[k+1]]) && (a[m1[k]][2]>a[m1[k+1]][2])) && (k<n))
^
user.cpp:76:26: warning: array subscript is above array bounds [-Warray-bounds]
while (((a[m2[k]][2]+r[m2[k]])>(a[m2[k+1]][2]+r[m2[k+1]])) && (k<n))
^
user.cpp:76:51: warning: array subscript is above array bounds [-Warray-bounds]
while (((a[m2[k]][2]+r[m2[k]])>(a[m2[k+1]][2]+r[m2[k+1]])) && (k<n))
^
user.cpp:81:27: warning: array subscript is above array bounds [-Warray-bounds]
while (((a[m2[k]][2]+r[m2[k]]==a[m2[k+1]][2]+r[m2[k+1]]) && (m2[k]>m2[k+1])) && (k<n))
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 404kb | OK! | 10 |
2 | 0ms | 408kb | OK! | 10 |
3 | 0ms | 408kb | Wrong answer! | 0 |
4 | 0ms | 400kb | OK! | 10 |
5 | 0ms | 400kb | Wrong answer! | 0 |
6 | 0ms | 404kb | Wrong answer! | 0 |
7 | 0ms | 404kb | Wrong answer! | 0 |
8 | 0ms | 400kb | OK! | 10 |
9 | 0ms | 404kb | Wrong answer! | 0 |
10 | 0ms | 404kb | Wrong answer! | 0 |
Punctaj total | 40 |