Submission #779120

#TimeUsernameProblemLanguageResultExecution timeMemory
779120JosiaConnecting Supertrees (IOI20_supertrees)C++17
0 / 100
0 ms212 KiB
#include "supertrees.h" #include <vector> #include <bits/stdc++.h> using namespace std; int construct(std::vector<std::vector<int>> p) { int n = p.size(); vector<vector<int>> answer(n, vector<int>(n)); vector<int> vals; for (int i = 0; i<n; i++) { bool isZero = p[i][0]; for (int j = 0; j<n; j++) { if ((p[i][j] == 0) != isZero) return 0; } if (!isZero) vals.push_back(i); } for (int i = 0; i<(int)(vals.size())-1; i++) { answer[i][i+1] = 1; answer[i+1][i] = 1; } build(answer); 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...