Submission #1289631

#TimeUsernameProblemLanguageResultExecution timeMemory
1289631eri16슈퍼트리 잇기 (IOI20_supertrees)C++20
0 / 100
1 ms340 KiB
#include <bits/stdc++.h> #include "supertrees.h" using namespace std; /* void build(vector<vector<int>> v){ for (int i=0; i<v.size(); i++){ for (int j=0; j<v.size(); j++){ cout<<v[i][j]<<' '; } cout<<"\n"; } } */ int construct(vector<vector<int>> p){ int n=p.size(); vector<vector<int>> arr(n); for (int i=0; i<n; i++){ for (int j=0; j<n; j++){ arr[i].push_back(0); } } for (int i=0; i<n-1; i++){ arr[i][i+1]=1; arr[i+1][i]=1; } build(arr); return 0; } /* int main(){ vector<vector<int>> p = { {1,1,1,1}, {1,1,1,1}, {1,1,1,1}, {1,1,1,1} }; construct(p); }*/
#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...