oj.uz

Submission #101927

# Submission time Handle Problem Language Result Execution time Memory
101927 2019-03-21T05:52:38 Z daniel920712 Mechanical Doll (IOI18_doll) C++14
84 / 100
 465 ms 262144 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++;


        if(N>one)
        {
            build(N-one,one/2,X[-here]);
            build(one,one/2,Y[-here]);
        }
        else build(N,one/2,Y[-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:66:22: warning: unused variable 'temp' [-Wunused-variable]
   66 |     int N=A.size(),i,temp,t=1;
      |                      ^~~~

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 50 ms 5460 KB Output is correct
3 Correct 54 ms 4948 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 15 ms 1820 KB Output is correct
6 Correct 87 ms 7320 KB Output is correct
7 Runtime error 465 ms 262144 KB Execution killed with signal 11

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 50 ms 5460 KB Output is correct
3 Correct 54 ms 4948 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 15 ms 1820 KB Output is correct
6 Correct 87 ms 7320 KB Output is correct
7 Runtime error 465 ms 262144 KB Execution killed with signal 11

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 50 ms 5460 KB Output is correct
3 Correct 54 ms 4948 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 15 ms 1820 KB Output is correct
6 Correct 87 ms 7320 KB Output is correct
7 Runtime error 465 ms 262144 KB Execution killed with signal 11

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 2 ms 204 KB Output is correct
5 Correct 2 ms 204 KB Output is correct
6 Correct 2 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 85 ms 7092 KB Output is correct
3 Correct 86 ms 6592 KB Output is correct
4 Correct 116 ms 9972 KB Output is correct

Subtask #6
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 85 ms 7092 KB Output is correct
3 Correct 86 ms 6592 KB Output is correct
4 Correct 116 ms 9972 KB Output is correct
5 Correct 140 ms 11504 KB Output is correct
6 Correct 138 ms 11084 KB Output is correct
7 Correct 132 ms 11172 KB Output is correct
8 Correct 122 ms 10780 KB Output is correct
9 Correct 82 ms 6696 KB Output is correct
10 Correct 142 ms 10708 KB Output is correct
11 Correct 133 ms 10332 KB Output is correct
12 Correct 84 ms 6852 KB Output is correct
13 Correct 88 ms 7716 KB Output is correct
14 Correct 85 ms 7400 KB Output is correct
15 Correct 93 ms 7596 KB Output is correct
16 Correct 3 ms 460 KB Output is correct
17 Correct 85 ms 7444 KB Output is correct
18 Correct 79 ms 7328 KB Output is correct
19 Correct 104 ms 6828 KB Output is correct
20 Correct 136 ms 10648 KB Output is correct
21 Correct 148 ms 10260 KB Output is correct
22 Correct 127 ms 10436 KB Output is correct