# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
253656 | khangal | 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<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define po pop_back
#define pb push_back
#define mk make_pair
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define boost ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
#define MOD 1000000007
#define MAX 1e18
#define MIN -1e18
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
// typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// template< typename T>
// using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll sz,n,m,ans,mid,mn,mx,cnt,T,sum,h1,h2,e[1234567],b[1234567],c[1234567],d[1<<20],k,i,j,l,r,h,a[1234567],w,x,y,z;
bool used[1234567];
vector<ll> v[1234567],vec;
string s1,s;
ll dx[4]={-1,1,0,0},dy[4]={0,0,-1,1},c1[123][123];
void dfs(ll a){
if(used[a])return ;
used[a]=1;
for(ll i=0;i<v[a].size();i++){
dfs(v[a][i]);
}
vec.pb(a);
}
vector<ll> find_split(int n , int a , int b ,int c ,vector<int>v1 , vector<int>v2){
ll m = v1.size();
for(ll i = 0 ;i < m ;i++){
v[v1[i]].pb(v2[i]);
v[v2[i]].pb(v1[i]);
}
dfs(0);
vl ans(n);
for(auto &x:ans)x=0;
for(ll i = 0 ;i<a;i++){
ans[vec[i]]=1;
}
for(ll i = a;i<a+b;i++){
ans[vec[i]]=2;
}
for(ll i = a+b;i<n;i++){
ans[vec[i]]=3;
}
return ans;
}