Submission #1024195

#TimeUsernameProblemLanguageResultExecution timeMemory
1024195vjudge1Connecting Supertrees (IOI20_supertrees)C++17
11 / 100
140 ms22096 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(); std::vector<std::vector<int>> answer(n, vector<int>(n, 0)); for (int i = 0; i < n; i++) { if(p[i][i] == 0) return 0; for(int j = 0; j < n; ++j){ if(i == j) continue; if(i == 0 && p[i][j] == 1) answer[i][j] = 1; } if(i != 0 && p[i][0] == 1) answer[i][0] = 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...