oj.uz

Submission #121349

# Submission time Handle Problem Language Result Execution time Memory
121349 2019-06-26T11:52:45 Z MKopchev Mechanical Doll (IOI18_doll) C++14
37 / 100
 150 ms 9940 KB 
#include "doll.h"
#include<bits/stdc++.h>
using namespace std;
/*
void answer(vector<int> C,vector<int> x,vector<int> y)
{
    cout<<"C: ";for(auto k:C)cout<<k<<" ";cout<<endl;
    int SZ=x.size();
    cout<<"switches "<<endl;
    for(int i=0;i<SZ;i++)
    {
        cout<<x[i]<<" "<<y[i]<<endl;
    }
    cout<<"---"<<endl;
    //exit(0);
}
*/
vector<int> x,y;

vector<int> order;

bool state[1'000'000];

int open;

void solve(int run,int where)
{
    //cout<<"solve "<<run<<" "<<where<<endl;
    where=-where;
    if(where>=open/2)
    {
        if(run<order.size())
        {
            if(state[where-1]==0)
            {
                x[where-1]=order[run];
                state[where-1]=!state[where-1];
            }
            else
            {
                y[where-1]=order[run];
                state[where-1]=!state[where-1];
            }
            return;
        }

        if(run==open-1)
        {
            y[where-1]=0;
            return;
        }

        state[where-1]=!state[where-1];
        return;
    }

    if(state[where-1]==0)
    {
        state[where-1]=1;
        solve(run,x[where-1]);
    }
    else
    {
        state[where-1]=0;
        solve(run,y[where-1]);
    }
}
void create_circuit(int M, vector<int> A)
{
    vector<int> C={};
    for(int i=0;i<=M;i++)
        C.push_back(-1);

    open=2;
    while(open<=A.size())open=open*2;

    for(int i=1;i<open;i++)
    {
        x.push_back(-1);
        y.push_back(-1);
    }
    for(int i=1;i<open/2;i++)
    {
        x[i-1]=-(2*i);
        y[i-1]=-(2*i+1);
    }
    order=A;

    //answer(C,x,y);

    for(int i=0;i<open;i++)
        solve(i,-1);

    answer(C,x,y);
}
/*
int main()
{
    create_circuit(4, {1, 2, 1,3});
}
*/

Compilation message

doll.cpp: In function 'void solve(int, int)':
doll.cpp:32:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |         if(run<order.size())
      |            ~~~^~~~~~~~~~~~~
doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:75:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |     while(open<=A.size())open=open*2;
      |           ~~~~^~~~~~~~~~

Subtask #1
0 / 2.0

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

Subtask #2
0 / 4.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

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

Subtask #5
9.0 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 204 KB Output is partially correct
2 Partially correct 132 ms 8252 KB Output is partially correct
3 Partially correct 134 ms 8364 KB Output is partially correct
4 Partially correct 136 ms 9172 KB Output is partially correct

Subtask #6
28.0 / 56.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 204 KB Output is partially correct
2 Partially correct 132 ms 8252 KB Output is partially correct
3 Partially correct 134 ms 8364 KB Output is partially correct
4 Partially correct 136 ms 9172 KB Output is partially correct
5 Partially correct 138 ms 9940 KB Output is partially correct
6 Partially correct 147 ms 9760 KB Output is partially correct
7 Partially correct 143 ms 9888 KB Output is partially correct
8 Partially correct 136 ms 9660 KB Output is partially correct
9 Partially correct 115 ms 8356 KB Output is partially correct
10 Partially correct 136 ms 9612 KB Output is partially correct
11 Partially correct 126 ms 9280 KB Output is partially correct
12 Partially correct 124 ms 8512 KB Output is partially correct
13 Partially correct 117 ms 8960 KB Output is partially correct
14 Partially correct 150 ms 8920 KB Output is partially correct
15 Partially correct 122 ms 9108 KB Output is partially correct
16 Partially correct 4 ms 588 KB Output is partially correct
17 Correct 66 ms 5148 KB Output is correct
18 Partially correct 120 ms 8560 KB Output is partially correct
19 Partially correct 124 ms 8500 KB Output is partially correct
20 Partially correct 144 ms 9412 KB Output is partially correct
21 Partially correct 128 ms 9316 KB Output is partially correct
22 Partially correct 130 ms 9236 KB Output is partially correct