Submission #335703

#TimeUsernameProblemLanguageResultExecution timeMemory
335703richyrichConnecting Supertrees (IOI20_supertrees)C++17
11 / 100
252 ms24172 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; for (int i = 0; i < n; i++) { std::vector<int> row; row.resize(n); answer.push_back(row); } for(int i = 0; i < n; i++) { for(int j = 0; j < n; j++) { if((i==0 || j == 0) && (i != j)) answer[i][j] = answer[j][i] = 1; else answer[i][j] = answer[j][i] = 0; } } 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...