oj.uz

Submission #730901

# Submission time Handle Problem Language Result Execution time Memory
730901 2023-04-26T15:09:03 Z danikoynov Split the Attractions (IOI19_split) C++14
100 / 100
 176 ms 40384 KB 
#include "split.h"
#include <bits/stdc++.h>

using namespace std;

const int maxn = 3e5 + 10;

struct edge
{
    int v, u;

    edge(int _v = 0, int _u = 0)
    {
        v = _v;
        u = _u;
    }
} e[maxn];

int deg[maxn], m, n, A, B, C, type[4];
vector < pair < int, int > > graph[maxn];

int used[maxn], tree_edge[maxn];
vector < int > order;

void dfs(int v)
{
    /// << v << endl;
    used[v] = 1;

    for (pair < int, int > nb : graph[v])
    {
        if (used[nb.first] == 1)
            continue;
        tree_edge[nb.second] = 1;
        dfs(nb.first);
    }
}

vector < int > tree[maxn];
int sub[maxn];

void calc(int v, int p)
{
    sub[v] = 1;
    for (int u : tree[v])
    {
        if (u == p)
            continue;
        calc(u, v);
        sub[v] += sub[u];
    }
}

int find_centroid(int v, int p)
{
    for (int u : tree[v])
    {
        if (u == p)
            continue;
        if (sub[u] >= n / 2)
            return find_centroid(u, v);
    }
    return v;
}

vector < vector < int > > cp_list;
vector < int > component;

void trav(int v, int p)
{
    component.push_back(v);
    for (int u : tree[v])
    {
        if (u == p)
            continue;
        trav(u, v);
    }
}

void fill_component(int v, int p, int sz)
{
    component.push_back(v);
    for (int u : tree[v])
    {
        if (component.size() == sz)
            break;
        if (u == p)
            continue;

        fill_component(u, v, sz);
    }
}

int cp_idx[maxn];
vector < int > a_list;


bool found = false;
int cur_sz;
void find_path(int v)
{
    cur_sz += cp_list[v].size();
    used[v] = 1;
    a_list.push_back(v);
    for (int u : tree[v])
    {
        if (cur_sz >= A)
        {
            found = true;
            break;
        }
        if (used[u])
            continue;
        find_path(u);
    }
}
int sp[maxn];
void fill_component_again(int v, int sz)
{
    component.push_back(v);
    used[v] = 1;
    for (int u : tree[v])
    {
        if (component.size() == sz)
            break;
        if (used[u])
            continue;

        fill_component_again(u, sz);
    }
}

