| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 156740 | 2019-10-07T08:08:26 Z | AKaan37 | Split the Attractions (IOI19_split) | C++17 | 0 ms | 0 KB |
#include "split.h"
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//Abdulhamid Han
//Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;
int m,b[li],a[li],k,flag,t,vis[li],bb,say,visit[li];
int cev;
string s;
vector<int> v[li];
vector<int> vv;
inline void dfs(int node,int der,ind){
if(vis[node]==1)return ;
vis[node]=1;
for(int i=0;i<(int)v[node].size();i++){
int go=v[node][i];
dfs(go,der+1);
}
if(visit[i]==0){
say++;
visit[i]=ind
if(say==bb)return ;
}
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
bb=b;
for(int i=0;i<(int)p.size();i++){
v[q[i]].pb(p[i]);
v[p[i]].pb(q[i]);
}
dfs(0,0,2);
bb=a;
memset(vis,0,sizeof(vis));
dfs(0,0,1);
for(int i=0;i<n;i++){
if(vis[i]==2){vv.pb(2);}
else if(vis[i]==1){a--;vv.pb(1);}
else vv.pb(3);
}
return vv;
}