Nu aveti permisiuni pentru a descarca fisierul grader_test3.in
Borderou de evaluare (job #1319002)
Utilizator | andrei Walrus21 | Data | 16 ianuarie 2015 16:16:29 |
---|---|---|---|
Problema | Algoritmul lui Dijkstra | Status | done |
Runda | Arhiva educationala | Compilator | cpp | Vezi sursa |
Scor | 20 |
Raport evaluator
Compilare:
user.cpp: In function ‘void dj(int)’:
user.cpp:22:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(j=0;j<g[k].size();j++)
^
user.cpp:27:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(j=0;j<g[k].size();j++)
^
user.cpp: In function ‘int main()’:
user.cpp:34:37: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("dijkstra.in","r",stdin);
^
user.cpp:35:39: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("dijkstra.out","w",stdout);
^
user.cpp:36:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&n,&m);
^
user.cpp:39:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d",&x,&y,&c);
^
Test | Timp executie | Memorie folosita | Mesaj | Punctaj/test |
---|---|---|---|---|
1 | 12ms | Depăşit | Memory limit exceeded. | 0 |
2 | 0ms | 864kb | OK | 10 |
3 | 12ms | Depăşit | Memory limit exceeded. | 0 |
4 | 16ms | Depăşit | Memory limit exceeded. | 0 |
5 | 32ms | Depăşit | Memory limit exceeded. | 0 |
6 | 56ms | Depăşit | Memory limit exceeded. | 0 |
7 | 72ms | Depăşit | Memory limit exceeded. | 0 |
8 | 76ms | 1972kb | OK | 10 |
9 | 200ms | Depăşit | Memory limit exceeded. | 0 |
10 | 260ms | Depăşit | Memory limit exceeded. | 0 |
Punctaj total | 20 |
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !