제출 #429259

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