제출 #622308

#제출 시각아이디문제언어결과실행 시간메모리
622308JomnoiSplit the Attractions (IOI19_split)C++17
0 / 100
1 ms2644 KiB
#include <bits/stdc++.h> #include "split.h" using namespace std; const int MAX_N = 1e5 + 5; int N, M, A, B, C; int sz[MAX_N]; vector <int> graph[MAX_N]; vector <int> res; void dfs(int u, int p, int a, int &A) { A--; res[u] = a; for(auto v : graph[u]) { if(res[v] == p and A > 0) { dfs(v, p, a, A); } } } vector <int> find_split(int n, int a, int b, int c, vector <int> p, vector <int> q) { N = n, M = p.size(), A = a, B = b, C = c; res.resize(N, 0); for(int i = 0; i < M; i++) { graph[p[i]].push_back(q[i]); graph[q[i]].push_back(p[i]); } int rt = 0; for(int i = 0; i < N; i++) { if(graph[i].size() == 1) { rt = i; break; } } dfs(rt, 0, 2, B); for(int i = 0; i < N; i++) { if(res[i] == 0) { dfs(i, 0, -1, B = A); if(B == 0) { dfs(i, -1, 1, A); break; } } } for(int i = 0; i < N; i++) { if(res[i] != 1 and res[i] != 2) { res[i] = 3; } } if(A != 0 or B != 0 or C != 0) { fill(res.begin(), res.end(), 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...