oj.uz

Submission #880520

# Submission time Handle Problem Language Result Execution time Memory
880520 2023-11-29T15:12:27 Z andrei_boaca Split the Attractions (IOI19_split) C++17
100 / 100
 102 ms 28448 KB 
#include "split.h"
#include <bits/stdc++.h>
//#include "grader.cpp"
//#pragma GCC optimize ("Ofast")
//#pragma GCC optimize ("fast-math")
//#pragma GCC optimize ("unroll-loops")
using namespace std;
typedef pair<int,int> pii;
mt19937 rng(chrono::steady_clock().now().time_since_epoch().count());
int n,m;
int take[5],ord[5];
vector<int> sol;
bool byval(int a,int b)
{
    return take[a]<take[b];
}
vector<int> kids[100005],edges[100005];
vector<int> dsu[100005];
bool rebel[100005];
int comp[100005];
vector<pii> g;
vector<int> linie;
int par[100005];
bool use[100005];
vector<int> nodes;
int nr[100005];
int niv[100005],nivmin[100005];
int part[100005];
void dfs(int nod)
{
    nr[nod]=1;
    use[nod]=1;
    nivmin[nod]=niv[nod];
    for(int i:edges[nod])
    {
        if(i==par[nod])
            continue;
        if(!use[i])
        {
            niv[i]=niv[nod]+1;
            par[i]=nod;
            dfs(i);
            kids[nod].push_back(i);
            nr[nod]+=nr[i];
            nivmin[nod]=min(nivmin[nod],nivmin[i]);
        }
        else
            nivmin[nod]=min(nivmin[nod],niv[i]);
    }
}
bool valid(int nod)
{
    if(nr[nod]<take[ord[1]])
        return 0;
    for(int i:kids[nod])
        if(nr[i]>=take[ord[1]])
            return 0;
    return 1;
}
bool good(int lg1,int lg2)
{
    return min(lg1,lg2)>=take[ord[1]]&&max(lg1,lg2)>=take[ord[2]];
}
void put(int nod,int x)
{
    part[nod]=x;
    for(int i:kids[nod])
        if(part[i]==0)
            put(i,x);
}
void build(int nod,int x)
{
    nodes.push_back(nod);
    use[nod]=1;
    for(int i:edges[nod])
        if(part[i]==x&&!use[i])
            build(i,x);
}
void go(int nod,int x)
{
    part[nod]=x;
    for(int i:edges[nod])
        if(part[i]==0)
            go(i,x);
}
vector<int> find_split(int N, int A, int B, int C, vector<int> p, vector<int> q)
{
    n=N;
    take[1]=A;
    take[2]=B;
    take[3]=C;
    ord[1]=1;
    ord[2]=2;
    ord[3]=3;
    sort(ord+1,ord+4,byval);
    sol.resize(n);
    m=p.size();
    for(int i=0;i<n;i++)
    {
        par[i]=-1;
        comp[i]=i+1;
    }
    for(int i=0;i<p.size();i++)
    {
        int a,b;
        a=p[i];
        b=q[i];
        edges[a].push_back(b);
        edges[b].push_back(a);
    }
    niv[0]=1;
    dfs(0);
    for(int v=0;v<n;v++)
        if(valid(v))
        {
            vector<int> rebeli;
            int lg1=nr[v],lg2=n-nr[v];
            for(int i=0;i<kids[v].size();i++)
            {
                int u=kids[v][i];
                rebel[u]=0;
                if(nivmin[u]<niv[v]&&lg1-nr[u]>=take[ord[1]])
                {
                    lg1-=nr[u];
                    rebeli.push_back(u);
                    rebel[u]=1;
                    lg2+=nr[u];
                }
            }
            if(good(lg1,lg2))
            {
                for(int i=0;i<n;i++)
                    use[i]=0;
                part[v]=1;
                for(int i:kids[v])
                    if(!rebel[i])
                        put(i,1);
                int z=0;
                for(int i=0;i<n;i++)
                    if(part[i]==0)
                    {
                        z=i;
                        break;
                    }
                int c1=ord[1];
                int c2=ord[2];
                if(lg1>lg2)
                {
                    swap(c1,c2);
                }
                go(z,2);
                nodes.clear();
                build(v,1);
                for(int i=0;i<take[c1];i++)
                    sol[nodes[i]]=c1;
                nodes.clear();
                int r=-1;
                for(int i=0;i<n;i++)
                    if(part[i]==2)
                        {
                            r=i;
                            break;
                        }
                build(r,2);
                for(int i=0;i<take[c2];i++)
                    sol[nodes[i]]=c2;
                for(int i=0;i<n;i++)
                    if(sol[i]==0)
                        sol[i]=ord[3];
                return sol;
            }
        }
    return sol;
}

