Submission #76214

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
76214	2018-09-12T12:13:21 Z	born2rule	Mechanical Doll (IOI18_doll)	C++14	6 / 100	128 ms	13372 KB

doll

#include <bits/stdc++.h>
#include "doll.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define ll long long
#define db long double
#define ii pair<int,int>
#define vi vector<int>
#define fi first
#define se second
#define sz(a) (int)(a).size()
#define all(a) (a).begin(),(a).end()
#define pb push_back
#define mp make_pair
#define FN(i, n) for (int i = 0; i < (int)(n); ++i)
#define FEN(i,n) for (int i = 1;i <= (int)(n); ++i)
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repv(i,a,b) for(int i=b-1;i>=a;i--)
#define SET(A, val) memset(A, val, sizeof(A))
typedef tree<int ,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>ordered_set ;
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the kth largest element.(0-based)
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ','); cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
const int N=200005;
vi v[N],X,Y;
int cnt=0;
int getind(vi &curr)
{
  assert(!curr.empty());
  int mx=*max_element(all(curr));
  int mn=*min_element(all(curr));
  if(mx==mn)
    return mx;
  vi tmp1,tmp2;
  rep(i,0,sz(curr))
    {
      if(i%2==0) tmp1.pb(curr[i]);
      else tmp2.pb(curr[i]);
    }
  //make a switch
  int ans=++cnt;
  X.pb(0); Y.pb(0);
  int x=getind(tmp1);
  X[ans-1]=x;
  x=getind(tmp2);
  Y[ans-1]=x;
  return -ans;
}
void create_circuit(int m,vi A)
{
  int n=sz(A);
  vi C(m+1);
  rep(i,0,n-1)
    v[A[i]].pb(A[i+1]);
  v[A[n-1]].pb(0);
  C[0]=A[0];
  rep(i,1,m+1)
    {
      if(v[i].empty())
	{
	  C[i]=0;
	  continue;
	}
      C[i]=getind(v[i]);
    }
  answer(C,X,Y);
  int x=n+(int)log2(n);
  assert(cnt<=x);
}

Subtask #1
2.0 / 2.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	4940 KB	Output is correct
2	Correct	52 ms	8660 KB	Output is correct
3	Correct	29 ms	8332 KB	Output is correct
4	Correct	4 ms	4940 KB	Output is correct
5	Correct	16 ms	6128 KB	Output is correct
6	Correct	46 ms	9992 KB	Output is correct
7	Correct	4 ms	4940 KB	Output is correct

Subtask #2
4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	4940 KB	Output is correct
2	Correct	52 ms	8660 KB	Output is correct
3	Correct	29 ms	8332 KB	Output is correct
4	Correct	4 ms	4940 KB	Output is correct
5	Correct	16 ms	6128 KB	Output is correct
6	Correct	46 ms	9992 KB	Output is correct
7	Correct	4 ms	4940 KB	Output is correct
8	Correct	77 ms	10364 KB	Output is correct
9	Correct	82 ms	11012 KB	Output is correct
10	Correct	128 ms	13372 KB	Output is correct
11	Correct	5 ms	4940 KB	Output is correct
12	Correct	5 ms	4940 KB	Output is correct
13	Correct	4 ms	4908 KB	Output is correct

Subtask #3
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	4940 KB	Output is correct
2	Correct	52 ms	8660 KB	Output is correct
3	Correct	29 ms	8332 KB	Output is correct
4	Correct	4 ms	4940 KB	Output is correct
5	Correct	16 ms	6128 KB	Output is correct
6	Correct	46 ms	9992 KB	Output is correct
7	Correct	4 ms	4940 KB	Output is correct
8	Correct	77 ms	10364 KB	Output is correct
9	Correct	82 ms	11012 KB	Output is correct
10	Correct	128 ms	13372 KB	Output is correct
11	Correct	5 ms	4940 KB	Output is correct
12	Correct	5 ms	4940 KB	Output is correct
13	Correct	4 ms	4908 KB	Output is correct
14	Incorrect	108 ms	12544 KB	state 'Y'
15	Halted	0 ms	0 KB	-