oj.uz

Submission #476508

# Submission time Handle Problem Language Result Execution time Memory
476508 2021-09-27T12:25:20 Z Lam_lai_cuoc_doi Split the Attractions (IOI19_split) C++17
100 / 100
 184 ms 23444 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;

template <class T>
void read(T &x)
{
    x = 0;
    register int c;
    while ((c = getchar()) && (c > '9' || c < '0'))
        ;
    for (; c >= '0' && c <= '9'; c = getchar())
        x = x * 10 + c - '0';
}

constexpr bool typetest = 0;
constexpr int N = 2e5 + 5;
constexpr int Inf = 1e9 + 7;

vector<pair<int, int>> adj[N];
bool inused[N];
int cnt[N], n;
pair<int, int> a[3], par[N];

void dfs(int v, int p = 0)
{
    cnt[v] = 1;
    for (auto i : adj[v])
        if (i.first != p && !cnt[i.first])
        {
            inused[i.second] = 1;
            par[i.first] = make_pair(v, i.second);
            dfs(i.first, v);
            cnt[v] += cnt[i.first];
        }
}

vector<int> Do()
{
    int cnt1(0);

    vector<int> ans(n, 0);

    function<void(int, int, pair<int, int>)> Colored = [&](int v, int p, pair<int, int> a)
    {
        ++cnt1;
        ans[v] = a.second;
        if (cnt1 == a.first)
            return;

        for (auto i : adj[v])
            if (inused[i.second] && i.first != p)
            {
                Colored(i.first, v, a);
                if (cnt1 == a.first)
                    return;
            }
    };

    for (int i = 1; i < n; ++i)
        if (cnt[i] >= a[0].first)
        {
            int sz(cnt[i]);
            bool ok(1);

            for (auto j : adj[i])
                if (par[j.first].first == i)
                {
                    if (cnt[j.first] >= a[0].first)
                    {
                        ok = 0;
                        break;
                    }
                }

            if (!ok)
                continue;

            //cout << i << " " << cnt[i] << " " << a[0].first << "\n";

            vector<pair<int, int>> off;

            for (auto j : adj[i])
                if (par[j.first].first == i)
                {
                    if (adj[j.first][0].first != i && sz - cnt[j.first] >= a[0].first)
                    {
                        sz -= cnt[j.first];
                        off.emplace_back(j);
                    }
                    else if (sz - cnt[j.first] <= a[0].first)
                    {
                        for (auto t : off)
                        {
                            inused[t.second] = 0;
                            inused[adj[t.first][0].second] = 1;
                        }
                        inused[par[i].second] = 0;
                        //cout << i << " " << par[i].first << " " << sz << " " << a[0].second << "\n";

                        cnt1 = 0;
                        Colored(i, -1, a[0]);
                        cnt1 = 0;
                        Colored(par[i].first, -1, a[1]);

                        for (auto &t : ans)
                            if (t == 0)
                                t = a[2].second;

                        for (auto t : off)
                        {
                            inused[t.second] = 1;
                            inused[adj[t.first][0].second] = 0;
                        }
                        inused[par[i].second] = 1;

                        goto done;
                    }
                    //cout << sz << "\n";
                }

            if (n - sz >= a[1].first)
            {
                inused[par[i].second] = 0;
                for (auto t : off)
                {
                    inused[t.second] = 0;
                    inused[adj[t.first][0].second] = 1;
                }

                cnt1 = 0;
                Colored(i, -1, a[0]);
                cnt1 = 0;
                Colored(par[i].first, -1, a[1]);

                inused[par[i].second] = 1;
                for (auto t : off)
                {
                    inused[t.second] = 1;
                    inused[adj[t.first][0].second] = 0;
                }

                for (auto &t : ans)
                    if (t == 0)
                        t = a[2].second;

                break;
            }
            else if (n - sz >= a[0].first)
            {
                inused[par[i].second] = 0;
                for (auto t : off)
                {
                    inused[t.second] = 0;
                    inused[adj[t.first][0].second] = 1;
                }

                cnt1 = 0;
                Colored(i, -1, a[1]);
                cnt1 = 0;
                Colored(par[i].first, -1, a[0]);

                inused[par[i].second] = 1;
                for (auto t : off)
                {
                    inused[t.second] = 1;
                    inused[adj[t.first][0].second] = 0;
                }

                for (auto &t : ans)
                    if (t == 0)
                        t = a[2].second;

                break;
            }
        }
done:;

    return ans;
}

