제출 #302882

#제출 시각아이디문제언어결과실행 시간메모리
302882ivan24슈퍼트리 잇기 (IOI20_supertrees)C++14
0 / 100
1 ms256 KiB
#include "supertrees.h" #include <bits/stdc++.h> using namespace std; typedef vector<int> vi; typedef vector<vi> vvi; typedef pair<int,int> ii; typedef vector<ii> vii; typedef vector<vii> vvii; #define F first #define S second int construct(vvi p) { int n = p.size(); vvi ans(n,vi(n,0)); for (int i = 0; n > i; i++){ ans[i][0] = ans[0][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...