Submission #109488

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
109488	2019-05-06T17:26:15 Z	nikolapesic2802	Mechanical Doll (IOI18_doll)	C++14	2 / 100	95 ms	14824 KB

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,int skip,int sta)
{
    int ukupno=izlazi.size()+skip;
    if(ukupno==2)
    {
        for(int i=0;i<skip;i++)
            izlazi.pb(sta);
        graf[tr].x=izlazi[1];
        graf[tr].y=izlazi[0];
        return;
    }
    if(skip>=ukupno/2)
    {
        graf[tr].x=sta;
        graf[tr].y=stigao;
        stigao++;
        build(graf[tr].y,izlazi,skip-ukupno/2,sta);
        return;
    }
    int ss=skip;
    vector<int> levo,desno;
    for(int i=0;i<(int)izlazi.size();i++)
    {
        levo.pb(izlazi[i]);
        if(ss)
            ss--;
        else
            i++,desno.pb(izlazi[i]);
    }
    graf[tr].x=stigao;
    stigao++;
    build(graf[tr].x,levo,0,sta);
    graf[tr].y=stigao;
    stigao++;
    build(graf[tr].y,desno,skip,sta);
}
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;
    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);
}

Subtask #1
2.0 / 2.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	7244 KB	Output is correct
2	Correct	41 ms	13452 KB	Output is correct
3	Correct	53 ms	12216 KB	Output is correct
4	Correct	5 ms	7244 KB	Output is correct
5	Correct	22 ms	10968 KB	Output is correct
6	Correct	65 ms	14824 KB	Output is correct
7	Correct	5 ms	7244 KB	Output is correct

Subtask #2
0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	7244 KB	Output is correct
2	Correct	41 ms	13452 KB	Output is correct
3	Correct	53 ms	12216 KB	Output is correct
4	Correct	5 ms	7244 KB	Output is correct
5	Correct	22 ms	10968 KB	Output is correct
6	Correct	65 ms	14824 KB	Output is correct
7	Correct	5 ms	7244 KB	Output is correct
8	Incorrect	63 ms	14288 KB	wrong motion
9	Halted	0 ms	0 KB	-

Subtask #3
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	7244 KB	Output is correct
2	Correct	41 ms	13452 KB	Output is correct
3	Correct	53 ms	12216 KB	Output is correct
4	Correct	5 ms	7244 KB	Output is correct
5	Correct	22 ms	10968 KB	Output is correct
6	Correct	65 ms	14824 KB	Output is correct
7	Correct	5 ms	7244 KB	Output is correct
8	Incorrect	63 ms	14288 KB	wrong motion
9	Halted	0 ms	0 KB	-