oj.uz

답안 #543788

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
543788 2022-03-31T11:44:22 Z amunduzbaev 새 집 (APIO18_new_home) C++17
47 / 100
 4966 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 = 15 * N;
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 217 ms 444180 KB Output is correct
2 Correct 219 ms 444164 KB Output is correct
3 Correct 212 ms 444072 KB Output is correct
4 Correct 230 ms 444224 KB Output is correct
5 Correct 216 ms 444244 KB Output is correct
6 Correct 207 ms 444728 KB Output is correct
7 Correct 204 ms 444492 KB Output is correct
8 Correct 217 ms 445080 KB Output is correct
9 Correct 225 ms 444824 KB Output is correct
10 Correct 211 ms 445228 KB Output is correct
11 Correct 200 ms 444460 KB Output is correct
12 Correct 242 ms 444568 KB Output is correct
13 Correct 216 ms 444344 KB Output is correct
14 Correct 205 ms 444396 KB Output is correct
15 Correct 233 ms 444552 KB Output is correct
16 Correct 257 ms 444660 KB Output is correct
17 Correct 243 ms 444524 KB Output is correct
18 Correct 233 ms 444692 KB Output is correct
19 Correct 213 ms 444644 KB Output is correct
20 Correct 224 ms 444604 KB Output is correct
21 Correct 226 ms 444788 KB Output is correct
22 Correct 221 ms 444856 KB Output is correct
23 Correct 237 ms 444948 KB Output is correct
24 Correct 241 ms 444900 KB Output is correct
25 Correct 210 ms 444660 KB Output is correct
26 Correct 198 ms 444468 KB Output is correct
27 Correct 209 ms 444364 KB Output is correct
28 Correct 219 ms 444348 KB Output is correct
29 Correct 235 ms 444352 KB Output is correct
30 Correct 227 ms 444388 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 217 ms 444180 KB Output is correct
2 Correct 219 ms 444164 KB Output is correct
3 Correct 212 ms 444072 KB Output is correct
4 Correct 230 ms 444224 KB Output is correct
5 Correct 216 ms 444244 KB Output is correct
6 Correct 207 ms 444728 KB Output is correct
7 Correct 204 ms 444492 KB Output is correct
8 Correct 217 ms 445080 KB Output is correct
9 Correct 225 ms 444824 KB Output is correct
10 Correct 211 ms 445228 KB Output is correct
11 Correct 200 ms 444460 KB Output is correct
12 Correct 242 ms 444568 KB Output is correct
13 Correct 216 ms 444344 KB Output is correct
14 Correct 205 ms 444396 KB Output is correct
15 Correct 233 ms 444552 KB Output is correct
16 Correct 257 ms 444660 KB Output is correct
17 Correct 243 ms 444524 KB Output is correct
18 Correct 233 ms 444692 KB Output is correct
19 Correct 213 ms 444644 KB Output is correct
20 Correct 224 ms 444604 KB Output is correct
21 Correct 226 ms 444788 KB Output is correct
22 Correct 221 ms 444856 KB Output is correct
23 Correct 237 ms 444948 KB Output is correct
24 Correct 241 ms 444900 KB Output is correct
25 Correct 210 ms 444660 KB Output is correct
26 Correct 198 ms 444468 KB Output is correct
27 Correct 209 ms 444364 KB Output is correct
28 Correct 219 ms 444348 KB Output is correct
29 Correct 235 ms 444352 KB Output is correct
30 Correct 227 ms 444388 KB Output is correct
31 Correct 4100 ms 577460 KB Output is correct
32 Correct 411 ms 448220 KB Output is correct
33 Correct 2434 ms 505972 KB Output is correct
34 Correct 4164 ms 515688 KB Output is correct
35 Correct 3563 ms 569180 KB Output is correct
36 Correct 2316 ms 549384 KB Output is correct
37 Correct 2408 ms 482644 KB Output is correct
38 Correct 1841 ms 481664 KB Output is correct
39 Correct 1183 ms 476360 KB Output is correct
40 Correct 1237 ms 477068 KB Output is correct
41 Correct 1695 ms 467980 KB Output is correct
42 Correct 1667 ms 468420 KB Output is correct
43 Correct 293 ms 450736 KB Output is correct
44 Correct 1559 ms 467976 KB Output is correct
45 Correct 1280 ms 467536 KB Output is correct
46 Correct 1018 ms 467916 KB Output is correct
47 Correct 701 ms 464812 KB Output is correct
48 Correct 677 ms 465844 KB Output is correct
49 Correct 816 ms 466424 KB Output is correct
50 Correct 1152 ms 466424 KB Output is correct
51 Correct 808 ms 466848 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 4800 ms 1048576 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 4966 ms 1048576 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 217 ms 444180 KB Output is correct
2 Correct 219 ms 444164 KB Output is correct
3 Correct 212 ms 444072 KB Output is correct
4 Correct 230 ms 444224 KB Output is correct
5 Correct 216 ms 444244 KB Output is correct
6 Correct 207 ms 444728 KB Output is correct
7 Correct 204 ms 444492 KB Output is correct
8 Correct 217 ms 445080 KB Output is correct
9 Correct 225 ms 444824 KB Output is correct
10 Correct 211 ms 445228 KB Output is correct
11 Correct 200 ms 444460 KB Output is correct
12 Correct 242 ms 444568 KB Output is correct
13 Correct 216 ms 444344 KB Output is correct
14 Correct 205 ms 444396 KB Output is correct
15 Correct 233 ms 444552 KB Output is correct
16 Correct 257 ms 444660 KB Output is correct
17 Correct 243 ms 444524 KB Output is correct
18 Correct 233 ms 444692 KB Output is correct
19 Correct 213 ms 444644 KB Output is correct
20 Correct 224 ms 444604 KB Output is correct
21 Correct 226 ms 444788 KB Output is correct
22 Correct 221 ms 444856 KB Output is correct
23 Correct 237 ms 444948 KB Output is correct
24 Correct 241 ms 444900 KB Output is correct
25 Correct 210 ms 444660 KB Output is correct
26 Correct 198 ms 444468 KB Output is correct
27 Correct 209 ms 444364 KB Output is correct
28 Correct 219 ms 444348 KB Output is correct
29 Correct 235 ms 444352 KB Output is correct
30 Correct 227 ms 444388 KB Output is correct
31 Correct 4100 ms 577460 KB Output is correct
32 Correct 411 ms 448220 KB Output is correct
33 Correct 2434 ms 505972 KB Output is correct
34 Correct 4164 ms 515688 KB Output is correct
35 Correct 3563 ms 569180 KB Output is correct
36 Correct 2316 ms 549384 KB Output is correct
37 Correct 2408 ms 482644 KB Output is correct
38 Correct 1841 ms 481664 KB Output is correct
39 Correct 1183 ms 476360 KB Output is correct
40 Correct 1237 ms 477068 KB Output is correct
41 Correct 1695 ms 467980 KB Output is correct
42 Correct 1667 ms 468420 KB Output is correct
43 Correct 293 ms 450736 KB Output is correct
44 Correct 1559 ms 467976 KB Output is correct
45 Correct 1280 ms 467536 KB Output is correct
46 Correct 1018 ms 467916 KB Output is correct
47 Correct 701 ms 464812 KB Output is correct
48 Correct 677 ms 465844 KB Output is correct
49 Correct 816 ms 466424 KB Output is correct
50 Correct 1152 ms 466424 KB Output is correct
51 Correct 808 ms 466848 KB Output is correct
52 Correct 1149 ms 536728 KB Output is correct
53 Correct 1212 ms 487672 KB Output is correct
54 Correct 2883 ms 576528 KB Output is correct
55 Correct 1398 ms 491180 KB Output is correct
56 Correct 1289 ms 502744 KB Output is correct
57 Correct 1463 ms 474992 KB Output is correct
58 Correct 1651 ms 491296 KB Output is correct
59 Correct 1458 ms 502904 KB Output is correct
60 Correct 1713 ms 475308 KB Output is correct
61 Correct 630 ms 525012 KB Output is correct
62 Correct 1049 ms 536864 KB Output is correct
63 Correct 2005 ms 545016 KB Output is correct
64 Correct 2399 ms 533512 KB Output is correct
65 Correct 2824 ms 489528 KB Output is correct
66 Correct 1611 ms 469420 KB Output is correct
67 Correct 1329 ms 457644 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 217 ms 444180 KB Output is correct
2 Correct 219 ms 444164 KB Output is correct
3 Correct 212 ms 444072 KB Output is correct
4 Correct 230 ms 444224 KB Output is correct
5 Correct 216 ms 444244 KB Output is correct
6 Correct 207 ms 444728 KB Output is correct
7 Correct 204 ms 444492 KB Output is correct
8 Correct 217 ms 445080 KB Output is correct
9 Correct 225 ms 444824 KB Output is correct
10 Correct 211 ms 445228 KB Output is correct
11 Correct 200 ms 444460 KB Output is correct
12 Correct 242 ms 444568 KB Output is correct
13 Correct 216 ms 444344 KB Output is correct
14 Correct 205 ms 444396 KB Output is correct
15 Correct 233 ms 444552 KB Output is correct
16 Correct 257 ms 444660 KB Output is correct
17 Correct 243 ms 444524 KB Output is correct
18 Correct 233 ms 444692 KB Output is correct
19 Correct 213 ms 444644 KB Output is correct
20 Correct 224 ms 444604 KB Output is correct
21 Correct 226 ms 444788 KB Output is correct
22 Correct 221 ms 444856 KB Output is correct
23 Correct 237 ms 444948 KB Output is correct
24 Correct 241 ms 444900 KB Output is correct
25 Correct 210 ms 444660 KB Output is correct
26 Correct 198 ms 444468 KB Output is correct
27 Correct 209 ms 444364 KB Output is correct
28 Correct 219 ms 444348 KB Output is correct
29 Correct 235 ms 444352 KB Output is correct
30 Correct 227 ms 444388 KB Output is correct
31 Correct 4100 ms 577460 KB Output is correct
32 Correct 411 ms 448220 KB Output is correct
33 Correct 2434 ms 505972 KB Output is correct
34 Correct 4164 ms 515688 KB Output is correct
35 Correct 3563 ms 569180 KB Output is correct
36 Correct 2316 ms 549384 KB Output is correct
37 Correct 2408 ms 482644 KB Output is correct
38 Correct 1841 ms 481664 KB Output is correct
39 Correct 1183 ms 476360 KB Output is correct
40 Correct 1237 ms 477068 KB Output is correct
41 Correct 1695 ms 467980 KB Output is correct
42 Correct 1667 ms 468420 KB Output is correct
43 Correct 293 ms 450736 KB Output is correct
44 Correct 1559 ms 467976 KB Output is correct
45 Correct 1280 ms 467536 KB Output is correct
46 Correct 1018 ms 467916 KB Output is correct
47 Correct 701 ms 464812 KB Output is correct
48 Correct 677 ms 465844 KB Output is correct
49 Correct 816 ms 466424 KB Output is correct
50 Correct 1152 ms 466424 KB Output is correct
51 Correct 808 ms 466848 KB Output is correct
52 Runtime error 4800 ms 1048576 KB Execution killed with signal 11
53 Halted 0 ms 0 KB -