oj.uz

답안 #543785

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
543785 2022-03-31T11:42:18 Z amunduzbaev 새 집 (APIO18_new_home) C++17
5 / 100
 1373 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 = 1e7 + 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 637 ms 960828 KB Output is correct
2 Correct 510 ms 960716 KB Output is correct
3 Correct 529 ms 960816 KB Output is correct
4 Correct 534 ms 960896 KB Output is correct
5 Correct 544 ms 960992 KB Output is correct
6 Correct 550 ms 961504 KB Output is correct
7 Correct 518 ms 961188 KB Output is correct
8 Correct 563 ms 961808 KB Output is correct
9 Correct 487 ms 961408 KB Output is correct
10 Correct 481 ms 961856 KB Output is correct
11 Correct 505 ms 961044 KB Output is correct
12 Correct 494 ms 961228 KB Output is correct
13 Correct 466 ms 961020 KB Output is correct
14 Correct 459 ms 961092 KB Output is correct
15 Correct 474 ms 961224 KB Output is correct
16 Correct 520 ms 961296 KB Output is correct
17 Correct 490 ms 961196 KB Output is correct
18 Correct 483 ms 961404 KB Output is correct
19 Correct 492 ms 961516 KB Output is correct
20 Correct 524 ms 961272 KB Output is correct
21 Correct 528 ms 961300 KB Output is correct
22 Correct 533 ms 961516 KB Output is correct
23 Correct 478 ms 961608 KB Output is correct
24 Correct 482 ms 961484 KB Output is correct
25 Correct 480 ms 961236 KB Output is correct
26 Correct 483 ms 961156 KB Output is correct
27 Correct 512 ms 960924 KB Output is correct
28 Correct 512 ms 961108 KB Output is correct
29 Correct 496 ms 961044 KB Output is correct
30 Correct 469 ms 961100 KB Output is correct

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 637 ms 960828 KB Output is correct
2 Correct 510 ms 960716 KB Output is correct
3 Correct 529 ms 960816 KB Output is correct
4 Correct 534 ms 960896 KB Output is correct
5 Correct 544 ms 960992 KB Output is correct
6 Correct 550 ms 961504 KB Output is correct
7 Correct 518 ms 961188 KB Output is correct
8 Correct 563 ms 961808 KB Output is correct
9 Correct 487 ms 961408 KB Output is correct
10 Correct 481 ms 961856 KB Output is correct
11 Correct 505 ms 961044 KB Output is correct
12 Correct 494 ms 961228 KB Output is correct
13 Correct 466 ms 961020 KB Output is correct
14 Correct 459 ms 961092 KB Output is correct
15 Correct 474 ms 961224 KB Output is correct
16 Correct 520 ms 961296 KB Output is correct
17 Correct 490 ms 961196 KB Output is correct
18 Correct 483 ms 961404 KB Output is correct
19 Correct 492 ms 961516 KB Output is correct
20 Correct 524 ms 961272 KB Output is correct
21 Correct 528 ms 961300 KB Output is correct
22 Correct 533 ms 961516 KB Output is correct
23 Correct 478 ms 961608 KB Output is correct
24 Correct 482 ms 961484 KB Output is correct
25 Correct 480 ms 961236 KB Output is correct
26 Correct 483 ms 961156 KB Output is correct
27 Correct 512 ms 960924 KB Output is correct
28 Correct 512 ms 961108 KB Output is correct
29 Correct 496 ms 961044 KB Output is correct
30 Correct 469 ms 961100 KB Output is correct
31 Runtime error 1373 ms 1048576 KB Execution killed with signal 9
32 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

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

Subtask #4
0 / 23.0

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

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 637 ms 960828 KB Output is correct
2 Correct 510 ms 960716 KB Output is correct
3 Correct 529 ms 960816 KB Output is correct
4 Correct 534 ms 960896 KB Output is correct
5 Correct 544 ms 960992 KB Output is correct
6 Correct 550 ms 961504 KB Output is correct
7 Correct 518 ms 961188 KB Output is correct
8 Correct 563 ms 961808 KB Output is correct
9 Correct 487 ms 961408 KB Output is correct
10 Correct 481 ms 961856 KB Output is correct
11 Correct 505 ms 961044 KB Output is correct
12 Correct 494 ms 961228 KB Output is correct
13 Correct 466 ms 961020 KB Output is correct
14 Correct 459 ms 961092 KB Output is correct
15 Correct 474 ms 961224 KB Output is correct
16 Correct 520 ms 961296 KB Output is correct
17 Correct 490 ms 961196 KB Output is correct
18 Correct 483 ms 961404 KB Output is correct
19 Correct 492 ms 961516 KB Output is correct
20 Correct 524 ms 961272 KB Output is correct
21 Correct 528 ms 961300 KB Output is correct
22 Correct 533 ms 961516 KB Output is correct
23 Correct 478 ms 961608 KB Output is correct
24 Correct 482 ms 961484 KB Output is correct
25 Correct 480 ms 961236 KB Output is correct
26 Correct 483 ms 961156 KB Output is correct
27 Correct 512 ms 960924 KB Output is correct
28 Correct 512 ms 961108 KB Output is correct
29 Correct 496 ms 961044 KB Output is correct
30 Correct 469 ms 961100 KB Output is correct
31 Runtime error 1373 ms 1048576 KB Execution killed with signal 9
32 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 637 ms 960828 KB Output is correct
2 Correct 510 ms 960716 KB Output is correct
3 Correct 529 ms 960816 KB Output is correct
4 Correct 534 ms 960896 KB Output is correct
5 Correct 544 ms 960992 KB Output is correct
6 Correct 550 ms 961504 KB Output is correct
7 Correct 518 ms 961188 KB Output is correct
8 Correct 563 ms 961808 KB Output is correct
9 Correct 487 ms 961408 KB Output is correct
10 Correct 481 ms 961856 KB Output is correct
11 Correct 505 ms 961044 KB Output is correct
12 Correct 494 ms 961228 KB Output is correct
13 Correct 466 ms 961020 KB Output is correct
14 Correct 459 ms 961092 KB Output is correct
15 Correct 474 ms 961224 KB Output is correct
16 Correct 520 ms 961296 KB Output is correct
17 Correct 490 ms 961196 KB Output is correct
18 Correct 483 ms 961404 KB Output is correct
19 Correct 492 ms 961516 KB Output is correct
20 Correct 524 ms 961272 KB Output is correct
21 Correct 528 ms 961300 KB Output is correct
22 Correct 533 ms 961516 KB Output is correct
23 Correct 478 ms 961608 KB Output is correct
24 Correct 482 ms 961484 KB Output is correct
25 Correct 480 ms 961236 KB Output is correct
26 Correct 483 ms 961156 KB Output is correct
27 Correct 512 ms 960924 KB Output is correct
28 Correct 512 ms 961108 KB Output is correct
29 Correct 496 ms 961044 KB Output is correct
30 Correct 469 ms 961100 KB Output is correct
31 Runtime error 1373 ms 1048576 KB Execution killed with signal 9
32 Halted 0 ms 0 KB -