oj.uz

Submission #253686

# Submission time Handle Problem Language Result Execution time Memory
253686 2020-07-28T14:07:40 Z HynDuf Split the Attractions (IOI19_split) C++14
100 / 100
 178 ms 20856 KB 
#include "split.h"
#include <bits/stdc++.h>

#define task "SPLIT"
#define all(v) (v).begin(), (v).end()
#define rep(i, l, r) for (int i = (l); i <= (r); ++i)
#define Rep(i, r, l) for (int i = (r); i >= (l); --i)
#define DB(X) { cerr << #X << " = " << (X) << '\n'; }
#define DB1(A, _) { cerr << #A << "[" << _ << "] = " << (A[_]) << '\n'; }
#define DB2(A, _, __) { cerr << #A << "[" << _ << "][" << __ << "] = " << (A[_][__]) << '\n'; }
#define DB3(A, _, __, ___) { cerr << #A << "[" << _ << "][" << __ << "][" << ___ << "] = " << (A[_][__][___]) << '\n'; }
#define PR(A, l, r) { cerr << '\n'; rep(_, l, r) DB1(A, _); cerr << '\n';}
#define SZ(x) ((int)(x).size())
#define pb push_back
#define eb emplace_back
#define pf push_front
#define F first
#define S second
#define by(x) [](const auto& a, const auto& b) { return a.x < b.x; } // sort(arr, arr + N, by(a));
#define next ___next
#define prev ___prev
#define y1 ___y1
#define left ___left
#define right ___right
#define y0 ___y0
#define div ___div
#define j0 ___j0
#define jn ___jn

