Submission #1077812

#TimeUsernameProblemLanguageResultExecution timeMemory
1077812BoasSplit the Attractions (IOI19_split)C++17
0 / 100
869 ms1048576 KiB
#include "split.h" #include <bits/stdc++.h> using namespace std; #define sz(x) (int)x.size() #define pb push_back #define loop(x, i) for (int i = 0; i < x; i++) #define rev(x, i) for (int i = (int)x - 1; i >= 0; i--) #define ALL(x) begin(x), end(x) typedef signed i32; typedef vector<i32> vi32; typedef vector<int> vi; typedef vector<bool> vb; typedef vector<vi> vvi; typedef vector<vb> vvb; vi find_split(int n, int a, int b, int c, vi p, vi q) { vvi adj(n); int m = sz(p); loop(m, i) { adj[p[i]].pb(q[i]); adj[q[i]].pb(p[i]); } vi res(n); auto dfs = [&](auto &&dfs, int i, int prev, int cnt) -> void { if (cnt < a) res[i] = 1; else if (cnt < a + b) res[i] = 2; else res[i] = 3; for (int j : adj[i]) { if (j == prev) continue; dfs(dfs, j, i, cnt + 1); } }; dfs(dfs, 0, 0, 0); return res; }
#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...