답안 #361332

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
361332	2021-01-29T10:38:24 Z	AmShZ	새 집 (APIO18_new_home)	C++11	12 / 100	5000 ms	1048580 KB

new_home

//khodaya khodet komak kon
# include <bits/stdc++.h>
 
/*
// ordered_set 
# include <ext/pb_ds/assoc_container.hpp>
# include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
# define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
*/
 
using namespace std;
 
typedef long long                                        ll;
typedef long double                                      ld;
typedef pair <int, int>                                  pii;
typedef pair <pii, int>                                  ppi;
typedef pair <int, pii>                                  pip;
typedef pair <pii, pii>                                  ppp;
typedef pair <ll, ll>                                    pll;
 
# define A                                               first
# define B                                               second
# define endl                                            '\n'
# define sep                                             ' '
# define all(x)                                          x.begin(), x.end()
# define kill(x)                                         return cout << x << endl, 0
# define SZ(x)                                           int(x.size())
# define lc                                              id << 1
# define rc                                              id << 1 | 1
# define InTheNameOfGod                                  ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
 
ll power(ll a, ll b, ll md) {return (!b ? 1 : (b & 1 ? a * power(a * a % md, b / 2, md) % md : power(a * a % md, b / 2, md) % md));}
 
const int xn = 3e5 + 10;
const int xm = - 20 + 10;
const int sq = 320;
const int inf = 1e9 + 10;
const ll INF = 1e18 + 10;
const int mod = 998244353;
const int base = 257;

int n, k, q, ans[xn], cnt[xn], ptr, ted;
int nxt[xn];
ppp a[xn];
pii b[xn];
vector <pip> query;
set <pii> st[xn];

void remove(int x){
	-- cnt[x];
	if (!cnt[x])
		-- ted;
}
int add(int x){
	if (!cnt[x])
		++ ted;
	++ cnt[x];
}

void solve(){
	sort(a + 1, a + n + 1);
	a[n + 1].A.A = inf;
	for (int i = 1; i <= n; ++ i){
		if (i)
			remove(a[i - 1].A.B);
		while (ptr <= n && ted < k)
			add(a[ptr + 1].A.B);
		nxt[i] = ptr;
	}
	nxt[0] = nxt[n + 1] = n + 1;
	while (q --){
		int x, y, ans = inf;
		cin >> x >> y;
		int l = 0, r = n + 1, mid;
		while (r - l > 1){
			mid = (l + r) / 2;
			if (x - a[mid].A.A < a[nxt[mid]].A.A - x)
				r = mid;
			else
				l = mid;
		}
		ans = min(ans, max(x - a[l].A.A, a[nxt[l]].A.A - x));
		ans = min(ans, max(x - a[r].A.A, a[nxt[l]].A.A - x));
		if (x > 1e8)
			ans = - 1;
		cout << ans << endl;
	}
}

int main(){
	InTheNameOfGod;
	
	cin >> n >> k >> q;
	for (int i = 1; i <= n; ++ i){
		int x, t, l, r;
		cin >> x >> t >> l >> r;
		a[i] = {{x, t}, {l, r}};
		query.push_back({l, {0, i}});
		query.push_back({r, {2, i}});
	}
	if (n > 6e4){
		solve();
		return 0;
	}
	for (int i = 1; i <= q; ++ i){
		int x, y;
		cin >> x >> y;
		b[i] = {x, y};
		query.push_back({y, {1, i}});
	}
	for (int i = 1; i <= k; ++ i)
		st[i].insert({inf, 0}), st[i].insert({- inf, 0});
	sort(all(query));
	for (pip Q : query){
		int id = Q.B.B, t = Q.B.A;
		if (t == 0)
			st[a[id].A.B].insert({a[id].A.A, id});
		else if (t == 2)
			st[a[id].A.B].erase({a[id].A.A, id});
		else{
			int mx = 0;
			for (int i = 1; i <= k; ++ i){
				pii x = *st[i].lower_bound({b[id].A, 0});
				pii y = *prev(st[i].lower_bound({b[id].A, 0}));
				mx = max(mx, min(x.A - b[id].A, b[id].A - y.A));
			}
			if (mx > 1e8)
				ans[id] = - 1;
			else
				ans[id] = mx;
		}
	}
	for (int i = 1; i <= q; ++ i)
		cout << ans[i] << endl;
			
	return 0;
}

