Borderou de evaluare (job #1997995)

Utilizator GoogalAbabei Daniel Googal Data 6 iulie 2017 08:59:57
Problema Cuplaj maxim in graf bipartit Status done
Runda Arhiva educationala Compilator cpp | Vezi sursa
Scor 20

Raport evaluator

Compilare: user.cpp: In function ‘void addedge(int, int)’: user.cpp:30:31: warning: narrowing conversion of ‘g[j].std::vector<_Tp, _Alloc>::size<Edge, std::allocator<Edge> >()’ from ‘std::vector<Edge>::size_type {aka unsigned int}’ to ‘int’ inside { } [-Wnarrowing] Edge direct = {j, g[j].size(), 1, 0}; ^ user.cpp:31:32: warning: narrowing conversion of ‘g[i].std::vector<_Tp, _Alloc>::size<Edge, std::allocator<Edge> >()’ from ‘std::vector<Edge>::size_type {aka unsigned int}’ to ‘int’ inside { } [-Wnarrowing] Edge inverse = {i, g[i].size(), 0, 0}; ^ user.cpp: In function ‘bool bfs()’: user.cpp:61:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i = 0; i < g[from].size(); i++){ ^ user.cpp: In function ‘int dfs(int, int)’: user.cpp:76:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i = 0; i < g[from].size(); i++){ ^ user.cpp: In function ‘void tracesol()’: user.cpp:105:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int j = 0; j < g[i].size(); j++){ ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
10ms684kbNod inexistent in graf4
20ms688kbNod inexistent in graf4
30ms692kbNod inexistent in graf4
44ms760kbNod inexistent in graf4
524ms848kbNod inexistent in graf4
6Depăşit1472kbTime limit exceeded.0
7Depăşit2600kbTime limit exceeded.0
8Depăşit2212kbTime limit exceeded.0
9Depăşit3576kbTime limit exceeded.0
10Depăşit6424kbTime limit exceeded.0
Punctaj total20

Ceva nu functioneaza?