oj.uz

Submission #101926

# Submission time Handle Problem Language Result Execution time Memory
101926 2019-03-21T05:47:39 Z daniel920712 Mechanical Doll (IOI18_doll) C++14
10 / 100
 1 ms 316 KB 
#include "doll.h"
#include <vector>
#include <stdio.h>

using namespace std;
int con[1000005]={0};
int This[1000005]={0};
int m[1000005];
int n[1000005];
int start[1000005]={0};
vector < int > C,x,y;
int X[1000005]={0};
int Y[1000005]={0};
int now=1;
int t[1000005]={0};
int how[1000005]={0};
void build(int N,int one,int here)
{
    //printf("%d %d %d\n",N,one,here);

    if(one==1)
    {
        Y[-here]=0;
        if(N==2) X[-here]=0;
        else X[-here]=-1;
    }
    else
    {
        if(N<=one) X[-here]=-1;
        else
        {
            X[-here]=(-now);
            now++;
        }
        Y[-here]=(-now);
        now++;

        build(one,one/2,Y[-here]);
        if(N>one) build(N-one,one/2,X[-here]);

    }
}
void New(int here,int what)
{
    //printf("%d ",here);
    if(how[-here]%2==0)
    {
        how[-here]++;
        if(X[-here]) New(X[-here],what);
        else X[-here]=what;
    }
    else
    {
        how[-here]++;
        if(Y[-here]) New(Y[-here],what);
        else Y[-here]=what;
    }
}
void create_circuit(int M, vector < int > A)
{
    int N=A.size(),i,temp,t=1;
    C.push_back(A[0]);
    for(i=1;i<=M;i++) C.push_back(i);
    for(i=0;i<N;i++) con[A[i]]++;
    A.push_back(0);


    while(t<N) t*=2;

    now++;
    build(N,t/2,-1);
    for(i=0;i<N;i++)
    {
        C[A[i]]=-1;
        //printf("a%d: ",i);
        New(C[A[i]],A[i+1]);
        //printf("\n");
    }


    //printf("a %d\n",now-1);
    //for(auto i:C) printf("%d ",i);
    //printf("\n");
    //for(i=1;i<now;i++) printf("%d %d %d\n",-i,X[i],Y[i]);
    for(i=1;i<now;i++) x.push_back(X[i]);
    for(i=1;i<now;i++) y.push_back(Y[i]);
    answer(C,x,y);

}

Compilation message

doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:61:22: warning: unused variable 'temp' [-Wunused-variable]
   61 |     int N=A.size(),i,temp,t=1;
      |                      ^~~~

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB state 'Y'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB state 'Y'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB state 'Y'
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 256 KB Output is correct

Subtask #5
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 316 KB state 'Y'
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 56.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 316 KB state 'Y'
2 Halted 0 ms 0 KB -