Borderou de evaluare (job #2235335)

Utilizator retrogradLucian Bicsi retrograd Data 26 august 2018 16:17:13
Problema Nespus Status done
Runda Algoritmiada 2018 Runda Maraton Compilator cpp | Vezi sursa
Scor 0

Raport evaluator

Compilare: user.cpp: In constructor ‘DynConn::DynConn(int, int)’: user.cpp:9:29: warning: ‘DynConn::sz’ will be initialized after [-Wreorder] vector<int> link, rank, sz; ^~ user.cpp:8:36: warning: ‘std::vector<std::vector<std::pair<int, int> > > DynConn::edges’ [-Wreorder] vector<vector<pair<int, int>>> edges; ^~~~~ user.cpp:12:5: warning: when initialized here [-Wreorder] DynConn(int n, int k) : link(n, -1), rank(n, 0), sz(n, 1), edges(4 * n), k(k) {} ^~~~~~~ user.cpp: In member function ‘bool DynConn::Solve(int, int, int)’: user.cpp:38:19: warning: variable ‘e’ set but not used [-Wunused-but-set-variable] for (auto e : edges[node]) { ^
Feedback Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
✓14ms1272kbOK50
✗20ms1272kbIncorect0
✓344ms1460kbOK50
✗448ms1456kbOK5
✗544ms1456kbOK5
✗64ms1444kbIncorect0
✓7Depăşit14436kbTime limit exceeded.00
✓8Depăşit15168kbTime limit exceeded.0
✗9Depăşit15000kbTime limit exceeded.0
✗10500ms14704kbIncorect0
✗11436ms14636kbIncorect0
✓12Depăşit14372kbTime limit exceeded.0
✓13Depăşit27980kbTime limit exceeded.00
✓14Depăşit28508kbTime limit exceeded.0
✗15Depăşit28512kbTime limit exceeded.0
✗16Depăşit28516kbTime limit exceeded.0
✗17Depăşit28508kbTime limit exceeded.0
✗18Depăşit28508kbTime limit exceeded.0
✗19Depăşit28512kbTime limit exceeded.0
✓20Depăşit27980kbTime limit exceeded.0
Punctaj total0

Ceva nu functioneaza?