Pagini recente » Borderou de evaluare (job #1004903) | Borderou de evaluare (job #1824529) | Borderou de evaluare (job #1878885) | Borderou de evaluare (job #2196341) | Borderou de evaluare (job #1296906)
Borderou de evaluare (job #1296906)
Raport evaluator
Compilare:
user.cpp: In function ‘void update(int)’:
user.cpp:14:45: warning: suggest parentheses around ‘-’ inside ‘<<’ [-Wparentheses]
a[2][j]=max(a[1][j],a[1][j+(1<<i-1)]);
^
user.cpp: In function ‘int main()’:
user.cpp:34:45: warning: suggest parentheses around ‘-’ inside ‘<<’ [-Wparentheses]
a[2][j]=max(a[1][j],a[1][j+(1<<i-1)]);
^
user.cpp:22:41: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("saracsaurege.in","r",stdin);
^
user.cpp:23:43: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("saracsaurege.out","w",stdout);
^
user.cpp:24:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d",&n,&m);
^
user.cpp:26:41: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&a[0][i]),a[1][i]=a[0][i];
^
user.cpp:41:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d",&x,&y);
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 268kb | OK | 10 |
2 | 16ms | 280kb | OK | 10 |
3 | Depăşit | 420kb | Time limit exceeded. | 0 |
4 | Depăşit | 280kb | Time limit exceeded. | 0 |
5 | Depăşit | 1032kb | Time limit exceeded. | 0 |
6 | Depăşit | 1032kb | Time limit exceeded. | 0 |
7 | Depăşit | 1032kb | Time limit exceeded. | 0 |
8 | Depăşit | 1028kb | Time limit exceeded. | 0 |
9 | Depăşit | 1032kb | Time limit exceeded. | 0 |
10 | Depăşit | 1032kb | Time limit exceeded. | 0 |
Punctaj total | 20 |