oj.uz

Submission #289909

# Submission time Handle Problem Language Result Execution time Memory
289909 2020-09-03T08:22:27 Z MarcoMeijer Split the Attractions (IOI19_split) C++14
100 / 100
 218 ms 21880 KB 
#include <bits/stdc++.h>
#include "split.h"
using namespace std;

//macros
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a:b)
#define INF 1e9
#define pb push_back
#define fi first
#define se second

const int MX = 1e5+10;

int n, m, a[3], SA[3];
int cnt[3];
int RSA[4];
vi adj[MX];
vi adjT[MX];
vi res;
bitset<MX> visited;
int sz[MX];
int cent;

void dfsTree(int u) {
    visited[u] = 1;
    FOR(v,adj[u]) if(!visited[v]) dfsTree(v), adjT[u].pb(v), adjT[v].pb(u);
}
void dfsSz(int u, int p) {
    sz[u] = 1;
    FOR(v,adjT[u]) if(v != p) dfsSz(v, u), sz[u]+=sz[v];
}
int dfsCentroid(int u, int p, int s) {
    FOR(v,adjT[u]) if(v != p && sz[v] >= s/2) return dfsCentroid(v,u,s);
    return u;
}

int comp[MX], compSZ[MX], compR[MX], compP[MX], compN=0;
void dfsComp(int u, int p) {
    comp[u] = compN;
    FOR(v,adjT[u]) if(v != p) dfsComp(v,u);
}
int getComp(int i) {return i==compP[i] ? i : compP[i] = getComp(compP[i]);}
bool isSameSet(int i, int j) {return getComp(i) == getComp(j);}
void unionSet(int i, int j) {
    if(isSameSet(i,j)) return;
    i=compP[i], j=compP[j];
    compSZ[i] = compSZ[j] = compSZ[i] + compSZ[j];
    if(compR[i] > compR[j]) {
        compP[j] = i;
    } else {
        compP[i] = j;
        if(compR[i] == compR[j]) compR[j]++;
    }
}

void dfsFirst(int u, int c, int numb) {
    if(res[u] != 0) return;
    if(cnt[numb] == a[SA[numb]]) return;
    cnt[numb]++;
    res[u] = numb+1;
    FOR(v,adj[u]) if(v != cent && getComp(comp[v]) == c) dfsFirst(v,c,numb);
}
void dfsSecond(int u, int numb) {
    if(res[u] != 0) return;
    if(cnt[numb] == a[SA[numb]]) return;
    cnt[numb]++;
    res[u] = numb+1;
    FOR(v,adj[u]) dfsSecond(v, numb);
}

