Submission #101674

#	Time	Username	Problem	Language	Result	Execution time	Memory
101674		briansu	Mechanical Doll (IOI18_doll)	C++14	100 / 100	169 ms	11056 KiB

doll

#include "doll.h"
//{
#include<bits/stdc++.h>
using namespace std;
typedef int ll;
typedef double lf;
typedef pair<ll,ll> ii;
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define FILL(i,n) memset(i,n,sizeof i)
#define X first
#define Y second
#define SZ(_a) (int)_a.size()
#define ALL(_a) _a.begin(),_a.end()
#define pb push_back
#ifdef brian
#define debug(...) do{\
    fprintf(stderr,"%s - %d (%s) = ",__PRETTY_FUNCTION__,__LINE__,#__VA_ARGS__);\
    _do(__VA_ARGS__);\
}while(0)
template<typename T>void _do(T &&_x){cerr<<_x<<endl;}
template<typename T,typename ...S> void _do(T &&_x,S &&..._t){cerr<<_x<<" ,";_do(_t...);}
template<typename _a,typename _b> ostream& operator << (ostream &_s,const pair<_a,_b> &_p){return _s<<"("<<_p.X<<","<<_p.Y<<")";}
template<typename It> ostream& _OUTC(ostream &_s,It _ita,It _itb)
{
    _s<<"{";
    for(It _it=_ita;_it!=_itb;_it++)
    {
        _s<<(_it==_ita?"":",")<<*_it;
    }
    _s<<"}";
    return _s;
}
template<typename _a> ostream &operator << (ostream &_s,vector<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,set<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a,typename _b> ostream &operator << (ostream &_s,map<_a,_b> &_c){return _OUTC(_s,ALL(_c));}
template<typename _t> void pary(_t _a,_t _b){_OUTC(cerr,_a,_b);cerr<<endl;}
#define IOS()
#else
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#endif // brian
//}

const ll MAXn = 400000 + 5;

ll x[MAXn], y[MAXn], stat[MAXn];
vector<int> C, X, Y;
ll sit = 0;


inline ll nnd(){
  return --sit;
}

void build(int &now, int sz)
{
  if(sz == 1)
  {
    now = MAXn;
    return;
  }
  now = nnd();
  assert(sz % 2 == 0);
  build(x[-now-1], sz>>1);
  build(y[-now-1], sz>>1);
}

void create_circuit(int M, std::vector<int> A) {
  X.clear();Y.clear();C.clear();sit = 0;
  if(SZ(A) == 1)
  {
    vector<int> tmp;
    REP(i, M+1)tmp.pb(0);
    tmp[0] = A[0];
    answer(tmp, vector<int>(), vector<int>());
    return;
  }
  vector<int> v;
  for(int i = 1;i < SZ(A);i ++)v.pb(A[i]);
  int rt;
  rt = nnd();

  for(int i = __lg(SZ(v)), now = rt;i >= 0;i --)
  {
    if(SZ(v) & (1<<i))build(x[-now-1], (1<<i));
    else x[-now-1] = rt;
    if(i != 0)now = y[-now-1] = nnd();
    else y[-now-1] = 0;
  }

  debug(v);
  ll now = rt, it = 0;
  REP(i, -sit)stat[i] = 0;
  while(now != 0)
  {
    if(stat[-now-1] == 0){ // x
      stat[-now-1] ^= 1;
      if(x[-now-1] == MAXn){
        assert(it != SZ(v));
        x[-now-1] = v[it++];
        now = rt;
      }else now = x[-now-1];
    }
    else{ // y
      stat[-now-1] ^= 1;
      if(y[-now-1] == MAXn){
        assert(it != SZ(v));
        y[-now-1] = v[it++];
        now = rt;
      }else now = y[-now-1];
    }
  }
  
  //build(rt, v);
  C.pb(A[0]);
  REP(i, M)C.pb(rt);
  REP(i, -sit)X.pb(x[i]), Y.pb(y[i]);
  answer(C, X, Y);
}

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