oj.uz

Submission #242509

# Submission time Handle Problem Language Result Execution time Memory
242509 2020-06-27T22:38:42 Z thebes Split the Attractions (IOI19_split) C++14
100 / 100
 271 ms 26296 KB 
#include <bits/stdc++.h>
#define DEBUG 1
using namespace std;

namespace output{
    void __(short x){cout<<x;}
    void __(unsigned x){cout<<x;}
    void __(int x){cout<<x;}
    void __(long long x){cout<<x;}
    void __(unsigned long long x){cout<<x;}
    void __(double x){cout<<x;}
    void __(long double x){cout<<x;}
    void __(char x){cout<<x;}
    void __(const char*x){cout<<x;}
    void __(const string&x){cout<<x;}
    void __(bool x){cout<<(x?"true":"false");}
    template<class S,class T>
    void __(const pair<S,T>&x){__(DEBUG?"(":""),__(x.first),__(DEBUG?", ":" "),__(x.second),__(DEBUG?")":"");}
    template<class T>
    void __(const vector<T>&x){__(DEBUG?"{":"");bool _=0;for(const auto&v:x)__(_?DEBUG?", ":" ":""),__(v),_=1;__(DEBUG?"}":"");}
    template<class T>
    void __(const set<T>&x){__(DEBUG?"{":"");bool _=0;for(const auto&v:x)__(_?DEBUG?", ":" ":""),__(v),_=1;__(DEBUG?"}":"");}
    template<class T>
    void __(const multiset<T>&x){__(DEBUG?"{":"");bool _=0;for(const auto&v:x)__(_?DEBUG?", ":" ":""),__(v),_=1;__(DEBUG?"}":"");}
    template<class S,class T>
    void __(const map<S,T>&x){__(DEBUG?"{":"");bool _=0;for(const auto&v:x)__(_?DEBUG?", ":" ":""),__(v),_=1;__(DEBUG?"}":"");}
    void pr(){cout<<"\n";}
    template<class S,class... T>
    void pr(const S&a,const T&...b){__(a);if(sizeof...(b))__(' ');pr(b...);}
}

using namespace output;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<int,char> pic;
typedef pair<double,double> pdd;
typedef pair<ld,ld> pld;
typedef vector<int> vi;
typedef vector<ll> vl;

#define pb push_back
#define fox(i,x,y) for(int i=(x);i<=(y);i++)
#define foxr(i,x,y) for(int i=(y);i>=(x);i--)
#define F first
#define S second

const int MN = 1e5+5, MM = 2e5+5;
int N, M, A, B, C, i, j, use[MM], sz[MN], mx[MN], vs[MN], ds[MN], cc[MN], ct, rem;
vi tree[MN], ans;
vector<pii> adj[MN], hm;
int fnd(int x){return ds[x]=x==ds[x]?x:fnd(ds[x]);}

void dfs(int n){
    vs[n] = 1;
    for(auto v : adj[n]){
        if(!vs[v.F]){
            use[v.S]=1;
            dfs(v.F);
            tree[n].pb(v.F);
            tree[v.F].pb(n);
        }
    }
}

void dfs2(int n,int p){
    sz[n]=1; mx[n]=0;
    for(auto v : tree[n]){
        if(v==p) continue;
        dfs2(v, n);
        sz[n] += sz[v];
        mx[n] = max(mx[n], sz[v]);
    }
}

void dfs3(int n,int p){
    if(2*mx[n]<=N&&2*(N-sz[n])<=N) ct=n;
    for(auto v : tree[n]){
        if(v==p) continue;
        dfs3(v, n);
    }
}

void go(int n,int p){
    cc[fnd(n)]++;
    for(auto v : tree[n]){
        if(v==p) continue;
        ds[v] = ds[n];
        go(v, n);
    }
}

void mrk(int n,int g,int id,bool wew=false){
    vs[n] = 1;
    if(rem){
        ans[n]=id; rem--;
        for(auto v : adj[n]){
            if(!wew&&fnd(v.F)==g&&!vs[v.F]&&rem) mrk(v.F,g,id);
            if(wew&&fnd(v.F)!=g&&!vs[v.F]&&rem) mrk(v.F,g,id,wew);
        }
    }
}

