제출 #320236

#제출 시각아이디문제언어결과실행 시간메모리
320236blue슈퍼트리 잇기 (IOI20_supertrees)C++17
11 / 100
258 ms24124 KiB
#include "supertrees.h" #include <vector> using namespace std; int construct(vector< vector<int> > p) { int n = p.size(); vector< vector<int> > b(n); for(int i = 0; i < n; i++) b[i] = vector<int>(n, 0); for(int i = 0; i < n-1; i++) b[i][i+1] = b[i+1][i] = 1; build(b); 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...