| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 292475 | Autoratch | Split the Attractions (IOI19_split) | C++14 | 121 ms | 14196 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 "split.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5;
int n,a,b,c;
vector<int> adj[N];
vector<int> sq;
bool visited[N];
void dfs(int u)
{
if(visited[u]) return;
visited[u] = true;
sq.push_back(u);
for(int v : adj[u]) dfs(v);
}
vector<int> find_split(int _n,int _a,int _b,int _c,vector<int> p,vector<int> q)
{
n = _n,a = _a,b = _b,c = _c;
for(int i = 0;i < p.size();i++)
{
int a = p[i],b = q[i];
adj[a].push_back(b),adj[b].push_back(a);
}
dfs(0);
vector<int> res(n);
for(int i = 0;i < a;i++) res[sq[i]] = 1;
for(int i = a;i < a+b;i++) res[sq[i]] = 2;
for(int i = a+b;i < n;i++) res[sq[i]] = 3;
return res;
}
Compilation message (stderr)
| # | 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... | ||||
