oj.uz

Submission #101820

# Submission time Handle Problem Language Result Execution time Memory
101820 2019-03-20T12:05:54 Z daniel920712 Mechanical Doll (IOI18_doll) C++14
2 / 100
 68 ms 8276 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};
void build(int N,int here,int n,int all,int x)
{
    //printf("%d %d %d %d\n",N,here,n,all);
    if(n==all-1)
    {
        if(N%2) Y[-here]=x;
        else X[-here]=x;
        return ;
    }
    if(N%2)
    {
        if(!Y[-here])
        {
            Y[-here]=-now;
            now++;
        }
        build(N/2,Y[-here],n,all,x);
    }
    else
    {
        if(!X[-here])
        {
            X[-here]=-now;
            now++;
        }
        build(N/2,X[-here],n,all,x);
    }
}
void create_circuit(int M, vector < int > A)
{
    int N=A.size(),i,temp;
    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);
    for(i=0;i<N;i++)
    {
        if(con[A[i]]==1)
        {
            C[A[i]]=A[i+1];
        }
        else
        {
            if(!This[A[i]])
            {
                C[A[i]]=-now;
                now++;
                t[A[i]]=0;
                temp=1;
                while(temp<con[A[i]])
                {
                    temp*=2;
                    t[A[i]]++;
                }
                start[A[i]]=temp-con[A[i]];
                printf("%d %d %d %d\n",temp,A[i],t[A[i]],C[A[i]]);
                for(int j=0;j<temp;j++) build(j,C[A[i]],0,t[A[i]],A[i+1]);

            }
            build(This[A[i]]+start[A[i]],C[A[i]],0,t[A[i]],A[i+1]);
            This[A[i]]++;
        }




    }

    //for(auto i:C) printf("%d ",i);
    //printf("\n");
    //for(i=1;i<now;i++) printf("%d %d\n",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);

}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 23 ms 2496 KB Output is correct
3 Correct 26 ms 1936 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 13 ms 1852 KB Output is correct
6 Correct 28 ms 2732 KB Output is correct
7 Correct 1 ms 204 KB Output is correct

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 23 ms 2496 KB Output is correct
3 Correct 26 ms 1936 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 13 ms 1852 KB Output is correct
6 Correct 28 ms 2732 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Incorrect 68 ms 7196 KB DO NOT PRINT ANYTHING TO STANDARD OUTPUT
9 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 23 ms 2496 KB Output is correct
3 Correct 26 ms 1936 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 13 ms 1852 KB Output is correct
6 Correct 28 ms 2732 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Incorrect 68 ms 7196 KB DO NOT PRINT ANYTHING TO STANDARD OUTPUT
9 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 12 ms 8276 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Runtime error 13 ms 8236 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 56.0

# Verdict Execution time Memory Grader output
1 Runtime error 13 ms 8236 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -