oj.uz

Submission #199562

# Submission time Handle Problem Language Result Execution time Memory
199562 2020-02-02T03:42:31 Z tri Split the Attractions (IOI19_split) C++14
100 / 100
 250 ms 26596 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;

#define pb push_back
#define f first
#define s second

namespace debug {
    const int DEBUG = true;

    template<class T1, class T2>
    void pr(const pair<T1, T2> &x);

    template<class T, size_t SZ>
    void pr(const array<T, SZ> &x);

    template<class T>
    void pr(const vector<T> &x);

    template<class T>
    void pr(const set<T> &x);

    template<class T1, class T2>
    void pr(const map<T1, T2> &x);

    template<class T>
    void pr(const T &x) { if (DEBUG) cout << x; }

    template<class T, class... Ts>
    void pr(const T &first, const Ts &... rest) { pr(first), pr(rest...); }

    template<class T1, class T2>
    void pr(const pair<T1, T2> &x) { pr("{", x.f, ", ", x.s, "}"); }

    template<class T>
    void prIn(const T &x) {
        pr("{");
        bool fst = 1;
        for (auto &a : x) {
            pr(fst ? "" : ", ", a), fst = 0;
        }
        pr("}");
    }

    template<class T, size_t SZ>
    void pr(const array<T, SZ> &x) { prIn(x); }

    template<class T>
    void pr(const vector<T> &x) { prIn(x); }

    template<class T>
    void pr(const set<T> &x) { prIn(x); }

    template<class T1, class T2>
    void pr(const map<T1, T2> &x) { prIn(x); }

    void ps() { pr("\n"), cout << flush; }

    template<class Arg, class... Args>
    void ps(const Arg &first, const Args &... rest) {
        pr(first, " ");
        ps(rest...);
    }
}
using namespace debug;


const int MAXN = 1e5 + 100;

vi aL[MAXN];
vi tAL[MAXN];
vi cAL[MAXN];

bool vis[MAXN];
int cnt[MAXN];

int halfN;

int cID = -1;
int id[MAXN];

int rem;
int color[MAXN];

int compSizes[MAXN];

vi sComps;

void fSpanTree(int cV) {
    vis[cV] = true;
    for (int aV : aL[cV]) {
        if (!vis[aV]) {
            tAL[cV].pb(aV);
            tAL[aV].pb(cV);

            fSpanTree(aV);
        }
    }
} // reviewed

void fCnt(int cV, int pV) {
    cnt[cV] = 1;
    id[cV] = cID;
    for (int aV : tAL[cV]) {
        if (aV != pV) {
            fCnt(aV, cV);
            cnt[cV] += cnt[aV];
        }
    }
} // reviewed

int fCent(int cV, int pV) {
    for (int aV : tAL[cV]) {
        if (aV != pV && cnt[aV] > halfN) {
            return fCent(aV, cV);
        }
    }
    return cV;
} // reviewed

void markColor(int cV, int pV, int cC) {
    if (rem == 0) return;

    color[cV] = cC;
    rem--;

    for (int aV : tAL[cV]) {
        if (aV != pV && color[aV] == -1) {
            markColor(aV, cV, cC);
        }
    }
} // reviewed

void fEdges(int cV, int pV) {
    for (int aV : aL[cV]) {
        if (id[aV] != -1 && id[aV] != id[cV]) {
            cAL[id[cV]].pb(id[aV]);
//            ps(aV, id[aV]);
            cAL[id[aV]].pb(id[cV]);
        }
    }

    for (int aV : tAL[cV]) {
        if (aV != pV) {
            fEdges(aV, cV);
        }
    }
} // reviewed

void fCompConnect(int cV) {
    vis[cV] = true;
    if (rem <= 0) return;
    rem -= compSizes[cV];

    sComps.pb(cV);

    for (int aV : cAL[cV]) {
        if (!vis[aV]) {
            fCompConnect(aV);
        }
    }
} // reviewed

