제출 #1256845

#제출 시각아이디문제언어결과실행 시간메모리
1256845rhm_ganSplit the Attractions (IOI19_split)C++20
18 / 100
51 ms12900 KiB
#include "split.h" #include <bits/stdc++.h> using namespace std; const int N = 1e5 + 1; vector<int> g[N]; vector<int> res; bool vis[N]; int A, B, C; vector<int> path; void dfs(int u, int c) { int mx = N; if (c == 1) mx = A; if (c == 2) mx = B; if (c == 3) mx = C; if (path.size() == mx) { return; } vis[u] = true; path.push_back(u); for (auto v : g[u]) { if (!vis[v]) { dfs(v, c); } } } vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) { res.resize(n); // if (a > b) swap(a, b); // if (a > c) swap(a, c); // if (b > c) swap(b, c); A = a; B = b; C = c; for (int i = 0; i < p.size(); i++) { g[p[i]].push_back(q[i]); g[q[i]].push_back(p[i]); } int x = 0; for (int i = 0; i < n; i++) { if (g[i].size() == 1) { x = i; break; } } dfs(x, 1); vector<int> ones = path; for (int i = 0; i < n; i++) { if (!vis[i]) { path.clear(); dfs(i, 2); if (path.size() == b) { for (auto u : path) { res[u] = 2; } for (auto u : ones) { res[u] = 1; } for (int i = 0; i < n; i++) { if (res[i] == 0) { res[i] = 3; } } return res; } } } 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...