제출 #429267

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