Pagini recente » Borderou de evaluare (job #208139) | Borderou de evaluare (job #2832204) | Borderou de evaluare (job #471482) | Borderou de evaluare (job #840536) | Borderou de evaluare (job #1999294)
Borderou de evaluare (job #1999294)
Raport evaluator
Compilare:
user.cpp: In constructor ‘Graph::Graph(int, int, int)’:
user.cpp:19:12: warning: ‘Graph::s’ will be initialized after [-Wreorder]
int n, d, s;
^
user.cpp:19:9: warning: ‘int Graph::d’ [-Wreorder]
int n, d, s;
^
user.cpp:21:2: warning: when initialized here [-Wreorder]
Graph(int _n, int _s, int _d) : n(_n), s(_s), d(_d), adia(vector <vector <int>>(_n + 1)) { }
^
user.cpp:19:9: warning: ‘Graph::d’ will be initialized after [-Wreorder]
int n, d, s;
^
user.cpp:16:24: warning: ‘std::vector<std::vector<int> > Graph::adia’ [-Wreorder]
vector <vector <int>> adia;
^
user.cpp:21:2: warning: when initialized here [-Wreorder]
Graph(int _n, int _s, int _d) : n(_n), s(_s), d(_d), adia(vector <vector <int>>(_n + 1)) { }
^
user.cpp: In member function ‘int Graph::recursive_mincost(int)’:
user.cpp:59:2: warning: control reaches end of non-void function [-Wreturn-type]
}
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 0ms | 432kb | OK | 10 | 10 |
2 | 0ms | 424kb | OK | 10 | 10 |
3 | 0ms | 452kb | OK | 10 | 10 |
4 | 0ms | 448kb | OK | 10 | 10 |
5 | 0ms | 448kb | OK | 10 | 10 |
6 | 248ms | 784kb | OK | 10 | 20 |
7 | 272ms | 784kb | OK | 10 |
8 | 576ms | 980kb | OK | 10 | 30 |
9 | 412ms | 976kb | OK | 10 |
10 | 536ms | 976kb | OK | 10 |
Punctaj total | 100 |