oj.uz

Submission #109471

# Submission time Handle Problem Language Result Execution time Memory
109471 2019-05-06T16:29:07 Z nikolapesic2802 Mechanical Doll (IOI18_doll) C++14
53 / 100
 228 ms 20204 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);
int stigao;
void build(int tr,int koliko)
{
    if(koliko==0)
        return;
    graf[tr].x=stigao;
    stigao++;
    build(stigao-1,koliko-1);
    graf[tr].y=stigao;
    stigao++;
    build(stigao-1,koliko-1);
}
pair<int,int> get(int tr)
{
    //printf("Getujem %i %i  %i %i\n",tr,flipped[tr],graf[tr].x,graf[tr].y);
    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)
{
    //cout << d << i << endl;
    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-1,sz-1);
    for(int j=0;j<(1<<sz);j++)
    {
        pair<int,int> t=get(graf[i].x);
        if(t.s)
        {
            if(j==(1<<sz)-1)
            {
                graf[t.f].y=d.back();
                continue;
            }
            if(j>=(int)d.size()-1)
                graf[t.f].y=graf[i].x;
            else
                graf[t.f].y=d[j];
        }
        else
        {
            if(j==(1<<sz)-1)
            {
                graf[t.f].x=d.back();
                continue;
            }
            if(j>=(int)d.size()-1)
                graf[t.f].x=graf[i].x;
            else
                graf[t.f].x=d[j];
        }
    }
    /*for(int i=0;i<NMAX;i++)
    {
        printf("%i: %i %i\n",i,graf[i].x,graf[i].y);
    }*/
}
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.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7244 KB Output is correct
2 Correct 67 ms 13508 KB Output is correct
3 Correct 42 ms 12228 KB Output is correct
4 Correct 7 ms 7244 KB Output is correct
5 Correct 29 ms 10948 KB Output is correct
6 Correct 63 ms 14788 KB Output is correct
7 Correct 5 ms 7220 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7244 KB Output is correct
2 Correct 67 ms 13508 KB Output is correct
3 Correct 42 ms 12228 KB Output is correct
4 Correct 7 ms 7244 KB Output is correct
5 Correct 29 ms 10948 KB Output is correct
6 Correct 63 ms 14788 KB Output is correct
7 Correct 5 ms 7220 KB Output is correct
8 Correct 69 ms 14404 KB Output is correct
9 Correct 115 ms 15660 KB Output is correct
10 Correct 150 ms 17936 KB Output is correct
11 Correct 6 ms 7244 KB Output is correct
12 Correct 6 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 5 ms 7244 KB Output is correct
2 Correct 67 ms 13508 KB Output is correct
3 Correct 42 ms 12228 KB Output is correct
4 Correct 7 ms 7244 KB Output is correct
5 Correct 29 ms 10948 KB Output is correct
6 Correct 63 ms 14788 KB Output is correct
7 Correct 5 ms 7220 KB Output is correct
8 Correct 69 ms 14404 KB Output is correct
9 Correct 115 ms 15660 KB Output is correct
10 Correct 150 ms 17936 KB Output is correct
11 Correct 6 ms 7244 KB Output is correct
12 Correct 6 ms 7244 KB Output is correct
13 Correct 6 ms 7244 KB Output is correct
14 Correct 180 ms 18048 KB Output is correct
15 Correct 81 ms 12860 KB Output is correct
16 Correct 107 ms 15648 KB Output is correct
17 Correct 5 ms 7244 KB Output is correct
18 Correct 5 ms 7292 KB Output is correct
19 Correct 6 ms 7244 KB Output is correct
20 Correct 138 ms 17736 KB Output is correct
21 Correct 6 ms 7244 KB Output is correct
22 Correct 6 ms 7244 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 7296 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
9.0000000036 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 6 ms 7244 KB Output is partially correct
2 Correct 107 ms 12396 KB Output is correct
3 Partially correct 174 ms 15096 KB Output is partially correct
4 Partially correct 161 ms 16084 KB Output is partially correct

Subtask #6
28.0000000112 / 56.0

# Verdict Execution time Memory Grader output
1 Partially correct 6 ms 7244 KB Output is partially correct
2 Correct 107 ms 12396 KB Output is correct
3 Partially correct 174 ms 15096 KB Output is partially correct
4 Partially correct 161 ms 16084 KB Output is partially correct
5 Partially correct 133 ms 19140 KB Output is partially correct
6 Partially correct 164 ms 19496 KB Output is partially correct
7 Partially correct 195 ms 19444 KB Output is partially correct
8 Partially correct 174 ms 19820 KB Output is partially correct
9 Partially correct 154 ms 15792 KB Output is partially correct
10 Partially correct 228 ms 20072 KB Output is partially correct
11 Partially correct 179 ms 20204 KB Output is partially correct
12 Partially correct 110 ms 15848 KB Output is partially correct
13 Partially correct 124 ms 15552 KB Output is partially correct
14 Partially correct 95 ms 15260 KB Output is partially correct
15 Partially correct 112 ms 15112 KB Output is partially correct
16 Partially correct 7 ms 7500 KB Output is partially correct
17 Partially correct 95 ms 14196 KB Output is partially correct
18 Partially correct 99 ms 14248 KB Output is partially correct
19 Partially correct 120 ms 14640 KB Output is partially correct
20 Partially correct 112 ms 16812 KB Output is partially correct
21 Partially correct 133 ms 18616 KB Output is partially correct
22 Partially correct 142 ms 16168 KB Output is partially correct