제출 #424491

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