제출 #1315031

#제출 시각아이디문제언어결과실행 시간메모리
1315031yus1f_m슈퍼트리 잇기 (IOI20_supertrees)C++20
11 / 100
89 ms22012 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(),vector<int>(nums.size(),0)); for(int i=0;i<nums.size()-1;i++) { 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...