oj.uz

Submission #787248

# Submission time Handle Problem Language Result Execution time Memory
787248 2023-07-19T00:30:49 Z resting Split the Attractions (IOI19_split) C++17
100 / 100
 85 ms 27840 KB 
#include "split.h"
#include <bits/stdc++.h>

using namespace std;

vector<int> ss, sz, pp, tin, low, st, res; int curt = 1;
vector<vector<int>> scc, adj;

void dfs(int v, int p) {
    sz[v] = 1;
    low[v] = tin[v] = curt++; pp[v] = p;
    st.push_back(v);
    for (auto& x : adj[v]) {
        if (tin[x]) low[v] = min(low[v], tin[x]);
        else {
            int tmp = curt;
            dfs(x, v); sz[v] += sz[x];
            if (low[x] == tin[v]) {
                scc.push_back({});
                while (tin[st.back()] >= tmp) { scc.back().push_back(st.back()); st.pop_back(); }
                scc.back().push_back(v);
            }
            low[v] = min(low[v], low[x]);
        }
    }
}

int dfs_fill(int v, int t, int amt) {
    if (!amt || res[v]) return amt;
    res[v] = t; amt--;
    for (auto& x : adj[v]) amt = dfs_fill(x, t, amt);
    return amt;
}


vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
    int na = 1, nb = 2, nc = 3;
    if (a > b) {
        swap(a, b); swap(na, nb);
    }
    if (b > c) {
        swap(b, c); swap(nb, nc);
    }
    if (a > b) {
        swap(a, b); swap(na, nb);//haha o(n) sorting OwO
    }

    sz = pp = tin = low = ss = res = vector<int>(n, 0);
    adj.assign(n, {});
    scc.clear();


    int m = p.size();
    for (int i = 0; i < m; i++) {
        adj[p[i]].push_back(q[i]);
        adj[q[i]].push_back(p[i]);
    }

    dfs(0, 0);

    int mxi = -1;
    assert(scc.size());
    for (int i = 0; i < scc.size(); i++) {
        {
            int mxsz = 0;
            for (auto& x : scc[i]) {
                mxsz = max(mxsz, sz[x]);
                ss[x] = sz[x];
            }
            for (auto& x : scc[i]) {
                if (x) ss[pp[x]] -= sz[x];
                if (sz[x] == mxsz) ss[x] += n - sz[x];
            }
            int sm = 0;
            for (auto& x : scc[i]) sm += ss[x];
            assert(sm == n);
            for (auto& x : scc[i]) {
                if (ss[x] >= b) {
                    if (n - ss[x] >= a) {
                        mxi = i;
                    }
                    goto end;
                }
            }
            mxi = i; break;
        }
    end:;
    }
    if (mxi == -1) return res;


    {
        vector<int> mark1(n, 0);
        vector<int> mark2(n, 0);
        vector<int> mark3(n, 0);
        vector<int> cntc(n, 0);

        int mxsz = 0;
        for (auto& x : scc[mxi]) {
            mark1[x] = 1;
            mxsz = max(mxsz, sz[x]);
            ss[x] = sz[x];
            res[x] = 4;
        }
        for (auto& x : scc[mxi]) {
            if (x) { ss[pp[x]] -= sz[x]; cntc[pp[x]]++; }
            if (sz[x] == mxsz) ss[x] += n - sz[x];
        }
        for (auto& x : scc[mxi]) {
            if (ss[x] >= b) {
                if (b) {
                    res[x] = nb; b--;
                }
                for (auto& x : adj[x])
                    if (!mark1[x])
                        b = dfs_fill(x, nb, b);
                assert(!b);
                for (auto& x : scc[mxi]) {
                    if (res[x] == 4) res[x] = 0;
                }
                for (auto& x : scc[mxi]) {
                    if (!res[x]) {
                        a = dfs_fill(x, na, a);
                        break;
                    }
                }
                assert(!a);
                //assert(!a);
                goto end2;
            }
        }

        vector<int> st;
        for (auto& x : scc[mxi]) if (cntc[x] == 0) st.push_back(x);
        while (st.size()) {
            int c = st.back(); st.pop_back();
            mark2[c]++;
            ss[pp[c]] += ss[c];
            cntc[pp[c]]--;
            if (!cntc[pp[c]]) st.push_back(pp[c]);
            c = pp[c];
            if (ss[c] >= b) {
                assert(ss[c] < 2 * b);
                vector<int> q; q.push_back(c);
                while (q.size()) {
                    int t = q.back(); q.pop_back();
                    mark3[t] = 1;mark2[t] = 0;
                    assert(res[t] == 4);
                    if (b) {
                        res[t] = nb; b--;
                    }
                    for (auto& x : adj[t]) {
                        if (!mark1[x])
                            b = dfs_fill(x, nb, b);
                        if (mark2[x] && pp[x] == t) q.push_back(x);
                    }
                }
                assert(!b);

                for (auto& x : scc[mxi]) {
                    if (res[x] == 4) res[x] = 0;
                }
                for (auto& x : scc[mxi])
                    if (!mark3[x] && res[x] == 0) {
                        a = dfs_fill(x, na, a);
                        break;
                    }
                //assert(!a);
                goto end2;
            }
        }
    }

    assert(false);
