Pagini recente » Borderou de evaluare (job #2211311) | Borderou de evaluare (job #207789) | Borderou de evaluare (job #2425355) | Borderou de evaluare (job #2707636) | Borderou de evaluare (job #2237863)
Borderou de evaluare (job #2237863)
Raport evaluator
Compilare:
user.cpp: In function ‘void addEdge(int, int, int, int)’:
user.cpp:29:37: warning: narrowing conversion of ‘g[to].std::vector<_Tp, _Alloc>::size<Edge, std::allocator<Edge> >()’ from ‘std::vector<Edge>::size_type {aka unsigned int}’ to ‘int’ inside { } [-Wnarrowing]
g[from].push_back({to , g[to].size() , cap , 0, index });
~~~~~~~~~~^~
user.cpp:30:42: warning: narrowing conversion of ‘(g[from].std::vector<_Tp, _Alloc>::size<Edge, std::allocator<Edge> >() - 1u)’ from ‘std::vector<Edge>::size_type {aka unsigned int}’ to ‘int’ inside { } [-Wnarrowing]
g[to].push_back({from , g[from].size() - 1 , cap , 0 , index} );
~~~~~~~~~~~~~~~^~~
user.cpp: In function ‘bool bfs()’:
user.cpp:45:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int h = 0 ; h < g[node].size() ;h++){
~~^~~~~~~~~~~~~~~~
user.cpp: In function ‘int dfs(int, int)’:
user.cpp:61:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int &h = rem[node] ; h < g[node].size() ;h++){
~~^~~~~~~~~~~~~~~~
user.cpp: In function ‘int maxflow()’:
user.cpp:82:10: warning: unused variable ‘ok’ [-Wunused-variable]
bool ok = 0;
^~
user.cpp: In function ‘void mark(int, int)’:
user.cpp:101:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int h = 0 ; h < g[node].size() ;h++){
~~^~~~~~~~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 1424kb | Okay! | 10 |
2 | 0ms | 1420kb | Okay! | 10 |
3 | 0ms | 1492kb | Okay! | 10 |
4 | 0ms | 1460kb | Okay! | 10 |
5 | 0ms | 1492kb | Okay! | 10 |
6 | 4ms | 1736kb | Okay! | 10 |
7 | 12ms | 2172kb | Okay! | 10 |
8 | 12ms | 1980kb | Okay! | 10 |
9 | 8ms | 1940kb | Okay! | 10 |
10 | 12ms | 2076kb | Okay! | 10 |
Punctaj total | 100 |