Submission #696257

#TimeUsernameProblemLanguageResultExecution timeMemory
696257T0p_Connecting Supertrees (IOI20_supertrees)C++14
11 / 100
171 ms22048 KiB
// Subtask 2 #include "supertrees.h" #include <bits/stdc++.h> using namespace std; const int N = 1000; bool visited[N]; int construct(vector<vector<int>> p) { int n = p.size(); vector<vector<int>> ans(n, vector<int> (n, 0)); for (int i=0 ; i<n ; i++) { if (visited[i]) continue ; visited[i] = true; for (int j=0 ; j<i ; j++) if (p[i][j] == 1) return 0; for (int j=i+1 ; j<n ; j++) if (p[i][j] == 1) { if (visited[j]) return 0; visited[j] = true; ans[i][j] = ans[j][i] = 1; } } build(ans); return 1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...