oj.uz

Submission #553746

# Submission time Handle Problem Language Result Execution time Memory
553746 2022-04-26T18:30:12 Z QwertyPi Fortune Telling 2 (JOI14_fortune_telling2) C++14
35 / 100
 3000 ms 256396 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 2e5+3;
int A[N], B[N], C[N];
int x1[N], x2[N], pa[N];
map<int, int> M; int m;

// persistent segment tree
struct node{
	node *l, *r;
	int tl, tr, cnt;
	node(int L, int R, int cnt) : l(nullptr), r(nullptr), tl(L), tr(R), cnt(cnt){};
	~node(){};
};

void build(node*& t, int l, int r){
	t = new node(l, r, 0);
	if(l == r) return;
	int mid = (l + r) / 2;
	build(t->l, l, mid); 
	build(t->r, mid + 1, r);
}

node* upd(node* t, int tl, int tr, int q, int delta){
	if(tl == tr){
		node* ret = new node(tl, tr, (t ? t->cnt : 0) + delta);
		return ret;
	}
	int tm = (tl + tr) / 2;
	node* ret = new node(tl, tr, t->cnt);
	ret->l = t->l, ret->r = t->r;
	if(q <= tm){
		ret->l = upd(t->l, tl, tm, q, delta);
	}else{
		ret->r = upd(t->r, tm + 1, tr, q, delta);
	}
	ret->cnt = (ret->l ? ret->l->cnt : 0) + (ret->r ? ret->r->cnt : 0);
	return ret;
}

int qry(node* t, int r){
	if(t->tl == t->tr) return t->cnt;
	if(r <= t->l->tr) return qry(t->l, r);
	else return t->l->cnt + qry(t->r, r);
}

int qry(node* t, int l, int r){
	return qry(t, r) - qry(t, l - 1);
}

node* T[N];

// MT merge sort tree

namespace MTree{
	vector<int> t[N * 4];
	vector<int> a, b;
	void build(int v, int l, int r){
		if(l == r){
			t[v].push_back(C[l + 1]);
			return;
		}
		int m = (l + r) / 2;
		build(v * 2 + 1, l, m);
		build(v * 2 + 2, m + 1, r);
		merge(t[v * 2 + 1].begin(), t[v * 2 + 1].end(), t[v * 2 + 2].begin(), t[v * 2 + 2].end(), back_inserter(t[v]));
	}
	int last(int v, int l, int r, int vl, int vr){
		if(l == r) return l;
		if(lower_bound(t[v * 2 + 2].begin(), t[v * 2 + 2].end(), vl) != upper_bound(t[v * 2 + 2].begin(), t[v * 2 + 2].end(), vr)){
			return last(v * 2 + 2, (l + r) / 2 + 1, r, vl, vr);
		}else{
			return last(v * 2 + 1, l, (l + r) / 2, vl, vr);
		}
	}
};

int32_t main(){
	int n, k;
	cin >> n >> k;
	for(int i = 0; i < n; i++){
		cin >> A[i] >> B[i];
		x1[i] = min(A[i], B[i]);
		x2[i] = max(A[i], B[i]);
		pa[i] = x1[i] != A[i];
	}
	for(int i = 1; i <= k; i++){
		cin >> C[i];
	}
	{
		vector<int> v; for(int i = 1; i <= k; i++) v.push_back(C[i]);
		sort(v.begin(), v.end()); v.resize(unique(v.begin(), v.end()) - v.begin());
		int idx = 0; for(auto i : v) M[i] = ++idx; M[1 << 30] = ++idx; m = idx;
		for(int i = 1; i <= k; i++) C[i] = M[C[i]];
	}
	
	MTree::build(0, 0, k - 1);
	build(T[0], 0, m);
	for(int i = 1; i <= k; i++){
		T[i] = upd(T[i - 1], 0, m, C[i], 1);
	}
	long long ans = 0;
	for(int i = 0; i < n; i++){
		int y1 = M.lower_bound(x1[i])->second;
		int y2 = M.lower_bound(x2[i])->second;
		int l = 0, r = k, tot = qry(T[k], y1, y2 - 1);
		while(l != r){
			int mid = (l + r + 1) / 2;
			if(qry(T[mid], y1, y2 - 1) == tot){
				r = mid - 1;
			}else{
				l = mid;
			}
		}
		int l2 = MTree::last(0, 0, k - 1, y1, y2 - 1);
		if(l != 0) pa[i] = true;
		int cnt = qry(T[k], y2, m) - qry(T[l], y2, m);
		pa[i] ^= cnt % 2;
		ans += pa[i] ? x2[i] : x1[i];
	}
	cout << ans << endl;
}

Compilation message

fortune_telling2.cpp: In function 'int32_t main()':
fortune_telling2.cpp:117:7: warning: unused variable 'l2' [-Wunused-variable]
  117 |   int l2 = MTree::last(0, 0, k - 1, y1, y2 - 1);
      |       ^~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19796 KB Output is correct
2 Correct 13 ms 19880 KB Output is correct
3 Correct 14 ms 19924 KB Output is correct
4 Correct 14 ms 19924 KB Output is correct
5 Correct 13 ms 19872 KB Output is correct
6 Correct 16 ms 19924 KB Output is correct
7 Correct 15 ms 19924 KB Output is correct
8 Correct 14 ms 19876 KB Output is correct
9 Correct 14 ms 19928 KB Output is correct
10 Correct 14 ms 19796 KB Output is correct
11 Correct 16 ms 19872 KB Output is correct
12 Correct 13 ms 19924 KB Output is correct
13 Correct 14 ms 19924 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19796 KB Output is correct
2 Correct 13 ms 19880 KB Output is correct
3 Correct 14 ms 19924 KB Output is correct
4 Correct 14 ms 19924 KB Output is correct
5 Correct 13 ms 19872 KB Output is correct
6 Correct 16 ms 19924 KB Output is correct
7 Correct 15 ms 19924 KB Output is correct
8 Correct 14 ms 19876 KB Output is correct
9 Correct 14 ms 19928 KB Output is correct
10 Correct 14 ms 19796 KB Output is correct
11 Correct 16 ms 19872 KB Output is correct
12 Correct 13 ms 19924 KB Output is correct
13 Correct 14 ms 19924 KB Output is correct
14 Correct 81 ms 29056 KB Output is correct
15 Correct 189 ms 39768 KB Output is correct
16 Correct 289 ms 50236 KB Output is correct
17 Correct 426 ms 62440 KB Output is correct
18 Correct 439 ms 62484 KB Output is correct
19 Correct 432 ms 62392 KB Output is correct
20 Correct 424 ms 62440 KB Output is correct
21 Correct 348 ms 62448 KB Output is correct
22 Correct 209 ms 60488 KB Output is correct
23 Correct 217 ms 60040 KB Output is correct
24 Correct 221 ms 59500 KB Output is correct
25 Correct 221 ms 60924 KB Output is correct
26 Correct 289 ms 62428 KB Output is correct
27 Correct 377 ms 62432 KB Output is correct
28 Correct 298 ms 62428 KB Output is correct
29 Correct 466 ms 62428 KB Output is correct

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19796 KB Output is correct
2 Correct 13 ms 19880 KB Output is correct
3 Correct 14 ms 19924 KB Output is correct
4 Correct 14 ms 19924 KB Output is correct
5 Correct 13 ms 19872 KB Output is correct
6 Correct 16 ms 19924 KB Output is correct
7 Correct 15 ms 19924 KB Output is correct
8 Correct 14 ms 19876 KB Output is correct
9 Correct 14 ms 19928 KB Output is correct
10 Correct 14 ms 19796 KB Output is correct
11 Correct 16 ms 19872 KB Output is correct
12 Correct 13 ms 19924 KB Output is correct
13 Correct 14 ms 19924 KB Output is correct
14 Correct 81 ms 29056 KB Output is correct
15 Correct 189 ms 39768 KB Output is correct
16 Correct 289 ms 50236 KB Output is correct
17 Correct 426 ms 62440 KB Output is correct
18 Correct 439 ms 62484 KB Output is correct
19 Correct 432 ms 62392 KB Output is correct
20 Correct 424 ms 62440 KB Output is correct
21 Correct 348 ms 62448 KB Output is correct
22 Correct 209 ms 60488 KB Output is correct
23 Correct 217 ms 60040 KB Output is correct
24 Correct 221 ms 59500 KB Output is correct
25 Correct 221 ms 60924 KB Output is correct
26 Correct 289 ms 62428 KB Output is correct
27 Correct 377 ms 62432 KB Output is correct
28 Correct 298 ms 62428 KB Output is correct
29 Correct 466 ms 62428 KB Output is correct
30 Correct 739 ms 252244 KB Output is correct
31 Correct 1303 ms 253680 KB Output is correct
32 Correct 2031 ms 254448 KB Output is correct
33 Execution timed out 3081 ms 256396 KB Time limit exceeded
34 Halted 0 ms 0 KB -