Submission #1295428

#TimeUsernameProblemLanguageResultExecution timeMemory
1295428kawhiet슈퍼트리 잇기 (IOI20_supertrees)C++20
11 / 100
88 ms22020 KiB
#include <bits/stdc++.h> #include "supertrees.h" using namespace std; int construct(vector<vector<int>> p) { int n = p.size(); vector<vector<int>> ans(n, vector<int>(n)); for (int i = 1; i < n; i++) { ans[i][i - 1] = 1; ans[i - 1][i] = 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...