Submission #1077867

#TimeUsernameProblemLanguageResultExecution timeMemory
1077867BoasSplit the Attractions (IOI19_split)C++17
18 / 100
60 ms12372 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 pair<int, int> ii; typedef vector<i32> vi32; typedef vector<int> vi; typedef vector<ii> vii; typedef vector<bool> vb; typedef vector<vi> vvi; typedef vector<vii> vvii; typedef vector<vb> vvb; vi find_split(int n, int a, int b, int c, vi p, vi q) { vii prts = {{a, 1}, {b, 2}, {c, 3}}; sort(ALL(prts)); int A = prts[0].first, B = prts[1].first; int aix = prts[0].second, bix = prts[1].second, cix = prts[2].second; 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); vb vis(n); int cnt = 0; auto dfs = [&](auto &&self, int i) -> void { if (cnt < B) res[i] = bix; else if (cnt < A + B) res[i] = aix; else res[i] = cix; cnt++; vis[i] = 1; for (int j : adj[i]) { if (vis[j]) continue; self(self, j); } }; dfs(dfs, 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...