vi find_split(int N, int A, int B, int C, vi p, vi q) {
//    ps("start");
    pi goals[] = {{A, 1},
                  {B, 2},
                  {C, 3}};
    sort(goals, goals + 3);

    A = goals[0].f;
    B = goals[1].f;
    C = goals[2].f;

    for (int i = 0; i < p.size(); i++) {
        aL[p[i]].pb(q[i]);
        aL[q[i]].pb(p[i]);
    }

    fill(vis, vis + MAXN, 0);
    fSpanTree(0);

    fCnt(0, -1);

    halfN = cnt[0] / 2;
    int cent = fCent(0, -1);

    int nComp = tAL[cent].size();

    cID = 0;
    for (int i = 0; i < nComp; i++) {
        int aV = tAL[cent][i];
        fCnt(aV, cent);
        compSizes[i] = cnt[aV];
        cID++;
    }

//    ps("check1");

//    for (int i = 0; i < N; i++) {
//        ps(id[i]);
//    }

    assert(id[cent] == -1);

    fill(color, color + MAXN, -1);
    fill(vis, vis + MAXN, 0);

    bool smaller = true;
    for (int i = 0; i < nComp; i++) {
        int aV = tAL[cent][i];
        if (compSizes[i] >= A) {
            smaller = false;

            rem = A;
            markColor(aV, cent, goals[0].s);

            rem = B;
            markColor(cent, aV, goals[1].s);

            break;
        }
    }

//    ps("check2");

    assert(cID == nComp);

    if (smaller) {
        for (int i = 0; i < nComp; i++) {
            int aV = tAL[cent][i];
            fEdges(aV, cent);
        }

        for (int i = 0; i < nComp; i++) {
            sort(cAL[i].begin(), cAL[i].end());
            cAL[i].erase(unique(cAL[i].begin(), cAL[i].end()), cAL[i].end());
        }

        bool found = false;
        fill(vis, vis + MAXN, 0);
        for (int i = 0; i < nComp; i++) {
            if (!vis[i]) {
                sComps.clear();
                rem = A;
                fCompConnect(i);
                if (rem <= 0) {
                    found = true;

                    rem = A;
                    for (int cComp : sComps) {
                        markColor(tAL[cent][cComp], cent, goals[0].s);
                    }

                    rem = B;
                    markColor(cent, -1, goals[1].s);
                    break;
                }
            }
        }

        if (!found) {
            return vi(N, 0);
        }
    }


    vi ans(N);
    for (int i = 0; i < N; i++) {
        if (color[i] == -1) {
            color[i] = goals[2].s;
        }
        ans[i] = color[i];
    }
    return ans;
}

Compilation message

