Submission #1021237

#	Time	Username	Problem	Language	Result	Execution time	Memory
1021237		vjudge1	Split the Attractions (IOI19_split)	C++17	0 / 100	508 ms	1048576 KiB

split

#include <bits/stdc++.h>
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
// #pragma GCC target("popcnt")
#define endl '\n'
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fo(i,n) for(auto i =0 ; i < n;i++)
#define fore(i,l,r) for(auto i = l; i < r;i++)
#define forex(i,r,l) for(auto i = r; i >= l; i--)
#define ffo(i,n) forex(i,n-1,0)
#define all(x) x.begin(),x.end()
#define lsb(x) x&(-x)
#define sz(x) (int)x.size()
#define gcd(a,b) __gcd(a,b)
#define vii vector<ii>
#define pq_min(a) priority_queue<a, vector<a>, greater<a>>
#define fls cout.flush()
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using ii = pair<int,int>;
using mii = map<int,int>;
using lld = long double;
void valid(ll in){cout<<((in)?"YES\n":"NO\n");}
const int N = 2e5 + 7;
vi graph[N];
int sz[N], tin[N], tout[N], timer, pa[N];
void dfs(int nodo, int p = 0){sz[nodo]=1;
    tin[nodo]=timer++;
    for(int v : graph[nodo]){
        if(v==p)continue;
        pa[v] = nodo;
        dfs(v, nodo);
        sz[nodo] += sz[v];
    }
    tout[nodo]=timer-1;
}
vi find_split(int n,int a,int b,int c,vi p,vi q){timer = 0;
    int m = sz(p);
    vii ord;
    ord.pb({a, 1});
    ord.pb({b, 2});
    ord.pb({c, 3});
    sort(all(ord));
    fo(i,m){
        graph[p[i]].pb(q[i]);
        graph[q[i]].pb(p[i]);
    }
    dfs(0);
    vi ans(n, 0);
    /*
    5 4
    1 2 2
    0 1
    1 2
    2 3
    3 4 
    */
    fo(i,n){
        if(sz[i]>=ord[0].fi&&n-sz[i]>=ord[1].fi){
            queue<int> q;
            q.push(i);
            int ca = 1;
            ans[i] = ord[0].se;
            while(!q.empty()){
                int nodo = q.front();q.pop();
                for(int v : graph[nodo]){
                    if(ans[v]==0&&tin[i]<=tin[v]&&tout[i]>=tout[v]&&ca<a){
                        ans[v]=ord[0].se;
                        ca++;
                        q.push(v);
                    }
                }
            }
            while(!q.empty())q.pop();
            q.push(pa[i]);
            ca=0;
            ans[pa[i]]=ord[1].se;
            while(!q.empty()){
                int nodo = q.front(); q.pop();
                for(int v : graph[nodo]){
                    if(ans[v]==0&&ca<b){
                        ans[v]=ord[1].se;
                        ca++;
                        q.push(v);
                    }
                }
            }
            fo(j,n)
                if(ans[j]==0)
                    ans[j]=ord[2].se;
            break;
        }
    }
    fo(i,n)graph[i].clear();
    return ans;
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 11
• Subtask 3: 0 / 22
• Subtask 4: 0 / 24
• Subtask 5: 0 / 36