답안 #109467

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
109467	2019-05-06T16:12:28 Z	nikolapesic2802	자동 인형 (IOI18_doll)	C++14	2 / 100	1000 ms	12620 KB

doll

#include <bits/stdc++.h>

#define ll long long
#define pb push_back
#define f first
#define s second
#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<bool> flipped(NMAX);
int stigao;
void build(int tr,int koliko)
{
    if(koliko==0)
        return;
    graf[tr].x=stigao;
    stigao++;
    build(stigao,koliko-1);
    graf[tr].y=stigao;
    stigao++;
    build(stigao,koliko-1);
}
pair<int,int> get(int tr)
{
    if(flipped[tr])
    {
        flipped[tr]=0;
        if(graf[tr].y==-1)
        {
            return {tr,1};
        }
        else
            return get(graf[tr].y);
    }
    else
    {
        flipped[tr]=1;
        if(graf[tr].x==-1)
        {
            return {tr,0};
        }
        else
            return get(graf[tr].x);
    }
}
void construct(int i,vector<int> d)
{
    if(d.size()==0)
        d.pb(0);
    if(d.size()==1)
    {
        graf[i].x=d[0];
        return;
    }
    int sz=1;
    while((1<<sz)<(int)d.size())
        sz++;
    graf[i].x=stigao;
    stigao++;
    build(stigao,sz-1);
    for(int i=0;i<(1<<sz);i++)
    {
        pair<int,int> t=get(graf[i].x);
        if(t.s)
        {
            if(i==(1<<sz)-1)
            {
                graf[t.f].y=d.back();
                continue;
            }
            if(i>=(int)d.size()-1)
                graf[t.f].y=graf[i].x;
            else
                graf[t.f].y=d[i];
        }
        else
        {
            if(i==(1<<sz)-1)
            {
                graf[t.f].x=d.back();
                continue;
            }
            if(i>=(int)d.size()-1)
                graf[t.f].x=graf[i].x;
            else
                graf[t.f].x=d[i];
        }
    }

}
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];
    graf[a.back()].x=0;
    for(int i=1;i<n;i++)
        ide[a[i-1]].pb(a[i]);
    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.0 / 2.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	5068 KB	Output is correct
2	Correct	48 ms	11208 KB	Output is correct
3	Correct	39 ms	9912 KB	Output is correct
4	Correct	4 ms	5068 KB	Output is correct
5	Correct	23 ms	8620 KB	Output is correct
6	Correct	69 ms	12620 KB	Output is correct
7	Correct	4 ms	5068 KB	Output is correct

Subtask #2
0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	5068 KB	Output is correct
2	Correct	48 ms	11208 KB	Output is correct
3	Correct	39 ms	9912 KB	Output is correct
4	Correct	4 ms	5068 KB	Output is correct
5	Correct	23 ms	8620 KB	Output is correct
6	Correct	69 ms	12620 KB	Output is correct
7	Correct	4 ms	5068 KB	Output is correct
8	Incorrect	107 ms	11984 KB	wrong motion
9	Halted	0 ms	0 KB	-

Subtask #3
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	5068 KB	Output is correct
2	Correct	48 ms	11208 KB	Output is correct
3	Correct	39 ms	9912 KB	Output is correct
4	Correct	4 ms	5068 KB	Output is correct
5	Correct	23 ms	8620 KB	Output is correct
6	Correct	69 ms	12620 KB	Output is correct
7	Correct	4 ms	5068 KB	Output is correct
8	Incorrect	107 ms	11984 KB	wrong motion
9	Halted	0 ms	0 KB	-