제출 #1243192

#제출 시각아이디문제언어결과실행 시간메모리
1243192nikulid슈퍼트리 잇기 (IOI20_supertrees)C++20
0 / 100
0 ms324 KiB
#include "supertrees.h" #include <vector> using namespace std; #define pb push_back int construct(vector<vector<int>> p) { int n = p.size(); vector<vector<int>> answer; // test case 1 (line city) vector<int> ns(n); for(int i=0; i<n; i++){ for(int j=0; j<n; j++){ ns[j]=(j == i-1 || j == i || j == i+1); } answer.pb(ns); } build(answer); 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...