제출 #1221095

#제출 시각아이디문제언어결과실행 시간메모리
1221095hmms127슈퍼트리 잇기 (IOI20_supertrees)C++20
0 / 100
0 ms328 KiB
#include "supertrees.h" #include <vector> using namespace std; int construct(std::vector<std::vector<int>> p) { int n=p[0].size(); vector<vector<int>>v(n,vector<int>(n,0)); for(int i=0;i<n-1;i++){ v[i][i+1]=1; if(i)v[i][i-1]=1; } build(v); 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...