Submission #952954

#TimeUsernameProblemLanguageResultExecution timeMemory
952954kilikumaConnecting Supertrees (IOI20_supertrees)C++17
11 / 100
143 ms24132 KiB
#include "supertrees.h" #include <bits/stdc++.h> using namespace std; int construct(vector<vector<int>> p) { int n = p.size(); vector<vector<int>> answer; for (int i = 0; i < n; i ++) { vector<int> row; row.resize(n); answer.push_back(row); } for (int i = 0; i < n; i ++) { for (int j = 0; j < n; j ++) { if ((i == (j + 1)) or (j == (i + 1))) { answer[i][j] = 1; } } } 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...