oj.uz

Submission #422758

# Submission time Handle Problem Language Result Execution time Memory
422758 2021-06-10T11:51:44 Z oleh1421 Split the Attractions (IOI19_split) C++17
100 / 100
 181 ms 30456 KB 
//#include "grader.cpp"
#include "split.h"
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N=200010;
vector<int>g[N],t[N];
pair<int,int>gr[3];
int sz[N];
int P[N];
bool used[N];
int timer=0;
int tin[N],fup[N];
void dfs(int v,int pr){
    sz[v]=1;
    tin[v]=fup[v]=++timer;
    P[v]=pr;
    used[v]=true;
    for (int to:g[v]){
        if (!used[to]){
            t[v].push_back(to);
            t[to].push_back(v);
            dfs(to,v);
            sz[v]+=sz[to];
            fup[v]=min(fup[v],fup[to]);
        } else if (to!=pr) fup[v]=min(fup[v],tin[to]);
    }
}
int ans[N];
bool allowed[N];
void Mark(int v,int ind){
    if (!gr[ind].first) return;
    gr[ind].first--;
    ans[v]=gr[ind].second;
//    if (!ind) cout<<"OK "<<v<<" "<<gr[ind].first<<" "<<gr[ind].second<<endl;
    for (int to:t[v]){
        if (ans[to]) continue;
        Mark(to,ind);
    }
}
void dfs1(int v,int pr){
    allowed[v]=true;
    for (int to:t[v]){
        if (to!=pr){
            dfs1(to,v);
        }
    }
}
void Mark1(int v,int ind){
    if (!gr[ind].first) return;
    gr[ind].first--;
    ans[v]=gr[ind].second;
//    if (!ind) cout<<"OK "<<v<<" "<<gr[ind].first<<" "<<gr[ind].second<<endl;
    for (int to:g[v]){
        if (ans[to] || !allowed[to]) continue;
        Mark1(to,ind);
    }
}
bool DONE=false;
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
    gr[0]={a,1};
    gr[1]={b,2};
    gr[2]={c,3};
    sort(gr,gr+3);
	for (int i=0;i<p.size();i++){
        g[p[i]].push_back(q[i]);
        g[q[i]].push_back(p[i]);
	}
    dfs(0,-1);
    for (int i=0;i<n;i++) allowed[i]=true;
    for (int i=0;i<n;i++){
        if (sz[i]>=gr[0].first && sz[i]<=n-gr[0].first){
            if (sz[i]<=n-gr[1].first){
                ans[P[i]]=gr[1].second;
                ans[i]=gr[0].second;
                Mark(P[i],1);
                Mark(i,0);
            } else {
                ans[P[i]]=gr[0].first;
                ans[i]=gr[1].first;
                Mark(P[i],0);
                Mark(i,1);
            }
            DONE=true;
            break;
        }
    }
    if (!DONE){
        int V=-1;
        for (int i=0;i<n;i++){
            if (sz[i]<=n-gr[0].first) continue;
            if (V==-1 || sz[i]<sz[V]) V=i;
    //        if (sz[i]>=gr[0].first && sz[i]<=n-gr[0].first){
    //            if (sz[i]<=n-gr[1].first){
    //                ans[P[i]]=gr[1].second;
    //                ans[i]=gr[0].second;
    //                Mark(P[i],1);
    //                Mark(i,0);
    //            } else {
    //                ans[P[i]]=gr[0].first;
    //                ans[i]=gr[1].first;
    //                Mark(P[i],0);
    //                Mark(i,1);
    //            }
    //            DONE=true;
    //            break;
    //        }
        }
        for (int i=0;i<n;i++) allowed[i]=false;
        int cur=n-sz[V];
        vector<int>u;
        for (int to:t[V]){
            if (to==P[V]) continue;
            if (fup[to]<tin[V]){
                cur+=sz[to];
                u.push_back(to);
                if (cur>=gr[0].first){
                    for (int i:u){
                        dfs1(i,V);
                    }
                    dfs1(P[V],V);
                    Mark1(P[V],0);
                    for (int i=0;i<n;i++) allowed[i]^=1;
                    Mark1(V,1);
                    if (gr[0].first){

                        while (true){
                            gr[0].first++;
                        }
                    }
                    DONE=true;
                    break;
                }
            }
        }
    }
