Submission #494273

#	Time	Username	Problem	Language	Result	Execution time	Memory
494273		flappybird	Minerals (JOI19_minerals)	C++14	75 / 100	56 ms	5684 KiB

minerals

#include "minerals.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ln '\n'
#define MAX 101010

ll rnd[MAX];
vector<ll> A, B; //A is old
ll chk[MAX];
ll rem[MAX];
ll pv = 0;
ll pvv = 0;

ll query(ll x) {
	rem[x] = !rem[x];
	pv = pvv;
	pvv = Query(rnd[x]);
	return pvv;
}

void answer(ll x, ll y) {
	Answer(rnd[x], rnd[y]);
}

void rnd_gen(ll N) {
	ll i;
	for (i = 1; i <= 2 * N; i++) rnd[i] = i;
	for (i = 2 * N; i > 1; i--) {
		ll a = rand() % i + 1;
		swap(rnd[i], rnd[a]);
	}
}

ll ans[MAX];
ll anschk[MAX];
ll num[MAX];
ll checked[MAX];

void Solve(int N) {
	srand(77777); //lucky seven
	ll i;
	rnd_gen(N);
	for (i = 1; i <= 2 * N; i++) {
		ll res = query(i);
		if (res != pv) {
			B.push_back(i);
			chk[i] = 1;
		}
		else {
			A.push_back(i);
			num[A.size() - 1] = B.size();
			chk[i] = 0;
		}
	}
	for (i = 1; i <= 2 * N; i++) rem[i] = 1, checked[i] = 16;
	for (i = 1; i <= 2 * N; i++) {
		for (ll j = 15; j >= 0; j--) {
			if (num[i] < (1LL << j)) {
				checked[i] = j;
			}
		}
	}
	ll b;
	for (b = 15; b >= 1; b--) {
		for (i = 0; i < N; i++) {
			if (checked[i] <= b) continue;
			if (!((1LL << b) & i)) {
				if (!rem[B[i]]) query(B[i]);
			}
			else {
				if (rem[B[i]]) query(B[i]);
			}
		}
		for (i = 0; i < N; i++) if (query(A[i]) != pv) ans[i] += (1LL << b);
	}
	b = 0;
	for (i = 0; i < N; i++) {
		for (i = 0; i < N; i++) {
			if (!((1LL << b) & i)) {
				if (!rem[B[i]]) query(B[i]);
			}
			else {
				if (rem[B[i]]) query(B[i]);
			}
		}
		for (i = 0; i < N; i++) {
			if (anschk[ans[i]] || anschk[ans[i] + 1]) {
				if (anschk[ans[i]]) ans[i]++;
			}
			else {
				if (query(A[i]) != pv) ans[i] += (1LL << b);
				anschk[ans[i]] = 1;
			}
		}
	}
	for (i = 0; i < N; i++) answer(A[i], B[ans[i]]);
}

• Subtask 1: 6 / 6
• Subtask 2: 25 / 25
• Subtask 3: 9 / 9
• Subtask 4: 30 / 30
• Subtask 5: 5 / 5
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 10