vector<int> find_split(int N, int a, int b, int c, vector<int> p, vector<int> q)
{
    n = N;
    m = p.size();
    for (int i = 0; i < p.size(); i ++)
    {
        graph[p[i]].push_back({q[i], i});
        graph[q[i]].push_back({p[i], i});
    }

    for (int i = 0; i < m; i ++)
    {
        e[i] = edge(p[i], q[i]);
    }

    dfs(0);
    for (int i = 0; i < m; i ++)
    {
        if (tree_edge[i])
        {
            tree[p[i]].push_back(q[i]);
            tree[q[i]].push_back(p[i]);
            /// << p[i] << " " << q[i] << endl;
        }
    }
    calc(0, -1);
    int centroid = find_centroid(0, -1);

    memset(used, 0, sizeof(used));

    for (int u : tree[centroid])
    {
        component.clear();
        trav(u, centroid);
        cp_list.push_back(component);
    }

    A = a;
    B = b;
    C = c;
    type[1] = 1;
    type[2] = 2;
    type[3] = 3;

    if (A > B)
    {
        swap(A, B);
        swap(type[1], type[2]);
    }

    if (A > C)
    {
        swap(A, C);
        swap(type[1], type[3]);
    }

    if (B > C)
    {
        swap(B, C);
        swap(type[2], type[3]);
    }


    for (int i = 0; i < cp_list.size(); i ++)
    {
        if (cp_list[i].size() >= A)
        {
            vector < int > res(n, 0);
            component.clear();
            fill_component(cp_list[i][0], centroid, A);
            for (int v : component)
                res[v] = type[1];
            component.clear();
            fill_component(centroid, cp_list[i][0], B);
            for (int v : component)
                res[v] = type[2];
            for (int j = 0; j < n; j ++)
                if (res[j] == 0)
                    res[j] = type[3];
            return res;
        }
    }
    // << "here" << endl;

    for (int i = 0; i < cp_list.size(); i ++)
    {
        for (int v : cp_list[i])
            cp_idx[v] = i;
    }
    cp_idx[centroid] = -1;

    for (int i = 0; i < n; i ++)
        tree[i].clear();
    for (int i = 0; i < m; i ++)
    {
        if (tree_edge[i])
            continue;
        if (cp_idx[p[i]] == cp_idx[q[i]])
            continue;
        if (p[i] == centroid || q[i] == centroid)
            continue;

        tree[cp_idx[p[i]]].push_back(cp_idx[q[i]]);
        tree[cp_idx[q[i]]].push_back(cp_idx[p[i]]);
    }


    vector < int > res(n, 0);
    memset(used, 0, sizeof(used));
    for (int i = 0; i < cp_list.size() && !found; i ++)
    {
        a_list.clear();
        cur_sz = 0;
        find_path(i);
    }

    if (!found)
        return res;

    for (int i = 0; i < n; i ++)
        tree[i].clear();
        int sum = 0;
        for (int i = 0; i < a_list.size(); i ++)
            sum += cp_list[a_list[i]].size();

    for (int i = 0; i < a_list.size(); i ++)
        for (int v : cp_list[a_list[i]])
            sp[v] = 1;

    for (int i = 0; i < m; i ++)
    {
        if (sp[p[i]] == sp[q[i]])
        {
            tree[p[i]].push_back(q[i]);
            tree[q[i]].push_back(p[i]);
        }
    }
    component.clear();
    int root1 = 0;
    while(sp[root1] == 0)
        root1 ++;
    int root2 = 0;
    while(sp[root2] == 1)
        root2 ++;
    memset(used, 0, sizeof(used));
    fill_component_again(root1, A);

    for (int v : component)
        res[v] = type[1];
    component.clear();
    fill_component_again(root2, B);
    for (int v : component)
        res[v] = type[2];
    for (int i = 0; i < n; i ++)
        if (res[i] == 0)
            res[i] = type[3];

    return res;
}

Compilation message

split.cpp: In function 'void fill_component(int, int, int)':
split.cpp:85:30: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   85 |         if (component.size() == sz)
      |             ~~~~~~~~~~~~~~~~~^~~~~
split.cpp: In function 'void fill_component_again(int, int)':
split.cpp:124:30: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  124 |         if (component.size() == sz)
      |             ~~~~~~~~~~~~~~~~~^~~~~
split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:137:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  137 |     for (int i = 0; i < p.size(); i ++)
      |                     ~~^~~~~~~~~~
split.cpp:196:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  196 |     for (int i = 0; i < cp_list.size(); i ++)
      |                     ~~^~~~~~~~~~~~~~~~
split.cpp:198:31: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  198 |         if (cp_list[i].size() >= A)
      |             ~~~~~~~~~~~~~~~~~~^~~~
split.cpp:217:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  217 |     for (int i = 0; i < cp_list.size(); i ++)
      |                     ~~^~~~~~~~~~~~~~~~
split.cpp:242:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  242 |     for (int i = 0; i < cp_list.size() && !found; i ++)
      |                     ~~^~~~~~~~~~~~~~~~
split.cpp:252:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  252 |     for (int i = 0; i < n; i ++)
      |     ^~~
split.cpp:254:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  254 |         int sum = 0;
      |         ^~~
split.cpp:255:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  255 |         for (int i = 0; i < a_list.size(); i ++)
      |                         ~~^~~~~~~~~~~~~~~
split.cpp:258:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  258 |     for (int i = 0; i < a_list.size(); i ++)
      |                     ~~^~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 17876 KB ok, correct split