Compilation message

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

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9816 KB ok, correct split
2 Correct 3 ms 9820 KB ok, correct split
3 Correct 2 ms 9820 KB ok, correct split
4 Correct 2 ms 9828 KB ok, correct split
5 Correct 2 ms 9820 KB ok, correct split
6 Correct 2 ms 9820 KB ok, correct split
7 Correct 74 ms 27848 KB ok, correct split
8 Correct 62 ms 25288 KB ok, correct split
9 Correct 83 ms 24524 KB ok, correct split
10 Correct 64 ms 28448 KB ok, correct split
11 Correct 102 ms 28180 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9820 KB ok, correct split
2 Correct 2 ms 9820 KB ok, correct split
3 Correct 2 ms 9820 KB ok, correct split
4 Correct 71 ms 23500 KB ok, correct split
5 Correct 54 ms 17632 KB ok, correct split
6 Correct 76 ms 28380 KB ok, correct split
7 Correct 68 ms 25032 KB ok, correct split
8 Correct 83 ms 20344 KB ok, correct split
9 Correct 55 ms 19060 KB ok, correct split
10 Correct 37 ms 16592 KB ok, correct split
11 Correct 37 ms 16600 KB ok, correct split
12 Correct 40 ms 16596 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9820 KB ok, correct split
2 Correct 66 ms 17664 KB ok, correct split
3 Correct 21 ms 13528 KB ok, correct split
4 Correct 2 ms 9816 KB ok, correct split
5 Correct 58 ms 23256 KB ok, correct split
6 Correct 66 ms 22984 KB ok, correct split
7 Correct 61 ms 22732 KB ok, correct split
8 Correct 59 ms 24268 KB ok, correct split
9 Correct 56 ms 22408 KB ok, correct split
10 Correct 17 ms 12636 KB ok, no valid answer
11 Correct 24 ms 13916 KB ok, no valid answer
12 Correct 39 ms 17424 KB ok, no valid answer
13 Correct 43 ms 18012 KB ok, no valid answer
14 Correct 34 ms 17412 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9820 KB ok, correct split
2 Correct 2 ms 9820 KB ok, no valid answer
3 Correct 2 ms 9820 KB ok, correct split
4 Correct 2 ms 9820 KB ok, correct split
5 Correct 2 ms 9820 KB ok, correct split
6 Correct 3 ms 9816 KB ok, correct split
7 Correct 3 ms 9820 KB ok, correct split
8 Correct 3 ms 9816 KB ok, correct split
9 Correct 4 ms 10076 KB ok, correct split
10 Correct 4 ms 10076 KB ok, correct split
11 Correct 2 ms 9820 KB ok, correct split
12 Correct 5 ms 10076 KB ok, correct split
13 Correct 2 ms 9820 KB ok, correct split
14 Correct 2 ms 9820 KB ok, correct split
15 Correct 2 ms 9820 KB ok, correct split
16 Correct 2 ms 9820 KB ok, correct split
17 Correct 2 ms 9820 KB ok, correct split
18 Correct 2 ms 9820 KB ok, correct split
19 Correct 2 ms 9820 KB ok, correct split
20 Correct 3 ms 10072 KB ok, correct split
21 Correct 3 ms 10076 KB ok, correct split
22 Correct 3 ms 10076 KB ok, correct split
23 Correct 3 ms 10100 KB ok, correct split
24 Correct 3 ms 10076 KB ok, correct split
25 Correct 3 ms 10168 KB ok, correct split
26 Correct 3 ms 10076 KB ok, correct split
27 Correct 4 ms 10136 KB ok, correct split
28 Correct 3 ms 10076 KB ok, correct split
29 Correct 3 ms 9820 KB ok, correct split
30 Correct 4 ms 10076 KB ok, correct split
31 Correct 2 ms 9820 KB ok, correct split
32 Correct 3 ms 9820 KB ok, correct split
33 Correct 2 ms 9820 KB ok, correct split
34 Correct 4 ms 10072 KB ok, correct split
35 Correct 3 ms 10076 KB ok, correct split
36 Correct 3 ms 10072 KB ok, correct split
37 Correct 4 ms 10072 KB ok, correct split
38 Correct 5 ms 10072 KB ok, correct split
39 Correct 4 ms 10076 KB ok, correct split
40 Correct 4 ms 10076 KB ok, correct split
41 Correct 4 ms 9820 KB ok, correct split
42 Correct 3 ms 9820 KB ok, correct split
43 Correct 5 ms 10076 KB ok, correct split
44 Correct 5 ms 10136 KB ok, correct split
45 Correct 4 ms 10076 KB ok, correct split
46 Correct 3 ms 10076 KB ok, correct split
47 Correct 3 ms 10104 KB ok, no valid answer
48 Correct 3 ms 10076 KB ok, correct split
49 Correct 3 ms 10076 KB ok, correct split
50 Correct 3 ms 9820 KB ok, no valid answer
51 Correct 2 ms 9816 KB ok, no valid answer
52 Correct 3 ms 9872 KB ok, no valid answer
53 Correct 4 ms 10076 KB ok, no valid answer
54 Correct 3 ms 9820 KB ok, no valid answer
55 Correct 3 ms 10076 KB ok, no valid answer
56 Correct 4 ms 10076 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9816 KB ok, correct split
2 Correct 3 ms 9820 KB ok, correct split
3 Correct 2 ms 9820 KB ok, correct split
4 Correct 2 ms 9828 KB ok, correct split
5 Correct 2 ms 9820 KB ok, correct split
6 Correct 2 ms 9820 KB ok, correct split
7 Correct 74 ms 27848 KB ok, correct split
8 Correct 62 ms 25288 KB ok, correct split
9 Correct 83 ms 24524 KB ok, correct split
10 Correct 64 ms 28448 KB ok, correct split
11 Correct 102 ms 28180 KB ok, correct split
12 Correct 2 ms 9820 KB ok, correct split
13 Correct 2 ms 9820 KB ok, correct split
14 Correct 2 ms 9820 KB ok, correct split
15 Correct 71 ms 23500 KB ok, correct split
16 Correct 54 ms 17632 KB ok, correct split
17 Correct 76 ms 28380 KB ok, correct split
18 Correct 68 ms 25032 KB ok, correct split
19 Correct 83 ms 20344 KB ok, correct split
20 Correct 55 ms 19060 KB ok, correct split
21 Correct 37 ms 16592 KB ok, correct split
22 Correct 37 ms 16600 KB ok, correct split
23 Correct 40 ms 16596 KB ok, correct split
24 Correct 2 ms 9820 KB ok, correct split
25 Correct 66 ms 17664 KB ok, correct split
26 Correct 21 ms 13528 KB ok, correct split
27 Correct 2 ms 9816 KB ok, correct split
28 Correct 58 ms 23256 KB ok, correct split
29 Correct 66 ms 22984 KB ok, correct split
30 Correct 61 ms 22732 KB ok, correct split
31 Correct 59 ms 24268 KB ok, correct split
32 Correct 56 ms 22408 KB ok, correct split
33 Correct 17 ms 12636 KB ok, no valid answer
34 Correct 24 ms 13916 KB ok, no valid answer
35 Correct 39 ms 17424 KB ok, no valid answer
36 Correct 43 ms 18012 KB ok, no valid answer
37 Correct 34 ms 17412 KB ok, no valid answer
38 Correct 2 ms 9820 KB ok, correct split
39 Correct 2 ms 9820 KB ok, no valid answer
40 Correct 2 ms 9820 KB ok, correct split
41 Correct 2 ms 9820 KB ok, correct split
42 Correct 2 ms 9820 KB ok, correct split
43 Correct 3 ms 9816 KB ok, correct split
44 Correct 3 ms 9820 KB ok, correct split
45 Correct 3 ms 9816 KB ok, correct split
46 Correct 4 ms 10076 KB ok, correct split
47 Correct 4 ms 10076 KB ok, correct split
48 Correct 2 ms 9820 KB ok, correct split
49 Correct 5 ms 10076 KB ok, correct split
50 Correct 2 ms 9820 KB ok, correct split
51 Correct 2 ms 9820 KB ok, correct split
52 Correct 2 ms 9820 KB ok, correct split
53 Correct 2 ms 9820 KB ok, correct split
54 Correct 2 ms 9820 KB ok, correct split
55 Correct 2 ms 9820 KB ok, correct split
56 Correct 2 ms 9820 KB ok, correct split
57 Correct 3 ms 10072 KB ok, correct split
58 Correct 3 ms 10076 KB ok, correct split
59 Correct 3 ms 10076 KB ok, correct split
60 Correct 3 ms 10100 KB ok, correct split
61 Correct 3 ms 10076 KB ok, correct split
62 Correct 3 ms 10168 KB ok, correct split
63 Correct 3 ms 10076 KB ok, correct split
64 Correct 4 ms 10136 KB ok, correct split
65 Correct 3 ms 10076 KB ok, correct split
66 Correct 3 ms 9820 KB ok, correct split
67 Correct 4 ms 10076 KB ok, correct split
68 Correct 2 ms 9820 KB ok, correct split
69 Correct 3 ms 9820 KB ok, correct split
70 Correct 2 ms 9820 KB ok, correct split
71 Correct 4 ms 10072 KB ok, correct split
72 Correct 3 ms 10076 KB ok, correct split
73 Correct 3 ms 10072 KB ok, correct split
74 Correct 4 ms 10072 KB ok, correct split
75 Correct 5 ms 10072 KB ok, correct split
76 Correct 4 ms 10076 KB ok, correct split
77 Correct 4 ms 10076 KB ok, correct split
78 Correct 4 ms 9820 KB ok, correct split
79 Correct 3 ms 9820 KB ok, correct split
80 Correct 5 ms 10076 KB ok, correct split
81 Correct 5 ms 10136 KB ok, correct split
82 Correct 4 ms 10076 KB ok, correct split
83 Correct 3 ms 10076 KB ok, correct split
84 Correct 3 ms 10104 KB ok, no valid answer
85 Correct 3 ms 10076 KB ok, correct split
86 Correct 3 ms 10076 KB ok, correct split
87 Correct 3 ms 9820 KB ok, no valid answer
88 Correct 2 ms 9816 KB ok, no valid answer
89 Correct 3 ms 9872 KB ok, no valid answer
90 Correct 4 ms 10076 KB ok, no valid answer
91 Correct 3 ms 9820 KB ok, no valid answer
92 Correct 3 ms 10076 KB ok, no valid answer
93 Correct 4 ms 10076 KB ok, no valid answer
94 Correct 62 ms 22296 KB ok, correct split
95 Correct 90 ms 28324 KB ok, correct split
96 Correct 79 ms 26288 KB ok, correct split
97 Correct 20 ms 13592 KB ok, correct split
98 Correct 22 ms 13780 KB ok, correct split
99 Correct 35 ms 16356 KB ok, correct split
100 Correct 81 ms 23188 KB ok, correct split
101 Correct 91 ms 21972 KB ok, correct split
102 Correct 67 ms 21348 KB ok, correct split
103 Correct 62 ms 21052 KB ok, correct split
104 Correct 55 ms 20972 KB ok, correct split
105 Correct 31 ms 15584 KB ok, correct split
106 Correct 60 ms 21060 KB ok, correct split
107 Correct 48 ms 18644 KB ok, correct split
108 Correct 49 ms 18644 KB ok, correct split
109 Correct 86 ms 22484 KB ok, correct split
110 Correct 76 ms 23240 KB ok, correct split
111 Correct 79 ms 23376 KB ok, correct split
112 Correct 72 ms 21928 KB ok, correct split
113 Correct 73 ms 21968 KB ok, correct split
114 Correct 10 ms 11352 KB ok, correct split
115 Correct 9 ms 11096 KB ok, correct split
116 Correct 92 ms 23372 KB ok, correct split
117 Correct 76 ms 23180 KB ok, correct split
118 Correct 54 ms 20172 KB ok, correct split
119 Correct 54 ms 20172 KB ok, correct split
120 Correct 59 ms 25040 KB ok, correct split
121 Correct 45 ms 18196 KB ok, no valid answer
122 Correct 57 ms 18000 KB ok, no valid answer
123 Correct 71 ms 22608 KB ok, no valid answer
124 Correct 86 ms 22612 KB ok, no valid answer
125 Correct 50 ms 18924 KB ok, no valid answer
126 Correct 30 ms 16592 KB ok, no valid answer
127 Correct 53 ms 19856 KB ok, no valid answer