답안 #101809

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
101809	2019-03-20T11:17:01 Z	daniel920712	자동 인형 (IOI18_doll)	C++14	6 / 100	71 ms	8084 KB

doll

#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];
vector < int > C,x,y;
int X[1000005];
int Y[1000005];
void create_circuit(int M, vector < int > A)
{
    int N=A.size(),now=1,i;
    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(con[A[i]]==2)
        {
            if(This[A[i]]==0)
            {
                C[A[i]]=-(now);
                X[now]=A[i+1];
                now++;
            }
            else Y[-C[A[i]]]=A[i+1];
            This[A[i]]++;
        }
        else if(con[A[i]]==4)
        {
            //printf("%d %d %d\n",i,A[i],This[A[i]]);
            if(This[A[i]]==0)
            {
                C[A[i]]=-now;
                X[now]=-(now+1);
                Y[now]=-(now+2);
                now+=3;
                m[A[i]]=X[-C[A[i]]];
                n[A[i]]=Y[-C[A[i]]];
                //printf("a:%d %d\n",m[A[i]],n[A[i]]);
                X[-m[A[i]]]=A[i+1];
            }
            else if(This[A[i]]==1) Y[-m[A[i]]]=A[i+1];
            else if(This[A[i]]==2) X[-n[A[i]]]=A[i+1];
            else if(This[A[i]]==3) Y[-n[A[i]]]=A[i+1];
            This[A[i]]++;
        }
        /*else
        {
            if(This[A[i]]==0)
            {
                C[A[i]]=-now;
                X[now]=-(now+1);
                Y[now]=-(now+2);
                now+=3;
                m[A[i]]=X[-C[A[i]]];
                n[A[i]]=Y[-C[A[i]]];
                X[-m[A[i]]]=A[i+1];
                Y[-m[A[i]]]=C[A[i]];
            }
            else if(This[A[i]]==1) X[-n[A[i]]]=A[i+1];
            else if(This[A[i]]==2) Y[-n[A[i]]]=A[i+1];
            This[A[i]]++;
        }*/



    }

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

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	24 ms	2476 KB	Output is correct
3	Correct	18 ms	1980 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	12 ms	1804 KB	Output is correct
6	Correct	26 ms	2776 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct

Subtask #2
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	24 ms	2476 KB	Output is correct
3	Correct	18 ms	1980 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	12 ms	1804 KB	Output is correct
6	Correct	26 ms	2776 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	42 ms	5540 KB	Output is correct
9	Correct	52 ms	5280 KB	Output is correct
10	Correct	71 ms	8084 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	2 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct

Subtask #3
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	24 ms	2476 KB	Output is correct
3	Correct	18 ms	1980 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	12 ms	1804 KB	Output is correct
6	Correct	26 ms	2776 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	42 ms	5540 KB	Output is correct
9	Correct	52 ms	5280 KB	Output is correct
10	Correct	71 ms	8084 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	2 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Incorrect	40 ms	3260 KB	wrong motion
15	Halted	0 ms	0 KB	-