# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
419050 | EncryptingWolf | Split the Attractions (IOI19_split) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <vector>
#include <iostream>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
#define FOR(i,x,y) for (ll i = x; i <y; i++)
vector<vector<int>> adj;
vector<int> ret;
void dfs(int x)
{
if (ret[x] == 2)
return;
ret[x] == 2;
for (auto i : adj[x])
dfs(i);
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q)
{
ret.resize(n, 3);
FOR(i, 0, p.size())
{
adj[p[i]].push_back[q[i]];
adj[q[i]].push_back[p[i]];
}
dfs(0);
FOR(i, 0, n)
{
if (ret[i] != 2)
{
ret[i] = 1;
return ret;
}
}
return ret;
}