Submission #1287008

#TimeUsernameProblemLanguageResultExecution timeMemory
1287008nathlol2Connecting Supertrees (IOI20_supertrees)C++20
11 / 100
94 ms26120 KiB
#include "supertrees.h" #include <bits/stdc++.h> using namespace std; int construct(std::vector<std::vector<int>> p) { int n = p.size(); vector<vector<int>> ans(n, vector<int>(n, 0)); vector<vector<int>> g(n); vector<bool> v(n, 0); for(int i = 0;i<n;i++){ for(int j = 0;j<n;j++){ if(p[i][j] != p[n - i - 1][n - j - 1]) return 0; if(i == j) continue; if(p[i][j]){ g[i].push_back(j); } } } for(int i = 0;i<n;i++){ if(v[i]) continue; v[i] = 1; int pv = i; for(auto x : g[i]){ v[x] = 1; ans[pv][x] = 1; ans[x][pv] = 1; pv = x; } } 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...