vi find_split(int N, int A, int B, int C, vi P, vi Q) {
    n=N; a[0]=A; a[1]=B; a[2]=C;
    RE(i,3) SA[i]=i;
    sort(SA,SA+3,[](int i, int j) {
        return a[i]<a[j];
    });
    res.assign(n,0);
    m=P.size();
    RE(i,m) {
        adj[P[i]].pb(Q[i]);
        adj[Q[i]].pb(P[i]);
    }
    visited.reset(); dfsTree(1);
    dfsSz(1, -1);
    cent = dfsCentroid(1, -1, sz[1]);
    dfsSz(cent, -1);
    FOR(u,adjT[cent]) {
        compSZ[compN] = sz[u];
        dfsComp(u,cent);
        compN++;
    }
    RE(i,compN) compP[i]=i, compR[i]=1;
    RE(i,m) {
        if(P[i] == cent || Q[i] == cent) continue;
        int u = getComp(comp[P[i]]);
        int v = getComp(comp[Q[i]]);
        if(compSZ[u] < a[SA[0]] && compSZ[v] < a[SA[0]])
            unionSet(u,v);
    }

    int firstComp = -1;
    RE(i,compN)
        if(compSZ[i] >= a[SA[0]])
            firstComp = i;
    if(firstComp == -1) return res;

    RE(i,3) cnt[i] = 0;
    RE(i,n) if(i != cent && compSZ[getComp(comp[i])] >= a[SA[0]]) {
        dfsFirst(i, getComp(comp[i]),0);
        break;
    }
    dfsSecond(cent,1);
    RE(i,n) if(res[i] == 0) res[i] = 3;
    RE(i,n) res[i] = SA[res[i]-1]+1;

	return res;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB ok, correct split
2 Correct 3 ms 4992 KB ok, correct split
3 Correct 4 ms 4992 KB ok, correct split
4 Correct 4 ms 4992 KB ok, correct split
5 Correct 4 ms 4992 KB ok, correct split
6 Correct 4 ms 4992 KB ok, correct split
7 Correct 152 ms 17528 KB ok, correct split
8 Correct 136 ms 18536 KB ok, correct split
9 Correct 145 ms 18936 KB ok, correct split
10 Correct 137 ms 19064 KB ok, correct split
11 Correct 145 ms 19064 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB ok, correct split
2 Correct 4 ms 4992 KB ok, correct split
3 Correct 4 ms 4992 KB ok, correct split
4 Correct 172 ms 17732 KB ok, correct split
5 Correct 130 ms 14584 KB ok, correct split
6 Correct 144 ms 19068 KB ok, correct split
7 Correct 146 ms 17656 KB ok, correct split
8 Correct 194 ms 16504 KB ok, correct split
9 Correct 156 ms 14456 KB ok, correct split
10 Correct 89 ms 16372 KB ok, correct split
11 Correct 91 ms 16368 KB ok, correct split
12 Correct 96 ms 16368 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4992 KB ok, correct split
2 Correct 129 ms 14720 KB ok, correct split
3 Correct 42 ms 8952 KB ok, correct split
4 Correct 4 ms 4992 KB ok, correct split
5 Correct 144 ms 15992 KB ok, correct split
6 Correct 150 ms 16120 KB ok, correct split
7 Correct 146 ms 17272 KB ok, correct split
8 Correct 143 ms 16888 KB ok, correct split
9 Correct 144 ms 17144 KB ok, correct split
10 Correct 37 ms 8696 KB ok, no valid answer
11 Correct 55 ms 10496 KB ok, no valid answer
12 Correct 101 ms 16884 KB ok, no valid answer
13 Correct 124 ms 15864 KB ok, no valid answer
14 Correct 84 ms 17520 KB ok, no valid answer

Subtask #4
24.0 / 24.0

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

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB ok, correct split
2 Correct 3 ms 4992 KB ok, correct split
3 Correct 4 ms 4992 KB ok, correct split
4 Correct 4 ms 4992 KB ok, correct split
5 Correct 4 ms 4992 KB ok, correct split
6 Correct 4 ms 4992 KB ok, correct split
7 Correct 152 ms 17528 KB ok, correct split
8 Correct 136 ms 18536 KB ok, correct split
9 Correct 145 ms 18936 KB ok, correct split
10 Correct 137 ms 19064 KB ok, correct split
11 Correct 145 ms 19064 KB ok, correct split
12 Correct 4 ms 4992 KB ok, correct split
13 Correct 4 ms 4992 KB ok, correct split
14 Correct 4 ms 4992 KB ok, correct split
15 Correct 172 ms 17732 KB ok, correct split
16 Correct 130 ms 14584 KB ok, correct split
17 Correct 144 ms 19068 KB ok, correct split
18 Correct 146 ms 17656 KB ok, correct split
19 Correct 194 ms 16504 KB ok, correct split
20 Correct 156 ms 14456 KB ok, correct split
21 Correct 89 ms 16372 KB ok, correct split
22 Correct 91 ms 16368 KB ok, correct split
23 Correct 96 ms 16368 KB ok, correct split
24 Correct 5 ms 4992 KB ok, correct split
25 Correct 129 ms 14720 KB ok, correct split
26 Correct 42 ms 8952 KB ok, correct split
27 Correct 4 ms 4992 KB ok, correct split
28 Correct 144 ms 15992 KB ok, correct split
29 Correct 150 ms 16120 KB ok, correct split
30 Correct 146 ms 17272 KB ok, correct split
31 Correct 143 ms 16888 KB ok, correct split
32 Correct 144 ms 17144 KB ok, correct split
33 Correct 37 ms 8696 KB ok, no valid answer
34 Correct 55 ms 10496 KB ok, no valid answer
35 Correct 101 ms 16884 KB ok, no valid answer
36 Correct 124 ms 15864 KB ok, no valid answer
37 Correct 84 ms 17520 KB ok, no valid answer
38 Correct 4 ms 4992 KB ok, correct split
39 Correct 4 ms 4992 KB ok, no valid answer
40 Correct 3 ms 4992 KB ok, correct split
41 Correct 4 ms 4992 KB ok, correct split
42 Correct 4 ms 4992 KB ok, correct split
43 Correct 4 ms 4992 KB ok, correct split
44 Correct 4 ms 4992 KB ok, correct split
45 Correct 4 ms 4992 KB ok, correct split
46 Correct 6 ms 5376 KB ok, correct split
47 Correct 7 ms 5376 KB ok, correct split
48 Correct 4 ms 5120 KB ok, correct split
49 Correct 7 ms 5376 KB ok, correct split
50 Correct 4 ms 4992 KB ok, correct split
51 Correct 4 ms 4992 KB ok, correct split
52 Correct 4 ms 4992 KB ok, correct split
53 Correct 4 ms 4992 KB ok, correct split
54 Correct 4 ms 4992 KB ok, correct split
55 Correct 4 ms 4992 KB ok, correct split
56 Correct 4 ms 5120 KB ok, correct split
57 Correct 5 ms 5120 KB ok, correct split
58 Correct 6 ms 5376 KB ok, correct split
59 Correct 6 ms 5376 KB ok, correct split
60 Correct 6 ms 5376 KB ok, correct split
61 Correct 6 ms 5376 KB ok, correct split
62 Correct 6 ms 5376 KB ok, correct split
63 Correct 6 ms 5376 KB ok, correct split
64 Correct 7 ms 5376 KB ok, correct split
65 Correct 6 ms 5376 KB ok, correct split
66 Correct 4 ms 5120 KB ok, correct split
67 Correct 7 ms 5376 KB ok, correct split
68 Correct 5 ms 5120 KB ok, correct split
69 Correct 4 ms 5120 KB ok, correct split
70 Correct 4 ms 5120 KB ok, correct split
71 Correct 6 ms 5376 KB ok, correct split
72 Correct 6 ms 5376 KB ok, correct split
73 Correct 6 ms 5376 KB ok, correct split
74 Correct 7 ms 5376 KB ok, correct split
75 Correct 6 ms 5376 KB ok, correct split
76 Correct 7 ms 5376 KB ok, correct split
77 Correct 7 ms 5376 KB ok, correct split
78 Correct 5 ms 5248 KB ok, correct split
79 Correct 5 ms 5248 KB ok, correct split
80 Correct 7 ms 5376 KB ok, correct split
81 Correct 7 ms 5376 KB ok, correct split
82 Correct 6 ms 5376 KB ok, correct split
83 Correct 6 ms 5376 KB ok, correct split
84 Correct 6 ms 5376 KB ok, no valid answer
85 Correct 6 ms 5376 KB ok, correct split
86 Correct 6 ms 5376 KB ok, correct split
87 Correct 4 ms 4992 KB ok, no valid answer
88 Correct 4 ms 4992 KB ok, no valid answer
89 Correct 6 ms 5376 KB ok, no valid answer
90 Correct 7 ms 5376 KB ok, no valid answer
91 Correct 5 ms 5376 KB ok, no valid answer
92 Correct 6 ms 5376 KB ok, no valid answer
93 Correct 6 ms 5376 KB ok, no valid answer
94 Correct 167 ms 17668 KB ok, correct split
95 Correct 218 ms 21880 KB ok, correct split
96 Correct 203 ms 20344 KB ok, correct split
97 Correct 46 ms 9380 KB ok, correct split
98 Correct 46 ms 9464 KB ok, correct split
99 Correct 70 ms 11128 KB ok, correct split
100 Correct 188 ms 19192 KB ok, correct split
101 Correct 167 ms 18168 KB ok, correct split
102 Correct 160 ms 18288 KB ok, correct split
103 Correct 148 ms 18288 KB ok, correct split
104 Correct 158 ms 19556 KB ok, correct split
105 Correct 75 ms 11768 KB ok, correct split
106 Correct 163 ms 20840 KB ok, correct split
107 Correct 141 ms 15992 KB ok, correct split
108 Correct 133 ms 15736 KB ok, correct split
109 Correct 192 ms 18680 KB ok, correct split
110 Correct 204 ms 18788 KB ok, correct split
111 Correct 190 ms 18800 KB ok, correct split
112 Correct 187 ms 19140 KB ok, correct split
113 Correct 190 ms 19092 KB ok, correct split
114 Correct 18 ms 6656 KB ok, correct split
115 Correct 17 ms 6656 KB ok, correct split
116 Correct 168 ms 18672 KB ok, correct split
117 Correct 176 ms 18544 KB ok, correct split
118 Correct 131 ms 15736 KB ok, correct split
119 Correct 128 ms 15608 KB ok, correct split
120 Correct 140 ms 17272 KB ok, correct split
121 Correct 123 ms 15864 KB ok, no valid answer
122 Correct 118 ms 16120 KB ok, no valid answer
123 Correct 187 ms 19192 KB ok, no valid answer
124 Correct 186 ms 19320 KB ok, no valid answer
125 Correct 151 ms 18032 KB ok, no valid answer
126 Correct 80 ms 16240 KB ok, no valid answer
127 Correct 135 ms 18160 KB ok, no valid answer