Submission #1013199

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1013199	2024-07-03T09:45:22 Z	c2zi6	Mechanical Doll (IOI18_doll)	C++14	2 / 100	13 ms	3160 KB

doll

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "doll.h"

void create_circuit(int M, VI A) {
    VI C, X, Y;
    C = VI(M+1);

    int u = 0;
    for (int x : A) {
        C[u] = x;
        u = x;
    }

    /*for (int x : C) cout << x << " "; cout << endl;*/
    answer(C, X, Y);
}

Subtask #1
2.0 / 2.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	11 ms	2392 KB	Output is correct
3	Correct	8 ms	2176 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	5 ms	1372 KB	Output is correct
6	Correct	12 ms	2908 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct

Subtask #2
0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	11 ms	2392 KB	Output is correct
3	Correct	8 ms	2176 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	5 ms	1372 KB	Output is correct
6	Correct	12 ms	2908 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Incorrect	13 ms	3160 KB	wrong motion
9	Halted	0 ms	0 KB	-

Subtask #3
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	11 ms	2392 KB	Output is correct
3	Correct	8 ms	2176 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	5 ms	1372 KB	Output is correct
6	Correct	12 ms	2908 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Incorrect	13 ms	3160 KB	wrong motion
9	Halted	0 ms	0 KB	-