oj.uz

Submission #490271

# Submission time Handle Problem Language Result Execution time Memory
490271 2021-11-26T17:26:17 Z fcmalkcin Split the Attractions (IOI19_split) C++17
100 / 100
 135 ms 24540 KB 
#pragma GCC optimize("Ofast")
#pragma GCC optimization("unroll-loops, no-stack-protector")
#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
using namespace std;

#define ll  int
#define pll pair<ll,ll>
#define ff first
#define ss second
#define pb push_back
#define endl "\n"
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

const ll maxn=1e5+50;
const ll mod=1e9+7  ;
const ll base=2e18;
/// you will be the best but now you just are trash
/// goal 6/7
vector<ll> adj[maxn];
vector<pll> nw;
vector<ll> adj1[maxn];
ll siz[maxn];
ll low[maxn];
ll num[maxn];
ll cntnw=0;
ll pos=-1;
ll anc[maxn];
void dfs(ll u)
{
    cntnw++;
    low[u]=cntnw;
    num[u]=cntnw;
    siz[u]=1;
    bool chk=true;
    for (auto to:adj[u])
    {
        if (num[to])
        {
            low[u]=min(low[u],num[to]);
            continue;
        }
        adj1[u].pb(to);
        adj1[to].pb(u);
        anc[to]=u;
        dfs(to);
        low[u]=min(low[u],low[to]);
        siz[u]+=siz[to];
        if (siz[to]>=nw[0].ff) chk=false;
    }
    if (chk&&siz[u]>=nw[0].ff)
    {
        pos=u;
    }
}
vector<ll> ans;
ll colmx;
ll cnt[4];
ll val[4];
ll dem=0;
void dfs1(ll u,ll col1)
{
   // cout <<siz[u]<<" chk"<<endl;
    if (cnt[col1]>=val[col1]) col1=colmx;
    ans[u]=col1;
    cnt[col1]++;
   // assert(cnt[col1]<=val[col1]);
    for (auto to:adj1[u])
    {
        if (to==anc[u]||ans[to]) continue;
        dfs1(to,col1);
    }
}
void dfs2(ll u,ll col2)
{
    if (cnt[col2]>=val[col2]) col2=colmx;
    ans[u]=col2;
    cnt[col2]++;
  //  assert(cnt[col2]<=val[col2]);
    for (auto to:adj[u])
    {
        if (ans[to]) continue;
        dfs2(to,col2);
    }
}
vector<ll> find_split(int n, int a, int b, int c, vector<ll> p, vector<ll> q)
{
    memset(anc,-1,sizeof(anc));
    nw.pb(make_pair(a,1));
    nw.pb(make_pair(b,2));
    nw.pb(make_pair(c,3));
    sort(nw.begin(),nw.end());
    for (int i=1;i<=nw.size();i++) val[nw[i-1].ss]=nw[i-1].ff;
    colmx=nw.back().ss;
    for (int i=0;i<p.size();i++)
    {
        adj[p[i]].pb(q[i]);
        adj[q[i]].pb(p[i]);
    }
    ans=vector<ll> (n,0);
    dfs(0);
    ll cl=siz[pos];
    ll u=pos;
    ll h=n-cl;
  ll kp=nw[0].ff;
    for (int i=0;i<adj1[u].size();i++)
    {
        ll to=adj1[u][i];
        if (to==anc[u]) continue;
        if (low[to]<num[u])
        {
            if (cl-siz[to]>=kp)
            {
                h+=siz[to];
                cl-=siz[to];
            }
            else
            {
                break;
            }
        }
        else
        {
        }
    }
    if (h<nw[0].ff)
    {
        ans=vector<ll> (n,0);
        return ans;
    }
    if (h<cl)
    {
        swap(nw[0],nw[1]);
    }
    cl=siz[pos];
     ans[pos]=nw[0].ss;
    cnt[nw[0].ss]++;
    for (int i=0;i<adj1[u].size();i++)
    {
        ll to=adj1[u][i];
        if (to==anc[u]) continue;
        if (low[to]<num[u])
        {
            if (cl-siz[to]>=kp)
            {

                h+=siz[to];
                cl-=siz[to];
            }
            else
            {
                for (int j=i;j<adj1[u].size();j++)
                {
                    ll to=adj1[u][j];
                    if (to==anc[u]||ans[to]) continue;
                    dfs1(to,nw[0].ss);
                }
                break;
            }
        }
        else
        {
            dfs1(to,nw[0].ss);
        }
    }
    if (anc[u]!=-1)
    {
        dfs2(anc[u],nw[1].ss);
    }
    return ans;
}

Compilation message

split.cpp:2: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    2 | #pragma GCC optimization("unroll-loops, no-stack-protector")
      | 
split.cpp:18:15: warning: overflow in conversion from 'double' to 'int' changes value from '2.0e+18' to '2147483647' [-Woverflow]
   18 | const ll base=2e18;
      |               ^~~~
split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:94:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   94 |     for (int i=1;i<=nw.size();i++) val[nw[i-1].ss]=nw[i-1].ff;
      |                  ~^~~~~~~~~~~
split.cpp:96:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   96 |     for (int i=0;i<p.size();i++)
      |                  ~^~~~~~~~~
split.cpp:107:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  107 |     for (int i=0;i<adj1[u].size();i++)
      |                  ~^~~~~~~~~~~~~~~
split.cpp:139:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  139 |     for (int i=0;i<adj1[u].size();i++)
      |                  ~^~~~~~~~~~~~~~~
split.cpp:153:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  153 |                 for (int j=i;j<adj1[u].size();j++)
      |                              ~^~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5324 KB ok, correct split
2 Correct 3 ms 5324 KB ok, correct split
3 Correct 3 ms 5324 KB ok, correct split
4 Correct 3 ms 5324 KB ok, correct split
5 Correct 3 ms 5324 KB ok, correct split
6 Correct 3 ms 5324 KB ok, correct split
7 Correct 97 ms 24060 KB ok, correct split
8 Correct 105 ms 21328 KB ok, correct split
9 Correct 95 ms 20424 KB ok, correct split
10 Correct 92 ms 24540 KB ok, correct split
11 Correct 95 ms 24464 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5324 KB ok, correct split
2 Correct 3 ms 5324 KB ok, correct split
3 Correct 3 ms 5324 KB ok, correct split
4 Correct 104 ms 20436 KB ok, correct split
5 Correct 82 ms 15264 KB ok, correct split
6 Correct 103 ms 24496 KB ok, correct split
7 Correct 90 ms 21148 KB ok, correct split
8 Correct 115 ms 17124 KB ok, correct split
9 Correct 98 ms 15172 KB ok, correct split
10 Correct 64 ms 15856 KB ok, correct split
11 Correct 58 ms 15948 KB ok, correct split
12 Correct 57 ms 15900 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5324 KB ok, correct split
2 Correct 86 ms 15344 KB ok, correct split
3 Correct 27 ms 9420 KB ok, correct split
4 Correct 3 ms 5324 KB ok, correct split
5 Correct 92 ms 18196 KB ok, correct split
6 Correct 87 ms 17896 KB ok, correct split
7 Correct 121 ms 17728 KB ok, correct split
8 Correct 92 ms 19264 KB ok, correct split
9 Correct 92 ms 17492 KB ok, correct split
10 Correct 22 ms 8652 KB ok, no valid answer
11 Correct 32 ms 10380 KB ok, no valid answer
12 Correct 64 ms 15708 KB ok, no valid answer
13 Correct 76 ms 15444 KB ok, no valid answer
14 Correct 79 ms 15900 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5324 KB ok, correct split
2 Correct 3 ms 5324 KB ok, no valid answer
3 Correct 4 ms 5324 KB ok, correct split
4 Correct 3 ms 5324 KB ok, correct split
5 Correct 3 ms 5324 KB ok, correct split
6 Correct 5 ms 5324 KB ok, correct split
7 Correct 4 ms 5324 KB ok, correct split
8 Correct 3 ms 5324 KB ok, correct split
9 Correct 6 ms 5708 KB ok, correct split
10 Correct 5 ms 5580 KB ok, correct split
11 Correct 4 ms 5340 KB ok, correct split
12 Correct 7 ms 5708 KB ok, correct split
13 Correct 3 ms 5324 KB ok, correct split
14 Correct 4 ms 5324 KB ok, correct split
15 Correct 4 ms 5324 KB ok, correct split
16 Correct 3 ms 5380 KB ok, correct split
17 Correct 3 ms 5324 KB ok, correct split
18 Correct 3 ms 5324 KB ok, correct split
19 Correct 4 ms 5452 KB ok, correct split
20 Correct 4 ms 5452 KB ok, correct split
21 Correct 4 ms 5708 KB ok, correct split
22 Correct 5 ms 5656 KB ok, correct split
23 Correct 5 ms 5744 KB ok, correct split
24 Correct 4 ms 5708 KB ok, correct split
25 Correct 5 ms 5708 KB ok, correct split
26 Correct 7 ms 5708 KB ok, correct split
27 Correct 5 ms 5708 KB ok, correct split
28 Correct 5 ms 5696 KB ok, correct split
29 Correct 4 ms 5324 KB ok, correct split
30 Correct 5 ms 5708 KB ok, correct split
31 Correct 5 ms 5452 KB ok, correct split
32 Correct 3 ms 5324 KB ok, correct split
33 Correct 3 ms 5324 KB ok, correct split
34 Correct 4 ms 5580 KB ok, correct split
35 Correct 5 ms 5580 KB ok, correct split
36 Correct 4 ms 5580 KB ok, correct split
37 Correct 6 ms 5580 KB ok, correct split
38 Correct 5 ms 5708 KB ok, correct split
39 Correct 6 ms 5708 KB ok, correct split
40 Correct 5 ms 5584 KB ok, correct split
41 Correct 5 ms 5464 KB ok, correct split
42 Correct 4 ms 5464 KB ok, correct split
43 Correct 5 ms 5592 KB ok, correct split
44 Correct 6 ms 5592 KB ok, correct split
45 Correct 5 ms 5592 KB ok, correct split
46 Correct 4 ms 5720 KB ok, correct split
47 Correct 5 ms 5720 KB ok, no valid answer
48 Correct 6 ms 5592 KB ok, correct split
49 Correct 5 ms 5720 KB ok, correct split
50 Correct 3 ms 5332 KB ok, no valid answer
51 Correct 3 ms 5336 KB ok, no valid answer
52 Correct 4 ms 5592 KB ok, no valid answer
53 Correct 5 ms 5592 KB ok, no valid answer
54 Correct 6 ms 5592 KB ok, no valid answer
55 Correct 4 ms 5592 KB ok, no valid answer
56 Correct 5 ms 5592 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5324 KB ok, correct split
2 Correct 3 ms 5324 KB ok, correct split
3 Correct 3 ms 5324 KB ok, correct split
4 Correct 3 ms 5324 KB ok, correct split
5 Correct 3 ms 5324 KB ok, correct split
6 Correct 3 ms 5324 KB ok, correct split
7 Correct 97 ms 24060 KB ok, correct split
8 Correct 105 ms 21328 KB ok, correct split
9 Correct 95 ms 20424 KB ok, correct split
10 Correct 92 ms 24540 KB ok, correct split
11 Correct 95 ms 24464 KB ok, correct split
12 Correct 3 ms 5324 KB ok, correct split
13 Correct 3 ms 5324 KB ok, correct split
14 Correct 3 ms 5324 KB ok, correct split
15 Correct 104 ms 20436 KB ok, correct split
16 Correct 82 ms 15264 KB ok, correct split
17 Correct 103 ms 24496 KB ok, correct split
18 Correct 90 ms 21148 KB ok, correct split
19 Correct 115 ms 17124 KB ok, correct split
20 Correct 98 ms 15172 KB ok, correct split
21 Correct 64 ms 15856 KB ok, correct split
22 Correct 58 ms 15948 KB ok, correct split
23 Correct 57 ms 15900 KB ok, correct split
24 Correct 4 ms 5324 KB ok, correct split
25 Correct 86 ms 15344 KB ok, correct split
26 Correct 27 ms 9420 KB ok, correct split
27 Correct 3 ms 5324 KB ok, correct split
28 Correct 92 ms 18196 KB ok, correct split
29 Correct 87 ms 17896 KB ok, correct split
30 Correct 121 ms 17728 KB ok, correct split
31 Correct 92 ms 19264 KB ok, correct split
32 Correct 92 ms 17492 KB ok, correct split
33 Correct 22 ms 8652 KB ok, no valid answer
34 Correct 32 ms 10380 KB ok, no valid answer
35 Correct 64 ms 15708 KB ok, no valid answer
36 Correct 76 ms 15444 KB ok, no valid answer
37 Correct 79 ms 15900 KB ok, no valid answer
38 Correct 3 ms 5324 KB ok, correct split
39 Correct 3 ms 5324 KB ok, no valid answer
40 Correct 4 ms 5324 KB ok, correct split
41 Correct 3 ms 5324 KB ok, correct split
42 Correct 3 ms 5324 KB ok, correct split
43 Correct 5 ms 5324 KB ok, correct split
44 Correct 4 ms 5324 KB ok, correct split
45 Correct 3 ms 5324 KB ok, correct split
46 Correct 6 ms 5708 KB ok, correct split
47 Correct 5 ms 5580 KB ok, correct split
48 Correct 4 ms 5340 KB ok, correct split
49 Correct 7 ms 5708 KB ok, correct split
50 Correct 3 ms 5324 KB ok, correct split
51 Correct 4 ms 5324 KB ok, correct split
52 Correct 4 ms 5324 KB ok, correct split
53 Correct 3 ms 5380 KB ok, correct split
54 Correct 3 ms 5324 KB ok, correct split
55 Correct 3 ms 5324 KB ok, correct split
56 Correct 4 ms 5452 KB ok, correct split
57 Correct 4 ms 5452 KB ok, correct split
58 Correct 4 ms 5708 KB ok, correct split
59 Correct 5 ms 5656 KB ok, correct split
60 Correct 5 ms 5744 KB ok, correct split
61 Correct 4 ms 5708 KB ok, correct split
62 Correct 5 ms 5708 KB ok, correct split
63 Correct 7 ms 5708 KB ok, correct split
64 Correct 5 ms 5708 KB ok, correct split
65 Correct 5 ms 5696 KB ok, correct split
66 Correct 4 ms 5324 KB ok, correct split
67 Correct 5 ms 5708 KB ok, correct split
68 Correct 5 ms 5452 KB ok, correct split
69 Correct 3 ms 5324 KB ok, correct split
70 Correct 3 ms 5324 KB ok, correct split
71 Correct 4 ms 5580 KB ok, correct split
72 Correct 5 ms 5580 KB ok, correct split
73 Correct 4 ms 5580 KB ok, correct split
74 Correct 6 ms 5580 KB ok, correct split
75 Correct 5 ms 5708 KB ok, correct split
76 Correct 6 ms 5708 KB ok, correct split
77 Correct 5 ms 5584 KB ok, correct split
78 Correct 5 ms 5464 KB ok, correct split
79 Correct 4 ms 5464 KB ok, correct split
80 Correct 5 ms 5592 KB ok, correct split
81 Correct 6 ms 5592 KB ok, correct split
82 Correct 5 ms 5592 KB ok, correct split
83 Correct 4 ms 5720 KB ok, correct split
84 Correct 5 ms 5720 KB ok, no valid answer
85 Correct 6 ms 5592 KB ok, correct split
86 Correct 5 ms 5720 KB ok, correct split
87 Correct 3 ms 5332 KB ok, no valid answer
88 Correct 3 ms 5336 KB ok, no valid answer
89 Correct 4 ms 5592 KB ok, no valid answer
90 Correct 5 ms 5592 KB ok, no valid answer
91 Correct 6 ms 5592 KB ok, no valid answer
92 Correct 4 ms 5592 KB ok, no valid answer
93 Correct 5 ms 5592 KB ok, no valid answer
94 Correct 97 ms 18360 KB ok, correct split
95 Correct 127 ms 22888 KB ok, correct split
96 Correct 113 ms 21584 KB ok, correct split
97 Correct 28 ms 9348 KB ok, correct split
98 Correct 38 ms 9404 KB ok, correct split
99 Correct 46 ms 11164 KB ok, correct split
100 Correct 121 ms 17732 KB ok, correct split
101 Correct 127 ms 17088 KB ok, correct split
102 Correct 106 ms 16948 KB ok, correct split
103 Correct 101 ms 16628 KB ok, correct split
104 Correct 128 ms 17964 KB ok, correct split
105 Correct 45 ms 11504 KB ok, correct split
106 Correct 111 ms 17808 KB ok, correct split
107 Correct 80 ms 15320 KB ok, correct split
108 Correct 102 ms 15392 KB ok, correct split
109 Correct 128 ms 17076 KB ok, correct split
110 Correct 125 ms 17088 KB ok, correct split
111 Correct 108 ms 17188 KB ok, correct split
112 Correct 135 ms 17424 KB ok, correct split
113 Correct 105 ms 17384 KB ok, correct split
114 Correct 12 ms 6988 KB ok, correct split
115 Correct 12 ms 6716 KB ok, correct split
116 Correct 114 ms 17124 KB ok, correct split
117 Correct 105 ms 17024 KB ok, correct split
118 Correct 82 ms 15296 KB ok, correct split
119 Correct 81 ms 15148 KB ok, correct split
120 Correct 91 ms 20060 KB ok, correct split
121 Correct 90 ms 15300 KB ok, no valid answer
122 Correct 74 ms 15420 KB ok, no valid answer
123 Correct 110 ms 17956 KB ok, no valid answer
124 Correct 119 ms 17824 KB ok, no valid answer
125 Correct 84 ms 16384 KB ok, no valid answer
126 Correct 58 ms 14976 KB ok, no valid answer
127 Correct 86 ms 16448 KB ok, no valid answer