using ll = long long;
using ld = long double;
using ull = unsigned long long;
using namespace std;
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ll> vl;
const int N = 2e5 + 3;
//int n, m, a, b, c;
int sz[N], eul[N], st[N], ed[N], neu, dep[N], par[N], id[4];
vi g[N], leaf[4];
ii A[4];
bool vis[N];
int team[N];
void dfs(int u)
{
    st[u] = ++neu;
    eul[neu] = u;
    vis[u] = 1;
    sz[u] = 1;
    for (int v : g[u]) if (!vis[v])
    {
        dep[v] = dep[u] + 1;
        dfs(v);
        sz[u] += sz[v];
    }
    ed[u] = neu;
}
void getleaves(int u, int teamid)
{
    vis[u] = 1;
    sz[u] = 1;
    for (int v : g[u]) if (!vis[v] && team[v] == teamid)
    {
        par[v] = u;
        getleaves(v, teamid);
        sz[u]++;
    }
    if (sz[u] == 1) leaf[teamid].eb(u);
}
void setteam(int teamid, int lim, int siz)
{
    int redun = siz - lim;
    rep(i, 1, redun)
    {
        //if (leaf[teamid].empty()) break;
        int cur = leaf[teamid].back();
        team[cur] = 3;
        leaf[teamid].pop_back();
        if (--sz[par[cur]] == 1) leaf[teamid].eb(par[cur]);

    }
}
bool canreach(int u, int mxd)
{
    rep(i, st[u], ed[u]) for (int v : g[eul[i]]) if (dep[v] < mxd) return 1;
    return 0;
}
vi find_split(int n, int a, int b, int c, vi p, vi q)
{
    vi ans(n, 0);
    //ios_base::sync_with_stdio(false); cin.tie(nullptr);
    //cin >> n >> m >> a >> b >> c;
    int m = SZ(p);
    rep(i, 1, m)
    {
        //int u, v;
        //cin >> u >> v;
        //u++, v++;
        int u = p[i - 1] + 1, v = q[i - 1] + 1;
        g[u].eb(v);
        g[v].eb(u);
    }
    A[0] = {a, 1};
    A[1] = {b, 2};
    A[2] = {c, 3};
    sort(A, A + 3);
    a = A[0].F; b = A[1].F;
    c = A[2].F;
    rep(i, 1, 3) id[i] = A[i - 1].S;
    dfs(1);
    int u = 0, mxd = -1;
    rep(i, 1, n) if (sz[i] >= a && mxd < dep[i])
    {
        mxd = dep[i];
        u = i;
    }
    if (n - sz[u] >= a)
    {
        int sz1 = sz[u], sz2 = n - sz[u];
        int rA = u, rB = 1;
        if (sz[u] >= b)
        {
            swap(rA, rB);
            swap(sz1, sz2);
            //swap(id[1], id[2]);
            rep(i, st[u], ed[u]) team[eul[i]] = 2; // B-team
            rep(i, 1, n) if (team[i] == 0) team[i] = 1; // A-team
        }
        else
        {
            rep(i, st[u], ed[u]) team[eul[i]] = 1; // A-team
            rep(i, 1, n) if (team[i] == 0) team[i] = 2; // B-team
        }
        fill(vis, vis + 1 + n, 0);
        getleaves(rA, 1);
        getleaves(rB, 2);
        /*
        for (int l : leaf[1]) cout << l << ' ';
        cout << '\n';
        for (int l : leaf[2]) cout << l << ' ';
        cout << '\n';
        */
        setteam(1, a, sz1);
        setteam(2, b, sz2);
        rep(i, 1, n) ans[i - 1] = id[team[i]];
    } else
    {
        if (m == n - 1)
        {
            rep(i, 0, n - 1) ans[i] = 0;
            return ans;
        }
        int sz1 = sz[u];
        int sz2 = n - sz[u];
        rep(i, st[u], ed[u]) team[eul[i]] = 1; // A-team
        rep(i, 1, n) if (team[i] == 0) team[i] = 2; // B-team
        bool ok = 0;
        for (int v : g[u]) if (dep[v] > dep[u])
        {
            if (canreach(v, dep[u]))
            {
                rep(i, st[v], ed[v]) team[eul[i]] = 2;
                sz2 += sz[v];
                sz1 -= sz[v];
                if (sz2 >= a)
                {
                    ok = 1;
                    break;
                }
            }
        }
        if (!ok)
        {
            rep(i, 1, n) ans[i - 1] = 0;
            return ans;
        }
        int rA = u, rB = 1;
        if (sz1 >= sz2)
        {
            swap(rA, rB);
            swap(sz1, sz2);
            //swap(id[1], id[2]);
            rep(i, 1, n) if (team[i] == 1) team[i] = 2;
            else team[i] = 1;
        }
        fill(vis, vis + 1 + n, 0);
        getleaves(rA, 1);
        getleaves(rB, 2);
        setteam(1, a, sz1);
        setteam(2, b, sz2);
        rep(i, 1, n) ans[i - 1] = id[team[i]];
    }
    return ans;
}
/*
int main()
{
    freopen("S.in", "r", stdin);
    //freopen("S.out", "w", stdout);
    int n, m, a, b, c;
    cin >> n >> m >> a >> b >> c;
    vi pp(m, 0), qq(m, 0);

    rep(i, 0, m - 1) cin >> pp[i] >> qq[i];
    vi res = find_split(n, a, b, c, pp, qq);
    for (int v : res) cout << v << ' ';

    return 0;
}
*/

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4992 KB ok, correct split
2 Correct 3 ms 4992 KB ok, correct split
3 Correct 3 ms 4992 KB ok, correct split
4 Correct 4 ms 4992 KB ok, correct split
5 Correct 3 ms 5120 KB ok, correct split
6 Correct 3 ms 4992 KB ok, correct split
7 Correct 96 ms 17400 KB ok, correct split
8 Correct 119 ms 16052 KB ok, correct split
9 Correct 129 ms 15736 KB ok, correct split
10 Correct 129 ms 17660 KB ok, correct split
11 Correct 122 ms 17656 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4992 KB ok, correct split
2 Correct 3 ms 5120 KB ok, correct split
3 Correct 3 ms 5120 KB ok, correct split
4 Correct 119 ms 16504 KB ok, correct split
5 Correct 82 ms 13432 KB ok, correct split
6 Correct 100 ms 17656 KB ok, correct split
7 Correct 120 ms 15992 KB ok, correct split
8 Correct 129 ms 15480 KB ok, correct split
9 Correct 85 ms 13048 KB ok, correct split
10 Correct 60 ms 14192 KB ok, correct split
11 Correct 71 ms 14196 KB ok, correct split
12 Correct 71 ms 14192 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 104 ms 13560 KB ok, correct split
3 Correct 30 ms 8448 KB ok, correct split
4 Correct 4 ms 4992 KB ok, correct split
5 Correct 122 ms 14584 KB ok, correct split
6 Correct 111 ms 14328 KB ok, correct split
7 Correct 135 ms 14328 KB ok, correct split
8 Correct 100 ms 15096 KB ok, correct split
9 Correct 121 ms 14232 KB ok, correct split
10 Correct 23 ms 7424 KB ok, no valid answer
11 Correct 44 ms 8696 KB ok, no valid answer
12 Correct 65 ms 12404 KB ok, no valid answer
13 Correct 77 ms 12280 KB ok, no valid answer
14 Correct 53 ms 12528 KB ok, no valid answer

