Submission #1026991

#	Time	Username	Problem	Language	Result	Execution time	Memory
1026991		mindiyak	Mechanical Doll (IOI18_doll)	C++14	16 / 100	50 ms	12868 KiB

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, vi A) {
  A.pb(0);
  N = A.size();M=m;
  vi C(M + 1,0),X,Y;

  vvi counters(M+1,vi());
  FOR(i,0,N-1){
    counters[A[i]].pb(A[i+1]);
  }

  // FOR(i,0,M+1){
  //   cout << i << " {";
  //   for(int j:counters[i])cout<<j << " ,";
  //   cout<<"}"<<endl;
  // }

  FOR(i,0,M+1){
    if(counters[i].size() == 1){
      C[i] = counters[i][0];
    }else if(counters[i].size() == 2){
      X.pb(counters[i][0]);
      Y.pb(counters[i][1]);
      C[i] = X.size()*-1;
    }else if(counters[i].size() == 3){
      int k = -X.size();
      C[i] = k-1;
      X.pb(k-2);
      Y.pb(k-3);
      X.pb(counters[i][0]);
      Y.pb(k-1);
      X.pb(counters[i][1]);
      Y.pb(counters[i][2]);
    }else if(counters[i].size() == 4){
      int k = -X.size();
      C[i] = k-1;
      X.pb(k-2);
      Y.pb(k-3);
      X.pb(counters[i][0]);
      Y.pb(counters[i][2]);
      X.pb(counters[i][1]);
      Y.pb(counters[i][3]);
    }
  }
  C[0] = A[0];

  // FOR(i,0,M+1)cout << C[i] << " ";
  // cout << endl;
  // FOR(i,0,X.size())cout << X[i] << " " << Y[i] << endl;

  answer(C, X, Y);
}

• Subtask 1: 2 / 2
• Subtask 2: 4 / 4
• Subtask 3: 10 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 18
• Subtask 6: 0 / 56