oj.uz

Submission #859988

# Submission time Handle Problem Language Result Execution time Memory
859988 2023-10-11T09:30:05 Z abcvuitunggio Split the Attractions (IOI19_split) C++17
100 / 100
 105 ms 32872 KB 
#include "split.h"
#include <bits/stdc++.h>
using namespace std;
int n,a,b,c,label[3]={1,2,3},d[100001],up[100001],sz[100001],vis[100001],node,t,f[100001],ch[100001],tin[100001],tout[100001];
vector <int> ke[100001],child[100001],del2[100001],res,ve;
vector <pair <int, int>> add[100001],del[100001];
void dfs(int u){
    tin[u]=++t;
    vis[u]=sz[u]=1;
    for (int v:ke[u])
        if (!vis[v]){
            child[u].push_back(v);
            d[v]=d[u]+1;
            up[v]=u;
            dfs(v);
            sz[u]+=sz[v];
        }
    tout[u]=t;
}
void dfs2(int u, int cur, int i){
    if (d[up[u]]<d[cur]){
        add[cur].push_back({u,i});
        del[up[u]].push_back({u,i});
        cur=up[u];
    }
    for (int v:child[u])
        dfs2(v,cur,i);
}
void dfs3(int u){
    if (ch[u])
        return;
    ve.push_back(u);
    for (int v:child[u])
        dfs3(v);
}
void update(int i, int val){
    i++;
    for (;i<=n;i+=i&(-i))
        f[i]+=val;
}
int get(int i){
    i++;
    int res=0;
    for (;i;i-=i&(-i))
        res+=f[i];
    return res;
}
bool check(int l, int r){
    vector <int> ve;
    set <pair <int, int>> s;
    set <int> s2;
    for (int i=0;i<n;i++){
        if (sz[i]>=l&&sz[i]<=r){
            node=i;
            return true;
        }
        add[i].clear();
        del[i].clear();
        del2[i].clear();
        if (sz[i]>r)
            ve.push_back(i);
    }
    memset(f,0,sizeof(f));
    memset(ch,0,sizeof(ch));
    sort(ve.begin(),ve.end(),[](int i, int j){return d[i]<d[j];});
    for (int i=0;i<ve.size();i++){
        for (int j:child[ve[i]])
            if (sz[j]<l)
                dfs2(j,ve[i],i);
        del2[up[ve[i]]].push_back(i);
    }
    s.insert({0,ve.size()});
    for (int i=ve.size()-1;i>=0;i--){
        for (auto [j,k]:del[ve[i]]){
            update(k,-sz[j]);
            s2.erase(j);
        }
        for (auto [j,k]:add[ve[i]]){
            update(k,sz[j]);
            s2.insert(j);
        }
        for (int j:del2[ve[i]])
            s.erase({-sz[ve[j]],j});
        auto it=s.lower_bound({a-sz[ve[i]],-1});
        auto [val,pos]=*it;
        if (sz[ve[i]]+val<=b){
            node=ve[i];
            if (pos<ve.size())
                ch[ve[pos]]=1;
            return true;
        }
        if (sz[ve[i]]+val-get(pos-1)<=r){
            node=ve[i];
            if (pos<ve.size())
                ch[ve[pos]]=1;
            int cnt=sz[ve[i]]+val;
            for (int j:s2){
                if (pos<ve.size()&&tin[ve[pos]]<=tin[j]&&tout[ve[pos]]>=tout[j])
                    continue;
                cnt-=sz[j];
                ch[j]=1;
                if (cnt<=r)
                    break;
            }
            return true;
        }
        s.insert({-sz[ve[i]],i});
    }
    return false;
}
vector <int> find_split(int N, int A, int B, int C, vector <int> p, vector <int> q){
	n=N,a=A,b=B,c=C;
	if (a>b){
        swap(a,b);
        swap(label[0],label[1]);
	}
	if (b>c){
        swap(b,c);
        swap(label[1],label[2]);
	}
	if (a>b){
        swap(a,b);
        swap(label[0],label[1]);
	}
	for (int i=0;i<p.size();i++){
        ke[p[i]].push_back(q[i]);
        ke[q[i]].push_back(p[i]);
	}
	dfs(0);
    for (int i=0;i<n;i++)
        for (int j:ke[i])
            if (d[j]<d[up[i]])
                up[i]=j;
    res.assign(n,0);
    if (check(b,n-a)){
        swap(a,b);
        swap(label[0],label[1]);
    }
    else if (!check(a,n-b))
        return res;
    dfs3(node);
    sort(ve.begin(),ve.end(),[](int i, int j){return d[i]<d[j];});
    for (int i=0;i<ve.size();i++)
        res[ve[i]]=label[(i>=a)*2];
    ve.clear();
    for (int i=0;i<n;i++)
        if (!res[i])
            ve.push_back(i);
    queue <int> Q;
    memset(d,0,sizeof(d));
    d[ve[0]]=1;
    Q.push(ve[0]);
    while (!Q.empty()){
        int u=Q.front();
        Q.pop();
        for (int v:ke[u])
            if (!res[v]&&!d[v]){
                d[v]=d[u]+1;
                Q.push(v);
            }
    }
    sort(ve.begin(),ve.end(),[](int i, int j){return d[i]<d[j];});
    for (int i=0;i<ve.size();i++)
        res[ve[i]]=label[(i>=b)+1];
    return res;
}

