oj.uz

Submission #109496

# Submission time Handle Problem Language Result Execution time Memory
109496 2019-05-06T17:55:50 Z nikolapesic2802 Mechanical Doll (IOI18_doll) C++14
85.5534 / 100
 218 ms 18068 KB 
#include <bits/stdc++.h>

#define ll long long
#define pb push_back
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()

using namespace std;
template<class T1, class T2> ostream& operator<<(ostream& os, const pair<T1,T2>& a) { os << '{' << a.f << ", " << a.s << '}'; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<T>& a){os << '{';for(int i=0;i<sz(a);i++){if(i>0&&i<sz(a))os << ", ";os << a[i];}os<<'}';return os;}

void answer(std::vector<int> C, std::vector<int> X, std::vector<int> Y);
struct node{
    int x,y;
    node(){x=-1;y=-1;}
};
const int NMAX=6e5+5;
vector<node> graf(NMAX);
vector<int> flipped(NMAX);
vector<int> skips;
int stigao;
void markskips(vector<int> poz,int koliko)
{
    if(koliko==0)
        return;
    vector<int> levo,desno;
    for(int i=0;i<(int)poz.size();i++)
        if(i%2)
            desno.pb(poz[i]);
        else
            levo.pb(poz[i]);
    if((int)levo.size()<=koliko)
        for(auto p:levo)
            skips[p]=1;
    else
        markskips(levo,koliko);
    if((int)levo.size()<koliko)
        markskips(desno,koliko-(int)levo.size());
}
void build(int tr,vector<int> izlazi,int skip,int sta)
{
    int ukupno=izlazi.size()+skip;
    assert(ukupno%2==0);
    if(ukupno==2)
    {
        if(skip)
        {
            assert(skip==1);
            graf[tr].x=sta;
            graf[tr].y=izlazi[0];
        }
        else
        {
            graf[tr].x=izlazi[0];
            graf[tr].y=izlazi[1];
        }
        return;
    }
    if(skip>=ukupno/2)
    {
        graf[tr].x=sta;
        graf[tr].y=stigao;
        stigao++;
        build(graf[tr].y,izlazi,skip-ukupno/2,sta);
        return;
    }
    skips.resize(ukupno);
    fill(all(skips),0);
    vector<int> pozicije;
    for(int i=0;i<ukupno;i++)
        pozicije.pb(i);
    markskips(pozicije,skip);
    vector<int> levo,desno;
    int trr=0;
    for(int i=0;i<ukupno;i++)
    {
        if(i%2)
            desno.pb(izlazi[trr++]),assert(!skips[i]);
        else
            if(!skips[i])
                levo.pb(izlazi[trr++]);
    }
    bool isto=skip==0;
    for(int i=1;i<levo.size();i++)
        if(levo[i]!=levo[0])
            isto=false;
    if(isto)
    {
        graf[tr].x=levo[0];
    }
    else
    {
        graf[tr].x=stigao;
        stigao++;
        build(graf[tr].x,levo,skip,sta);
    }
    isto=true;
    for(int i=1;i<desno.size();i++)
        if(desno[i]!=desno[0])
            isto=false;
    if(isto)
    {
        graf[tr].y=desno[0];
    }
    else
    {
        graf[tr].y=stigao;
        stigao++;
        build(graf[tr].y,desno,0,sta);
    }
}
void construct(int i,vector<int> d)
{
    //cout << i << d << endl;
    if(d.size()==0)
        d.pb(0);
    if(d.size()==1)
    {
        graf[i].x=d[0];
        return;
    }
    graf[i].x=stigao;
    stigao++;
    int sz=2;
    while(sz<(int)d.size())
        sz*=2;
    build(graf[i].x,d,sz-d.size(),graf[i].x);
}
void create_circuit(int m, vector<int> a)
{
    int n=a.size();
    vector<vector<int> > ide(m+1);
    for(int i=0;i<=m;i++)
        graf[i].y=-1;
    graf[0].x=a[0];
    for(int i=1;i<n;i++)
        ide[a[i-1]].pb(a[i]);
    ide[a.back()].pb(0);
    stigao=m+1;
    for(int i=1;i<=m;i++)
        construct(i,ide[i]);
    vector<int> A,X,Y;
    for(int i=0;i<=m;i++)
        if(graf[i].x>m)
            A.pb(m-graf[i].x);
        else
            A.pb(graf[i].x);
    int zbir=0;
    for(int i=1;i<=m;i++)
        zbir+=ide[i].size();
    for(int i=m+1;i<stigao;i++)
    {
        if(graf[i].x>m)
            X.pb(m-graf[i].x);
        else
            X.pb(graf[i].x);
        if(graf[i].y>m)
            Y.pb(m-graf[i].y);
        else
            Y.pb(graf[i].y);
    }
    answer(A,X,Y);
}

