Borderou de evaluare (job #1999294)

Utilizator theodor.moroianuTheodor Moroianu theodor.moroianu Data 10 iulie 2017 20:22:08
Problema Flux maxim de cost minim Status done
Runda Arhiva educationala Compilator cpp | Vezi sursa
Scor 100

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
10ms432kbOK1010
20ms424kbOK1010
30ms452kbOK1010
40ms448kbOK1010
50ms448kbOK1010
6248ms784kbOK1020
7272ms784kbOK10
8576ms980kbOK1030
9412ms976kbOK10
10536ms976kbOK10
Punctaj total100

Ceva nu functioneaza?