oj.uz

답안 #229603

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
229603 2020-05-05T09:48:39 Z combi1k1 Split the Attractions (IOI19_split) C++14
100 / 100
 156 ms 18040 KB 
#include "split.h"
#include <bits/stdc++.h>

using namespace std;

#define ll  long long
#define ld  double

#define sz(x)   (int)x.size()
#define all(x)  x.begin(),x.end()

#define pb  emplace_back
#define X   first
#define Y   second

typedef pair<int,int>   ii;

const int   N   = 2e5 + 5;

int p[N];
int s[N];

int init(int n) {
    iota(p,p + n,0);
    fill(s,s + n,1);
    return  1;
}
int lead(int x) {   return  p[x] == x ? x : p[x] = lead(p[x]);  }
int join(int x,int y)   {
    x = lead(x);
    y = lead(y);

    if (x == y) return  0;
    if (s[x] < s[y])
        swap(x,y);
    
    p[y] = x;
    s[x] += s[y];

    return  1;
}
bool sameSet(int x,int y)   {
    x = lead(x);
    y = lead(y);

    return  x == y;
}
typedef vector<int> vec;

int findRoot(int mxSize,const vector<vec> &adj) {
    vector<int> s(sz(adj),0);
    vector<int> p(sz(adj),-1);
    
    function<void(int)> dfs = [&](int u)    {
        s[u] = 1;

        for(int v : adj[u]) if (v != p[u])  {
            p[v] = u;   dfs(v);
            s[u] += s[v];
        }
    };
    dfs(0);
    
    for(int u = 0 ;;)   {
        int siz = -1;
        int idx = 0;

        for(int v : adj[u]) if (v != p[u])
            if (siz < s[v])
                siz = s[v],
                idx = v;
        
        if (siz <= mxSize)  return  u;
        u = idx;
    }
}
vector<int> find_split(int n,int a,int b,int c,vector<int> p,vector<int> q) {
    vector<int> res(n,0);
    vector<ii>  color_Set;

    color_Set.pb(a,1);
    color_Set.pb(b,2);
    color_Set.pb(c,3);
    
    sort(all(color_Set));

    a = color_Set[0].X; int ca = color_Set[0].Y;
    b = color_Set[1].X; int cb = color_Set[1].Y;
    c = color_Set[2].X; int cc = color_Set[2].Y;

    vector<vec> g(n);
    init(n);
    
    for(int i = 0 ; i < sz(p) ; ++i)
        if (join(p[i],q[i]))    {
            g[p[i]].pb(q[i]);
            g[q[i]].pb(p[i]);
        }
    init(n);
    int r = findRoot(n - b,g);

    for(int i = 0 ; i < n ; ++i)
    for(int x : g[i])   {
        if (i == r) continue;
        if (x == r) continue;

        join(i,x);
    }
    
    for(int i = 0 ; i < sz(p) ; ++i)    {
        int x = p[i];
        int y = q[i];

        if (sameSet(x,y))   continue;
        if (x == r) continue;
        if (y == r) continue;

        if (s[lead(x)] >= a)    continue;
        if (s[lead(y)] >= a)    continue;

        join(x,y);

        g[x].pb(y);
        g[y].pb(x);
    }
    function<void(int,int&,int,int)> cal = [&](int u,int&n,int c,int bad)   {
        if (u == bad)   return;
        if (res[u])     return;
        if (n == 0)     return;

        res[u] = c;
        n--;

        for(int v : g[u])
            cal(v,n,c,bad);
    };
    for(int v : g[r])   if (s[lead(v)] >= a)    {
        cal(v,a,ca,r);
        cal(r,b,cb,-1); // color root and its surrounding subgraph for set B
        
        replace(all(res),0,cc);
        break;
    }
    return  res;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB ok, correct split
2 Correct 5 ms 384 KB ok, correct split
3 Correct 5 ms 384 KB ok, correct split
4 Correct 5 ms 256 KB ok, correct split
5 Correct 5 ms 384 KB ok, correct split
6 Correct 5 ms 384 KB ok, correct split
7 Correct 119 ms 17912 KB ok, correct split
8 Correct 109 ms 15736 KB ok, correct split
9 Correct 105 ms 14968 KB ok, correct split
10 Correct 117 ms 18040 KB ok, correct split
11 Correct 119 ms 16760 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB ok, correct split
2 Correct 5 ms 256 KB ok, correct split
3 Correct 5 ms 384 KB ok, correct split
4 Correct 123 ms 12024 KB ok, correct split
5 Correct 98 ms 10616 KB ok, correct split
6 Correct 110 ms 18040 KB ok, correct split
7 Correct 134 ms 15480 KB ok, correct split
8 Correct 127 ms 13048 KB ok, correct split
9 Correct 112 ms 10508 KB ok, correct split
10 Correct 68 ms 10528 KB ok, correct split
11 Correct 66 ms 10480 KB ok, correct split
12 Correct 78 ms 10864 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB ok, correct split
2 Correct 118 ms 10668 KB ok, correct split
3 Correct 38 ms 4472 KB ok, correct split
4 Correct 5 ms 384 KB ok, correct split
5 Correct 130 ms 13048 KB ok, correct split
6 Correct 141 ms 13048 KB ok, correct split
7 Correct 112 ms 12664 KB ok, correct split
8 Correct 116 ms 13944 KB ok, correct split
9 Correct 104 ms 12536 KB ok, correct split
10 Correct 30 ms 3840 KB ok, no valid answer
11 Correct 47 ms 5504 KB ok, no valid answer
12 Correct 86 ms 10740 KB ok, no valid answer
13 Correct 88 ms 10616 KB ok, no valid answer
14 Correct 65 ms 10864 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB ok, correct split
2 Correct 5 ms 384 KB ok, no valid answer
3 Correct 5 ms 384 KB ok, correct split
4 Correct 4 ms 256 KB ok, correct split
5 Correct 5 ms 256 KB ok, correct split
6 Correct 5 ms 256 KB ok, correct split
7 Correct 5 ms 384 KB ok, correct split
8 Correct 4 ms 256 KB ok, correct split
9 Correct 7 ms 640 KB ok, correct split
10 Correct 7 ms 640 KB ok, correct split
11 Correct 5 ms 384 KB ok, correct split
12 Correct 7 ms 640 KB ok, correct split
13 Correct 5 ms 256 KB ok, correct split
14 Correct 4 ms 384 KB ok, correct split
15 Correct 5 ms 384 KB ok, correct split
16 Correct 5 ms 384 KB ok, correct split
17 Correct 5 ms 384 KB ok, correct split
18 Correct 4 ms 256 KB ok, correct split
19 Correct 5 ms 384 KB ok, correct split
20 Correct 5 ms 384 KB ok, correct split
21 Correct 6 ms 640 KB ok, correct split
22 Correct 6 ms 640 KB ok, correct split
23 Correct 7 ms 640 KB ok, correct split
24 Correct 6 ms 640 KB ok, correct split
25 Correct 6 ms 640 KB ok, correct split
26 Correct 7 ms 640 KB ok, correct split
27 Correct 7 ms 640 KB ok, correct split
28 Correct 7 ms 640 KB ok, correct split
29 Correct 5 ms 384 KB ok, correct split
30 Correct 7 ms 640 KB ok, correct split
31 Correct 5 ms 384 KB ok, correct split
32 Correct 5 ms 384 KB ok, correct split
33 Correct 5 ms 384 KB ok, correct split
34 Correct 6 ms 640 KB ok, correct split
35 Correct 7 ms 640 KB ok, correct split
36 Correct 6 ms 512 KB ok, correct split
37 Correct 7 ms 640 KB ok, correct split
38 Correct 7 ms 640 KB ok, correct split
39 Correct 7 ms 640 KB ok, correct split
40 Correct 7 ms 640 KB ok, correct split
41 Correct 6 ms 512 KB ok, correct split
42 Correct 6 ms 512 KB ok, correct split
43 Correct 7 ms 640 KB ok, correct split
44 Correct 7 ms 640 KB ok, correct split
45 Correct 7 ms 640 KB ok, correct split
46 Correct 6 ms 640 KB ok, correct split
47 Correct 6 ms 640 KB ok, no valid answer
48 Correct 6 ms 640 KB ok, correct split
49 Correct 6 ms 640 KB ok, correct split
50 Correct 5 ms 384 KB ok, no valid answer
51 Correct 4 ms 384 KB ok, no valid answer
52 Correct 6 ms 640 KB ok, no valid answer
53 Correct 7 ms 640 KB ok, no valid answer
54 Correct 6 ms 640 KB ok, no valid answer
55 Correct 7 ms 640 KB ok, no valid answer
56 Correct 7 ms 640 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB ok, correct split
2 Correct 5 ms 384 KB ok, correct split
3 Correct 5 ms 384 KB ok, correct split
4 Correct 5 ms 256 KB ok, correct split
5 Correct 5 ms 384 KB ok, correct split
6 Correct 5 ms 384 KB ok, correct split
7 Correct 119 ms 17912 KB ok, correct split
8 Correct 109 ms 15736 KB ok, correct split
9 Correct 105 ms 14968 KB ok, correct split
10 Correct 117 ms 18040 KB ok, correct split
11 Correct 119 ms 16760 KB ok, correct split
12 Correct 5 ms 384 KB ok, correct split
13 Correct 5 ms 256 KB ok, correct split
14 Correct 5 ms 384 KB ok, correct split
15 Correct 123 ms 12024 KB ok, correct split
16 Correct 98 ms 10616 KB ok, correct split
17 Correct 110 ms 18040 KB ok, correct split
18 Correct 134 ms 15480 KB ok, correct split
19 Correct 127 ms 13048 KB ok, correct split
20 Correct 112 ms 10508 KB ok, correct split
21 Correct 68 ms 10528 KB ok, correct split
22 Correct 66 ms 10480 KB ok, correct split
23 Correct 78 ms 10864 KB ok, correct split
24 Correct 5 ms 384 KB ok, correct split
25 Correct 118 ms 10668 KB ok, correct split
26 Correct 38 ms 4472 KB ok, correct split
27 Correct 5 ms 384 KB ok, correct split
28 Correct 130 ms 13048 KB ok, correct split
29 Correct 141 ms 13048 KB ok, correct split
30 Correct 112 ms 12664 KB ok, correct split
31 Correct 116 ms 13944 KB ok, correct split
32 Correct 104 ms 12536 KB ok, correct split
33 Correct 30 ms 3840 KB ok, no valid answer
34 Correct 47 ms 5504 KB ok, no valid answer
35 Correct 86 ms 10740 KB ok, no valid answer
36 Correct 88 ms 10616 KB ok, no valid answer
37 Correct 65 ms 10864 KB ok, no valid answer
38 Correct 5 ms 384 KB ok, correct split
39 Correct 5 ms 384 KB ok, no valid answer
40 Correct 5 ms 384 KB ok, correct split
41 Correct 4 ms 256 KB ok, correct split
42 Correct 5 ms 256 KB ok, correct split
43 Correct 5 ms 256 KB ok, correct split
44 Correct 5 ms 384 KB ok, correct split
45 Correct 4 ms 256 KB ok, correct split
46 Correct 7 ms 640 KB ok, correct split
47 Correct 7 ms 640 KB ok, correct split
48 Correct 5 ms 384 KB ok, correct split
49 Correct 7 ms 640 KB ok, correct split
50 Correct 5 ms 256 KB ok, correct split
51 Correct 4 ms 384 KB ok, correct split
52 Correct 5 ms 384 KB ok, correct split
53 Correct 5 ms 384 KB ok, correct split
54 Correct 5 ms 384 KB ok, correct split
55 Correct 4 ms 256 KB ok, correct split
56 Correct 5 ms 384 KB ok, correct split
57 Correct 5 ms 384 KB ok, correct split
58 Correct 6 ms 640 KB ok, correct split
59 Correct 6 ms 640 KB ok, correct split
60 Correct 7 ms 640 KB ok, correct split
61 Correct 6 ms 640 KB ok, correct split
62 Correct 6 ms 640 KB ok, correct split
63 Correct 7 ms 640 KB ok, correct split
64 Correct 7 ms 640 KB ok, correct split
65 Correct 7 ms 640 KB ok, correct split
66 Correct 5 ms 384 KB ok, correct split
67 Correct 7 ms 640 KB ok, correct split
68 Correct 5 ms 384 KB ok, correct split
69 Correct 5 ms 384 KB ok, correct split
70 Correct 5 ms 384 KB ok, correct split
71 Correct 6 ms 640 KB ok, correct split
72 Correct 7 ms 640 KB ok, correct split
73 Correct 6 ms 512 KB ok, correct split
74 Correct 7 ms 640 KB ok, correct split
75 Correct 7 ms 640 KB ok, correct split
76 Correct 7 ms 640 KB ok, correct split
77 Correct 7 ms 640 KB ok, correct split
78 Correct 6 ms 512 KB ok, correct split
79 Correct 6 ms 512 KB ok, correct split
80 Correct 7 ms 640 KB ok, correct split
81 Correct 7 ms 640 KB ok, correct split
82 Correct 7 ms 640 KB ok, correct split
83 Correct 6 ms 640 KB ok, correct split
84 Correct 6 ms 640 KB ok, no valid answer
85 Correct 6 ms 640 KB ok, correct split
86 Correct 6 ms 640 KB ok, correct split
87 Correct 5 ms 384 KB ok, no valid answer
88 Correct 4 ms 384 KB ok, no valid answer
89 Correct 6 ms 640 KB ok, no valid answer
90 Correct 7 ms 640 KB ok, no valid answer
91 Correct 6 ms 640 KB ok, no valid answer
92 Correct 7 ms 640 KB ok, no valid answer
93 Correct 7 ms 640 KB ok, no valid answer
94 Correct 122 ms 11128 KB ok, correct split
95 Correct 144 ms 13328 KB ok, correct split
96 Correct 123 ms 12536 KB ok, correct split
97 Correct 36 ms 4480 KB ok, correct split
98 Correct 38 ms 4600 KB ok, correct split
99 Correct 52 ms 5368 KB ok, correct split
100 Correct 142 ms 13280 KB ok, correct split
101 Correct 132 ms 12536 KB ok, correct split
102 Correct 132 ms 12532 KB ok, correct split
103 Correct 113 ms 12404 KB ok, correct split
104 Correct 120 ms 13816 KB ok, correct split
105 Correct 55 ms 6648 KB ok, correct split
106 Correct 105 ms 13552 KB ok, correct split
107 Correct 97 ms 10616 KB ok, correct split
108 Correct 112 ms 10616 KB ok, correct split
109 Correct 149 ms 13048 KB ok, correct split
110 Correct 152 ms 13428 KB ok, correct split
111 Correct 145 ms 13492 KB ok, correct split
112 Correct 138 ms 13428 KB ok, correct split
113 Correct 152 ms 13432 KB ok, correct split
114 Correct 16 ms 1664 KB ok, correct split
115 Correct 15 ms 1664 KB ok, correct split
116 Correct 130 ms 13556 KB ok, correct split
117 Correct 135 ms 13300 KB ok, correct split
118 Correct 126 ms 10616 KB ok, correct split
119 Correct 156 ms 10616 KB ok, correct split
120 Correct 121 ms 13688 KB ok, correct split
121 Correct 90 ms 10616 KB ok, no valid answer
122 Correct 83 ms 10744 KB ok, no valid answer
123 Correct 142 ms 13304 KB ok, no valid answer
124 Correct 132 ms 13304 KB ok, no valid answer
125 Correct 89 ms 11632 KB ok, no valid answer
126 Correct 62 ms 9840 KB ok, no valid answer
127 Correct 106 ms 12164 KB ok, no valid answer