Submission #88883

#	Time	Username	Problem	Language	Result	Execution time	Memory
88883		jasony123123	Poklon (COCI17_poklon)	C++11	140 / 140	963 ms	17968 KiB

poklon

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFOR(i,start,end) for(int i = start; i>end; i--)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define all(a) a.begin(), a.end()
#define mt make_tuple
#define v vector
#define sf scanf
#define pf printf
#define dvar(x) cout << #x << " := " << x << "\n"
#define darr(x,n) FOR(i,0,n) cout << #x << "[" << i << "]" << " := " << x[i] << "\n"
typedef long long ll;
typedef long double ld;
typedef pair<int, int > pii;
typedef pair<ll, ll> pll;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void minn(T &a, T b) { a = min(a, b); }
template<class T> void maxx(T &a, T b) { a = max(a, b); }
inline void io() {
#ifdef LOCAL_PROJECT 
	freopen("input.in", "r", stdin); freopen("output.out", "w", stdout);
#else 
	/* online submission */
#endif 
	ios_base::sync_with_stdio(false); cin.tie(NULL);
}
/**************************COCI 2016-2017 R5 P5 *************************/

const int MAXN = 500000;

int N, Q, A[MAXN];

inline ll hilbertOrder(int x, int y, int pow, int rotate) {
	if (pow == 0) {
		return 0;
	}
	int hpow = 1 << (pow - 1);
	int seg = (x < hpow) ? (
		(y < hpow) ? 0 : 3
		) : (
		(y < hpow) ? 1 : 2
			);
	seg = (seg + rotate) & 3;
	const int rotateDelta[4] = { 3, 0, 0, 1 };
	int nx = x & (x ^ hpow), ny = y & (y ^ hpow);
	int nrot = (rotate + rotateDelta[seg]) & 3;
	ll subSquareSize = ll(1) << (2 * pow - 2);
	ll ans = seg * subSquareSize;
	ll add = hilbertOrder(nx, ny, pow - 1, nrot);
	ans += (seg == 1 || seg == 2) ? add : (subSquareSize - add - 1);
	return ans;
}
struct Query {
	int l, r, idx;
	ll ord;
	inline void calcOrder() {
		ord = hilbertOrder(l, r, 21, 0);
	}
};
inline bool operator<(const Query &a, const Query &b) {
	return a.ord < b.ord;
}

Query qs[MAXN];
int allans[MAXN];

int ans = 0;
int cnt[MAXN];
int L, R;

void add(int x) {
	if (cnt[x] == 2)ans--;
	else if (cnt[x] == 1) ans++;
	cnt[x]++;
}
void remove(int x) {
	if (cnt[x] == 2)ans--;
	else if (cnt[x] == 3) ans++;
	cnt[x]--;
}
void upd(int l, int r) {
	while (l < L)
		add(A[--L]);
	while (L < l)
		remove(A[L++]);
	while (r < R)
		remove(A[R--]);
	while (R < r)
		add(A[++R]);
}
void pop(int l, int r) {
	FORE(i, l, r)
		add(A[i]);
	L = l, R = r;
}

void compress(int a[], int n) {
	v<int> dat;
	FOR(i, 0, n) dat.emplace_back(a[i]);
	sort(dat.begin(), dat.end());
	dat.erase(unique(dat.begin(), dat.end()), dat.end());
	FOR(i, 0, n)
		a[i] = lower_bound(all(dat), a[i]) - dat.begin();
}

int main() {
	io();
	cin >> N >> Q;
	FOR(i, 0, N) cin >> A[i];
	compress(A, N);
	FOR(i, 0, Q) {
		cin >> qs[i].l >> qs[i].r;
		qs[i].l--, qs[i].r--;
		qs[i].idx = i;
		qs[i].calcOrder();
	}
	sort(qs, qs + Q);

	pop(qs[0].l, qs[0].r);
	allans[qs[0].idx] = ans;
	FOR(i, 1, Q) {
		upd(qs[i].l, qs[i].r);
		allans[qs[i].idx] = ans;
	}
	FOR(i, 0, Q)
		cout << allans[i] << "\n";
	return 0;
}

• Subtask 1: 140 / 140