Submission #1026960

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1026960	2024-07-18T15:11:12 Z	mindiyak	Mechanical Doll (IOI18_doll)	C++14	2 / 100	14 ms	2396 KB

doll

#include "doll.h"
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<int, int> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1000000007;

int N,M;

void create_circuit(int m, std::vector<int> A) {
  N = A.size();M=m;
  vi C(M + 1,0),X,Y;
  C[0] = A[0];
  FOR(i,0,N){
    C[A[i]] = A[i+1];
  }
  answer(C, X, Y);
}

Subtask #1
2.0 / 2.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	10 ms	2140 KB	Output is correct
3	Correct	8 ms	1628 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	5 ms	1372 KB	Output is correct
6	Correct	13 ms	2396 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct

Subtask #2
0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	10 ms	2140 KB	Output is correct
3	Correct	8 ms	1628 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	5 ms	1372 KB	Output is correct
6	Correct	13 ms	2396 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Incorrect	14 ms	2140 KB	wrong motion
9	Halted	0 ms	0 KB	-

Subtask #3
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	10 ms	2140 KB	Output is correct
3	Correct	8 ms	1628 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	5 ms	1372 KB	Output is correct
6	Correct	13 ms	2396 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Incorrect	14 ms	2140 KB	wrong motion
9	Halted	0 ms	0 KB	-