Submission #487685

#TimeUsernameProblemLanguageResultExecution timeMemory
487685ala2Connecting Supertrees (IOI20_supertrees)C++14
11 / 100
180 ms23908 KiB
#include "supertrees.h" #include <vector> using namespace std; int construct(vector<vector<int>> p) { int n = p.size(); vector<vector<int>> answer; for (int i = 0; i < n; i++) { vector<int> row; row.resize(n); answer.push_back(row); } for(int i=0;i<n-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...