Pagini recente » Borderou de evaluare (job #44657) | Borderou de evaluare (job #87776) | Monitorul de evaluare | Borderou de evaluare (job #2201285) | Borderou de evaluare (job #2129682)
Borderou de evaluare (job #2129682)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:21:36: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen ( "sahara.in","r",stdin );
^
user.cpp:22:38: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen ( "sahara.out","w",stdout );
^
user.cpp:24:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf ( "%d%d%d%d",&n,&m,&Q,&t );
^
user.cpp:26:46: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf ( "%d%d%d%d%d",&x1,&y1,&x2,&y2,&q );
^
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 0ms | 1160kb | Incorect | 0 |
| 2 | 4ms | 2112kb | Incorect | 0 |
| 3 | 12ms | 7332kb | Incorect | 0 |
| 4 | 48ms | Depăşit | Memory limit exceeded. | 0 |
| 5 | 48ms | Depăşit | Memory limit exceeded. | 0 |
| 6 | 96ms | Depăşit | Memory limit exceeded. | 0 |
| 7 | 88ms | Depăşit | Memory limit exceeded. | 0 |
| 8 | 60ms | 5772kb | Incorect | 0 |
| 9 | 104ms | 5772kb | Incorect | 0 |
| 10 | 92ms | 5692kb | Incorect | 0 |
| 11 | 88ms | Depăşit | Memory limit exceeded. | 0 |
| 12 | 60ms | 7028kb | Incorect | 0 |
| 13 | 84ms | 10496kb | Incorect | 0 |
| 14 | 88ms | Depăşit | Memory limit exceeded. | 0 |
| 15 | 88ms | Depăşit | Memory limit exceeded. | 0 |
| 16 | 140ms | Depăşit | Memory limit exceeded. | 0 |
| 17 | 140ms | Depăşit | Memory limit exceeded. | 0 |
| 18 | 88ms | Depăşit | Memory limit exceeded. | 0 |
| 19 | 140ms | Depăşit | Memory limit exceeded. | 0 |
| 20 | 0ms | 860kb | Incorect | 0 |
| Punctaj total | 0 |