제출 #963779

#제출 시각아이디문제언어결과실행 시간메모리
963779SuPythony슈퍼트리 잇기 (IOI20_supertrees)C++17
0 / 100
1 ms348 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)); for (int i=0; i<n; i++) { ans[i][i]=1; if (i<n-1) { ans[i][i+1]=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...