oj.uz

Submission #101908

# Submission time Handle Problem Language Result Execution time Memory
101908 2019-03-21T01:39:34 Z daniel920712 Mechanical Doll (IOI18_doll) C++14
47 / 100
 204 ms 13836 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 here,int a,int b)
{
    //printf("%d %d\n",N,here);
    if(N==2)
    {
        X[-here]=a;
        Y[-here]=b;
    }
    else if(N%2==0)
    {
        X[-here]=(-now);
        now++;

        Y[-here]=(-now);
        now++;
        build(N/2,X[-here],a,b);
        build(N/2,Y[-here],0,0);
    }
    else
    {
        X[-here]=(-now);
        now++;

        Y[-here]=(-now);
        now++;

        build(N/2+1,X[-here],a,b);
        build(N/2+1,Y[-here],here,0);
    }
}
void New(int here,int what)
{
    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;
    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);
    now++;
    build(N,-1,0,0);

    for(i=0;i<N;i++)
    {
        C[A[i]]=-1;
        New(C[A[i]],A[i+1]);
    }
    //printf("a %d\n",now-1);
    //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);

}

Compilation message

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

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

Subtask #5
9.0000000036 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 204 KB Output is partially correct
2 Correct 73 ms 7076 KB Output is correct
3 Partially correct 149 ms 11316 KB Output is partially correct
4 Partially correct 148 ms 12104 KB Output is partially correct

Subtask #6
28.0000000112 / 56.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 204 KB Output is partially correct
2 Correct 73 ms 7076 KB Output is correct
3 Partially correct 149 ms 11316 KB Output is partially correct
4 Partially correct 148 ms 12104 KB Output is partially correct
5 Partially correct 155 ms 13836 KB Output is partially correct
6 Partially correct 145 ms 13424 KB Output is partially correct
7 Partially correct 172 ms 13344 KB Output is partially correct
8 Partially correct 204 ms 12936 KB Output is partially correct
9 Partially correct 122 ms 11360 KB Output is partially correct
10 Partially correct 156 ms 12904 KB Output is partially correct
11 Partially correct 160 ms 12492 KB Output is partially correct
12 Partially correct 125 ms 11648 KB Output is partially correct
13 Correct 99 ms 7708 KB Output is correct
14 Partially correct 127 ms 12076 KB Output is partially correct
15 Partially correct 121 ms 12220 KB Output is partially correct
16 Partially correct 4 ms 716 KB Output is partially correct
17 Correct 80 ms 7364 KB Output is correct
18 Correct 77 ms 7312 KB Output is correct
19 Partially correct 126 ms 11688 KB Output is partially correct
20 Partially correct 151 ms 12780 KB Output is partially correct
21 Partially correct 167 ms 12444 KB Output is partially correct
22 Partially correct 185 ms 12556 KB Output is partially correct