oj.uz

Submission #109482

# Submission time Handle Problem Language Result Execution time Memory
109482 2019-05-06T17:00:47 Z nikolapesic2802 Mechanical Doll (IOI18_doll) C++14
81.1504 / 100
 188 ms 18072 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,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.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7328 KB Output is correct
2 Correct 44 ms 13496 KB Output is correct
3 Correct 44 ms 12200 KB Output is correct
4 Correct 7 ms 7244 KB Output is correct
5 Correct 25 ms 10948 KB Output is correct
6 Correct 80 ms 14884 KB Output is correct
7 Correct 7 ms 7336 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7328 KB Output is correct
2 Correct 44 ms 13496 KB Output is correct
3 Correct 44 ms 12200 KB Output is correct
4 Correct 7 ms 7244 KB Output is correct
5 Correct 25 ms 10948 KB Output is correct
6 Correct 80 ms 14884 KB Output is correct
7 Correct 7 ms 7336 KB Output is correct
8 Correct 90 ms 14256 KB Output is correct
9 Correct 115 ms 15660 KB Output is correct
10 Correct 155 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 7328 KB Output is correct
2 Correct 44 ms 13496 KB Output is correct
3 Correct 44 ms 12200 KB Output is correct
4 Correct 7 ms 7244 KB Output is correct
5 Correct 25 ms 10948 KB Output is correct
6 Correct 80 ms 14884 KB Output is correct
7 Correct 7 ms 7336 KB Output is correct
8 Correct 90 ms 14256 KB Output is correct
9 Correct 115 ms 15660 KB Output is correct
10 Correct 155 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 173 ms 18044 KB Output is correct
15 Correct 88 ms 12832 KB Output is correct
16 Correct 132 ms 15660 KB Output is correct
17 Correct 6 ms 7244 KB Output is correct
18 Correct 6 ms 7244 KB Output is correct
19 Correct 6 ms 7244 KB Output is correct
20 Correct 177 ms 17708 KB Output is correct
21 Correct 5 ms 7244 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 7296 KB Output is correct
2 Correct 8 ms 7244 KB Output is correct
3 Correct 6 ms 7244 KB Output is correct
4 Correct 6 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 5 ms 7244 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7244 KB Output is correct
2 Correct 25 ms 11900 KB Output is correct
3 Correct 30 ms 14436 KB Output is correct
4 Correct 93 ms 15516 KB Output is correct

Subtask #6
37.150369844 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7244 KB Output is correct
2 Correct 25 ms 11900 KB Output is correct
3 Correct 30 ms 14436 KB Output is correct
4 Correct 93 ms 15516 KB Output is correct
5 Partially correct 172 ms 18072 KB Output is partially correct
6 Partially correct 158 ms 17452 KB Output is partially correct
7 Partially correct 156 ms 17648 KB Output is partially correct
8 Partially correct 188 ms 16780 KB Output is partially correct
9 Correct 71 ms 11768 KB Output is correct
10 Correct 137 ms 16040 KB Output is correct
11 Partially correct 125 ms 15648 KB Output is partially correct
12 Partially correct 91 ms 12836 KB Output is partially correct
13 Partially correct 107 ms 14112 KB Output is partially correct
14 Partially correct 118 ms 14112 KB Output is partially correct
15 Partially correct 111 ms 14440 KB Output is partially correct
16 Partially correct 7 ms 7496 KB Output is partially correct
17 Partially correct 96 ms 12988 KB Output is partially correct
18 Partially correct 92 ms 12920 KB Output is partially correct
19 Partially correct 102 ms 13708 KB Output is partially correct
20 Partially correct 148 ms 16032 KB Output is partially correct
21 Partially correct 164 ms 16952 KB Output is partially correct
22 Partially correct 150 ms 16176 KB Output is partially correct