oj.uz

Submission #543782

# Submission time Handle Problem Language Result Execution time Memory
543782 2022-03-31T11:38:52 Z amunduzbaev New Home (APIO18_new_home) C++17
47 / 100
 3446 ms 1048576 KB 
#include "bits/stdc++.h"
using namespace std;
 
#define ar array
#define pq priority_queue

const int N = 3e5 + 5;
const int M = N * 30;
const int MX = 1e8 + 5;

struct node{
	pq<int> in[2], del[2];
	int f[2];
	
	node (){
		f[0] = f[1] = 0;
	}
};

node def;

struct ST{
	vector<node> tree;
	int last;
	ST(){
		tree.push_back(def);
		last = 0;
	}
	
	void make_l(int x){
		//~ tree.push_back(def);
		if(tree[x].f[0]) return;
		tree.push_back(def);
		tree[x].f[0] = ++last; // tree[x].f[1] = ++last;
		//~ assert(last < M);
	}
	void make_r(int x){
		//~ tree.push_back(def);
		if(tree[x].f[1]) return;
		tree.push_back(def);
		tree[x].f[1] = ++last; // tree[x].f[1] = ++last;
		//~ assert(last < M);
	}
	
	void add(int l, int r, int s, int t, int lx = 0, int rx = MX, int x = 0){
		if(lx > r || rx < l) return;
		if(lx >= l && rx <= r){
			if(t == 1){
				tree[x].in[0].push(s + (lx - l));
			} else {
				tree[x].in[1].push(s - (lx - l));
			} return;
		} int m = (lx + rx) >> 1;
		//~ make(x);
		if(lx <= r && m >= l){
			make_l(x);
			add(l, r, s, t, lx, m, tree[x].f[0]);
		} if(m + 1 <= r && rx >= l){
			make_r(x);
			add(l, r, s, t, m+1, rx, tree[x].f[1]);
		}
		//~ add(l, r, s, t, lx, m, tree[x].f[0]), add(l, r, s, t, m+1, rx, tree[x].f[1]);
	}
	
	void bal(pq<int>& a, pq<int>& b){
		while(!a.empty() && !b.empty() && a.top() == b.top()){
			a.pop();
			b.pop();
		}
	}
	
	void del(int l, int r, int s, int t, int lx = 0, int rx = MX, int x = 0){
		if(lx > r || rx < l) return;
		if(lx >= l && rx <= r){
			if(t == 1){
				tree[x].del[0].push(s + (lx - l));
			} else {
				tree[x].del[1].push(s - (lx - l));
			} return;
		} int m = (lx + rx) >> 1;
		if(lx <= r && m >= l){
			make_l(x);
			del(l, r, s, t, lx, m, tree[x].f[0]);
		} if(m + 1 <= r && rx >= l){
			make_r(x);
			del(l, r, s, t, m+1, rx, tree[x].f[1]);
		}
	}
	
	int get(int i, int lx = 0, int rx = MX, int x = 0){
		int res = 0;
		bal(tree[x].in[0], tree[x].del[0]);
		bal(tree[x].in[1], tree[x].del[1]);
		if(!tree[x].in[0].empty()) res = max(res, tree[x].in[0].top() + (i - lx));
		if(!tree[x].in[1].empty()) res = max(res, tree[x].in[1].top() - (i - lx));
		if(lx == rx) return res;
		int m = (lx + rx) >> 1;
		if(i <= m) return max((tree[x].f[0] ? get(i, lx, m, tree[x].f[0]) : 0), res);
		else return max((tree[x].f[1] ? get(i, m+1, rx, tree[x].f[1]) : 0), res);
	}
}tree;

/*

4 2 4
3 1 1 10
9 2 2 4
7 2 5 7
4 1 8 10
5 3
5 6
5 9
1 10

2 1 3
1 1 1 4
1 1 2 6
1 3
1 5
1 7

1 1 1
100000000 1 1 1
1 1

*/