vi find_split(int n,int a,int b,int c,vi p,vi q){
    N = n; M = (int)p.size();
    int w[]={1,2,3};
    A=a, B=b, C=c;
    ans.resize(N);
    if(A>B) swap(A,B), swap(w[0],w[1]);
    if(A>C) swap(A,C), swap(w[0],w[2]);
    if(B>C) swap(B,C), swap(w[1],w[2]);
    for(i=0;i<M;i++){
        adj[p[i]].pb({q[i],i});
        adj[q[i]].pb({p[i],i});
    }
    dfs(1);
    dfs2(1,-1);
    dfs3(1,-1);
    dfs2(ct,-1);
    ds[ct]=ct;
    for(auto v : tree[ct]){
        ds[v] = v;
        go(v, ct);
    }
    memset(vs,0,sizeof(vs));
    for(i=0;i<N;i++){
        if(cc[i]>=A){
            if(cc[i]>=B){
                rem = B;
                mrk(i,i,w[1]);
                rem = A;
                mrk(ct,i,w[0],1);
            }
            else{
                rem = A;
                mrk(i,i,w[0]);
                rem = B;
                mrk(ct,i,w[1],1);
            }
            for(auto &v : ans){
                if(!v) v=w[2];
            }
            return ans;
        }
    }
    for(i=0;i<M;i++){
        if(use[i]) continue;
        int x=p[i], y=q[i];
        if(x==ct||y==ct) continue;
        if(fnd(x)!=fnd(y)){
            x=fnd(x), y=fnd(y);
            cc[x] += cc[y];
            ds[y] = x;
            if(cc[x]>=A){
                if(cc[x]>=B){
                    rem = B;
                    mrk(x,x,w[1]);
                    rem = A;
                    mrk(ct,x,w[0],1);
                }
                else{
                    rem = A;
                    mrk(x,x,w[0]);
                    rem = B;
                    mrk(ct,x,w[1],1);
                }
                for(auto &v : ans){
                    if(!v) v=w[2];
                }
                return ans;
            }
        }
    }
    return ans;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5504 KB ok, correct split
2 Correct 8 ms 5552 KB ok, correct split
3 Correct 8 ms 5376 KB ok, correct split
4 Correct 7 ms 5504 KB ok, correct split
5 Correct 8 ms 5376 KB ok, correct split
6 Correct 8 ms 5632 KB ok, correct split
7 Correct 148 ms 19832 KB ok, correct split
8 Correct 127 ms 20984 KB ok, correct split
9 Correct 149 ms 21532 KB ok, correct split
10 Correct 129 ms 21880 KB ok, correct split
11 Correct 162 ms 22008 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5504 KB ok, correct split
2 Correct 7 ms 5376 KB ok, correct split
3 Correct 8 ms 5376 KB ok, correct split
4 Correct 190 ms 20856 KB ok, correct split
5 Correct 134 ms 16376 KB ok, correct split
6 Correct 131 ms 21884 KB ok, correct split
7 Correct 135 ms 19832 KB ok, correct split
8 Correct 192 ms 20088 KB ok, correct split
9 Correct 123 ms 15736 KB ok, correct split
10 Correct 93 ms 17132 KB ok, correct split
11 Correct 96 ms 17252 KB ok, correct split
12 Correct 93 ms 17132 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5376 KB ok, correct split
2 Correct 132 ms 16352 KB ok, correct split
3 Correct 44 ms 9976 KB ok, correct split
4 Correct 7 ms 5376 KB ok, correct split
5 Correct 146 ms 17656 KB ok, correct split
6 Correct 141 ms 17784 KB ok, correct split
7 Correct 141 ms 17916 KB ok, correct split
8 Correct 147 ms 17572 KB ok, correct split
9 Correct 200 ms 17656 KB ok, correct split
10 Correct 37 ms 9216 KB ok, no valid answer
11 Correct 52 ms 11128 KB ok, no valid answer
12 Correct 105 ms 17008 KB ok, no valid answer
13 Correct 126 ms 16760 KB ok, no valid answer
14 Correct 87 ms 17112 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5376 KB ok, correct split
2 Correct 7 ms 5376 KB ok, no valid answer
3 Correct 7 ms 5376 KB ok, correct split
4 Correct 8 ms 5376 KB ok, correct split
5 Correct 8 ms 5376 KB ok, correct split
6 Correct 8 ms 5376 KB ok, correct split
7 Correct 8 ms 5376 KB ok, correct split
8 Correct 8 ms 5376 KB ok, correct split
9 Correct 11 ms 5888 KB ok, correct split
10 Correct 11 ms 5760 KB ok, correct split
11 Correct 8 ms 5504 KB ok, correct split
12 Correct 10 ms 5760 KB ok, correct split
13 Correct 8 ms 5376 KB ok, correct split
14 Correct 8 ms 5408 KB ok, correct split
15 Correct 8 ms 5376 KB ok, correct split
16 Correct 8 ms 5504 KB ok, correct split
17 Correct 7 ms 5376 KB ok, correct split
18 Correct 7 ms 5376 KB ok, correct split
19 Correct 8 ms 5504 KB ok, correct split
20 Correct 8 ms 5504 KB ok, correct split
21 Correct 10 ms 5760 KB ok, correct split
22 Correct 9 ms 5760 KB ok, correct split
23 Correct 9 ms 5776 KB ok, correct split
24 Correct 9 ms 5760 KB ok, correct split
25 Correct 9 ms 5760 KB ok, correct split
26 Correct 9 ms 5760 KB ok, correct split
27 Correct 9 ms 5760 KB ok, correct split
28 Correct 12 ms 5760 KB ok, correct split
29 Correct 8 ms 5504 KB ok, correct split
30 Correct 10 ms 5760 KB ok, correct split
31 Correct 8 ms 5504 KB ok, correct split
32 Correct 7 ms 5504 KB ok, correct split
33 Correct 8 ms 5504 KB ok, correct split
34 Correct 9 ms 5760 KB ok, correct split
35 Correct 10 ms 5760 KB ok, correct split
36 Correct 10 ms 5632 KB ok, correct split
37 Correct 11 ms 5888 KB ok, correct split
38 Correct 11 ms 5888 KB ok, correct split
39 Correct 11 ms 5888 KB ok, correct split
40 Correct 10 ms 5888 KB ok, correct split
41 Correct 9 ms 5632 KB ok, correct split
42 Correct 9 ms 5632 KB ok, correct split
43 Correct 10 ms 5888 KB ok, correct split
44 Correct 10 ms 5888 KB ok, correct split
45 Correct 11 ms 5888 KB ok, correct split
46 Correct 10 ms 5760 KB ok, correct split
47 Correct 9 ms 5760 KB ok, no valid answer
48 Correct 9 ms 5760 KB ok, correct split
49 Correct 9 ms 5760 KB ok, correct split
50 Correct 7 ms 5376 KB ok, no valid answer
51 Correct 8 ms 5504 KB ok, no valid answer
52 Correct 9 ms 5760 KB ok, no valid answer
53 Correct 10 ms 5888 KB ok, no valid answer
54 Correct 9 ms 5760 KB ok, no valid answer
55 Correct 10 ms 5760 KB ok, no valid answer
56 Correct 10 ms 5760 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5504 KB ok, correct split
2 Correct 8 ms 5552 KB ok, correct split
3 Correct 8 ms 5376 KB ok, correct split
4 Correct 7 ms 5504 KB ok, correct split
5 Correct 8 ms 5376 KB ok, correct split
6 Correct 8 ms 5632 KB ok, correct split
7 Correct 148 ms 19832 KB ok, correct split
8 Correct 127 ms 20984 KB ok, correct split
9 Correct 149 ms 21532 KB ok, correct split
10 Correct 129 ms 21880 KB ok, correct split
11 Correct 162 ms 22008 KB ok, correct split
12 Correct 8 ms 5504 KB ok, correct split
13 Correct 7 ms 5376 KB ok, correct split
14 Correct 8 ms 5376 KB ok, correct split
15 Correct 190 ms 20856 KB ok, correct split
16 Correct 134 ms 16376 KB ok, correct split
17 Correct 131 ms 21884 KB ok, correct split
18 Correct 135 ms 19832 KB ok, correct split
19 Correct 192 ms 20088 KB ok, correct split
20 Correct 123 ms 15736 KB ok, correct split
21 Correct 93 ms 17132 KB ok, correct split
22 Correct 96 ms 17252 KB ok, correct split
23 Correct 93 ms 17132 KB ok, correct split
24 Correct 7 ms 5376 KB ok, correct split
25 Correct 132 ms 16352 KB ok, correct split
26 Correct 44 ms 9976 KB ok, correct split
27 Correct 7 ms 5376 KB ok, correct split
28 Correct 146 ms 17656 KB ok, correct split
29 Correct 141 ms 17784 KB ok, correct split
30 Correct 141 ms 17916 KB ok, correct split
31 Correct 147 ms 17572 KB ok, correct split
32 Correct 200 ms 17656 KB ok, correct split
33 Correct 37 ms 9216 KB ok, no valid answer
34 Correct 52 ms 11128 KB ok, no valid answer
35 Correct 105 ms 17008 KB ok, no valid answer
36 Correct 126 ms 16760 KB ok, no valid answer
37 Correct 87 ms 17112 KB ok, no valid answer
38 Correct 7 ms 5376 KB ok, correct split
39 Correct 7 ms 5376 KB ok, no valid answer
40 Correct 7 ms 5376 KB ok, correct split
41 Correct 8 ms 5376 KB ok, correct split
42 Correct 8 ms 5376 KB ok, correct split
43 Correct 8 ms 5376 KB ok, correct split
44 Correct 8 ms 5376 KB ok, correct split
45 Correct 8 ms 5376 KB ok, correct split
46 Correct 11 ms 5888 KB ok, correct split
47 Correct 11 ms 5760 KB ok, correct split
48 Correct 8 ms 5504 KB ok, correct split
49 Correct 10 ms 5760 KB ok, correct split
50 Correct 8 ms 5376 KB ok, correct split
51 Correct 8 ms 5408 KB ok, correct split
52 Correct 8 ms 5376 KB ok, correct split
53 Correct 8 ms 5504 KB ok, correct split
54 Correct 7 ms 5376 KB ok, correct split
55 Correct 7 ms 5376 KB ok, correct split
56 Correct 8 ms 5504 KB ok, correct split
57 Correct 8 ms 5504 KB ok, correct split
58 Correct 10 ms 5760 KB ok, correct split
59 Correct 9 ms 5760 KB ok, correct split
60 Correct 9 ms 5776 KB ok, correct split
61 Correct 9 ms 5760 KB ok, correct split
62 Correct 9 ms 5760 KB ok, correct split
63 Correct 9 ms 5760 KB ok, correct split
64 Correct 9 ms 5760 KB ok, correct split
65 Correct 12 ms 5760 KB ok, correct split
66 Correct 8 ms 5504 KB ok, correct split
67 Correct 10 ms 5760 KB ok, correct split
68 Correct 8 ms 5504 KB ok, correct split
69 Correct 7 ms 5504 KB ok, correct split
70 Correct 8 ms 5504 KB ok, correct split
71 Correct 9 ms 5760 KB ok, correct split
72 Correct 10 ms 5760 KB ok, correct split
73 Correct 10 ms 5632 KB ok, correct split
74 Correct 11 ms 5888 KB ok, correct split
75 Correct 11 ms 5888 KB ok, correct split
76 Correct 11 ms 5888 KB ok, correct split
77 Correct 10 ms 5888 KB ok, correct split
78 Correct 9 ms 5632 KB ok, correct split
79 Correct 9 ms 5632 KB ok, correct split
80 Correct 10 ms 5888 KB ok, correct split
81 Correct 10 ms 5888 KB ok, correct split
82 Correct 11 ms 5888 KB ok, correct split
83 Correct 10 ms 5760 KB ok, correct split
84 Correct 9 ms 5760 KB ok, no valid answer
85 Correct 9 ms 5760 KB ok, correct split
86 Correct 9 ms 5760 KB ok, correct split
87 Correct 7 ms 5376 KB ok, no valid answer
88 Correct 8 ms 5504 KB ok, no valid answer
89 Correct 9 ms 5760 KB ok, no valid answer
90 Correct 10 ms 5888 KB ok, no valid answer
91 Correct 9 ms 5760 KB ok, no valid answer
92 Correct 10 ms 5760 KB ok, no valid answer
93 Correct 10 ms 5760 KB ok, no valid answer
94 Correct 155 ms 20088 KB ok, correct split
95 Correct 271 ms 26296 KB ok, correct split
96 Correct 216 ms 24184 KB ok, correct split
97 Correct 50 ms 10488 KB ok, correct split
98 Correct 46 ms 10616 KB ok, correct split
99 Correct 69 ms 13176 KB ok, correct split
100 Correct 214 ms 23012 KB ok, correct split
101 Correct 194 ms 21624 KB ok, correct split
102 Correct 179 ms 20716 KB ok, correct split
103 Correct 144 ms 20332 KB ok, correct split
104 Correct 150 ms 21964 KB ok, correct split
105 Correct 74 ms 13176 KB ok, correct split
106 Correct 154 ms 22368 KB ok, correct split
107 Correct 144 ms 17912 KB ok, correct split
108 Correct 135 ms 17784 KB ok, correct split
109 Correct 195 ms 22392 KB ok, correct split
110 Correct 201 ms 23020 KB ok, correct split
111 Correct 211 ms 22892 KB ok, correct split
112 Correct 194 ms 22380 KB ok, correct split
113 Correct 188 ms 22256 KB ok, correct split
114 Correct 21 ms 7424 KB ok, correct split
115 Correct 20 ms 7296 KB ok, correct split
116 Correct 192 ms 23020 KB ok, correct split
117 Correct 175 ms 22508 KB ok, correct split
118 Correct 143 ms 17168 KB ok, correct split
119 Correct 127 ms 17144 KB ok, correct split
120 Correct 139 ms 19064 KB ok, correct split
121 Correct 134 ms 17912 KB ok, no valid answer
122 Correct 118 ms 18164 KB ok, no valid answer
123 Correct 196 ms 22880 KB ok, no valid answer
124 Correct 191 ms 23160 KB ok, no valid answer
125 Correct 114 ms 19436 KB ok, no valid answer
126 Correct 82 ms 17132 KB ok, no valid answer
127 Correct 132 ms 19692 KB ok, no valid answer