Submission #304457

#TimeUsernameProblemLanguageResultExecution timeMemory
304457SorahISAConnecting Supertrees (IOI20_supertrees)C++17
11 / 100
240 ms22136 KiB
#include "supertrees.h" #include <bits/stdc++.h> using namespace std; using pii = pair<int, int>; template<typename T> using Prior = priority_queue<T>; template<typename T> using prior = priority_queue<T, vector<T>, greater<T>>; #define X first #define Y second #define ALL(x) (x).begin(), (x).end() #define eb emplace_back #define pb push_back int construct(vector<vector<int>> p) { int n = p.size(); vector<vector<int>> ans(n, vector<int>(n, 0)); for (auto vec : p) { for (auto x : vec) { if (x == 3) return 0; } } for (int i = 0; i < n-1; ++i) { ans[i][i+1] = ans[i+1][i] = 1; } build(ans); 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...