2 Correct 10 ms 17876 KB ok, correct split
3 Correct 9 ms 17832 KB ok, correct split
4 Correct 9 ms 17820 KB ok, correct split
5 Correct 9 ms 17848 KB ok, correct split
6 Correct 9 ms 17876 KB ok, correct split
7 Correct 115 ms 34984 KB ok, correct split
8 Correct 101 ms 32816 KB ok, correct split
9 Correct 103 ms 32136 KB ok, correct split
10 Correct 102 ms 35400 KB ok, correct split
11 Correct 104 ms 35448 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 17948 KB ok, correct split
2 Correct 12 ms 17936 KB ok, correct split
3 Correct 10 ms 17876 KB ok, correct split
4 Correct 138 ms 33576 KB ok, correct split
5 Correct 102 ms 28356 KB ok, correct split
6 Correct 118 ms 35400 KB ok, correct split
7 Correct 122 ms 32584 KB ok, correct split
8 Correct 154 ms 31904 KB ok, correct split
9 Correct 88 ms 27536 KB ok, correct split
10 Correct 76 ms 33944 KB ok, correct split
11 Correct 79 ms 33988 KB ok, correct split
12 Correct 74 ms 33976 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 17876 KB ok, correct split
2 Correct 102 ms 28300 KB ok, correct split
3 Correct 37 ms 21964 KB ok, correct split
4 Correct 10 ms 17936 KB ok, correct split
5 Correct 107 ms 30156 KB ok, correct split
6 Correct 112 ms 29868 KB ok, correct split
7 Correct 101 ms 29848 KB ok, correct split
8 Correct 99 ms 31052 KB ok, correct split
9 Correct 110 ms 29820 KB ok, correct split
10 Correct 34 ms 21460 KB ok, no valid answer
11 Correct 47 ms 23228 KB ok, no valid answer
12 Correct 82 ms 31752 KB ok, no valid answer
13 Correct 119 ms 29020 KB ok, no valid answer
14 Correct 77 ms 33964 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 17896 KB ok, correct split
2 Correct 11 ms 17916 KB ok, no valid answer
3 Correct 11 ms 17876 KB ok, correct split
4 Correct 11 ms 17876 KB ok, correct split
5 Correct 11 ms 17876 KB ok, correct split
6 Correct 10 ms 17876 KB ok, correct split
7 Correct 10 ms 17876 KB ok, correct split
8 Correct 9 ms 17876 KB ok, correct split
9 Correct 11 ms 18296 KB ok, correct split
10 Correct 13 ms 18260 KB ok, correct split
11 Correct 10 ms 17876 KB ok, correct split
12 Correct 13 ms 18208 KB ok, correct split
13 Correct 10 ms 17876 KB ok, correct split
14 Correct 10 ms 17876 KB ok, correct split
15 Correct 10 ms 17928 KB ok, correct split
16 Correct 10 ms 17832 KB ok, correct split
17 Correct 10 ms 17876 KB ok, correct split
18 Correct 10 ms 17932 KB ok, correct split
19 Correct 10 ms 17876 KB ok, correct split
20 Correct 10 ms 18004 KB ok, correct split
21 Correct 11 ms 18212 KB ok, correct split
22 Correct 11 ms 18172 KB ok, correct split
23 Correct 12 ms 18220 KB ok, correct split
24 Correct 11 ms 18132 KB ok, correct split
25 Correct 11 ms 18132 KB ok, correct split
26 Correct 13 ms 18416 KB ok, correct split
27 Correct 12 ms 18364 KB ok, correct split
28 Correct 12 ms 18448 KB ok, correct split
29 Correct 11 ms 17936 KB ok, correct split
30 Correct 11 ms 18388 KB ok, correct split
31 Correct 12 ms 18004 KB ok, correct split
32 Correct 10 ms 17876 KB ok, correct split
33 Correct 13 ms 18048 KB ok, correct split
34 Correct 12 ms 18320 KB ok, correct split
35 Correct 12 ms 18260 KB ok, correct split
36 Correct 12 ms 18224 KB ok, correct split
37 Correct 15 ms 18324 KB ok, correct split
38 Correct 12 ms 18388 KB ok, correct split
39 Correct 12 ms 18388 KB ok, correct split
40 Correct 12 ms 18336 KB ok, correct split
41 Correct 10 ms 18060 KB ok, correct split
42 Correct 10 ms 18132 KB ok, correct split
43 Correct 12 ms 18388 KB ok, correct split
44 Correct 11 ms 18260 KB ok, correct split
45 Correct 11 ms 18388 KB ok, correct split
46 Correct 11 ms 18260 KB ok, correct split
47 Correct 11 ms 18260 KB ok, no valid answer
48 Correct 11 ms 18192 KB ok, correct split
49 Correct 12 ms 18260 KB ok, correct split
50 Correct 10 ms 17876 KB ok, no valid answer
51 Correct 10 ms 17840 KB ok, no valid answer
52 Correct 11 ms 18132 KB ok, no valid answer
53 Correct 12 ms 18324 KB ok, no valid answer
54 Correct 11 ms 18388 KB ok, no valid answer
55 Correct 11 ms 18252 KB ok, no valid answer
56 Correct 12 ms 18260 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 17876 KB ok, correct split
2 Correct 10 ms 17876 KB ok, correct split
3 Correct 9 ms 17832 KB ok, correct split
4 Correct 9 ms 17820 KB ok, correct split
5 Correct 9 ms 17848 KB ok, correct split
6 Correct 9 ms 17876 KB ok, correct split
7 Correct 115 ms 34984 KB ok, correct split
8 Correct 101 ms 32816 KB ok, correct split
9 Correct 103 ms 32136 KB ok, correct split
10 Correct 102 ms 35400 KB ok, correct split
11 Correct 104 ms 35448 KB ok, correct split
12 Correct 9 ms 17948 KB ok, correct split
13 Correct 12 ms 17936 KB ok, correct split
14 Correct 10 ms 17876 KB ok, correct split
15 Correct 138 ms 33576 KB ok, correct split
16 Correct 102 ms 28356 KB ok, correct split
17 Correct 118 ms 35400 KB ok, correct split
18 Correct 122 ms 32584 KB ok, correct split
19 Correct 154 ms 31904 KB ok, correct split
20 Correct 88 ms 27536 KB ok, correct split
21 Correct 76 ms 33944 KB ok, correct split
22 Correct 79 ms 33988 KB ok, correct split
23 Correct 74 ms 33976 KB ok, correct split
24 Correct 9 ms 17876 KB ok, correct split
25 Correct 102 ms 28300 KB ok, correct split
26 Correct 37 ms 21964 KB ok, correct split
27 Correct 10 ms 17936 KB ok, correct split
28 Correct 107 ms 30156 KB ok, correct split
29 Correct 112 ms 29868 KB ok, correct split
30 Correct 101 ms 29848 KB ok, correct split
31 Correct 99 ms 31052 KB ok, correct split
32 Correct 110 ms 29820 KB ok, correct split
33 Correct 34 ms 21460 KB ok, no valid answer
34 Correct 47 ms 23228 KB ok, no valid answer
35 Correct 82 ms 31752 KB ok, no valid answer
36 Correct 119 ms 29020 KB ok, no valid answer
37 Correct 77 ms 33964 KB ok, no valid answer
38 Correct 10 ms 17896 KB ok, correct split
39 Correct 11 ms 17916 KB ok, no valid answer
40 Correct 11 ms 17876 KB ok, correct split
41 Correct 11 ms 17876 KB ok, correct split
42 Correct 11 ms 17876 KB ok, correct split
43 Correct 10 ms 17876 KB ok, correct split
44 Correct 10 ms 17876 KB ok, correct split
45 Correct 9 ms 17876 KB ok, correct split
46 Correct 11 ms 18296 KB ok, correct split
47 Correct 13 ms 18260 KB ok, correct split
48 Correct 10 ms 17876 KB ok, correct split
49 Correct 13 ms 18208 KB ok, correct split
50 Correct 10 ms 17876 KB ok, correct split
51 Correct 10 ms 17876 KB ok, correct split
52 Correct 10 ms 17928 KB ok, correct split
53 Correct 10 ms 17832 KB ok, correct split
54 Correct 10 ms 17876 KB ok, correct split
55 Correct 10 ms 17932 KB ok, correct split
56 Correct 10 ms 17876 KB ok, correct split
57 Correct 10 ms 18004 KB ok, correct split
58 Correct 11 ms 18212 KB ok, correct split
59 Correct 11 ms 18172 KB ok, correct split
60 Correct 12 ms 18220 KB ok, correct split
61 Correct 11 ms 18132 KB ok, correct split
62 Correct 11 ms 18132 KB ok, correct split
63 Correct 13 ms 18416 KB ok, correct split
64 Correct 12 ms 18364 KB ok, correct split
65 Correct 12 ms 18448 KB ok, correct split
66 Correct 11 ms 17936 KB ok, correct split
67 Correct 11 ms 18388 KB ok, correct split
68 Correct 12 ms 18004 KB ok, correct split
69 Correct 10 ms 17876 KB ok, correct split
70 Correct 13 ms 18048 KB ok, correct split
71 Correct 12 ms 18320 KB ok, correct split
72 Correct 12 ms 18260 KB ok, correct split
73 Correct 12 ms 18224 KB ok, correct split
74 Correct 15 ms 18324 KB ok, correct split
75 Correct 12 ms 18388 KB ok, correct split
76 Correct 12 ms 18388 KB ok, correct split
77 Correct 12 ms 18336 KB ok, correct split
78 Correct 10 ms 18060 KB ok, correct split
79 Correct 10 ms 18132 KB ok, correct split
80 Correct 12 ms 18388 KB ok, correct split
81 Correct 11 ms 18260 KB ok, correct split
82 Correct 11 ms 18388 KB ok, correct split
83 Correct 11 ms 18260 KB ok, correct split
84 Correct 11 ms 18260 KB ok, no valid answer
85 Correct 11 ms 18192 KB ok, correct split
86 Correct 12 ms 18260 KB ok, correct split
87 Correct 10 ms 17876 KB ok, no valid answer
88 Correct 10 ms 17840 KB ok, no valid answer
89 Correct 11 ms 18132 KB ok, no valid answer
90 Correct 12 ms 18324 KB ok, no valid answer
91 Correct 11 ms 18388 KB ok, no valid answer
92 Correct 11 ms 18252 KB ok, no valid answer
93 Correct 12 ms 18260 KB ok, no valid answer
94 Correct 113 ms 32516 KB ok, correct split
95 Correct 152 ms 39052 KB ok, correct split
96 Correct 137 ms 36940 KB ok, correct split
97 Correct 36 ms 22604 KB ok, correct split
98 Correct 40 ms 22544 KB ok, correct split
99 Correct 57 ms 25856 KB ok, correct split
100 Correct 140 ms 34728 KB ok, correct split
101 Correct 128 ms 33124 KB ok, correct split
102 Correct 113 ms 33820 KB ok, correct split
103 Correct 106 ms 33524 KB ok, correct split
104 Correct 99 ms 33700 KB ok, correct split
105 Correct 60 ms 25804 KB ok, correct split
106 Correct 126 ms 40384 KB ok, correct split
107 Correct 97 ms 30412 KB ok, correct split
108 Correct 95 ms 30336 KB ok, correct split
109 Correct 176 ms 36052 KB ok, correct split
110 Correct 154 ms 36596 KB ok, correct split
111 Correct 155 ms 36616 KB ok, correct split
112 Correct 141 ms 36232 KB ok, correct split
113 Correct 142 ms 36064 KB ok, correct split
114 Correct 19 ms 19860 KB ok, correct split
115 Correct 19 ms 19604 KB ok, correct split
116 Correct 145 ms 36172 KB ok, correct split
117 Correct 138 ms 35928 KB ok, correct split
118 Correct 103 ms 28872 KB ok, correct split
119 Correct 91 ms 28928 KB ok, correct split
120 Correct 123 ms 32712 KB ok, correct split
121 Correct 88 ms 29564 KB ok, no valid answer
122 Correct 86 ms 30800 KB ok, no valid answer
123 Correct 140 ms 35172 KB ok, no valid answer
124 Correct 135 ms 35068 KB ok, no valid answer
125 Correct 89 ms 34972 KB ok, no valid answer
126 Correct 65 ms 33336 KB ok, no valid answer
127 Correct 101 ms 33664 KB ok, no valid answer