Submission #1312921

#TimeUsernameProblemLanguageResultExecution timeMemory
1312921tuncay_pasha슈퍼트리 잇기 (IOI20_supertrees)C++20
11 / 100
86 ms22000 KiB
#include "supertrees.h" #include <vector> using namespace std; int construct(std::vector<std::vector<int>> p) { int n = size(p.front()); vector<vector<int>> ans(n, vector<int>(n, 0)); for (int i = 1; i < n; ++i) ans[0][i] = ans[i][0] = 1; build(ans); 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...