int x[N], t[N], a[N], b[N], l[N], y[N];
vector<int> stor[N];
multiset<int> ss[N];

signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	int n, k, q; cin>>n>>k>>q;
	for(int i=0;i<n;i++){
		cin>>x[i]>>t[i]>>a[i]>>b[i];
		stor[--t[i]].push_back(i);
	}

	auto add = [&](int l, int r){
		if(l == r) return;
		int m = (l + r) >> 1;
		tree.add(l, m, 0, 1);
		tree.add(m + 1, r, r - m - 1, -1);
	}; auto inc = [&](int x) { tree.add(x, MX, 0, 1); };
	auto dec = [&](int x) { tree.add(0, x, x, -1); };
	
	auto dadd = [&](int l, int r){
		if(l == r) return;
		int m = (l + r) >> 1;
		tree.del(l, m, 0, 1);
		tree.del(m + 1, r, r - m - 1, -1);
	}; auto dinc = [&](int x) { tree.del(x, MX, 0, 1); };
	auto ddec = [&](int x) { tree.del(0, x, x, -1); };
	
	//~ bool is = 1;
	//~ for(int i=0;i<k;i++){
		//~ if(stor[i].empty()) { is = 0; break; }
		//~ sort(stor[i].begin(), stor[i].end(), [&](int i, int j){
			//~ return (x[i] < x[j]);
		//~ });
		//~ for(int j=1;j<(int)stor[i].size();j++){
			//~ add(x[stor[i][j-1]], x[stor[i][j]]);
		//~ }
		
		//~ dec(x[stor[i][0]]);
		//~ inc(x[stor[i].back()]);
	//~ }
	
	vector<int> in(n); iota(in.begin(), in.end(), 0);
	vector<int> out(n); iota(out.begin(), out.end(), 0);
	sort(in.begin(), in.end(), [&](int i, int j){
		return (a[i] < a[j]);
	});
	sort(out.begin(), out.end(), [&](int i, int j){
		return (b[i] < b[j]);
	});
	vector<int> p(q);
	
	for(int i=0;i<q;i++){ p[i] = i;
		cin>>l[i]>>y[i];
	}
	
	sort(p.begin(), p.end(), [&](int i, int j){
		return (y[i] < y[j]);
	});
	
	int I = 0, O = 0, c = k;
	auto NEW = [&](int i){
		auto it = ss[t[i]].upper_bound(x[i]);
		if(ss[t[i]].empty()) c--;
		if(it == ss[t[i]].end()){
			if(it != ss[t[i]].begin()){
				it--;
				dinc(*it);
				add(*it, x[i]);
				inc(x[i]);
			} else {
				inc(x[i]);
				dec(x[i]);
			}
		} else {
			if(it == ss[t[i]].begin()){
				ddec(*it);
				add(x[i], *it);
				dec(x[i]);
			} else {
				auto R = it; it--;
				dadd(*it, *R);
				add(*it, x[i]);
				add(x[i], *R);
			}
		}
		
		ss[t[i]].insert(x[i]);
	};
	
	auto DEL = [&](int i){
		ss[t[i]].erase(ss[t[i]].find(x[i]));
		if(ss[t[i]].empty()) c++;
		auto it = ss[t[i]].upper_bound(x[i]);
		if(it == ss[t[i]].end()){
			if(it == ss[t[i]].begin()){
				dinc(x[i]);
				ddec(x[i]);
			} else {
				it--;
				dadd(*it, x[i]);
				dinc(x[i]);
				inc(*it);
			}
		} else {
			if(it == ss[t[i]].begin()){
				dadd(x[i], *it);
				ddec(x[i]);
				dec(*it);
			} else {
				auto R = it; it--;
				dadd(*it, x[i]);
				dadd(x[i], *R);
				add(*it, *R);
			}
		}
	};
	
	vector<int> res(q);
	for(auto i : p){
		while(I < n && a[in[I]] <= y[i]){
			NEW(in[I]);
			I++;
		}
		
		while(O < n && b[out[O]] < y[i]){
			DEL(out[O]);
			O++;
		}
		
		if(!c) res[i] = tree.get(l[i]);
		else res[i] = -1;
	}
	
	for(int i=0;i<q;i++) cout<<res[i]<<"\n";
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 21460 KB Output is correct
2 Correct 12 ms 21468 KB Output is correct
3 Correct 11 ms 21460 KB Output is correct
4 Correct 12 ms 21844 KB Output is correct
5 Correct 15 ms 21604 KB Output is correct
6 Correct 36 ms 31436 KB Output is correct
7 Correct 16 ms 23900 KB Output is correct
8 Correct 21 ms 26316 KB Output is correct
9 Correct 14 ms 23876 KB Output is correct
10 Correct 25 ms 31116 KB Output is correct
11 Correct 18 ms 26572 KB Output is correct
12 Correct 23 ms 31448 KB Output is correct
13 Correct 17 ms 26448 KB Output is correct
14 Correct 19 ms 26460 KB Output is correct
15 Correct 21 ms 26500 KB Output is correct
16 Correct 19 ms 26316 KB Output is correct
17 Correct 22 ms 26464 KB Output is correct
18 Correct 22 ms 26340 KB Output is correct
19 Correct 20 ms 26316 KB Output is correct
20 Correct 21 ms 26476 KB Output is correct
21 Correct 14 ms 21660 KB Output is correct
22 Correct 15 ms 23884 KB Output is correct
23 Correct 18 ms 26316 KB Output is correct
24 Correct 21 ms 26336 KB Output is correct
25 Correct 21 ms 26464 KB Output is correct
26 Correct 23 ms 26796 KB Output is correct
27 Correct 14 ms 21716 KB Output is correct
28 Correct 20 ms 26444 KB Output is correct
29 Correct 22 ms 26460 KB Output is correct
30 Correct 18 ms 26444 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 21460 KB Output is correct
2 Correct 12 ms 21468 KB Output is correct
3 Correct 11 ms 21460 KB Output is correct
4 Correct 12 ms 21844 KB Output is correct
5 Correct 15 ms 21604 KB Output is correct
6 Correct 36 ms 31436 KB Output is correct
7 Correct 16 ms 23900 KB Output is correct
8 Correct 21 ms 26316 KB Output is correct
9 Correct 14 ms 23876 KB Output is correct
10 Correct 25 ms 31116 KB Output is correct
11 Correct 18 ms 26572 KB Output is correct
12 Correct 23 ms 31448 KB Output is correct
13 Correct 17 ms 26448 KB Output is correct
14 Correct 19 ms 26460 KB Output is correct
15 Correct 21 ms 26500 KB Output is correct
16 Correct 19 ms 26316 KB Output is correct
17 Correct 22 ms 26464 KB Output is correct
18 Correct 22 ms 26340 KB Output is correct
19 Correct 20 ms 26316 KB Output is correct
20 Correct 21 ms 26476 KB Output is correct
21 Correct 14 ms 21660 KB Output is correct
22 Correct 15 ms 23884 KB Output is correct
23 Correct 18 ms 26316 KB Output is correct
24 Correct 21 ms 26336 KB Output is correct
25 Correct 21 ms 26464 KB Output is correct
26 Correct 23 ms 26796 KB Output is correct
27 Correct 14 ms 21716 KB Output is correct
28 Correct 20 ms 26444 KB Output is correct
29 Correct 22 ms 26460 KB Output is correct
30 Correct 18 ms 26444 KB Output is correct
31 Correct 3368 ms 677516 KB Output is correct
32 Correct 208 ms 28332 KB Output is correct
33 Correct 2874 ms 674544 KB Output is correct
34 Correct 3446 ms 673648 KB Output is correct
35 Correct 3291 ms 683980 KB Output is correct
36 Correct 2895 ms 679336 KB Output is correct
37 Correct 2466 ms 680608 KB Output is correct
38 Correct 2150 ms 676304 KB Output is correct
39 Correct 1636 ms 678324 KB Output is correct
40 Correct 1584 ms 677148 KB Output is correct
41 Correct 2160 ms 678744 KB Output is correct
42 Correct 2092 ms 682508 KB Output is correct
43 Correct 74 ms 30940 KB Output is correct
44 Correct 2045 ms 678588 KB Output is correct
45 Correct 1834 ms 676300 KB Output is correct
46 Correct 1687 ms 675212 KB Output is correct
47 Correct 999 ms 677988 KB Output is correct
48 Correct 1038 ms 677344 KB Output is correct
49 Correct 1233 ms 680376 KB Output is correct
50 Correct 1385 ms 685124 KB Output is correct
51 Correct 1260 ms 679284 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 2355 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Runtime error 2658 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 21460 KB Output is correct
2 Correct 12 ms 21468 KB Output is correct
3 Correct 11 ms 21460 KB Output is correct
4 Correct 12 ms 21844 KB Output is correct
5 Correct 15 ms 21604 KB Output is correct
6 Correct 36 ms 31436 KB Output is correct
7 Correct 16 ms 23900 KB Output is correct
8 Correct 21 ms 26316 KB Output is correct
9 Correct 14 ms 23876 KB Output is correct
10 Correct 25 ms 31116 KB Output is correct
11 Correct 18 ms 26572 KB Output is correct
12 Correct 23 ms 31448 KB Output is correct
13 Correct 17 ms 26448 KB Output is correct
14 Correct 19 ms 26460 KB Output is correct
15 Correct 21 ms 26500 KB Output is correct
16 Correct 19 ms 26316 KB Output is correct
17 Correct 22 ms 26464 KB Output is correct
18 Correct 22 ms 26340 KB Output is correct
19 Correct 20 ms 26316 KB Output is correct
20 Correct 21 ms 26476 KB Output is correct
21 Correct 14 ms 21660 KB Output is correct
22 Correct 15 ms 23884 KB Output is correct
23 Correct 18 ms 26316 KB Output is correct
24 Correct 21 ms 26336 KB Output is correct
25 Correct 21 ms 26464 KB Output is correct
26 Correct 23 ms 26796 KB Output is correct
27 Correct 14 ms 21716 KB Output is correct
28 Correct 20 ms 26444 KB Output is correct
29 Correct 22 ms 26460 KB Output is correct
30 Correct 18 ms 26444 KB Output is correct
31 Correct 3368 ms 677516 KB Output is correct
32 Correct 208 ms 28332 KB Output is correct
33 Correct 2874 ms 674544 KB Output is correct
34 Correct 3446 ms 673648 KB Output is correct
35 Correct 3291 ms 683980 KB Output is correct
36 Correct 2895 ms 679336 KB Output is correct
37 Correct 2466 ms 680608 KB Output is correct
38 Correct 2150 ms 676304 KB Output is correct
39 Correct 1636 ms 678324 KB Output is correct
40 Correct 1584 ms 677148 KB Output is correct
41 Correct 2160 ms 678744 KB Output is correct
42 Correct 2092 ms 682508 KB Output is correct
43 Correct 74 ms 30940 KB Output is correct
44 Correct 2045 ms 678588 KB Output is correct
45 Correct 1834 ms 676300 KB Output is correct
46 Correct 1687 ms 675212 KB Output is correct
47 Correct 999 ms 677988 KB Output is correct
48 Correct 1038 ms 677344 KB Output is correct
49 Correct 1233 ms 680376 KB Output is correct
50 Correct 1385 ms 685124 KB Output is correct
51 Correct 1260 ms 679284 KB Output is correct
52 Correct 778 ms 333096 KB Output is correct
53 Correct 785 ms 348056 KB Output is correct
54 Correct 1878 ms 684400 KB Output is correct
55 Correct 1585 ms 387748 KB Output is correct
56 Correct 1333 ms 348572 KB Output is correct
57 Correct 1969 ms 679876 KB Output is correct
58 Correct 1548 ms 388932 KB Output is correct
59 Correct 1343 ms 350664 KB Output is correct
60 Correct 1979 ms 682924 KB Output is correct
61 Correct 103 ms 37792 KB Output is correct
62 Correct 780 ms 332992 KB Output is correct
63 Correct 1370 ms 342768 KB Output is correct
64 Correct 1604 ms 381668 KB Output is correct
65 Correct 2099 ms 684900 KB Output is correct
66 Correct 2200 ms 681876 KB Output is correct
67 Correct 291 ms 40680 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 21460 KB Output is correct
2 Correct 12 ms 21468 KB Output is correct
3 Correct 11 ms 21460 KB Output is correct
4 Correct 12 ms 21844 KB Output is correct
5 Correct 15 ms 21604 KB Output is correct
6 Correct 36 ms 31436 KB Output is correct
7 Correct 16 ms 23900 KB Output is correct
8 Correct 21 ms 26316 KB Output is correct
9 Correct 14 ms 23876 KB Output is correct
10 Correct 25 ms 31116 KB Output is correct
11 Correct 18 ms 26572 KB Output is correct
12 Correct 23 ms 31448 KB Output is correct
13 Correct 17 ms 26448 KB Output is correct
14 Correct 19 ms 26460 KB Output is correct
15 Correct 21 ms 26500 KB Output is correct
16 Correct 19 ms 26316 KB Output is correct
17 Correct 22 ms 26464 KB Output is correct
18 Correct 22 ms 26340 KB Output is correct
19 Correct 20 ms 26316 KB Output is correct
20 Correct 21 ms 26476 KB Output is correct
21 Correct 14 ms 21660 KB Output is correct
22 Correct 15 ms 23884 KB Output is correct
23 Correct 18 ms 26316 KB Output is correct
24 Correct 21 ms 26336 KB Output is correct
25 Correct 21 ms 26464 KB Output is correct
26 Correct 23 ms 26796 KB Output is correct
27 Correct 14 ms 21716 KB Output is correct
28 Correct 20 ms 26444 KB Output is correct
29 Correct 22 ms 26460 KB Output is correct
30 Correct 18 ms 26444 KB Output is correct
31 Correct 3368 ms 677516 KB Output is correct
32 Correct 208 ms 28332 KB Output is correct
33 Correct 2874 ms 674544 KB Output is correct
34 Correct 3446 ms 673648 KB Output is correct
35 Correct 3291 ms 683980 KB Output is correct
36 Correct 2895 ms 679336 KB Output is correct
37 Correct 2466 ms 680608 KB Output is correct
38 Correct 2150 ms 676304 KB Output is correct
39 Correct 1636 ms 678324 KB Output is correct
40 Correct 1584 ms 677148 KB Output is correct
41 Correct 2160 ms 678744 KB Output is correct
42 Correct 2092 ms 682508 KB Output is correct
43 Correct 74 ms 30940 KB Output is correct
44 Correct 2045 ms 678588 KB Output is correct
45 Correct 1834 ms 676300 KB Output is correct
46 Correct 1687 ms 675212 KB Output is correct
47 Correct 999 ms 677988 KB Output is correct
48 Correct 1038 ms 677344 KB Output is correct
49 Correct 1233 ms 680376 KB Output is correct
50 Correct 1385 ms 685124 KB Output is correct
51 Correct 1260 ms 679284 KB Output is correct
52 Runtime error 2355 ms 1048576 KB Execution killed with signal 9
53 Halted 0 ms 0 KB -