Submission #541666

#TimeUsernameProblemLanguageResultExecution timeMemory
541666MurotYConnecting Supertrees (IOI20_supertrees)C++14
11 / 100
162 ms23976 KiB
#include "supertrees.h" #include <bits/stdc++.h> 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++) answer[i][j]=0; } 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...