split.cpp: In function 'vi find_split(int, int, int, int, vi, vi)':
split.cpp:185:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < p.size(); i++) {
                     ~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 7800 KB ok, correct split
2 Correct 10 ms 7800 KB ok, correct split
3 Correct 9 ms 7928 KB ok, correct split
4 Correct 10 ms 7928 KB ok, correct split
5 Correct 10 ms 7928 KB ok, correct split
6 Correct 10 ms 7928 KB ok, correct split
7 Correct 174 ms 24056 KB ok, correct split
8 Correct 159 ms 22136 KB ok, correct split
9 Correct 168 ms 21624 KB ok, correct split
10 Correct 168 ms 24312 KB ok, correct split
11 Correct 174 ms 24312 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 7928 KB ok, correct split
2 Correct 10 ms 7928 KB ok, correct split
3 Correct 11 ms 7928 KB ok, correct split
4 Correct 178 ms 22520 KB ok, correct split
5 Correct 134 ms 18296 KB ok, correct split
6 Correct 161 ms 24312 KB ok, correct split
7 Correct 170 ms 22008 KB ok, correct split
8 Correct 199 ms 21112 KB ok, correct split
9 Correct 141 ms 18168 KB ok, correct split
10 Correct 96 ms 18800 KB ok, correct split
11 Correct 97 ms 18820 KB ok, correct split
12 Correct 110 ms 19184 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 7800 KB ok, correct split
2 Correct 147 ms 18296 KB ok, correct split
3 Correct 47 ms 12024 KB ok, correct split
4 Correct 10 ms 7800 KB ok, correct split
5 Correct 169 ms 20092 KB ok, correct split
6 Correct 165 ms 19960 KB ok, correct split
7 Correct 162 ms 19960 KB ok, correct split
8 Correct 168 ms 20856 KB ok, correct split
9 Correct 176 ms 19960 KB ok, correct split
10 Correct 47 ms 11388 KB ok, no valid answer
11 Correct 66 ms 13176 KB ok, no valid answer
12 Correct 130 ms 18872 KB ok, no valid answer
13 Correct 158 ms 18400 KB ok, no valid answer
14 Correct 97 ms 19312 KB ok, no valid answer

Subtask #4
24.0 / 24.0

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

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 7800 KB ok, correct split
2 Correct 10 ms 7800 KB ok, correct split
3 Correct 9 ms 7928 KB ok, correct split
4 Correct 10 ms 7928 KB ok, correct split
5 Correct 10 ms 7928 KB ok, correct split
6 Correct 10 ms 7928 KB ok, correct split
7 Correct 174 ms 24056 KB ok, correct split
8 Correct 159 ms 22136 KB ok, correct split
9 Correct 168 ms 21624 KB ok, correct split
10 Correct 168 ms 24312 KB ok, correct split
11 Correct 174 ms 24312 KB ok, correct split
12 Correct 10 ms 7928 KB ok, correct split
13 Correct 10 ms 7928 KB ok, correct split
14 Correct 11 ms 7928 KB ok, correct split
15 Correct 178 ms 22520 KB ok, correct split
16 Correct 134 ms 18296 KB ok, correct split
17 Correct 161 ms 24312 KB ok, correct split
18 Correct 170 ms 22008 KB ok, correct split
19 Correct 199 ms 21112 KB ok, correct split
20 Correct 141 ms 18168 KB ok, correct split
21 Correct 96 ms 18800 KB ok, correct split
22 Correct 97 ms 18820 KB ok, correct split
23 Correct 110 ms 19184 KB ok, correct split
24 Correct 10 ms 7800 KB ok, correct split
25 Correct 147 ms 18296 KB ok, correct split
26 Correct 47 ms 12024 KB ok, correct split
27 Correct 10 ms 7800 KB ok, correct split
28 Correct 169 ms 20092 KB ok, correct split
29 Correct 165 ms 19960 KB ok, correct split
30 Correct 162 ms 19960 KB ok, correct split
31 Correct 168 ms 20856 KB ok, correct split
32 Correct 176 ms 19960 KB ok, correct split
33 Correct 47 ms 11388 KB ok, no valid answer
34 Correct 66 ms 13176 KB ok, no valid answer
35 Correct 130 ms 18872 KB ok, no valid answer
36 Correct 158 ms 18400 KB ok, no valid answer
37 Correct 97 ms 19312 KB ok, no valid answer
38 Correct 10 ms 7800 KB ok, correct split
39 Correct 10 ms 7800 KB ok, no valid answer
40 Correct 10 ms 7800 KB ok, correct split
41 Correct 11 ms 7928 KB ok, correct split
42 Correct 10 ms 7928 KB ok, correct split
43 Correct 10 ms 7928 KB ok, correct split
44 Correct 10 ms 7928 KB ok, correct split
45 Correct 10 ms 7928 KB ok, correct split
46 Correct 13 ms 8184 KB ok, correct split
47 Correct 13 ms 8184 KB ok, correct split
48 Correct 10 ms 7928 KB ok, correct split
49 Correct 14 ms 8184 KB ok, correct split
50 Correct 11 ms 7928 KB ok, correct split
51 Correct 10 ms 7928 KB ok, correct split
52 Correct 10 ms 7928 KB ok, correct split
53 Correct 11 ms 7928 KB ok, correct split
54 Correct 10 ms 7800 KB ok, correct split
55 Correct 10 ms 7932 KB ok, correct split
56 Correct 10 ms 7928 KB ok, correct split
57 Correct 13 ms 7928 KB ok, correct split
58 Correct 12 ms 8184 KB ok, correct split
59 Correct 12 ms 8184 KB ok, correct split
60 Correct 12 ms 8184 KB ok, correct split
61 Correct 12 ms 8184 KB ok, correct split
62 Correct 12 ms 8184 KB ok, correct split
63 Correct 14 ms 8440 KB ok, correct split
64 Correct 13 ms 8312 KB ok, correct split
65 Correct 12 ms 8312 KB ok, correct split
66 Correct 11 ms 7928 KB ok, correct split
67 Correct 14 ms 8184 KB ok, correct split
68 Correct 10 ms 7928 KB ok, correct split
69 Correct 10 ms 7928 KB ok, correct split
70 Correct 11 ms 7928 KB ok, correct split
71 Correct 12 ms 8184 KB ok, correct split
72 Correct 13 ms 8184 KB ok, correct split
73 Correct 12 ms 8184 KB ok, correct split
74 Correct 13 ms 8316 KB ok, correct split
75 Correct 13 ms 8312 KB ok, correct split
76 Correct 13 ms 8312 KB ok, correct split
77 Correct 13 ms 8184 KB ok, correct split
78 Correct 11 ms 8060 KB ok, correct split
79 Correct 12 ms 8056 KB ok, correct split
80 Correct 14 ms 8312 KB ok, correct split
81 Correct 13 ms 8184 KB ok, correct split
82 Correct 14 ms 8312 KB ok, correct split
83 Correct 12 ms 8184 KB ok, correct split
84 Correct 12 ms 8184 KB ok, no valid answer
85 Correct 12 ms 8184 KB ok, correct split
86 Correct 13 ms 8184 KB ok, correct split
87 Correct 10 ms 7800 KB ok, no valid answer
88 Correct 10 ms 7928 KB ok, no valid answer
89 Correct 12 ms 8184 KB ok, no valid answer
90 Correct 13 ms 8184 KB ok, no valid answer
91 Correct 12 ms 8160 KB ok, no valid answer
92 Correct 12 ms 8184 KB ok, no valid answer
93 Correct 12 ms 8184 KB ok, no valid answer
94 Correct 186 ms 20808 KB ok, correct split
95 Correct 249 ms 25208 KB ok, correct split
96 Correct 212 ms 23672 KB ok, correct split
97 Correct 46 ms 12024 KB ok, correct split
98 Correct 52 ms 12280 KB ok, correct split
99 Correct 71 ms 14200 KB ok, correct split
100 Correct 189 ms 21752 KB ok, correct split
101 Correct 189 ms 20600 KB ok, correct split
102 Correct 184 ms 20464 KB ok, correct split
103 Correct 166 ms 20340 KB ok, correct split
104 Correct 155 ms 21988 KB ok, correct split
105 Correct 86 ms 14584 KB ok, correct split
106 Correct 237 ms 26596 KB ok, correct split
107 Correct 143 ms 18296 KB ok, correct split
108 Correct 143 ms 18424 KB ok, correct split
109 Correct 229 ms 21208 KB ok, correct split
110 Correct 235 ms 23024 KB ok, correct split
111 Correct 231 ms 22904 KB ok, correct split
112 Correct 250 ms 23532 KB ok, correct split
113 Correct 220 ms 23276 KB ok, correct split
114 Correct 25 ms 9596 KB ok, correct split
115 Correct 22 ms 9352 KB ok, correct split
116 Correct 238 ms 23020 KB ok, correct split
117 Correct 241 ms 22548 KB ok, correct split
118 Correct 154 ms 18168 KB ok, correct split
119 Correct 160 ms 18168 KB ok, correct split
120 Correct 182 ms 21368 KB ok, correct split
121 Correct 153 ms 18296 KB ok, no valid answer
122 Correct 138 ms 18552 KB ok, no valid answer
123 Correct 232 ms 21880 KB ok, no valid answer
124 Correct 230 ms 21880 KB ok, no valid answer
125 Correct 138 ms 19952 KB ok, no valid answer
126 Correct 106 ms 18164 KB ok, no valid answer
127 Correct 171 ms 20208 KB ok, no valid answer