Submission #794134

#TimeUsernameProblemLanguageResultExecution timeMemory
79413412345678Connecting Supertrees (IOI20_supertrees)C++17
11 / 100
157 ms23984 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 (abs(i-j)==1) answer[i][j]=1; else answer[i][j]=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...