Mai intai trebuie sa te autentifici.
Borderou de evaluare (job #3284064)
| Utilizator | Data | 10 martie 2025 22:10:14 | |
|---|---|---|---|
| Problema | Heavy Path Decomposition | Status | done |
| Runda | Arhiva educationala | Compilator | cpp-64 | Vezi sursa |
| Scor | 80 | ||
Raport evaluator
Compilare:
main.cpp: In function 'void find_heavy(int, int)':
main.cpp:68:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
68 | for( int i = 0; i < edges[vf].size(); i++ ) {
| ~~^~~~~~~~~~~~~~~~~~
main.cpp:77:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
77 | for( int i = 0; i < edges[vf].size(); i++ ) {
| ~~^~~~~~~~~~~~~~~~~~
main.cpp:78:44: warning: 'max_fiu' may be used uninitialized [-Wmaybe-uninitialized]
78 | if( edges[vf][i] != nod[vf].parent && edges[vf][i] != max_fiu )
main.cpp:62:19: note: 'max_fiu' was declared here
62 | int maxx = 0, max_fiu;
| ^~~~~~~
| Test | Timp executie | Memorie folosita | Mesaj | Punctaj/test | Punctaj/grupa |
|---|---|---|---|---|---|
| 1 | 0ms | 303kb | OK | 5 | 10 |
| 2 | 1ms | 311kb | OK | 5 | |
| 3 | 3ms | 557kb | OK | 5 | 10 |
| 4 | 7ms | 819kb | OK | 5 | |
| 5 | 64ms | 7028kb | OK | 5 | 20 |
| 6 | 44ms | 5681kb | OK | 5 | |
| 7 | 69ms | 6799kb | OK | 5 | |
| 8 | 44ms | 5758kb | OK | 5 | |
| 9 | 102ms | 13316kb | OK | 5 | 20 |
| 10 | 63ms | 10633kb | OK | 5 | |
| 11 | 113ms | 12767kb | OK | 5 | |
| 12 | 58ms | 10633kb | OK | 5 | |
| 13 | 143ms | 16773kb | OK | 5 | 20 |
| 14 | 118ms | 14970kb | OK | 5 | |
| 15 | 138ms | 17530kb | OK | 5 | |
| 16 | 118ms | 15024kb | OK | 5 | |
| 17 | 133ms | 20512kb | Memory limit exceeded | 0 | 0 |
| 18 | 138ms | 18067kb | OK | 5 | |
| 19 | 163ms | 20332kb | OK | 5 | |
| 20 | 143ms | 18092kb | OK | 5 | |
| Punctaj total | 80 | ||||
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !
