Submission #75101

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
75101	2018-09-08T10:44:28 Z	faustaadp	Mechanical Doll (IOI18_doll)	C++17	16 / 100	151 ms	15716 KB

doll

#include "doll.h"
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
ll i,Sa=0;
vector<ll> v[202020];
void create_circuit(int M, std::vector<int> A) {
    int N = A.size();
    std::vector<int> C(M + 1),X,Y;
    v[0].pb(A[i]);
    for(i=0;i<N-1;i++)
        v[A[i]].pb(A[i+1]);
    v[A[N-1]].pb(0);
    for(i=0;i<=M;i++)
    {
        if(v[i].size()==1)
            C[i]=v[i][0];
        else
        if(v[i].size()==2)
        {
            Sa++;
            C[i]=-Sa;
            X.pb(v[i][0]);
            Y.pb(v[i][1]);
        }
        else
        if(v[i].size()==3)
        {
            Sa++;
            C[i]=-Sa;
            X.pb(-Sa-1);
            Y.pb(-Sa-2);
            X.pb(v[i][0]);
            Y.pb(-Sa);
            X.pb(v[i][1]);
            Y.pb(v[i][2]);
            Sa+=2;
        }
        else
        if(v[i].size()==4)
        {
            Sa++;
            C[i]=-Sa;
            X.pb(-Sa-1);
            Y.pb(-Sa-2);
            X.pb(v[i][0]);
            Y.pb(v[i][2]);
            X.pb(v[i][1]);
            Y.pb(v[i][3]);
            Sa+=2;
        }
    }
   // for(i=0;i<=M;i++)cout<<i<<" "<<C[i]<<"\n";
   // for(i=0;i<X.size();i++)cout<<-i-1<<" "<<X[i]<<" "<<Y[i]<<"\n";
    answer(C, X, Y);
}

Subtask #1
2.0 / 2.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	4940 KB	Output is correct
2	Correct	48 ms	8760 KB	Output is correct
3	Correct	38 ms	8324 KB	Output is correct
4	Correct	5 ms	4992 KB	Output is correct
5	Correct	22 ms	6220 KB	Output is correct
6	Correct	45 ms	10092 KB	Output is correct
7	Correct	5 ms	4940 KB	Output is correct

Subtask #2
4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	4940 KB	Output is correct
2	Correct	48 ms	8760 KB	Output is correct
3	Correct	38 ms	8324 KB	Output is correct
4	Correct	5 ms	4992 KB	Output is correct
5	Correct	22 ms	6220 KB	Output is correct
6	Correct	45 ms	10092 KB	Output is correct
7	Correct	5 ms	4940 KB	Output is correct
8	Correct	70 ms	10436 KB	Output is correct
9	Correct	80 ms	10940 KB	Output is correct
10	Correct	142 ms	13400 KB	Output is correct
11	Correct	4 ms	4940 KB	Output is correct
12	Correct	5 ms	4940 KB	Output is correct
13	Correct	4 ms	4940 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	4940 KB	Output is correct
2	Correct	48 ms	8760 KB	Output is correct
3	Correct	38 ms	8324 KB	Output is correct
4	Correct	5 ms	4992 KB	Output is correct
5	Correct	22 ms	6220 KB	Output is correct
6	Correct	45 ms	10092 KB	Output is correct
7	Correct	5 ms	4940 KB	Output is correct
8	Correct	70 ms	10436 KB	Output is correct
9	Correct	80 ms	10940 KB	Output is correct
10	Correct	142 ms	13400 KB	Output is correct
11	Correct	4 ms	4940 KB	Output is correct
12	Correct	5 ms	4940 KB	Output is correct
13	Correct	4 ms	4940 KB	Output is correct
14	Correct	151 ms	15716 KB	Output is correct
15	Correct	82 ms	10484 KB	Output is correct
16	Correct	116 ms	13304 KB	Output is correct
17	Correct	5 ms	4940 KB	Output is correct
18	Correct	4 ms	4940 KB	Output is correct
19	Correct	5 ms	4940 KB	Output is correct
20	Correct	136 ms	14488 KB	Output is correct
21	Correct	4 ms	5012 KB	Output is correct
22	Correct	6 ms	4940 KB	Output is correct