Submission #927691

#TimeUsernameProblemLanguageResultExecution timeMemory
927691RifalConnecting Supertrees (IOI20_supertrees)C++14
11 / 100
146 ms22092 KiB
#include "supertrees.h" #include <bits/stdc++.h> #define endl '\n' using namespace std; const int M = 1e3 + 4; int typ[M]; vector<int> v1[M], v2[M]; vector<vector<int>> gr; bool egd[M][M]; int cnt = 1; int construct(std::vector<std::vector<int>> p) { int n = p.size(); vector<int> cur; cur.push_back(0); for(int i = 1; i < n; i++) { cur.push_back(1); } gr.push_back(cur); for(int i = 1; i < n; i++) { cur.clear(); cur.push_back(1); for(int j = 1; j < n; j++) { cur.push_back(0); } gr.push_back(cur); } build(gr); 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...