Pagini recente » Borderou de evaluare (job #1724992) | Borderou de evaluare (job #1101065) | Borderou de evaluare (job #1235484) | Borderou de evaluare (job #1369684) | Borderou de evaluare (job #3355045)
Borderou de evaluare (job #3355045)
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 |
| 1 | 0ms | 303kb | OK | 10 |
| 2 | 0ms | 303kb | OK | 10 |
| 3 | 1ms | 1081kb | OK | 10 |
| 4 | 1ms | 819kb | OK | 10 |
| 5 | 1ms | 1605kb | OK | 10 |
| 6 | 3ms | 4755kb | Memory limit exceeded | 0 |
| 7 | 3ms | 4751kb | Memory limit exceeded | 0 |
| 8 | 3ms | 5013kb | Memory limit exceeded | 0 |
| 9 | 3ms | 3178kb | OK | 10 |
| 10 | 1ms | 1605kb | OK | 10 |
| Punctaj total | 70 |