Compilation message

doll.cpp: In function 'void build(int, std::vector<int>, int, int)':
doll.cpp:86:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |     for(int i=1;i<levo.size();i++)
      |                 ~^~~~~~~~~~~~
doll.cpp:100:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  100 |     for(int i=1;i<desno.size();i++)
      |                 ~^~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7244 KB Output is correct
2 Correct 41 ms 13492 KB Output is correct
3 Correct 43 ms 12216 KB Output is correct
4 Correct 5 ms 7244 KB Output is correct
5 Correct 27 ms 10948 KB Output is correct
6 Correct 50 ms 14868 KB Output is correct
7 Correct 5 ms 7244 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7244 KB Output is correct
2 Correct 41 ms 13492 KB Output is correct
3 Correct 43 ms 12216 KB Output is correct
4 Correct 5 ms 7244 KB Output is correct
5 Correct 27 ms 10948 KB Output is correct
6 Correct 50 ms 14868 KB Output is correct
7 Correct 5 ms 7244 KB Output is correct
8 Correct 112 ms 14260 KB Output is correct
9 Correct 93 ms 15596 KB Output is correct
10 Correct 111 ms 17988 KB Output is correct
11 Correct 6 ms 7244 KB Output is correct
12 Correct 5 ms 7244 KB Output is correct
13 Correct 6 ms 7244 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7244 KB Output is correct
2 Correct 41 ms 13492 KB Output is correct
3 Correct 43 ms 12216 KB Output is correct
4 Correct 5 ms 7244 KB Output is correct
5 Correct 27 ms 10948 KB Output is correct
6 Correct 50 ms 14868 KB Output is correct
7 Correct 5 ms 7244 KB Output is correct
8 Correct 112 ms 14260 KB Output is correct
9 Correct 93 ms 15596 KB Output is correct
10 Correct 111 ms 17988 KB Output is correct
11 Correct 6 ms 7244 KB Output is correct
12 Correct 5 ms 7244 KB Output is correct
13 Correct 6 ms 7244 KB Output is correct
14 Correct 174 ms 17936 KB Output is correct
15 Correct 69 ms 12836 KB Output is correct
16 Correct 114 ms 15712 KB Output is correct
17 Correct 6 ms 7244 KB Output is correct
18 Correct 6 ms 7236 KB Output is correct
19 Correct 5 ms 7244 KB Output is correct
20 Correct 139 ms 17672 KB Output is correct
21 Correct 8 ms 7252 KB Output is correct
22 Correct 6 ms 7244 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7244 KB Output is correct
2 Correct 5 ms 7284 KB Output is correct
3 Correct 5 ms 7244 KB Output is correct
4 Correct 5 ms 7244 KB Output is correct
5 Correct 6 ms 7244 KB Output is correct
6 Correct 6 ms 7244 KB Output is correct
7 Correct 6 ms 7244 KB Output is correct
8 Correct 6 ms 7244 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7244 KB Output is correct
2 Correct 29 ms 12988 KB Output is correct
3 Correct 34 ms 16052 KB Output is correct
4 Correct 46 ms 17328 KB Output is correct

Subtask #6
41.5533523496 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7244 KB Output is correct
2 Correct 29 ms 12988 KB Output is correct
3 Correct 34 ms 16052 KB Output is correct
4 Correct 46 ms 17328 KB Output is correct
5 Partially correct 194 ms 18068 KB Output is partially correct
6 Partially correct 173 ms 17460 KB Output is partially correct
7 Partially correct 166 ms 17688 KB Output is partially correct
8 Partially correct 218 ms 16972 KB Output is partially correct
9 Correct 105 ms 12484 KB Output is correct
10 Correct 163 ms 16440 KB Output is correct
11 Partially correct 146 ms 15712 KB Output is partially correct
12 Partially correct 99 ms 12808 KB Output is partially correct
13 Partially correct 130 ms 13996 KB Output is partially correct
14 Partially correct 140 ms 14136 KB Output is partially correct
15 Partially correct 108 ms 14488 KB Output is partially correct
16 Partially correct 8 ms 7500 KB Output is partially correct
17 Partially correct 96 ms 12536 KB Output is partially correct
18 Partially correct 115 ms 12368 KB Output is partially correct
19 Partially correct 99 ms 12680 KB Output is partially correct
20 Partially correct 170 ms 15320 KB Output is partially correct
21 Partially correct 167 ms 15400 KB Output is partially correct
22 Partially correct 160 ms 14952 KB Output is partially correct