제출 #349511

#제출 시각아이디문제언어결과실행 시간메모리
349511izhang05슈퍼트리 잇기 (IOI20_supertrees)C++17
11 / 100
246 ms22380 KiB
#include "supertrees.h" #include <bits/stdc++.h> using namespace std; int construct(vector<vector<int>> p) { int n = p.size(); vector<vector<int>> sol(n, vector<int>(n)); for (int i = 0; i < n - 1; i++) { sol[i][i + 1] = 1; sol[i + 1][i] = 1; } build(sol); return 1; } #ifdef DEBUG int main() { freopen("1.in", "r", stdin); int n; cin >> n; vector<vector<int>> a(n, vector<int>(n)); for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { cin >> a[i][j]; } } cout << construct(a) << "\n"; } #endif
#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...