Compilation message

new_home.cpp: In function 'int add(int)':
new_home.cpp:59:1: warning: no return statement in function returning non-void [-Wreturn-type]
   59 | }
      | ^

Subtask #1

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	10 ms	14444 KB	Output is correct
2	Correct	10 ms	14444 KB	Output is correct
3	Correct	11 ms	14464 KB	Output is correct
4	Correct	10 ms	14464 KB	Output is correct
5	Correct	11 ms	14444 KB	Output is correct
6	Correct	11 ms	14572 KB	Output is correct
7	Correct	12 ms	14572 KB	Output is correct
8	Correct	12 ms	14572 KB	Output is correct
9	Correct	12 ms	14572 KB	Output is correct
10	Correct	13 ms	14572 KB	Output is correct
11	Correct	12 ms	14572 KB	Output is correct
12	Correct	11 ms	14572 KB	Output is correct
13	Correct	11 ms	14572 KB	Output is correct
14	Correct	10 ms	14572 KB	Output is correct
15	Correct	11 ms	14572 KB	Output is correct
16	Correct	12 ms	14572 KB	Output is correct
17	Correct	11 ms	14572 KB	Output is correct
18	Correct	12 ms	14572 KB	Output is correct
19	Correct	12 ms	14572 KB	Output is correct
20	Correct	11 ms	14572 KB	Output is correct
21	Correct	12 ms	14572 KB	Output is correct
22	Correct	13 ms	14572 KB	Output is correct
23	Correct	12 ms	14572 KB	Output is correct
24	Correct	12 ms	14700 KB	Output is correct
25	Correct	11 ms	14572 KB	Output is correct
26	Correct	12 ms	14572 KB	Output is correct
27	Correct	11 ms	14444 KB	Output is correct
28	Correct	11 ms	14572 KB	Output is correct
29	Correct	11 ms	14572 KB	Output is correct
30	Correct	11 ms	14572 KB	Output is correct

Subtask #2

