Submission #366983

#TimeUsernameProblemLanguageResultExecution timeMemory
366983PurpleCrayonConnecting Supertrees (IOI20_supertrees)C++17
11 / 100
233 ms22120 KiB
#include "supertrees.h" #include <bits/stdc++.h> using namespace std; #define ar array #define sz(v) int(v.size()) int n; int construct(vector<vector<int>> g) { n = sz(g); vector<vector<int>> ans(n, vector<int>(n)); bool done=0; [&](){ for (int i = 0; i < n; i++) for (int j = i+1; j < n; j++) if (g[i][j] != 1) return; for (int i = 1; i < n; i++) ans[i][0] = ans[0][i] = 1; build(ans), done=1; }(); return done; }
#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...