vector<int> find_split(int nn, int A, int B, int C, vector<int> p, vector<int> q)
{
    int m = p.size();
    n = nn;
    vector<int> ans(n, 0);
    a[0] = make_pair(A, 1);
    a[1] = make_pair(B, 2);
    a[2] = make_pair(C, 3);

    sort(a, a + 3);

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

    dfs(0);

    for (int i = 0; i < n; ++i)
        sort(adj[i].begin(), adj[i].end(), [&](const pair<int, int> &x, const pair<int, int> &y)
             { return cnt[x.first] > cnt[y.first]; });

    ans = Do();

    if (count(ans.begin(), ans.end(), '0') != 0)
    {
        swap(a[0], a[1]);
        ans = Do();
    }

    return ans;
}

void Read()
{
    int n, m, a, b, c;
    cin >> n >> m;
    cin >> a >> b >> c;
    vector<int> u(m), v(m);
    for (int i = 0; i < m; ++i)
        cin >> u[i] >> v[i];

    vector<int> ans = find_split(n, a, b, c, u, v);

    for (auto i : ans)
        cout << i << " ";
}

void Solve()
{
    /*
        9 4 2 3 10
        0 1
        0 2
        0 3
        0 4
        0 8
        0 6 
        1 7
        4 5
        3 7
        6 5

        6 2 2 2 5
        0 1
        0 2
        0 3
        0 4
        0 5

    */
}

Compilation message

split.cpp: In function 'void read(T&)':
split.cpp:12:18: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   12 |     register int c;
      |                  ^

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB ok, correct split
2 Correct 3 ms 4940 KB ok, correct split
3 Correct 3 ms 4940 KB ok, correct split
4 Correct 3 ms 4940 KB ok, correct split
5 Correct 4 ms 4940 KB ok, correct split
6 Correct 3 ms 4940 KB ok, correct split
7 Correct 98 ms 20224 KB ok, correct split
8 Correct 87 ms 18088 KB ok, correct split
9 Correct 87 ms 18348 KB ok, correct split
10 Correct 95 ms 20612 KB ok, correct split
11 Correct 103 ms 20612 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB ok, correct split
2 Correct 3 ms 4940 KB ok, correct split
3 Correct 3 ms 4940 KB ok, correct split
4 Correct 116 ms 19464 KB ok, correct split
5 Correct 101 ms 13500 KB ok, correct split
6 Correct 86 ms 20616 KB ok, correct split
7 Correct 101 ms 18260 KB ok, correct split
8 Correct 184 ms 17708 KB ok, correct split
9 Correct 86 ms 13096 KB ok, correct split
10 Correct 60 ms 13196 KB ok, correct split
11 Correct 66 ms 13308 KB ok, correct split
12 Correct 66 ms 13688 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB ok, correct split
2 Correct 88 ms 13468 KB ok, correct split
3 Correct 33 ms 8396 KB ok, correct split
4 Correct 3 ms 4996 KB ok, correct split
5 Correct 95 ms 16136 KB ok, correct split
6 Correct 93 ms 16140 KB ok, correct split
7 Correct 116 ms 16160 KB ok, correct split
8 Correct 102 ms 16392 KB ok, correct split
9 Correct 100 ms 16068 KB ok, correct split
10 Correct 23 ms 7816 KB ok, no valid answer
11 Correct 45 ms 9156 KB ok, no valid answer
12 Correct 72 ms 13560 KB ok, no valid answer
13 Correct 85 ms 13612 KB ok, no valid answer
14 Correct 58 ms 13692 KB ok, no valid answer

