Borderou de evaluare (job #3355045)

Utilizator domunlddomnuld d domunld Data 21 mai 2026 17:24:01
Problema Alee Status done
Runda Arhiva de probleme Compilator cpp-64 | Vezi sursa
Scor 70

Raport evaluator

Compilare: main.cpp: In function 'std::vector<std::set<int> > matrixToGraph(std::vector<std::vector<int> >&)': main.cpp:16:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 16 | for (int i = 1 ; i < adj.size(); i++ ){ | ~~^~~~~~~~~~~~ main.cpp:17:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 17 | for ( int j = 1 ; j < adj.size(); j ++ ) { | ~~^~~~~~~~~~~~ main.cpp:19:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 19 | if ( 1 <= i - 1 && i - 1 < adj.size() && adj[i-1][j] == 0 ) graph[(i-1)*((int)adj.size()-1)+j].insert((i-2)*((int)adj.size()-1)+j); | ~~~~~~^~~~~~~~~~~~ main.cpp:20:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 20 | if ( 1 <= i + 1 && i + 1 < adj.size() && adj[i+1][j] == 0 ) graph[(i-1)*((int)adj.size()-1)+j].insert((i)*((int)adj.size()-1)+j); | ~~~~~~^~~~~~~~~~~~ main.cpp:21:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 21 | if ( 1 <= j - 1 && j - 1 < adj.size() && adj[i][j-1] == 0 ) graph[(i-1)*((int)adj.size()-1)+j].insert((i-1)*((int)adj.size()-1)+j-1); | ~~~~~~^~~~~~~~~~~~ main.cpp:22:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 22 | if ( 1 <= j + 1 && j + 1 < adj.size() && adj[i][j+1] == 0 ) graph[(i-1)*((int)adj.size()-1)+j].insert((i-1)*((int)adj.size()-1)+j+1); | ~~~~~~^~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
10ms303kbOK10
20ms303kbOK10
31ms1081kbOK10
41ms819kbOK10
51ms1605kbOK10
63ms4755kbMemory limit exceeded0
73ms4751kbMemory limit exceeded0
83ms5013kbMemory limit exceeded0
93ms3178kbOK10
101ms1605kbOK10
Punctaj total70

Ceva nu functioneaza?