Submission #101790

# Submission time Handle Problem Language Result Execution time Memory
101790 2019-03-20T08:52:43 Z daniel920712 Mechanical Doll (IOI18_doll) C++14
6 / 100
74 ms 8740 KB
#include "doll.h"
#include <vector>
#include <stdio.h>
using namespace std;
int con[1000005]={0};
int This[1000005]={0};
vector < int > C,X,Y,x,y;
void create_circuit(int M, vector < int > A)
{
    X.push_back(0);
    Y.push_back(0);
    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]])
        {
            if(This[A[i]]==0)
            {
                C[A[i]]=-(now);
                now++;
                X.push_back(A[i+1]);
                Y.push_back(A[i+1]);
            }
            else Y[-C[A[i]]]=A[i+1];

            This[A[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);

}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 23 ms 2464 KB Output is correct
3 Correct 18 ms 1948 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 13 ms 1740 KB Output is correct
6 Correct 29 ms 2796 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 23 ms 2464 KB Output is correct
3 Correct 18 ms 1948 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 13 ms 1740 KB Output is correct
6 Correct 29 ms 2796 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 48 ms 5424 KB Output is correct
9 Correct 46 ms 5136 KB Output is correct
10 Correct 74 ms 8740 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 23 ms 2464 KB Output is correct
3 Correct 18 ms 1948 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 13 ms 1740 KB Output is correct
6 Correct 29 ms 2796 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 48 ms 5424 KB Output is correct
9 Correct 46 ms 5136 KB Output is correct
10 Correct 74 ms 8740 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Incorrect 60 ms 6280 KB wrong motion
15 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB wrong motion
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB wrong motion
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB wrong motion
2 Halted 0 ms 0 KB -