Subtask #4
24.0 / 24.0

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

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4992 KB ok, correct split
2 Correct 3 ms 4992 KB ok, correct split
3 Correct 3 ms 4992 KB ok, correct split
4 Correct 4 ms 4992 KB ok, correct split
5 Correct 3 ms 5120 KB ok, correct split
6 Correct 3 ms 4992 KB ok, correct split
7 Correct 96 ms 17400 KB ok, correct split
8 Correct 119 ms 16052 KB ok, correct split
9 Correct 129 ms 15736 KB ok, correct split
10 Correct 129 ms 17660 KB ok, correct split
11 Correct 122 ms 17656 KB ok, correct split
12 Correct 3 ms 4992 KB ok, correct split
13 Correct 3 ms 5120 KB ok, correct split
14 Correct 3 ms 5120 KB ok, correct split
15 Correct 119 ms 16504 KB ok, correct split
16 Correct 82 ms 13432 KB ok, correct split
17 Correct 100 ms 17656 KB ok, correct split
18 Correct 120 ms 15992 KB ok, correct split
19 Correct 129 ms 15480 KB ok, correct split
20 Correct 85 ms 13048 KB ok, correct split
21 Correct 60 ms 14192 KB ok, correct split
22 Correct 71 ms 14196 KB ok, correct split
23 Correct 71 ms 14192 KB ok, correct split
24 Correct 5 ms 4992 KB ok, correct split
25 Correct 104 ms 13560 KB ok, correct split
26 Correct 30 ms 8448 KB ok, correct split
27 Correct 4 ms 4992 KB ok, correct split
28 Correct 122 ms 14584 KB ok, correct split
29 Correct 111 ms 14328 KB ok, correct split
30 Correct 135 ms 14328 KB ok, correct split
31 Correct 100 ms 15096 KB ok, correct split
32 Correct 121 ms 14232 KB ok, correct split
33 Correct 23 ms 7424 KB ok, no valid answer
34 Correct 44 ms 8696 KB ok, no valid answer
35 Correct 65 ms 12404 KB ok, no valid answer
36 Correct 77 ms 12280 KB ok, no valid answer
37 Correct 53 ms 12528 KB ok, no valid answer
38 Correct 3 ms 4992 KB ok, correct split
39 Correct 3 ms 4992 KB ok, no valid answer
40 Correct 3 ms 4992 KB ok, correct split
41 Correct 3 ms 4992 KB ok, correct split
42 Correct 3 ms 4992 KB ok, correct split
43 Correct 3 ms 4992 KB ok, correct split
44 Correct 3 ms 4992 KB ok, correct split
45 Correct 3 ms 4992 KB ok, correct split
46 Correct 5 ms 5376 KB ok, correct split
47 Correct 6 ms 5248 KB ok, correct split
48 Correct 4 ms 5120 KB ok, correct split
49 Correct 5 ms 5248 KB ok, correct split
50 Correct 3 ms 4992 KB ok, correct split
51 Correct 3 ms 4992 KB ok, correct split
52 Correct 3 ms 4992 KB ok, correct split
53 Correct 3 ms 4992 KB ok, correct split
54 Correct 3 ms 4992 KB ok, correct split
55 Correct 3 ms 4992 KB ok, correct split
56 Correct 3 ms 5120 KB ok, correct split
57 Correct 4 ms 5120 KB ok, correct split
58 Correct 5 ms 5248 KB ok, correct split
59 Correct 6 ms 5248 KB ok, correct split
60 Correct 5 ms 5248 KB ok, correct split
61 Correct 5 ms 5248 KB ok, correct split
62 Correct 6 ms 5248 KB ok, correct split
63 Correct 6 ms 5376 KB ok, correct split
64 Correct 5 ms 5376 KB ok, correct split
65 Correct 6 ms 5376 KB ok, correct split
66 Correct 3 ms 5120 KB ok, correct split
67 Correct 5 ms 5376 KB ok, correct split
68 Correct 4 ms 5120 KB ok, correct split
69 Correct 3 ms 5120 KB ok, correct split
70 Correct 3 ms 5120 KB ok, correct split
71 Correct 5 ms 5376 KB ok, correct split
72 Correct 5 ms 5248 KB ok, correct split
73 Correct 5 ms 5376 KB ok, correct split
74 Correct 5 ms 5376 KB ok, correct split
75 Correct 5 ms 5376 KB ok, correct split
76 Correct 6 ms 5376 KB ok, correct split
77 Correct 6 ms 5376 KB ok, correct split
78 Correct 4 ms 5248 KB ok, correct split
79 Correct 4 ms 5248 KB ok, correct split
80 Correct 5 ms 5376 KB ok, correct split
81 Correct 5 ms 5376 KB ok, correct split
82 Correct 6 ms 5376 KB ok, correct split
83 Correct 5 ms 5376 KB ok, correct split
84 Correct 5 ms 5376 KB ok, no valid answer
85 Correct 4 ms 5248 KB ok, correct split
86 Correct 4 ms 5376 KB ok, correct split
87 Correct 4 ms 4992 KB ok, no valid answer
88 Correct 3 ms 5120 KB ok, no valid answer
89 Correct 7 ms 5248 KB ok, no valid answer
90 Correct 5 ms 5376 KB ok, no valid answer
91 Correct 4 ms 5248 KB ok, no valid answer
92 Correct 5 ms 5376 KB ok, no valid answer
93 Correct 4 ms 5376 KB ok, no valid answer
94 Correct 115 ms 16504 KB ok, correct split
95 Correct 168 ms 20856 KB ok, correct split
96 Correct 149 ms 19320 KB ok, correct split
97 Correct 32 ms 8988 KB ok, correct split
98 Correct 33 ms 9080 KB ok, correct split
99 Correct 53 ms 11128 KB ok, correct split
100 Correct 178 ms 18376 KB ok, correct split
101 Correct 126 ms 17144 KB ok, correct split
102 Correct 110 ms 16880 KB ok, correct split
103 Correct 108 ms 16624 KB ok, correct split
104 Correct 126 ms 18532 KB ok, correct split
105 Correct 48 ms 11000 KB ok, correct split
106 Correct 114 ms 18536 KB ok, correct split
107 Correct 84 ms 14712 KB ok, correct split
108 Correct 113 ms 14712 KB ok, correct split
109 Correct 134 ms 17716 KB ok, correct split
110 Correct 124 ms 17268 KB ok, correct split
111 Correct 157 ms 17264 KB ok, correct split
112 Correct 141 ms 17904 KB ok, correct split
113 Correct 163 ms 18032 KB ok, correct split
114 Correct 15 ms 6656 KB ok, correct split
115 Correct 13 ms 6432 KB ok, correct split
116 Correct 147 ms 17264 KB ok, correct split
117 Correct 159 ms 17236 KB ok, correct split
118 Correct 109 ms 14200 KB ok, correct split
119 Correct 106 ms 14200 KB ok, correct split
120 Correct 118 ms 16632 KB ok, correct split
121 Correct 75 ms 13816 KB ok, no valid answer
122 Correct 82 ms 13944 KB ok, no valid answer
123 Correct 132 ms 17912 KB ok, no valid answer
124 Correct 126 ms 17776 KB ok, no valid answer
125 Correct 85 ms 14960 KB ok, no valid answer
126 Correct 55 ms 13296 KB ok, no valid answer
127 Correct 93 ms 15500 KB ok, no valid answer