7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	10 ms	14444 KB	Output is correct
2	Correct	10 ms	14444 KB	Output is correct
3	Correct	11 ms	14464 KB	Output is correct
4	Correct	10 ms	14464 KB	Output is correct
5	Correct	11 ms	14444 KB	Output is correct
6	Correct	11 ms	14572 KB	Output is correct
7	Correct	12 ms	14572 KB	Output is correct
8	Correct	12 ms	14572 KB	Output is correct
9	Correct	12 ms	14572 KB	Output is correct
10	Correct	13 ms	14572 KB	Output is correct
11	Correct	12 ms	14572 KB	Output is correct
12	Correct	11 ms	14572 KB	Output is correct
13	Correct	11 ms	14572 KB	Output is correct
14	Correct	10 ms	14572 KB	Output is correct
15	Correct	11 ms	14572 KB	Output is correct
16	Correct	12 ms	14572 KB	Output is correct
17	Correct	11 ms	14572 KB	Output is correct
18	Correct	12 ms	14572 KB	Output is correct
19	Correct	12 ms	14572 KB	Output is correct
20	Correct	11 ms	14572 KB	Output is correct
21	Correct	12 ms	14572 KB	Output is correct
22	Correct	13 ms	14572 KB	Output is correct
23	Correct	12 ms	14572 KB	Output is correct
24	Correct	12 ms	14700 KB	Output is correct
25	Correct	11 ms	14572 KB	Output is correct
26	Correct	12 ms	14572 KB	Output is correct
27	Correct	11 ms	14444 KB	Output is correct
28	Correct	11 ms	14572 KB	Output is correct
29	Correct	11 ms	14572 KB	Output is correct
30	Correct	11 ms	14572 KB	Output is correct
31	Correct	3356 ms	23264 KB	Output is correct
32	Correct	127 ms	20444 KB	Output is correct
33	Correct	246 ms	21340 KB	Output is correct
34	Correct	2432 ms	21492 KB	Output is correct
35	Correct	1478 ms	23092 KB	Output is correct
36	Correct	305 ms	23132 KB	Output is correct
37	Correct	240 ms	20584 KB	Output is correct
38	Correct	138 ms	20320 KB	Output is correct
39	Correct	112 ms	20320 KB	Output is correct
40	Correct	113 ms	20240 KB	Output is correct
41	Correct	447 ms	20572 KB	Output is correct
42	Correct	597 ms	20316 KB	Output is correct
43	Correct	539 ms	23420 KB	Output is correct
44	Correct	366 ms	20500 KB	Output is correct
45	Correct	163 ms	20444 KB	Output is correct
46	Correct	93 ms	20588 KB	Output is correct
47	Correct	86 ms	20320 KB	Output is correct
48	Correct	80 ms	20320 KB	Output is correct
49	Correct	103 ms	20320 KB	Output is correct
50	Correct	338 ms	20192 KB	Output is correct
51	Correct	90 ms	20320 KB	Output is correct

Subtask #3

0 / 10.0

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

Subtask #4

0 / 23.0

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

Subtask #5

0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	10 ms	14444 KB	Output is correct
2	Correct	10 ms	14444 KB	Output is correct
3	Correct	11 ms	14464 KB	Output is correct
4	Correct	10 ms	14464 KB	Output is correct
5	Correct	11 ms	14444 KB	Output is correct
6	Correct	11 ms	14572 KB	Output is correct
7	Correct	12 ms	14572 KB	Output is correct
8	Correct	12 ms	14572 KB	Output is correct
9	Correct	12 ms	14572 KB	Output is correct
10	Correct	13 ms	14572 KB	Output is correct
11	Correct	12 ms	14572 KB	Output is correct
12	Correct	11 ms	14572 KB	Output is correct
13	Correct	11 ms	14572 KB	Output is correct
14	Correct	10 ms	14572 KB	Output is correct
15	Correct	11 ms	14572 KB	Output is correct
16	Correct	12 ms	14572 KB	Output is correct
17	Correct	11 ms	14572 KB	Output is correct
18	Correct	12 ms	14572 KB	Output is correct
19	Correct	12 ms	14572 KB	Output is correct
20	Correct	11 ms	14572 KB	Output is correct
21	Correct	12 ms	14572 KB	Output is correct
22	Correct	13 ms	14572 KB	Output is correct
23	Correct	12 ms	14572 KB	Output is correct
24	Correct	12 ms	14700 KB	Output is correct
25	Correct	11 ms	14572 KB	Output is correct
26	Correct	12 ms	14572 KB	Output is correct
27	Correct	11 ms	14444 KB	Output is correct
28	Correct	11 ms	14572 KB	Output is correct
29	Correct	11 ms	14572 KB	Output is correct
30	Correct	11 ms	14572 KB	Output is correct
31	Correct	3356 ms	23264 KB	Output is correct
32	Correct	127 ms	20444 KB	Output is correct
33	Correct	246 ms	21340 KB	Output is correct
34	Correct	2432 ms	21492 KB	Output is correct
35	Correct	1478 ms	23092 KB	Output is correct
36	Correct	305 ms	23132 KB	Output is correct
37	Correct	240 ms	20584 KB	Output is correct
38	Correct	138 ms	20320 KB	Output is correct
39	Correct	112 ms	20320 KB	Output is correct
40	Correct	113 ms	20240 KB	Output is correct
41	Correct	447 ms	20572 KB	Output is correct
42	Correct	597 ms	20316 KB	Output is correct
43	Correct	539 ms	23420 KB	Output is correct
44	Correct	366 ms	20500 KB	Output is correct
45	Correct	163 ms	20444 KB	Output is correct
46	Correct	93 ms	20588 KB	Output is correct
47	Correct	86 ms	20320 KB	Output is correct
48	Correct	80 ms	20320 KB	Output is correct
49	Correct	103 ms	20320 KB	Output is correct
50	Correct	338 ms	20192 KB	Output is correct
51	Correct	90 ms	20320 KB	Output is correct
52	Execution timed out	5047 ms	24596 KB	Time limit exceeded
53	Halted	0 ms	0 KB	-

