Submission #249072

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
249072	2020-07-14T09:45:21 Z	Evirir	Mechanical Doll (IOI18_doll)	C++17	6 / 100	158 ms	262148 KB

doll

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

#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'
#define mset(d,val) memset(d,val,sizeof(d))
#define setp(x) cout<<fixed<<setprecision(x)
#define forn(i,a,b) for(int i=(a);i<(b);i++)
#define fore(i,a,b) for(int i=(a);i<=(b);i++)
#define pb push_back
#define F first
#define S second
#define pqueue priority_queue
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef long double ld;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> pbds;
void amin(ll &a, ll b){ a=min(a,b); }
void amax(ll &a, ll b){ a=max(a,b); }
void YES(){cout<<"YES\n";} void NO(){cout<<"NO\n";}
void SD(int t=0){ cout<<"PASSED "<<t<<endl; }
const ll INF = ll(1e18);
const int MOD = 998244353;

const bool DEBUG = 0;
const int MAXN = 200005;

vector<int> c,x,y;

int dfs(const vector<int>& nxt, int l, int r)
{
	if(r-l==1)
	{
		x.pb(-(x.size()+1));
		y.pb(nxt[l]);
		return -x.size();
	}
	if(r-l==2)
	{
		x.pb(nxt[l]);
		y.pb(nxt[l+1]);
		return -x.size();
	}
	
	int mid=1;
	while(mid<(r-l+1)/2) mid<<=1;
	
	x.pb(dfs(nxt, l, mid));
	y.pb(dfs(nxt, mid, r));
	return -x.size();
}

void create_circuit(int m, vector<int> a)
{
	int n = a.size();
	c.resize(m+1);
	
	vector<int> nxt[m+1];
	
	forn(i,0,n-1){
		nxt[a[i]].pb(a[i+1]);
	}
	nxt[a[n-1]].pb(0);
	
	/*fore(i,1,m){
		cout<<"nxt["<<i<<"]=";
		for(int x: nxt[i]) cout<<x<<" ";
		cout<<'\n';
	}*/
	
	c[0]=a[0];
	
	fore(i,1,m){
		if(nxt[i].empty()){
			c[i]=i;
			continue;
		}
		
		c[i]=dfs(nxt[i],0,nxt[i].size());
	}
	
	answer(c,x,y);
}

Subtask #1
2.0 / 2.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	60 ms	8516 KB	Output is correct
3	Correct	49 ms	7628 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	15 ms	3908 KB	Output is correct
6	Correct	76 ms	10656 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct

Subtask #2
4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	60 ms	8516 KB	Output is correct
3	Correct	49 ms	7628 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	15 ms	3908 KB	Output is correct
6	Correct	76 ms	10656 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	60 ms	7832 KB	Output is correct
9	Correct	142 ms	10032 KB	Output is correct
10	Correct	92 ms	10952 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	2 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct

Subtask #3
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	60 ms	8516 KB	Output is correct
3	Correct	49 ms	7628 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	15 ms	3908 KB	Output is correct
6	Correct	76 ms	10656 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	60 ms	7832 KB	Output is correct
9	Correct	142 ms	10032 KB	Output is correct
10	Correct	92 ms	10952 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	2 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Incorrect	102 ms	11792 KB	over 20000000 inversions
15	Halted	0 ms	0 KB	-