Submission #109482

#	Time	Username	Problem	Language	Result	Execution time	Memory
109482		nikolapesic2802	Mechanical Doll (IOI18_doll)	C++14	81.15 / 100	188 ms	18072 KiB

doll

#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);
int stigao;
void build(int tr,vector<int> izlazi)
{
    vector<int> levo,desno;
    for(int i=0;i<(int)izlazi.size();i++)
        if(i%2)
            desno.pb(izlazi[i]);
        else
            levo.pb(izlazi[i]);
    bool isto=true;
    for(int i=1;i<(int)levo.size();i++)
        if(levo[i]!=levo[0])
        {
            isto=false;
            break;
        }
    if(isto)
        graf[tr].x=levo[0];
    else
    {
        graf[tr].x=stigao;
        stigao++;
        build(graf[tr].x,levo);
    }
    isto=true;
    for(int i=1;i<(int)desno.size();i++)
        if(desno[i]!=desno[0])
        {
            isto=false;
            break;
        }
    if(isto)
        graf[tr].y=desno[0];
    else
    {
        graf[tr].y=stigao;
        stigao++;
        build(graf[tr].y,desno);
    }
}
void construct(int i,vector<int> d)
{
    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;
    int koliko=0;
    koliko=sz-d.size();
    vector<int> bld;
    for(int j=0;j<(int)d.size();j++)
    {
        if(j<koliko)
            bld.pb(graf[i].x);
        bld.pb(d[j]);
    }
    build(graf[i].x,bld);
}
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);
    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);
}

• Subtask 1: 2 / 2
• Subtask 2: 4 / 4
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 18 / 18
• Subtask 6: 37.150369844 / 56