# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
447642 | 2021-07-27T08:02:45 Z | EliteCallsYou | Connecting Supertrees (IOI20_supertrees) | C++17 | 242 ms | 25888 KB |
#include "supertrees.h" #include <bits/stdc++.h> using namespace std ; ////////////////////////////////////////////////// vector < int > mp[1001] ; bool ans = true ; //////////////////////////////////////////////// int construct(std::vector<std::vector<int>> p) { int n = (int)p.size(); /////////////////////////////////////// for ( int i = 0 ; i < n ; i ++ ){ for ( int j = i+1 ; j < n ; j ++ ){ if ( p[i][j] && i != j ){ mp[i].push_back(j) ; mp[j].push_back(i) ; } } } for ( int i = 0 ; i < n ; i ++ ){ if ( (int)mp[i].size() == 1 ){ return 0 ; } } ////////////////////////////////////// bool been[1001] = {false} ; int bridge[n][n] ; for ( int i = 0 ; i < n ; i ++ ){ for ( int j = 0 ; j < n ; j ++ ){ bridge[i][j] = 0 ; } } for ( int i = 0 ; i < n ; i ++ ){ for ( int j = i+1 ; j < n ; j ++ ){ if ( p[i][j] ){ continue ; } for ( int child : mp[i] ){ if ( p[child][j] ){ return 0 ; } } } } //################################################ for ( int i = 0 ; i < n ; i ++ ){ int last = -1 ; for ( int j = i+1 ; j < n ; j ++ ){ if ( p[i][j] ){ last = j ; for ( int l = j-1 ; l >= i ; l -- ){ if ( !p[i][l] ){ continue ; } bridge[j][l] = 1 ; bridge[l][j] = 1 ; break ; } } } if ( last != -1 ){ bridge[i][last] = 1; bridge[last][i] = 1; } } //################################################ std::vector<std::vector<int>> answer; for ( int i = 0 ; i < n ; i ++ ){ std::vector < int > row ; for ( int j = 0 ; j < n ; j ++ ){ row.push_back(bridge[i][j]) ; }answer.push_back(row) ; } build(answer); return 1; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Incorrect | 1 ms | 204 KB | Answer gives possible 0 while actual possible 1 |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Incorrect | 1 ms | 204 KB | Answer gives possible 0 while actual possible 1 |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Correct | 1 ms | 204 KB | Output is correct |
4 | Correct | 1 ms | 204 KB | Output is correct |
5 | Correct | 1 ms | 204 KB | Output is correct |
6 | Correct | 0 ms | 216 KB | Output is correct |
7 | Correct | 1 ms | 204 KB | Output is correct |
8 | Correct | 11 ms | 1372 KB | Output is correct |
9 | Correct | 242 ms | 25888 KB | Output is correct |
10 | Incorrect | 0 ms | 204 KB | Too many ways to get from 0 to 4, should be 2 found no less than 3 |
11 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 0 ms | 204 KB | Output is correct |
3 | Incorrect | 0 ms | 204 KB | Too many ways to get from 1 to 4, should be 1 found no less than 2 |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Incorrect | 1 ms | 204 KB | Answer gives possible 0 while actual possible 1 |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Incorrect | 1 ms | 204 KB | Answer gives possible 0 while actual possible 1 |
3 | Halted | 0 ms | 0 KB | - |