//    x<=a
//    n-x
//        dfs1(0,-1);
    if (DONE){
        for (int i=0;i<n;i++){
            if (!ans[i]) ans[i]=gr[2].second;
        }
    }

	vector<int>res;
	for (int i=0;i<n;i++) res.push_back(ans[i]);
	return res;
}
/**
9 9 3 3 3
0 1
0 2
2 3
2 4
2 5
2 6
2 7
2 8
8 0

9 10
4 2 3
0 1
0 2
0 3
0 4
0 6
0 8
1 7
3 7
4 5
5 6


*/

Compilation message

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

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9636 KB ok, correct split
2 Correct 6 ms 9676 KB ok, correct split
3 Correct 6 ms 9676 KB ok, correct split
4 Correct 6 ms 9676 KB ok, correct split
5 Correct 6 ms 9616 KB ok, correct split
6 Correct 6 ms 9676 KB ok, correct split
7 Correct 152 ms 29248 KB ok, correct split
8 Correct 110 ms 26480 KB ok, correct split
9 Correct 113 ms 25576 KB ok, correct split
10 Correct 121 ms 29632 KB ok, correct split
11 Correct 123 ms 29680 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9676 KB ok, correct split
2 Correct 6 ms 9676 KB ok, correct split
3 Correct 6 ms 9676 KB ok, correct split
4 Correct 137 ms 25652 KB ok, correct split
5 Correct 113 ms 20536 KB ok, correct split
6 Correct 115 ms 29672 KB ok, correct split
7 Correct 151 ms 26280 KB ok, correct split
8 Correct 162 ms 22376 KB ok, correct split
9 Correct 109 ms 20404 KB ok, correct split
10 Correct 83 ms 21180 KB ok, correct split
11 Correct 103 ms 21236 KB ok, correct split
12 Correct 80 ms 21188 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9724 KB ok, correct split
2 Correct 130 ms 20484 KB ok, correct split
3 Correct 39 ms 14276 KB ok, correct split
4 Correct 6 ms 9676 KB ok, correct split
5 Correct 111 ms 23400 KB ok, correct split
6 Correct 159 ms 23108 KB ok, correct split
7 Correct 118 ms 22876 KB ok, correct split
8 Correct 124 ms 24544 KB ok, correct split
9 Correct 112 ms 22628 KB ok, correct split
10 Correct 32 ms 13388 KB ok, no valid answer
11 Correct 46 ms 14920 KB ok, no valid answer
12 Correct 92 ms 20484 KB ok, no valid answer
13 Correct 108 ms 20168 KB ok, no valid answer
14 Correct 109 ms 20840 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9644 KB ok, correct split
2 Correct 6 ms 9676 KB ok, no valid answer
3 Correct 6 ms 9676 KB ok, correct split
4 Correct 6 ms 9612 KB ok, correct split
5 Correct 6 ms 9676 KB ok, correct split
6 Correct 6 ms 9676 KB ok, correct split
7 Correct 6 ms 9676 KB ok, correct split
8 Correct 6 ms 9676 KB ok, correct split
9 Correct 9 ms 10064 KB ok, correct split
10 Correct 9 ms 9932 KB ok, correct split
11 Correct 6 ms 9676 KB ok, correct split
12 Correct 8 ms 10060 KB ok, correct split
13 Correct 7 ms 9676 KB ok, correct split
14 Correct 6 ms 9676 KB ok, correct split
15 Correct 6 ms 9676 KB ok, correct split
16 Correct 6 ms 9676 KB ok, correct split
17 Correct 6 ms 9676 KB ok, correct split
18 Correct 8 ms 9676 KB ok, correct split
19 Correct 6 ms 9676 KB ok, correct split
20 Correct 7 ms 9804 KB ok, correct split
21 Correct 9 ms 10060 KB ok, correct split
22 Correct 7 ms 9932 KB ok, correct split
23 Correct 8 ms 10060 KB ok, correct split
24 Correct 8 ms 10024 KB ok, correct split
25 Correct 8 ms 10060 KB ok, correct split
26 Correct 8 ms 9976 KB ok, correct split
27 Correct 10 ms 9992 KB ok, correct split
28 Correct 8 ms 9932 KB ok, correct split
29 Correct 6 ms 9676 KB ok, correct split
30 Correct 8 ms 10060 KB ok, correct split
31 Correct 7 ms 9676 KB ok, correct split
32 Correct 6 ms 9732 KB ok, correct split
33 Correct 6 ms 9676 KB ok, correct split
34 Correct 8 ms 9964 KB ok, correct split
35 Correct 8 ms 9932 KB ok, correct split
36 Correct 8 ms 9868 KB ok, correct split
37 Correct 8 ms 9932 KB ok, correct split
38 Correct 9 ms 10060 KB ok, correct split
39 Correct 9 ms 9932 KB ok, correct split
40 Correct 8 ms 9932 KB ok, correct split
41 Correct 7 ms 9804 KB ok, correct split
42 Correct 7 ms 9804 KB ok, correct split
43 Correct 10 ms 9932 KB ok, correct split
44 Correct 8 ms 9932 KB ok, correct split
45 Correct 8 ms 9932 KB ok, correct split
46 Correct 8 ms 10060 KB ok, correct split
47 Correct 8 ms 10060 KB ok, no valid answer
48 Correct 8 ms 9932 KB ok, correct split
49 Correct 8 ms 10088 KB ok, correct split
50 Correct 6 ms 9676 KB ok, no valid answer
51 Correct 6 ms 9692 KB ok, no valid answer
52 Correct 8 ms 9932 KB ok, no valid answer
53 Correct 9 ms 10060 KB ok, no valid answer
54 Correct 9 ms 9932 KB ok, no valid answer
55 Correct 8 ms 9964 KB ok, no valid answer
56 Correct 7 ms 9996 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9636 KB ok, correct split
2 Correct 6 ms 9676 KB ok, correct split
3 Correct 6 ms 9676 KB ok, correct split
4 Correct 6 ms 9676 KB ok, correct split
5 Correct 6 ms 9616 KB ok, correct split
6 Correct 6 ms 9676 KB ok, correct split
7 Correct 152 ms 29248 KB ok, correct split
8 Correct 110 ms 26480 KB ok, correct split
9 Correct 113 ms 25576 KB ok, correct split
10 Correct 121 ms 29632 KB ok, correct split
11 Correct 123 ms 29680 KB ok, correct split
12 Correct 6 ms 9676 KB ok, correct split
13 Correct 6 ms 9676 KB ok, correct split
14 Correct 6 ms 9676 KB ok, correct split
15 Correct 137 ms 25652 KB ok, correct split
16 Correct 113 ms 20536 KB ok, correct split
17 Correct 115 ms 29672 KB ok, correct split
18 Correct 151 ms 26280 KB ok, correct split
19 Correct 162 ms 22376 KB ok, correct split
20 Correct 109 ms 20404 KB ok, correct split
21 Correct 83 ms 21180 KB ok, correct split
22 Correct 103 ms 21236 KB ok, correct split
23 Correct 80 ms 21188 KB ok, correct split
24 Correct 7 ms 9724 KB ok, correct split
25 Correct 130 ms 20484 KB ok, correct split
26 Correct 39 ms 14276 KB ok, correct split
27 Correct 6 ms 9676 KB ok, correct split
28 Correct 111 ms 23400 KB ok, correct split
29 Correct 159 ms 23108 KB ok, correct split
30 Correct 118 ms 22876 KB ok, correct split
31 Correct 124 ms 24544 KB ok, correct split
32 Correct 112 ms 22628 KB ok, correct split
33 Correct 32 ms 13388 KB ok, no valid answer
34 Correct 46 ms 14920 KB ok, no valid answer
35 Correct 92 ms 20484 KB ok, no valid answer
36 Correct 108 ms 20168 KB ok, no valid answer
37 Correct 109 ms 20840 KB ok, no valid answer
38 Correct 6 ms 9644 KB ok, correct split
39 Correct 6 ms 9676 KB ok, no valid answer
40 Correct 6 ms 9676 KB ok, correct split
41 Correct 6 ms 9612 KB ok, correct split
42 Correct 6 ms 9676 KB ok, correct split
43 Correct 6 ms 9676 KB ok, correct split
44 Correct 6 ms 9676 KB ok, correct split
45 Correct 6 ms 9676 KB ok, correct split
46 Correct 9 ms 10064 KB ok, correct split
47 Correct 9 ms 9932 KB ok, correct split
48 Correct 6 ms 9676 KB ok, correct split
49 Correct 8 ms 10060 KB ok, correct split
50 Correct 7 ms 9676 KB ok, correct split
51 Correct 6 ms 9676 KB ok, correct split
52 Correct 6 ms 9676 KB ok, correct split
53 Correct 6 ms 9676 KB ok, correct split
54 Correct 6 ms 9676 KB ok, correct split
55 Correct 8 ms 9676 KB ok, correct split
56 Correct 6 ms 9676 KB ok, correct split
57 Correct 7 ms 9804 KB ok, correct split
58 Correct 9 ms 10060 KB ok, correct split
59 Correct 7 ms 9932 KB ok, correct split
60 Correct 8 ms 10060 KB ok, correct split
61 Correct 8 ms 10024 KB ok, correct split
62 Correct 8 ms 10060 KB ok, correct split
63 Correct 8 ms 9976 KB ok, correct split
64 Correct 10 ms 9992 KB ok, correct split
65 Correct 8 ms 9932 KB ok, correct split
66 Correct 6 ms 9676 KB ok, correct split
67 Correct 8 ms 10060 KB ok, correct split
68 Correct 7 ms 9676 KB ok, correct split
69 Correct 6 ms 9732 KB ok, correct split
70 Correct 6 ms 9676 KB ok, correct split
71 Correct 8 ms 9964 KB ok, correct split
72 Correct 8 ms 9932 KB ok, correct split
73 Correct 8 ms 9868 KB ok, correct split
74 Correct 8 ms 9932 KB ok, correct split
75 Correct 9 ms 10060 KB ok, correct split
76 Correct 9 ms 9932 KB ok, correct split
77 Correct 8 ms 9932 KB ok, correct split
78 Correct 7 ms 9804 KB ok, correct split
79 Correct 7 ms 9804 KB ok, correct split
80 Correct 10 ms 9932 KB ok, correct split
81 Correct 8 ms 9932 KB ok, correct split
82 Correct 8 ms 9932 KB ok, correct split
83 Correct 8 ms 10060 KB ok, correct split
84 Correct 8 ms 10060 KB ok, no valid answer
85 Correct 8 ms 9932 KB ok, correct split
86 Correct 8 ms 10088 KB ok, correct split
87 Correct 6 ms 9676 KB ok, no valid answer
88 Correct 6 ms 9692 KB ok, no valid answer
89 Correct 8 ms 9932 KB ok, no valid answer
90 Correct 9 ms 10060 KB ok, no valid answer
91 Correct 9 ms 9932 KB ok, no valid answer
92 Correct 8 ms 9964 KB ok, no valid answer
93 Correct 7 ms 9996 KB ok, no valid answer
94 Correct 129 ms 24876 KB ok, correct split
95 Correct 181 ms 30456 KB ok, correct split
96 Correct 160 ms 28684 KB ok, correct split
97 Correct 39 ms 14532 KB ok, correct split
98 Correct 40 ms 14724 KB ok, correct split
99 Correct 70 ms 16828 KB ok, correct split
100 Correct 160 ms 25284 KB ok, correct split
101 Correct 140 ms 24184 KB ok, correct split
102 Correct 159 ms 23868 KB ok, correct split
103 Correct 123 ms 23716 KB ok, correct split
104 Correct 129 ms 25372 KB ok, correct split
105 Correct 74 ms 17108 KB ok, correct split
106 Correct 129 ms 25392 KB ok, correct split
107 Correct 110 ms 21720 KB ok, correct split
108 Correct 118 ms 21696 KB ok, correct split
109 Correct 174 ms 24552 KB ok, correct split
110 Correct 151 ms 24636 KB ok, correct split
111 Correct 156 ms 24804 KB ok, correct split
112 Correct 149 ms 25060 KB ok, correct split
113 Correct 149 ms 25032 KB ok, correct split
114 Correct 17 ms 11596 KB ok, correct split
115 Correct 17 ms 11384 KB ok, correct split
116 Correct 156 ms 24668 KB ok, correct split
117 Correct 136 ms 24632 KB ok, correct split
118 Correct 108 ms 21592 KB ok, correct split
119 Correct 138 ms 21620 KB ok, correct split
120 Correct 115 ms 26452 KB ok, correct split
121 Correct 103 ms 21228 KB ok, no valid answer
122 Correct 107 ms 21452 KB ok, no valid answer
123 Correct 160 ms 25032 KB ok, no valid answer
124 Correct 167 ms 24932 KB ok, no valid answer
125 Correct 104 ms 22688 KB ok, no valid answer
126 Correct 73 ms 20740 KB ok, no valid answer
127 Correct 141 ms 23128 KB ok, no valid answer