Subtask #4
24.0 / 24.0

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

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB ok, correct split
2 Correct 3 ms 4940 KB ok, correct split
3 Correct 3 ms 4940 KB ok, correct split
4 Correct 3 ms 4940 KB ok, correct split
5 Correct 4 ms 4940 KB ok, correct split
6 Correct 3 ms 4940 KB ok, correct split
7 Correct 98 ms 20224 KB ok, correct split
8 Correct 87 ms 18088 KB ok, correct split
9 Correct 87 ms 18348 KB ok, correct split
10 Correct 95 ms 20612 KB ok, correct split
11 Correct 103 ms 20612 KB ok, correct split
12 Correct 3 ms 4940 KB ok, correct split
13 Correct 3 ms 4940 KB ok, correct split
14 Correct 3 ms 4940 KB ok, correct split
15 Correct 116 ms 19464 KB ok, correct split
16 Correct 101 ms 13500 KB ok, correct split
17 Correct 86 ms 20616 KB ok, correct split
18 Correct 101 ms 18260 KB ok, correct split
19 Correct 184 ms 17708 KB ok, correct split
20 Correct 86 ms 13096 KB ok, correct split
21 Correct 60 ms 13196 KB ok, correct split
22 Correct 66 ms 13308 KB ok, correct split
23 Correct 66 ms 13688 KB ok, correct split
24 Correct 3 ms 4940 KB ok, correct split
25 Correct 88 ms 13468 KB ok, correct split
26 Correct 33 ms 8396 KB ok, correct split
27 Correct 3 ms 4996 KB ok, correct split
28 Correct 95 ms 16136 KB ok, correct split
29 Correct 93 ms 16140 KB ok, correct split
30 Correct 116 ms 16160 KB ok, correct split
31 Correct 102 ms 16392 KB ok, correct split
32 Correct 100 ms 16068 KB ok, correct split
33 Correct 23 ms 7816 KB ok, no valid answer
34 Correct 45 ms 9156 KB ok, no valid answer
35 Correct 72 ms 13560 KB ok, no valid answer
36 Correct 85 ms 13612 KB ok, no valid answer
37 Correct 58 ms 13692 KB ok, no valid answer
38 Correct 3 ms 4940 KB ok, correct split
39 Correct 3 ms 4940 KB ok, no valid answer
40 Correct 3 ms 4940 KB ok, correct split
41 Correct 3 ms 4940 KB ok, correct split
42 Correct 3 ms 4940 KB ok, correct split
43 Correct 3 ms 4940 KB ok, correct split
44 Correct 5 ms 4940 KB ok, correct split
45 Correct 3 ms 4940 KB ok, correct split
46 Correct 6 ms 5392 KB ok, correct split
47 Correct 6 ms 5324 KB ok, correct split
48 Correct 4 ms 4940 KB ok, correct split
49 Correct 5 ms 5348 KB ok, correct split
50 Correct 3 ms 4940 KB ok, correct split
51 Correct 4 ms 4992 KB ok, correct split
52 Correct 3 ms 4940 KB ok, correct split
53 Correct 3 ms 4940 KB ok, correct split
54 Correct 4 ms 4940 KB ok, correct split
55 Correct 3 ms 4996 KB ok, correct split
56 Correct 4 ms 4940 KB ok, correct split
57 Correct 4 ms 5068 KB ok, correct split
58 Correct 4 ms 5272 KB ok, correct split
59 Correct 4 ms 5264 KB ok, correct split
60 Correct 4 ms 5264 KB ok, correct split
61 Correct 4 ms 5264 KB ok, correct split
62 Correct 4 ms 5196 KB ok, correct split
63 Correct 7 ms 5336 KB ok, correct split
64 Correct 5 ms 5324 KB ok, correct split
65 Correct 5 ms 5324 KB ok, correct split
66 Correct 4 ms 5064 KB ok, correct split
67 Correct 7 ms 5196 KB ok, correct split
68 Correct 4 ms 5068 KB ok, correct split
69 Correct 4 ms 4996 KB ok, correct split
70 Correct 3 ms 4940 KB ok, correct split
71 Correct 4 ms 5196 KB ok, correct split
72 Correct 5 ms 5264 KB ok, correct split
73 Correct 6 ms 5196 KB ok, correct split
74 Correct 7 ms 5324 KB ok, correct split
75 Correct 5 ms 5392 KB ok, correct split
76 Correct 6 ms 5324 KB ok, correct split
77 Correct 5 ms 5324 KB ok, correct split
78 Correct 4 ms 5120 KB ok, correct split
79 Correct 4 ms 5068 KB ok, correct split
80 Correct 5 ms 5324 KB ok, correct split
81 Correct 5 ms 5324 KB ok, correct split
82 Correct 5 ms 5324 KB ok, correct split
83 Correct 4 ms 5268 KB ok, correct split
84 Correct 5 ms 5196 KB ok, no valid answer
85 Correct 6 ms 5136 KB ok, correct split
86 Correct 4 ms 5196 KB ok, correct split
87 Correct 3 ms 4940 KB ok, no valid answer
88 Correct 5 ms 4940 KB ok, no valid answer
89 Correct 5 ms 5196 KB ok, no valid answer
90 Correct 5 ms 5324 KB ok, no valid answer
91 Correct 4 ms 5196 KB ok, no valid answer
92 Correct 5 ms 5268 KB ok, no valid answer
93 Correct 5 ms 5256 KB ok, no valid answer
94 Correct 112 ms 17476 KB ok, correct split
95 Correct 170 ms 23444 KB ok, correct split
96 Correct 131 ms 21296 KB ok, correct split
97 Correct 29 ms 8340 KB ok, correct split
98 Correct 29 ms 8552 KB ok, correct split
99 Correct 56 ms 12096 KB ok, correct split
100 Correct 142 ms 19096 KB ok, correct split
101 Correct 119 ms 17476 KB ok, correct split
102 Correct 114 ms 16408 KB ok, correct split
103 Correct 99 ms 15820 KB ok, correct split
104 Correct 106 ms 17248 KB ok, correct split
105 Correct 57 ms 10388 KB ok, correct split
106 Correct 134 ms 18692 KB ok, correct split
107 Correct 74 ms 13552 KB ok, correct split
108 Correct 86 ms 13516 KB ok, correct split
109 Correct 169 ms 18244 KB ok, correct split
110 Correct 141 ms 18720 KB ok, correct split
111 Correct 141 ms 18896 KB ok, correct split
112 Correct 121 ms 18196 KB ok, correct split
113 Correct 139 ms 18100 KB ok, correct split
114 Correct 15 ms 6832 KB ok, correct split
115 Correct 13 ms 6420 KB ok, correct split
116 Correct 131 ms 18700 KB ok, correct split
117 Correct 144 ms 18564 KB ok, correct split
118 Correct 126 ms 13028 KB ok, correct split
119 Correct 93 ms 12932 KB ok, correct split
120 Correct 93 ms 17036 KB ok, correct split
121 Correct 89 ms 13520 KB ok, no valid answer
122 Correct 77 ms 13548 KB ok, no valid answer
123 Correct 123 ms 19304 KB ok, no valid answer
124 Correct 170 ms 19140 KB ok, no valid answer
125 Correct 86 ms 14692 KB ok, no valid answer
126 Correct 49 ms 12716 KB ok, no valid answer
127 Correct 98 ms 15012 KB ok, no valid answer