Submission #1291616

#TimeUsernameProblemLanguageResultExecution timeMemory
1291616lucaskojimaConnecting Supertrees (IOI20_supertrees)C++17
11 / 100
91 ms22020 KiB
#include "bits/stdc++.h" #include "supertrees.h" #define sz(x) (int)size(x) #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) using namespace std; using ll = long long; using pii = pair<int, int>; const char nl = '\n'; const int INF = 0x3f3f3f3f; const ll LINF = 0x3f3f3f3f3f3f3f3f; int construct(vector<vector<int>> p) { int n = sz(p); vector ans(n, vector<int>(n)); for (int i = 0; i < n - 1; i++) { ans[i][i + 1] = 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...