Compilation message

split.cpp: In function 'bool check(int, int)':
split.cpp:66:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |     for (int i=0;i<ve.size();i++){
      |                  ~^~~~~~~~~~
split.cpp:88:20: warning: comparison of integer expressions of different signedness: 'std::tuple_element<1, std::pair<int, int> >::type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |             if (pos<ve.size())
      |                 ~~~^~~~~~~~~~
split.cpp:94:20: warning: comparison of integer expressions of different signedness: 'std::tuple_element<1, std::pair<int, int> >::type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   94 |             if (pos<ve.size())
      |                 ~~~^~~~~~~~~~
split.cpp:98:24: warning: comparison of integer expressions of different signedness: 'std::tuple_element<1, std::pair<int, int> >::type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |                 if (pos<ve.size()&&tin[ve[pos]]<=tin[j]&&tout[ve[pos]]>=tout[j])
      |                     ~~~^~~~~~~~~~
split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:125:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  125 |  for (int i=0;i<p.size();i++){
      |               ~^~~~~~~~~
split.cpp:143:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  143 |     for (int i=0;i<ve.size();i++)
      |                  ~^~~~~~~~~~
split.cpp:163:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  163 |     for (int i=0;i<ve.size();i++)
      |                  ~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 13148 KB ok, correct split
2 Correct 3 ms 13148 KB ok, correct split
3 Correct 3 ms 13148 KB ok, correct split
4 Correct 3 ms 13228 KB ok, correct split
5 Correct 2 ms 13148 KB ok, correct split
6 Correct 3 ms 13148 KB ok, correct split
7 Correct 74 ms 32264 KB ok, correct split
8 Correct 65 ms 29692 KB ok, correct split
9 Correct 77 ms 28620 KB ok, correct split
10 Correct 66 ms 32868 KB ok, correct split
11 Correct 69 ms 32640 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 13148 KB ok, correct split
2 Correct 2 ms 13148 KB ok, correct split
3 Correct 2 ms 13148 KB ok, correct split
4 Correct 105 ms 27776 KB ok, correct split
5 Correct 52 ms 22220 KB ok, correct split
6 Correct 68 ms 32872 KB ok, correct split
7 Correct 82 ms 29352 KB ok, correct split
8 Correct 77 ms 25020 KB ok, correct split
9 Correct 55 ms 23764 KB ok, correct split
10 Correct 43 ms 22232 KB ok, correct split
11 Correct 40 ms 21204 KB ok, correct split
12 Correct 39 ms 21300 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 13148 KB ok, correct split
2 Correct 53 ms 22016 KB ok, correct split
3 Correct 26 ms 16856 KB ok, correct split
4 Correct 3 ms 13916 KB ok, correct split
5 Correct 88 ms 27420 KB ok, correct split
6 Correct 79 ms 27084 KB ok, correct split
7 Correct 71 ms 25920 KB ok, correct split
8 Correct 74 ms 28972 KB ok, correct split
9 Correct 61 ms 26080 KB ok, correct split
10 Correct 17 ms 16472 KB ok, no valid answer
11 Correct 25 ms 18012 KB ok, no valid answer
12 Correct 45 ms 21704 KB ok, no valid answer
13 Correct 72 ms 22356 KB ok, no valid answer
14 Correct 49 ms 21632 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 13148 KB ok, correct split
2 Correct 3 ms 13668 KB ok, no valid answer
3 Correct 3 ms 13148 KB ok, correct split
4 Correct 3 ms 13148 KB ok, correct split
5 Correct 3 ms 13144 KB ok, correct split
6 Correct 3 ms 13248 KB ok, correct split
7 Correct 3 ms 13148 KB ok, correct split
8 Correct 3 ms 13240 KB ok, correct split
9 Correct 6 ms 13660 KB ok, correct split
10 Correct 4 ms 13400 KB ok, correct split
11 Correct 3 ms 13144 KB ok, correct split
12 Correct 4 ms 13404 KB ok, correct split
13 Correct 2 ms 13148 KB ok, correct split
14 Correct 3 ms 13144 KB ok, correct split
15 Correct 3 ms 13144 KB ok, correct split
16 Correct 3 ms 13148 KB ok, correct split
17 Correct 3 ms 13148 KB ok, correct split
18 Correct 3 ms 13148 KB ok, correct split
19 Correct 4 ms 13144 KB ok, correct split
20 Correct 3 ms 13240 KB ok, correct split
21 Correct 5 ms 14428 KB ok, correct split
22 Correct 5 ms 13404 KB ok, correct split
23 Correct 4 ms 13660 KB ok, correct split
24 Correct 5 ms 14252 KB ok, correct split
25 Correct 4 ms 14680 KB ok, correct split
26 Correct 4 ms 14428 KB ok, correct split
27 Correct 5 ms 14424 KB ok, correct split
28 Correct 4 ms 14428 KB ok, correct split
29 Correct 3 ms 13916 KB ok, correct split
30 Correct 5 ms 13336 KB ok, correct split
31 Correct 4 ms 13148 KB ok, correct split
32 Correct 3 ms 13148 KB ok, correct split
33 Correct 4 ms 13148 KB ok, correct split
34 Correct 4 ms 14264 KB ok, correct split
35 Correct 4 ms 14172 KB ok, correct split
36 Correct 5 ms 14272 KB ok, correct split
37 Correct 4 ms 14424 KB ok, correct split
38 Correct 4 ms 14428 KB ok, correct split
39 Correct 5 ms 14172 KB ok, correct split
40 Correct 4 ms 13400 KB ok, correct split
41 Correct 3 ms 13400 KB ok, correct split
42 Correct 4 ms 13404 KB ok, correct split
43 Correct 5 ms 14272 KB ok, correct split
44 Correct 4 ms 13664 KB ok, correct split
45 Correct 4 ms 14424 KB ok, correct split
46 Correct 5 ms 13660 KB ok, correct split
47 Correct 4 ms 13916 KB ok, no valid answer
48 Correct 4 ms 14172 KB ok, correct split
49 Correct 4 ms 13912 KB ok, correct split
50 Correct 3 ms 13660 KB ok, no valid answer
51 Correct 3 ms 13672 KB ok, no valid answer
52 Correct 7 ms 13928 KB ok, no valid answer
53 Correct 5 ms 14184 KB ok, no valid answer
54 Correct 4 ms 13928 KB ok, no valid answer
55 Correct 4 ms 13928 KB ok, no valid answer
56 Correct 4 ms 13928 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 13148 KB ok, correct split
2 Correct 3 ms 13148 KB ok, correct split
3 Correct 3 ms 13148 KB ok, correct split
4 Correct 3 ms 13228 KB ok, correct split
5 Correct 2 ms 13148 KB ok, correct split
6 Correct 3 ms 13148 KB ok, correct split
7 Correct 74 ms 32264 KB ok, correct split
8 Correct 65 ms 29692 KB ok, correct split
9 Correct 77 ms 28620 KB ok, correct split
10 Correct 66 ms 32868 KB ok, correct split
11 Correct 69 ms 32640 KB ok, correct split
12 Correct 2 ms 13148 KB ok, correct split
13 Correct 2 ms 13148 KB ok, correct split
14 Correct 2 ms 13148 KB ok, correct split
15 Correct 105 ms 27776 KB ok, correct split
16 Correct 52 ms 22220 KB ok, correct split
17 Correct 68 ms 32872 KB ok, correct split
18 Correct 82 ms 29352 KB ok, correct split
19 Correct 77 ms 25020 KB ok, correct split
20 Correct 55 ms 23764 KB ok, correct split
21 Correct 43 ms 22232 KB ok, correct split
22 Correct 40 ms 21204 KB ok, correct split
23 Correct 39 ms 21300 KB ok, correct split
24 Correct 3 ms 13148 KB ok, correct split
25 Correct 53 ms 22016 KB ok, correct split
26 Correct 26 ms 16856 KB ok, correct split
27 Correct 3 ms 13916 KB ok, correct split
28 Correct 88 ms 27420 KB ok, correct split
29 Correct 79 ms 27084 KB ok, correct split
30 Correct 71 ms 25920 KB ok, correct split
31 Correct 74 ms 28972 KB ok, correct split
32 Correct 61 ms 26080 KB ok, correct split
33 Correct 17 ms 16472 KB ok, no valid answer
34 Correct 25 ms 18012 KB ok, no valid answer
35 Correct 45 ms 21704 KB ok, no valid answer
36 Correct 72 ms 22356 KB ok, no valid answer
37 Correct 49 ms 21632 KB ok, no valid answer
38 Correct 3 ms 13148 KB ok, correct split
39 Correct 3 ms 13668 KB ok, no valid answer
40 Correct 3 ms 13148 KB ok, correct split
41 Correct 3 ms 13148 KB ok, correct split
42 Correct 3 ms 13144 KB ok, correct split
43 Correct 3 ms 13248 KB ok, correct split
44 Correct 3 ms 13148 KB ok, correct split
45 Correct 3 ms 13240 KB ok, correct split
46 Correct 6 ms 13660 KB ok, correct split
47 Correct 4 ms 13400 KB ok, correct split
48 Correct 3 ms 13144 KB ok, correct split
49 Correct 4 ms 13404 KB ok, correct split
50 Correct 2 ms 13148 KB ok, correct split
51 Correct 3 ms 13144 KB ok, correct split
52 Correct 3 ms 13144 KB ok, correct split
53 Correct 3 ms 13148 KB ok, correct split
54 Correct 3 ms 13148 KB ok, correct split
55 Correct 3 ms 13148 KB ok, correct split
56 Correct 4 ms 13144 KB ok, correct split
57 Correct 3 ms 13240 KB ok, correct split
58 Correct 5 ms 14428 KB ok, correct split
59 Correct 5 ms 13404 KB ok, correct split
60 Correct 4 ms 13660 KB ok, correct split
61 Correct 5 ms 14252 KB ok, correct split
62 Correct 4 ms 14680 KB ok, correct split
63 Correct 4 ms 14428 KB ok, correct split
64 Correct 5 ms 14424 KB ok, correct split
65 Correct 4 ms 14428 KB ok, correct split
66 Correct 3 ms 13916 KB ok, correct split
67 Correct 5 ms 13336 KB ok, correct split
68 Correct 4 ms 13148 KB ok, correct split
69 Correct 3 ms 13148 KB ok, correct split
70 Correct 4 ms 13148 KB ok, correct split
71 Correct 4 ms 14264 KB ok, correct split
72 Correct 4 ms 14172 KB ok, correct split
73 Correct 5 ms 14272 KB ok, correct split
74 Correct 4 ms 14424 KB ok, correct split
75 Correct 4 ms 14428 KB ok, correct split
76 Correct 5 ms 14172 KB ok, correct split
77 Correct 4 ms 13400 KB ok, correct split
78 Correct 3 ms 13400 KB ok, correct split
79 Correct 4 ms 13404 KB ok, correct split
80 Correct 5 ms 14272 KB ok, correct split
81 Correct 4 ms 13664 KB ok, correct split
82 Correct 4 ms 14424 KB ok, correct split
83 Correct 5 ms 13660 KB ok, correct split
84 Correct 4 ms 13916 KB ok, no valid answer
85 Correct 4 ms 14172 KB ok, correct split
86 Correct 4 ms 13912 KB ok, correct split
87 Correct 3 ms 13660 KB ok, no valid answer
88 Correct 3 ms 13672 KB ok, no valid answer
89 Correct 7 ms 13928 KB ok, no valid answer
90 Correct 5 ms 14184 KB ok, no valid answer
91 Correct 4 ms 13928 KB ok, no valid answer
92 Correct 4 ms 13928 KB ok, no valid answer
93 Correct 4 ms 13928 KB ok, no valid answer
94 Correct 63 ms 26840 KB ok, correct split
95 Correct 98 ms 32740 KB ok, correct split
96 Correct 92 ms 30944 KB ok, correct split
97 Correct 22 ms 17408 KB ok, correct split
98 Correct 25 ms 17628 KB ok, correct split
99 Correct 33 ms 20048 KB ok, correct split
100 Correct 85 ms 27656 KB ok, correct split
101 Correct 85 ms 26320 KB ok, correct split
102 Correct 68 ms 26704 KB ok, correct split
103 Correct 70 ms 26444 KB ok, correct split
104 Correct 60 ms 25632 KB ok, correct split
105 Correct 40 ms 20504 KB ok, correct split
106 Correct 86 ms 31420 KB ok, correct split
107 Correct 55 ms 24012 KB ok, correct split
108 Correct 62 ms 23864 KB ok, correct split
109 Correct 89 ms 27856 KB ok, correct split
110 Correct 78 ms 28508 KB ok, correct split
111 Correct 80 ms 28620 KB ok, correct split
112 Correct 82 ms 27360 KB ok, correct split
113 Correct 75 ms 27268 KB ok, correct split
114 Correct 10 ms 14940 KB ok, correct split
115 Correct 9 ms 14684 KB ok, correct split
116 Correct 91 ms 28552 KB ok, correct split
117 Correct 78 ms 28508 KB ok, correct split
118 Correct 54 ms 24784 KB ok, correct split
119 Correct 70 ms 25660 KB ok, correct split
120 Correct 60 ms 29644 KB ok, correct split
121 Correct 70 ms 23736 KB ok, no valid answer
122 Correct 50 ms 23384 KB ok, no valid answer
123 Correct 80 ms 28244 KB ok, no valid answer
124 Correct 87 ms 28004 KB ok, no valid answer
125 Correct 53 ms 24264 KB ok, no valid answer
126 Correct 38 ms 21848 KB ok, no valid answer
127 Correct 57 ms 25472 KB ok, no valid answer