Subtask #6

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	10 ms	14444 KB	Output is correct
2	Correct	10 ms	14444 KB	Output is correct
3	Correct	11 ms	14464 KB	Output is correct
4	Correct	10 ms	14464 KB	Output is correct
5	Correct	11 ms	14444 KB	Output is correct
6	Correct	11 ms	14572 KB	Output is correct
7	Correct	12 ms	14572 KB	Output is correct
8	Correct	12 ms	14572 KB	Output is correct
9	Correct	12 ms	14572 KB	Output is correct
10	Correct	13 ms	14572 KB	Output is correct
11	Correct	12 ms	14572 KB	Output is correct
12	Correct	11 ms	14572 KB	Output is correct
13	Correct	11 ms	14572 KB	Output is correct
14	Correct	10 ms	14572 KB	Output is correct
15	Correct	11 ms	14572 KB	Output is correct
16	Correct	12 ms	14572 KB	Output is correct
17	Correct	11 ms	14572 KB	Output is correct
18	Correct	12 ms	14572 KB	Output is correct
19	Correct	12 ms	14572 KB	Output is correct
20	Correct	11 ms	14572 KB	Output is correct
21	Correct	12 ms	14572 KB	Output is correct
22	Correct	13 ms	14572 KB	Output is correct
23	Correct	12 ms	14572 KB	Output is correct
24	Correct	12 ms	14700 KB	Output is correct
25	Correct	11 ms	14572 KB	Output is correct
26	Correct	12 ms	14572 KB	Output is correct
27	Correct	11 ms	14444 KB	Output is correct
28	Correct	11 ms	14572 KB	Output is correct
29	Correct	11 ms	14572 KB	Output is correct
30	Correct	11 ms	14572 KB	Output is correct
31	Correct	3356 ms	23264 KB	Output is correct
32	Correct	127 ms	20444 KB	Output is correct
33	Correct	246 ms	21340 KB	Output is correct
34	Correct	2432 ms	21492 KB	Output is correct
35	Correct	1478 ms	23092 KB	Output is correct
36	Correct	305 ms	23132 KB	Output is correct
37	Correct	240 ms	20584 KB	Output is correct
38	Correct	138 ms	20320 KB	Output is correct
39	Correct	112 ms	20320 KB	Output is correct
40	Correct	113 ms	20240 KB	Output is correct
41	Correct	447 ms	20572 KB	Output is correct
42	Correct	597 ms	20316 KB	Output is correct
43	Correct	539 ms	23420 KB	Output is correct
44	Correct	366 ms	20500 KB	Output is correct
45	Correct	163 ms	20444 KB	Output is correct
46	Correct	93 ms	20588 KB	Output is correct
47	Correct	86 ms	20320 KB	Output is correct
48	Correct	80 ms	20320 KB	Output is correct
49	Correct	103 ms	20320 KB	Output is correct
50	Correct	338 ms	20192 KB	Output is correct
51	Correct	90 ms	20320 KB	Output is correct
52	Runtime error	1108 ms	1048580 KB	Execution killed with signal 9
53	Halted	0 ms	0 KB	-