제출 #451960

#제출 시각아이디문제언어결과실행 시간메모리
451960rainboy슈퍼트리 잇기 (IOI20_supertrees)C++17
11 / 100
240 ms24044 KiB
#include "supertrees.h" #include <cstdio> using namespace std; typedef vector<int> vi; int abs_(int a) { return a > 0 ? a : -a; } int construct(vector<vi> pp) { int n = pp.size(), i, j; vector<vi> aa(n); for (i = 0; i < n; i++) { aa[i].resize(n); for (j = 0; j < n; j++) aa[i][j] = abs_(i - j) == 1 ? 1 : 0; } build(aa); 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...