end2:;
    assert(!(a + b));
    for (auto& x : res)if (!x)x = nc;
    return res;
}

Compilation message

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:63:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |     for (int i = 0; i < scc.size(); i++) {
      |                     ~~^~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB ok, correct split
2 Correct 0 ms 212 KB ok, correct split
3 Correct 0 ms 212 KB ok, correct split
4 Correct 0 ms 212 KB ok, correct split
5 Correct 0 ms 212 KB ok, correct split
6 Correct 0 ms 212 KB ok, correct split
7 Correct 72 ms 27840 KB ok, correct split
8 Correct 72 ms 24572 KB ok, correct split
9 Correct 63 ms 23400 KB ok, correct split
10 Correct 54 ms 23436 KB ok, correct split
11 Correct 59 ms 23308 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ok, correct split
2 Correct 0 ms 212 KB ok, correct split
3 Correct 0 ms 212 KB ok, correct split
4 Correct 61 ms 19232 KB ok, correct split
5 Correct 57 ms 16736 KB ok, correct split
6 Correct 56 ms 23016 KB ok, correct split
7 Correct 64 ms 23956 KB ok, correct split
8 Correct 70 ms 14344 KB ok, correct split
9 Correct 47 ms 12060 KB ok, correct split
10 Correct 46 ms 17080 KB ok, correct split
11 Correct 46 ms 17148 KB ok, correct split
12 Correct 47 ms 17060 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ok, correct split
2 Correct 56 ms 16848 KB ok, correct split
3 Correct 20 ms 6920 KB ok, correct split
4 Correct 0 ms 212 KB ok, correct split
5 Correct 67 ms 20468 KB ok, correct split
6 Correct 63 ms 20120 KB ok, correct split
7 Correct 62 ms 19872 KB ok, correct split
8 Correct 67 ms 21804 KB ok, correct split
9 Correct 63 ms 19564 KB ok, correct split
10 Correct 17 ms 6008 KB ok, no valid answer
11 Correct 24 ms 7936 KB ok, no valid answer
12 Correct 48 ms 15836 KB ok, no valid answer
13 Correct 53 ms 15596 KB ok, no valid answer
14 Correct 44 ms 15936 KB ok, no valid answer

Subtask #4
24.0 / 24.0

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

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB ok, correct split
2 Correct 0 ms 212 KB ok, correct split
3 Correct 0 ms 212 KB ok, correct split
4 Correct 0 ms 212 KB ok, correct split
5 Correct 0 ms 212 KB ok, correct split
6 Correct 0 ms 212 KB ok, correct split
7 Correct 72 ms 27840 KB ok, correct split
8 Correct 72 ms 24572 KB ok, correct split
9 Correct 63 ms 23400 KB ok, correct split
10 Correct 54 ms 23436 KB ok, correct split
11 Correct 59 ms 23308 KB ok, correct split
12 Correct 0 ms 212 KB ok, correct split
13 Correct 0 ms 212 KB ok, correct split
14 Correct 0 ms 212 KB ok, correct split
15 Correct 61 ms 19232 KB ok, correct split
16 Correct 57 ms 16736 KB ok, correct split
17 Correct 56 ms 23016 KB ok, correct split
18 Correct 64 ms 23956 KB ok, correct split
19 Correct 70 ms 14344 KB ok, correct split
20 Correct 47 ms 12060 KB ok, correct split
21 Correct 46 ms 17080 KB ok, correct split
22 Correct 46 ms 17148 KB ok, correct split
23 Correct 47 ms 17060 KB ok, correct split
24 Correct 0 ms 212 KB ok, correct split
25 Correct 56 ms 16848 KB ok, correct split
26 Correct 20 ms 6920 KB ok, correct split
27 Correct 0 ms 212 KB ok, correct split
28 Correct 67 ms 20468 KB ok, correct split
29 Correct 63 ms 20120 KB ok, correct split
30 Correct 62 ms 19872 KB ok, correct split
31 Correct 67 ms 21804 KB ok, correct split
32 Correct 63 ms 19564 KB ok, correct split
33 Correct 17 ms 6008 KB ok, no valid answer
34 Correct 24 ms 7936 KB ok, no valid answer
35 Correct 48 ms 15836 KB ok, no valid answer
36 Correct 53 ms 15596 KB ok, no valid answer
37 Correct 44 ms 15936 KB ok, no valid answer
38 Correct 0 ms 212 KB ok, correct split
39 Correct 0 ms 212 KB ok, no valid answer
40 Correct 0 ms 212 KB ok, correct split
41 Correct 0 ms 212 KB ok, correct split
42 Correct 0 ms 212 KB ok, correct split
43 Correct 1 ms 212 KB ok, correct split
44 Correct 1 ms 212 KB ok, correct split
45 Correct 1 ms 212 KB ok, correct split
46 Correct 2 ms 724 KB ok, correct split
47 Correct 2 ms 596 KB ok, correct split
48 Correct 0 ms 212 KB ok, correct split
49 Correct 2 ms 596 KB ok, correct split
50 Correct 0 ms 212 KB ok, correct split
51 Correct 0 ms 212 KB ok, correct split
52 Correct 0 ms 212 KB ok, correct split
53 Correct 0 ms 212 KB ok, correct split
54 Correct 0 ms 212 KB ok, correct split
55 Correct 0 ms 212 KB ok, correct split
56 Correct 1 ms 340 KB ok, correct split
57 Correct 1 ms 468 KB ok, correct split
58 Correct 2 ms 724 KB ok, correct split
59 Correct 2 ms 724 KB ok, correct split
60 Correct 2 ms 832 KB ok, correct split
61 Correct 2 ms 724 KB ok, correct split
62 Correct 2 ms 724 KB ok, correct split
63 Correct 2 ms 596 KB ok, correct split
64 Correct 2 ms 596 KB ok, correct split
65 Correct 2 ms 596 KB ok, correct split
66 Correct 1 ms 212 KB ok, correct split
67 Correct 2 ms 596 KB ok, correct split
68 Correct 1 ms 340 KB ok, correct split
69 Correct 1 ms 340 KB ok, correct split
70 Correct 1 ms 340 KB ok, correct split
71 Correct 2 ms 596 KB ok, correct split
72 Correct 2 ms 584 KB ok, correct split
73 Correct 2 ms 700 KB ok, correct split
74 Correct 2 ms 596 KB ok, correct split
75 Correct 2 ms 596 KB ok, correct split
76 Correct 2 ms 596 KB ok, correct split
77 Correct 2 ms 596 KB ok, correct split
78 Correct 1 ms 468 KB ok, correct split
79 Correct 1 ms 468 KB ok, correct split
80 Correct 2 ms 596 KB ok, correct split
81 Correct 2 ms 596 KB ok, correct split
82 Correct 2 ms 596 KB ok, correct split
83 Correct 1 ms 596 KB ok, correct split
84 Correct 1 ms 596 KB ok, no valid answer
85 Correct 2 ms 596 KB ok, correct split
86 Correct 2 ms 704 KB ok, correct split
87 Correct 0 ms 212 KB ok, no valid answer
88 Correct 0 ms 212 KB ok, no valid answer
89 Correct 2 ms 596 KB ok, no valid answer
90 Correct 2 ms 596 KB ok, no valid answer
91 Correct 2 ms 596 KB ok, no valid answer
92 Correct 2 ms 584 KB ok, no valid answer
93 Correct 2 ms 596 KB ok, no valid answer
94 Correct 64 ms 18080 KB ok, correct split
95 Correct 85 ms 21780 KB ok, correct split
96 Correct 76 ms 20216 KB ok, correct split
97 Correct 21 ms 6960 KB ok, correct split
98 Correct 21 ms 6248 KB ok, correct split
99 Correct 31 ms 7300 KB ok, correct split
100 Correct 72 ms 15044 KB ok, correct split
101 Correct 65 ms 14600 KB ok, correct split
102 Correct 67 ms 14716 KB ok, correct split
103 Correct 61 ms 14968 KB ok, correct split
104 Correct 59 ms 14520 KB ok, correct split
105 Correct 34 ms 10216 KB ok, correct split
106 Correct 75 ms 15296 KB ok, correct split
107 Correct 61 ms 16892 KB ok, correct split
108 Correct 56 ms 16948 KB ok, correct split
109 Correct 72 ms 14472 KB ok, correct split
110 Correct 73 ms 14196 KB ok, correct split
111 Correct 71 ms 14288 KB ok, correct split
112 Correct 71 ms 14824 KB ok, correct split
113 Correct 72 ms 14916 KB ok, correct split
114 Correct 8 ms 2388 KB ok, correct split
115 Correct 7 ms 1988 KB ok, correct split
116 Correct 66 ms 14196 KB ok, correct split
117 Correct 69 ms 14180 KB ok, correct split
118 Correct 48 ms 11852 KB ok, correct split
119 Correct 49 ms 12016 KB ok, correct split
120 Correct 53 ms 17812 KB ok, correct split
121 Correct 55 ms 15044 KB ok, no valid answer
122 Correct 53 ms 15724 KB ok, no valid answer
123 Correct 70 ms 14248 KB ok, no valid answer
124 Correct 72 ms 14052 KB ok, no valid answer
125 Correct 53 ms 15768 KB ok, no valid answer
126 Correct 41 ms 14468 KB ok, no valid answer
127 Correct 56 ms 14092 KB ok, no valid answer