제출 #1315022

#제출 시각아이디문제언어결과실행 시간메모리
1315022yus1f_m슈퍼트리 잇기 (IOI20_supertrees)C++20
0 / 100
0 ms332 KiB
//#pragma GCC optimize("O3") #include <bits/stdc++.h> #include "supertrees.h" using namespace std; int construct(vector<vector<int>>nums) { vector<vector<int>>ans(nums.size()); for(int i=0;i<nums.size()-1;i++) { ans[i].push_back(i+1),ans[i+1].push_back(i); } 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...