oj.uz

Submission #101932

# Submission time Handle Problem Language Result Execution time Memory
101932 2019-03-21T06:03:30 Z daniel920712 Mechanical Doll (IOI18_doll) C++14
85.553 / 100
 137 ms 12900 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,int what)
{
    if(one==1)
    {
        Y[-here]=0;
        if(N==2) X[-here]=0;
        else X[-here]=what;
    }
    else
    {
        if(N<=one) X[-here]=what;
        else
        {
            X[-here]=(-now);
            now++;
        }
        Y[-here]=(-now);
        now++;
        if(N>one)
        {
            build(N-one,one/2,X[-here],what);
            build(one,one/2,Y[-here],what);
        }
        else build(N,one/2,Y[-here],what);

    }
}
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);
    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++;
                temp=1;
                while(temp<con[A[i]]) temp*=2;
                build(con[A[i]],temp/2,C[A[i]],C[A[i]]);
            }
            This[A[i]]++;
            New(C[A[i]],A[i+1]);
        }
    }

    //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:62:27: warning: unused variable 't' [-Wunused-variable]
   62 |     int N=A.size(),i,temp,t=1;
      |                           ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 41 ms 2476 KB Output is correct
3 Correct 18 ms 1980 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 13 ms 1872 KB Output is correct
6 Correct 28 ms 2732 KB Output is correct
7 Correct 1 ms 204 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 41 ms 2476 KB Output is correct
3 Correct 18 ms 1980 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 13 ms 1872 KB Output is correct
6 Correct 28 ms 2732 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 46 ms 5788 KB Output is correct
9 Correct 62 ms 5428 KB Output is correct
10 Correct 73 ms 8544 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 41 ms 2476 KB Output is correct
3 Correct 18 ms 1980 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 13 ms 1872 KB Output is correct
6 Correct 28 ms 2732 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 46 ms 5788 KB Output is correct
9 Correct 62 ms 5428 KB Output is correct
10 Correct 73 ms 8544 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 135 ms 12508 KB Output is correct
15 Correct 54 ms 6376 KB Output is correct
16 Correct 82 ms 9504 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 87 ms 10472 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct

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 332 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 204 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 80 ms 7164 KB Output is correct
3 Correct 81 ms 6576 KB Output is correct
4 Correct 121 ms 10020 KB Output is correct

Subtask #6
41.5530038336 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 80 ms 7164 KB Output is correct
3 Correct 81 ms 6576 KB Output is correct
4 Correct 121 ms 10020 KB Output is correct
5 Partially correct 103 ms 12900 KB Output is partially correct
6 Partially correct 117 ms 12624 KB Output is partially correct
7 Partially correct 120 ms 12896 KB Output is partially correct
8 Partially correct 125 ms 11784 KB Output is partially correct
9 Partially correct 83 ms 6568 KB Output is partially correct
10 Partially correct 137 ms 10844 KB Output is partially correct
11 Partially correct 117 ms 9976 KB Output is partially correct
12 Partially correct 78 ms 6124 KB Output is partially correct
13 Partially correct 69 ms 7740 KB Output is partially correct
14 Partially correct 89 ms 7744 KB Output is partially correct
15 Partially correct 72 ms 7900 KB Output is partially correct
16 Partially correct 3 ms 588 KB Output is partially correct
17 Partially correct 72 ms 6176 KB Output is partially correct
18 Partially correct 70 ms 6828 KB Output is partially correct
19 Partially correct 85 ms 6156 KB Output is partially correct
20 Partially correct 113 ms 10316 KB Output is partially correct
21 Partially correct 115 ms 9828 KB Output is partially correct
22 Partially correct 105 ms 9996 KB Output is partially correct