oj.uz

답안 #543787

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
543787 2022-03-31T11:43:45 Z amunduzbaev 새 집 (APIO18_new_home) C++17
47 / 100
 5000 ms 1032716 KB 
#include "bits/stdc++.h"
using namespace std;
 
#define ar array
#define pq priority_queue

const int N = 3e5 + 5;
const int M = 7e6 + 5;
const int MX = 1e8 + 5;
 
struct ST{
	multiset<int> tree[M][2];
	int f[M][2], last;
	ST(){
		last = 0;
	}
	
	void make(int x){
		if(!f[x][0]) f[x][0] = ++last;
		if(!f[x][1]) f[x][1] = ++last;
	}
	
	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][0].insert(s + (lx - l));
				//~ tree[x][0] = max(tree[x][0], s + (lx - l));
			} else {
				tree[x][1].insert(s - (lx - l));
				//~ tree[x][1] = max(tree[x][1], s - (lx - l));
			} return;
		} int m = (lx + rx) >> 1;
		make(x);
		add(l, r, s, t, lx, m, f[x][0]), add(l, r, s, t, m+1, rx, f[x][1]);
	}
	
	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][0].erase(tree[x][0].find(s + (lx - l)));
			} else {
				tree[x][1].erase(tree[x][1].find(s - (lx - l)));
			} return;
		} int m = (lx + rx) >> 1;
		make(x);
		del(l, r, s, t, lx, m, f[x][0]), del(l, r, s, t, m+1, rx, f[x][1]);
	}
	
	int get(int i, int lx = 0, int rx = MX, int x = 0){
		int res = 0;
		if(!tree[x][0].empty()) res = max(res, (*--tree[x][0].end()) + (i - lx));
		if(!tree[x][1].empty()) res = max(res, (*--tree[x][1].end()) - (i - lx));
		if(lx == rx) return res;
		int m = (lx + rx) >> 1;
		if(i <= m) return max((f[x][0] ? get(i, lx, m, f[x][0]) : 0), res);
		else return max((f[x][1] ? get(i, m+1, rx, f[x][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

# 결과 실행 시간 메모리 Grader output
1 Correct 290 ms 678924 KB Output is correct
2 Correct 314 ms 679200 KB Output is correct
3 Correct 299 ms 678900 KB Output is correct
4 Correct 322 ms 679128 KB Output is correct
5 Correct 305 ms 679032 KB Output is correct
6 Correct 314 ms 679652 KB Output is correct
7 Correct 297 ms 679372 KB Output is correct
8 Correct 321 ms 679968 KB Output is correct
9 Correct 295 ms 679604 KB Output is correct
10 Correct 311 ms 680124 KB Output is correct
11 Correct 315 ms 679316 KB Output is correct
12 Correct 302 ms 679372 KB Output is correct
13 Correct 363 ms 679248 KB Output is correct
14 Correct 299 ms 679276 KB Output is correct
15 Correct 320 ms 679420 KB Output is correct
16 Correct 299 ms 679628 KB Output is correct
17 Correct 307 ms 679372 KB Output is correct
18 Correct 338 ms 679528 KB Output is correct
19 Correct 359 ms 679564 KB Output is correct
20 Correct 303 ms 679476 KB Output is correct
21 Correct 353 ms 679520 KB Output is correct
22 Correct 291 ms 679620 KB Output is correct
23 Correct 301 ms 679764 KB Output is correct
24 Correct 335 ms 679632 KB Output is correct
25 Correct 312 ms 679532 KB Output is correct
26 Correct 296 ms 679328 KB Output is correct
27 Correct 347 ms 679188 KB Output is correct
28 Correct 337 ms 679244 KB Output is correct
29 Correct 295 ms 679208 KB Output is correct
30 Correct 309 ms 679164 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 290 ms 678924 KB Output is correct
2 Correct 314 ms 679200 KB Output is correct
3 Correct 299 ms 678900 KB Output is correct
4 Correct 322 ms 679128 KB Output is correct
5 Correct 305 ms 679032 KB Output is correct
6 Correct 314 ms 679652 KB Output is correct
7 Correct 297 ms 679372 KB Output is correct
8 Correct 321 ms 679968 KB Output is correct
9 Correct 295 ms 679604 KB Output is correct
10 Correct 311 ms 680124 KB Output is correct
11 Correct 315 ms 679316 KB Output is correct
12 Correct 302 ms 679372 KB Output is correct
13 Correct 363 ms 679248 KB Output is correct
14 Correct 299 ms 679276 KB Output is correct
15 Correct 320 ms 679420 KB Output is correct
16 Correct 299 ms 679628 KB Output is correct
17 Correct 307 ms 679372 KB Output is correct
18 Correct 338 ms 679528 KB Output is correct
19 Correct 359 ms 679564 KB Output is correct
20 Correct 303 ms 679476 KB Output is correct
21 Correct 353 ms 679520 KB Output is correct
22 Correct 291 ms 679620 KB Output is correct
23 Correct 301 ms 679764 KB Output is correct
24 Correct 335 ms 679632 KB Output is correct
25 Correct 312 ms 679532 KB Output is correct
26 Correct 296 ms 679328 KB Output is correct
27 Correct 347 ms 679188 KB Output is correct
28 Correct 337 ms 679244 KB Output is correct
29 Correct 295 ms 679208 KB Output is correct
30 Correct 309 ms 679164 KB Output is correct
31 Correct 3789 ms 813680 KB Output is correct
32 Correct 511 ms 684012 KB Output is correct
33 Correct 2369 ms 742480 KB Output is correct
34 Correct 3779 ms 751828 KB Output is correct
35 Correct 3268 ms 805408 KB Output is correct
36 Correct 2211 ms 785664 KB Output is correct
37 Correct 2203 ms 718904 KB Output is correct
38 Correct 1925 ms 717844 KB Output is correct
39 Correct 1186 ms 712580 KB Output is correct
40 Correct 1362 ms 713276 KB Output is correct
41 Correct 2028 ms 704132 KB Output is correct
42 Correct 2191 ms 704400 KB Output is correct
43 Correct 463 ms 687020 KB Output is correct
44 Correct 1929 ms 704124 KB Output is correct
45 Correct 1567 ms 703780 KB Output is correct
46 Correct 1288 ms 704004 KB Output is correct
47 Correct 815 ms 700916 KB Output is correct
48 Correct 879 ms 701956 KB Output is correct
49 Correct 937 ms 702600 KB Output is correct
50 Correct 1329 ms 702692 KB Output is correct
51 Correct 962 ms 702968 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5077 ms 1032716 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5110 ms 958136 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 290 ms 678924 KB Output is correct
2 Correct 314 ms 679200 KB Output is correct
3 Correct 299 ms 678900 KB Output is correct
4 Correct 322 ms 679128 KB Output is correct
5 Correct 305 ms 679032 KB Output is correct
6 Correct 314 ms 679652 KB Output is correct
7 Correct 297 ms 679372 KB Output is correct
8 Correct 321 ms 679968 KB Output is correct
9 Correct 295 ms 679604 KB Output is correct
10 Correct 311 ms 680124 KB Output is correct
11 Correct 315 ms 679316 KB Output is correct
12 Correct 302 ms 679372 KB Output is correct
13 Correct 363 ms 679248 KB Output is correct
14 Correct 299 ms 679276 KB Output is correct
15 Correct 320 ms 679420 KB Output is correct
16 Correct 299 ms 679628 KB Output is correct
17 Correct 307 ms 679372 KB Output is correct
18 Correct 338 ms 679528 KB Output is correct
19 Correct 359 ms 679564 KB Output is correct
20 Correct 303 ms 679476 KB Output is correct
21 Correct 353 ms 679520 KB Output is correct
22 Correct 291 ms 679620 KB Output is correct
23 Correct 301 ms 679764 KB Output is correct
24 Correct 335 ms 679632 KB Output is correct
25 Correct 312 ms 679532 KB Output is correct
26 Correct 296 ms 679328 KB Output is correct
27 Correct 347 ms 679188 KB Output is correct
28 Correct 337 ms 679244 KB Output is correct
29 Correct 295 ms 679208 KB Output is correct
30 Correct 309 ms 679164 KB Output is correct
31 Correct 3789 ms 813680 KB Output is correct
32 Correct 511 ms 684012 KB Output is correct
33 Correct 2369 ms 742480 KB Output is correct
34 Correct 3779 ms 751828 KB Output is correct
35 Correct 3268 ms 805408 KB Output is correct
36 Correct 2211 ms 785664 KB Output is correct
37 Correct 2203 ms 718904 KB Output is correct
38 Correct 1925 ms 717844 KB Output is correct
39 Correct 1186 ms 712580 KB Output is correct
40 Correct 1362 ms 713276 KB Output is correct
41 Correct 2028 ms 704132 KB Output is correct
42 Correct 2191 ms 704400 KB Output is correct
43 Correct 463 ms 687020 KB Output is correct
44 Correct 1929 ms 704124 KB Output is correct
45 Correct 1567 ms 703780 KB Output is correct
46 Correct 1288 ms 704004 KB Output is correct
47 Correct 815 ms 700916 KB Output is correct
48 Correct 879 ms 701956 KB Output is correct
49 Correct 937 ms 702600 KB Output is correct
50 Correct 1329 ms 702692 KB Output is correct
51 Correct 962 ms 702968 KB Output is correct
52 Correct 1302 ms 772620 KB Output is correct
53 Correct 1267 ms 723712 KB Output is correct
54 Correct 3126 ms 812328 KB Output is correct
55 Correct 1813 ms 727232 KB Output is correct
56 Correct 1648 ms 738608 KB Output is correct
57 Correct 1928 ms 710956 KB Output is correct
58 Correct 1996 ms 727252 KB Output is correct
59 Correct 1792 ms 738716 KB Output is correct
60 Correct 2104 ms 710844 KB Output is correct
61 Correct 793 ms 760092 KB Output is correct
62 Correct 1257 ms 771952 KB Output is correct
63 Correct 2329 ms 779816 KB Output is correct
64 Correct 2832 ms 768224 KB Output is correct
65 Correct 3414 ms 724516 KB Output is correct
66 Correct 2157 ms 704088 KB Output is correct
67 Correct 1974 ms 692408 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 290 ms 678924 KB Output is correct
2 Correct 314 ms 679200 KB Output is correct
3 Correct 299 ms 678900 KB Output is correct
4 Correct 322 ms 679128 KB Output is correct
5 Correct 305 ms 679032 KB Output is correct
6 Correct 314 ms 679652 KB Output is correct
7 Correct 297 ms 679372 KB Output is correct
8 Correct 321 ms 679968 KB Output is correct
9 Correct 295 ms 679604 KB Output is correct
10 Correct 311 ms 680124 KB Output is correct
11 Correct 315 ms 679316 KB Output is correct
12 Correct 302 ms 679372 KB Output is correct
13 Correct 363 ms 679248 KB Output is correct
14 Correct 299 ms 679276 KB Output is correct
15 Correct 320 ms 679420 KB Output is correct
16 Correct 299 ms 679628 KB Output is correct
17 Correct 307 ms 679372 KB Output is correct
18 Correct 338 ms 679528 KB Output is correct
19 Correct 359 ms 679564 KB Output is correct
20 Correct 303 ms 679476 KB Output is correct
21 Correct 353 ms 679520 KB Output is correct
22 Correct 291 ms 679620 KB Output is correct
23 Correct 301 ms 679764 KB Output is correct
24 Correct 335 ms 679632 KB Output is correct
25 Correct 312 ms 679532 KB Output is correct
26 Correct 296 ms 679328 KB Output is correct
27 Correct 347 ms 679188 KB Output is correct
28 Correct 337 ms 679244 KB Output is correct
29 Correct 295 ms 679208 KB Output is correct
30 Correct 309 ms 679164 KB Output is correct
31 Correct 3789 ms 813680 KB Output is correct
32 Correct 511 ms 684012 KB Output is correct
33 Correct 2369 ms 742480 KB Output is correct
34 Correct 3779 ms 751828 KB Output is correct
35 Correct 3268 ms 805408 KB Output is correct
36 Correct 2211 ms 785664 KB Output is correct
37 Correct 2203 ms 718904 KB Output is correct
38 Correct 1925 ms 717844 KB Output is correct
39 Correct 1186 ms 712580 KB Output is correct
40 Correct 1362 ms 713276 KB Output is correct
41 Correct 2028 ms 704132 KB Output is correct
42 Correct 2191 ms 704400 KB Output is correct
43 Correct 463 ms 687020 KB Output is correct
44 Correct 1929 ms 704124 KB Output is correct
45 Correct 1567 ms 703780 KB Output is correct
46 Correct 1288 ms 704004 KB Output is correct
47 Correct 815 ms 700916 KB Output is correct
48 Correct 879 ms 701956 KB Output is correct
49 Correct 937 ms 702600 KB Output is correct
50 Correct 1329 ms 702692 KB Output is correct
51 Correct 962 ms 702968 KB Output is correct
52 Execution timed out 5077 ms 1032716 KB Time limit exceeded
53 Halted 0 ms 0 KB -