#include <bits/stdc++.h>
#include "split.h"
using namespace std;
const int N = 1e5 + 1;
vector<int> g[N];
vector<int> res;
bool vis[N];
int A, B, C;
int cnt = 0;
void dfs(int u) {
cnt++;
res[u] = 2;
vis[u] = true;
if (cnt == B) {
return;
}
for (auto v : g[u]) {
if (!vis[v] && cnt + 1 <= B) {
dfs(v);
}
}
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
A = a; B = b; C = c;
int m = p.size();
res.resize(n);
for (int i = 0; i < m; i++) {
g[p[i]].push_back(q[i]);
g[q[i]].push_back(p[i]);
}
if (a == 1) {
dfs(0);
for (int i = 0; i < n; i++) {
if (res[i] == 0) {
if (A) {
res[i] = 1;
A--;
}
else {
res[i] = 3;
}
}
}
}
return res;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |