oj.uz

Submission #490269

# Submission time Handle Problem Language Result Execution time Memory
490269 2021-11-26T17:21:44 Z fcmalkcin Split the Attractions (IOI19_split) C++17
100 / 100
 124 ms 24556 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;

     //  cout <<u<<" "<<to<<" chk1"<<endl;
        dfs(to);
        low[u]=min(low[u],low[to]);
        siz[u]+=siz[to];
        if (siz[to]<nw[0].ff)
        {

        }
        else
        {
            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])
    {

    }
    else
    {
        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])
    {

    }
    else
    {
        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);
  //  cout <<pos<<endl;
    assert(pos!=-1);
    ll cl=siz[pos];
    ll u=pos;
    ll h=n-cl;
  // cout <<h<<" "<<cl<<endl;
  ll kp=nw[0].ff;
    for (int i=0;i<adj1[u].size();i++)
    {
        ll to=adj1[u][i];
        if (to==anc[u]) continue;
      //  cout <<"wTF"<<" "<<to<<" "<<u<<" "<<anc[u]<<endl;
        if (low[to]<num[u])
        {
          //  cout <<"WTF"<<endl;
            if (cl-siz[to]>=kp)
            {
               // cout <<"WYF"<<endl;
                h+=siz[to];
                cl-=siz[to];
            }
            else
            {
              //  cout <<"nah"<<endl;
                break;
            }
        }
        else
        {
        }
    }
   // cout <<h<<" "<<nw[1].ff<<endl;
    if (h<nw[0].ff)
    {
        ans=vector<ll> (n,0);
        return ans;
    }
   // cout <<h<<" "<<cl<<" "<<pos<<" "<<adj1[pos].size()<<" "<<siz[pos]<<endl;
    if (h<cl)
    {
        swap(nw[0],nw[1]);
       // cout <<"na"<<endl;
    }
    cl=siz[pos];
    h=n-cl;
   // cout <<h<<" "<<cl<<endl;
     ans[pos]=nw[0].ss;
    cnt[nw[0].ss]++;
   // cout <<cnt[1]<<" "<<cnt[2]<<" "<<cnt[3]<<endl;
    for (int i=0;i<adj1[u].size();i++)
    {
        ll to=adj1[u][i];
        if (to==anc[u]) continue;
      //  cout <<"wTF"<<" "<<to<<" "<<u<<" "<<anc[u]<<endl;
        if (low[to]<num[u])
        {
          //  cout <<"WTF"<<endl;
            if (cl-siz[to]>=kp)
            {

                h+=siz[to];
                cl-=siz[to];
            }
            else
            {
              //  cout <<"nah"<<endl;
                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
        {
            //cout <<" wtf"<<endl;
            dfs1(to,nw[0].ss);
        }
    }
   //cout <<nw[1].ss<<" "<<cnt[2]<<" "<<val[2]<<" "<<cnt[3]<<" "<<val[3]<<endl;
    if (anc[u]!=-1)
    {
        dfs2(anc[u],nw[1].ss);
    }
    for (int i=1;i<=3;i++)
    {
     //   cout <<cnt[i]<<" "<<val[i]<<endl;
       if (cnt[i]!=val[i])
     {
         cout <<-1;
     }
    //  assert(cnt[i]==val[i]);
     // cout <<-1;

    }
   // ans=vector<ll> (n,1);
    return ans;
}


/*int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    if (fopen("test.inp", "r"))
    {
        freopen("test.inp", "r", stdin);
       // freopen("test.", "w", stdout);
    }
    if (1)
    {
    ll n, a, b, c;
     ll m;
    cin>> n>> m;
    cin>> a>> b>> c;

    vector<ll> vt;
    vector<ll> vt1;
    for (int i=1;i<=m;i++)
    {
        ll x, y;
        cin>>x>> y;
        vt.pb(x);
        vt1.pb(y);
    }
    vector<ll> ans=find_split(n,a,b,c, vt,vt1);
    }
    else
    {
         vector<ll> ans=find_split(3,1,1,1, {0,0},{2,1});

    }
}*/

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:117: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]
  117 |     for (int i=1;i<=nw.size();i++) val[nw[i-1].ss]=nw[i-1].ff;
      |                  ~^~~~~~~~~~~
split.cpp:119:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  119 |     for (int i=0;i<p.size();i++)
      |                  ~^~~~~~~~~
split.cpp:133:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  133 |     for (int i=0;i<adj1[u].size();i++)
      |                  ~^~~~~~~~~~~~~~~
split.cpp:175:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  175 |     for (int i=0;i<adj1[u].size();i++)
      |                  ~^~~~~~~~~~~~~~~
split.cpp:192:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  192 |                 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 92 ms 24048 KB ok, correct split
8 Correct 86 ms 21400 KB ok, correct split
9 Correct 92 ms 20436 KB ok, correct split
10 Correct 91 ms 24476 KB ok, correct split
11 Correct 90 ms 24552 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 119 ms 20584 KB ok, correct split
5 Correct 82 ms 15376 KB ok, correct split
6 Correct 92 ms 24556 KB ok, correct split
7 Correct 88 ms 21060 KB ok, correct split
8 Correct 118 ms 17220 KB ok, correct split
9 Correct 103 ms 15260 KB ok, correct split
10 Correct 58 ms 15932 KB ok, correct split
11 Correct 67 ms 15960 KB ok, correct split
12 Correct 58 ms 15896 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5324 KB ok, correct split
2 Correct 80 ms 15388 KB ok, correct split
3 Correct 28 ms 9420 KB ok, correct split
4 Correct 3 ms 5324 KB ok, correct split
5 Correct 96 ms 18228 KB ok, correct split
6 Correct 90 ms 17880 KB ok, correct split
7 Correct 89 ms 17732 KB ok, correct split
8 Correct 104 ms 19304 KB ok, correct split
9 Correct 88 ms 17476 KB ok, correct split
10 Correct 23 ms 8652 KB ok, no valid answer
11 Correct 31 ms 10372 KB ok, no valid answer
12 Correct 70 ms 15776 KB ok, no valid answer
13 Correct 75 ms 15352 KB ok, no valid answer
14 Correct 56 ms 15948 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 3 ms 5324 KB ok, correct split
4 Correct 3 ms 5324 KB ok, correct split
5 Correct 3 ms 5348 KB ok, correct split
6 Correct 3 ms 5324 KB ok, correct split
7 Correct 3 ms 5324 KB ok, correct split
8 Correct 3 ms 5324 KB ok, correct split
9 Correct 5 ms 5708 KB ok, correct split
10 Correct 6 ms 5580 KB ok, correct split
11 Correct 4 ms 5324 KB ok, correct split
12 Correct 4 ms 5708 KB ok, correct split
13 Correct 3 ms 5324 KB ok, correct split
14 Correct 3 ms 5324 KB ok, correct split
15 Correct 3 ms 5324 KB ok, correct split
16 Correct 3 ms 5324 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 4 ms 5580 KB ok, correct split
23 Correct 5 ms 5660 KB ok, correct split
24 Correct 4 ms 5708 KB ok, correct split
25 Correct 4 ms 5708 KB ok, correct split
26 Correct 4 ms 5708 KB ok, correct split
27 Correct 5 ms 5708 KB ok, correct split
28 Correct 5 ms 5636 KB ok, correct split
29 Correct 4 ms 5384 KB ok, correct split
30 Correct 4 ms 5708 KB ok, correct split
31 Correct 3 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 7 ms 5580 KB ok, correct split
35 Correct 4 ms 5580 KB ok, correct split
36 Correct 4 ms 5580 KB ok, correct split
37 Correct 5 ms 5708 KB ok, correct split
38 Correct 5 ms 5708 KB ok, correct split
39 Correct 5 ms 5708 KB ok, correct split
40 Correct 5 ms 5580 KB ok, correct split
41 Correct 4 ms 5452 KB ok, correct split
42 Correct 4 ms 5452 KB ok, correct split
43 Correct 5 ms 5580 KB ok, correct split
44 Correct 5 ms 5580 KB ok, correct split
45 Correct 5 ms 5580 KB ok, correct split
46 Correct 4 ms 5636 KB ok, correct split
47 Correct 4 ms 5688 KB ok, no valid answer
48 Correct 4 ms 5580 KB ok, correct split
49 Correct 4 ms 5708 KB ok, correct split
50 Correct 3 ms 5324 KB ok, no valid answer
51 Correct 3 ms 5324 KB ok, no valid answer
52 Correct 4 ms 5580 KB ok, no valid answer
53 Correct 5 ms 5580 KB ok, no valid answer
54 Correct 4 ms 5580 KB ok, no valid answer
55 Correct 4 ms 5580 KB ok, no valid answer
56 Correct 4 ms 5580 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 92 ms 24048 KB ok, correct split
8 Correct 86 ms 21400 KB ok, correct split
9 Correct 92 ms 20436 KB ok, correct split
10 Correct 91 ms 24476 KB ok, correct split
11 Correct 90 ms 24552 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 119 ms 20584 KB ok, correct split
16 Correct 82 ms 15376 KB ok, correct split
17 Correct 92 ms 24556 KB ok, correct split
18 Correct 88 ms 21060 KB ok, correct split
19 Correct 118 ms 17220 KB ok, correct split
20 Correct 103 ms 15260 KB ok, correct split
21 Correct 58 ms 15932 KB ok, correct split
22 Correct 67 ms 15960 KB ok, correct split
23 Correct 58 ms 15896 KB ok, correct split
24 Correct 3 ms 5324 KB ok, correct split
25 Correct 80 ms 15388 KB ok, correct split
26 Correct 28 ms 9420 KB ok, correct split
27 Correct 3 ms 5324 KB ok, correct split
28 Correct 96 ms 18228 KB ok, correct split
29 Correct 90 ms 17880 KB ok, correct split
30 Correct 89 ms 17732 KB ok, correct split
31 Correct 104 ms 19304 KB ok, correct split
32 Correct 88 ms 17476 KB ok, correct split
33 Correct 23 ms 8652 KB ok, no valid answer
34 Correct 31 ms 10372 KB ok, no valid answer
35 Correct 70 ms 15776 KB ok, no valid answer
36 Correct 75 ms 15352 KB ok, no valid answer
37 Correct 56 ms 15948 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 3 ms 5324 KB ok, correct split
41 Correct 3 ms 5324 KB ok, correct split
42 Correct 3 ms 5348 KB ok, correct split
43 Correct 3 ms 5324 KB ok, correct split
44 Correct 3 ms 5324 KB ok, correct split
45 Correct 3 ms 5324 KB ok, correct split
46 Correct 5 ms 5708 KB ok, correct split
47 Correct 6 ms 5580 KB ok, correct split
48 Correct 4 ms 5324 KB ok, correct split
49 Correct 4 ms 5708 KB ok, correct split
50 Correct 3 ms 5324 KB ok, correct split
51 Correct 3 ms 5324 KB ok, correct split
52 Correct 3 ms 5324 KB ok, correct split
53 Correct 3 ms 5324 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 4 ms 5580 KB ok, correct split
60 Correct 5 ms 5660 KB ok, correct split
61 Correct 4 ms 5708 KB ok, correct split
62 Correct 4 ms 5708 KB ok, correct split
63 Correct 4 ms 5708 KB ok, correct split
64 Correct 5 ms 5708 KB ok, correct split
65 Correct 5 ms 5636 KB ok, correct split
66 Correct 4 ms 5384 KB ok, correct split
67 Correct 4 ms 5708 KB ok, correct split
68 Correct 3 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 7 ms 5580 KB ok, correct split
72 Correct 4 ms 5580 KB ok, correct split
73 Correct 4 ms 5580 KB ok, correct split
74 Correct 5 ms 5708 KB ok, correct split
75 Correct 5 ms 5708 KB ok, correct split
76 Correct 5 ms 5708 KB ok, correct split
77 Correct 5 ms 5580 KB ok, correct split
78 Correct 4 ms 5452 KB ok, correct split
79 Correct 4 ms 5452 KB ok, correct split
80 Correct 5 ms 5580 KB ok, correct split
81 Correct 5 ms 5580 KB ok, correct split
82 Correct 5 ms 5580 KB ok, correct split
83 Correct 4 ms 5636 KB ok, correct split
84 Correct 4 ms 5688 KB ok, no valid answer
85 Correct 4 ms 5580 KB ok, correct split
86 Correct 4 ms 5708 KB ok, correct split
87 Correct 3 ms 5324 KB ok, no valid answer
88 Correct 3 ms 5324 KB ok, no valid answer
89 Correct 4 ms 5580 KB ok, no valid answer
90 Correct 5 ms 5580 KB ok, no valid answer
91 Correct 4 ms 5580 KB ok, no valid answer
92 Correct 4 ms 5580 KB ok, no valid answer
93 Correct 4 ms 5580 KB ok, no valid answer
94 Correct 96 ms 18360 KB ok, correct split
95 Correct 124 ms 22948 KB ok, correct split
96 Correct 113 ms 21572 KB ok, correct split
97 Correct 28 ms 9396 KB ok, correct split
98 Correct 30 ms 9464 KB ok, correct split
99 Correct 42 ms 11168 KB ok, correct split
100 Correct 116 ms 17684 KB ok, correct split
101 Correct 105 ms 17088 KB ok, correct split
102 Correct 103 ms 16692 KB ok, correct split
103 Correct 92 ms 16620 KB ok, correct split
104 Correct 95 ms 18048 KB ok, correct split
105 Correct 45 ms 11532 KB ok, correct split
106 Correct 93 ms 17824 KB ok, correct split
107 Correct 89 ms 15364 KB ok, correct split
108 Correct 78 ms 15384 KB ok, correct split
109 Correct 113 ms 17104 KB ok, correct split
110 Correct 113 ms 17108 KB ok, correct split
111 Correct 120 ms 17208 KB ok, correct split
112 Correct 108 ms 17472 KB ok, correct split
113 Correct 122 ms 17452 KB ok, correct split
114 Correct 12 ms 6988 KB ok, correct split
115 Correct 12 ms 6732 KB ok, correct split
116 Correct 112 ms 17052 KB ok, correct split
117 Correct 112 ms 17016 KB ok, correct split
118 Correct 93 ms 15324 KB ok, correct split
119 Correct 82 ms 15148 KB ok, correct split
120 Correct 90 ms 20076 KB ok, correct split
121 Correct 85 ms 15328 KB ok, no valid answer
122 Correct 76 ms 15524 KB ok, no valid answer
123 Correct 107 ms 17952 KB ok, no valid answer
124 Correct 106 ms 17840 KB ok, no valid answer
125 Correct 75 ms 16340 KB ok, no valid answer
126 Correct 49 ms 14824 KB ok, no valid answer
127 Correct 86 ms 16448 KB ok, no valid answer