제출 #735050

#제출 시각아이디문제언어결과실행 시간메모리
735050Elvin_Fritl슈퍼트리 잇기 (IOI20_supertrees)C++17
0 / 100
1 ms212 KiB
#include <bits/stdc++.h>
using namespace std;
 
void build(vector<vector<int> > b);
 
bool vis[1002];
int construct(vector<vector<int> > p) {
    int n = (int)p.size();
    vector<vector<int> > ans(n,vector<int>(n,0));
    
 
    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...