oj.uz

Submission #361335

# Submission time Handle Problem Language Result Execution time Memory
361335 2021-01-29T10:44:42 Z AmShZ New Home (APIO18_new_home) C++11
22 / 100
 5000 ms 45532 KB 
//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;
}
void 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)
			++ ptr, add(a[ptr].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[r]].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;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 14444 KB Output is correct
2 Correct 10 ms 14444 KB Output is correct
3 Correct 11 ms 14444 KB Output is correct
4 Correct 10 ms 14444 KB Output is correct
5 Correct 11 ms 14444 KB Output is correct
6 Correct 11 ms 14444 KB Output is correct
7 Correct 12 ms 14572 KB Output is correct
8 Correct 11 ms 14572 KB Output is correct
9 Correct 12 ms 14572 KB Output is correct
10 Correct 11 ms 14444 KB Output is correct
11 Correct 11 ms 14444 KB Output is correct
12 Correct 10 ms 14444 KB Output is correct
13 Correct 10 ms 14444 KB Output is correct
14 Correct 10 ms 14444 KB Output is correct
15 Correct 12 ms 14444 KB Output is correct
16 Correct 12 ms 14572 KB Output is correct
17 Correct 12 ms 14464 KB Output is correct
18 Correct 13 ms 14444 KB Output is correct
19 Correct 11 ms 14572 KB Output is correct
20 Correct 11 ms 14444 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 11 ms 14568 KB Output is correct
25 Correct 11 ms 14460 KB Output is correct
26 Correct 10 ms 14444 KB Output is correct
27 Correct 11 ms 14444 KB Output is correct
28 Correct 10 ms 14444 KB Output is correct
29 Correct 10 ms 14444 KB Output is correct
30 Correct 10 ms 14444 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 14444 KB Output is correct
2 Correct 10 ms 14444 KB Output is correct
3 Correct 11 ms 14444 KB Output is correct
4 Correct 10 ms 14444 KB Output is correct
5 Correct 11 ms 14444 KB Output is correct
6 Correct 11 ms 14444 KB Output is correct
7 Correct 12 ms 14572 KB Output is correct
8 Correct 11 ms 14572 KB Output is correct
9 Correct 12 ms 14572 KB Output is correct
10 Correct 11 ms 14444 KB Output is correct
11 Correct 11 ms 14444 KB Output is correct
12 Correct 10 ms 14444 KB Output is correct
13 Correct 10 ms 14444 KB Output is correct
14 Correct 10 ms 14444 KB Output is correct
15 Correct 12 ms 14444 KB Output is correct
16 Correct 12 ms 14572 KB Output is correct
17 Correct 12 ms 14464 KB Output is correct
18 Correct 13 ms 14444 KB Output is correct
19 Correct 11 ms 14572 KB Output is correct
20 Correct 11 ms 14444 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 11 ms 14568 KB Output is correct
25 Correct 11 ms 14460 KB Output is correct
26 Correct 10 ms 14444 KB Output is correct
27 Correct 11 ms 14444 KB Output is correct
28 Correct 10 ms 14444 KB Output is correct
29 Correct 10 ms 14444 KB Output is correct
30 Correct 10 ms 14444 KB Output is correct
31 Correct 3326 ms 21632 KB Output is correct
32 Correct 125 ms 19548 KB Output is correct
33 Correct 243 ms 19676 KB Output is correct
34 Correct 2411 ms 19844 KB Output is correct
35 Correct 1489 ms 21580 KB Output is correct
36 Correct 290 ms 21468 KB Output is correct
37 Correct 239 ms 18908 KB Output is correct
38 Correct 127 ms 18780 KB Output is correct
39 Correct 109 ms 18780 KB Output is correct
40 Correct 106 ms 18656 KB Output is correct
41 Correct 429 ms 18908 KB Output is correct
42 Correct 569 ms 18780 KB Output is correct
43 Correct 516 ms 21724 KB Output is correct
44 Correct 359 ms 19036 KB Output is correct
45 Correct 180 ms 18916 KB Output is correct
46 Correct 87 ms 19036 KB Output is correct
47 Correct 83 ms 18656 KB Output is correct
48 Correct 82 ms 18784 KB Output is correct
49 Correct 98 ms 18656 KB Output is correct
50 Correct 336 ms 18792 KB Output is correct
51 Correct 86 ms 18656 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 324 ms 31056 KB Output is correct
2 Correct 481 ms 41724 KB Output is correct
3 Correct 339 ms 45532 KB Output is correct
4 Correct 342 ms 44432 KB Output is correct
5 Correct 437 ms 41152 KB Output is correct
6 Correct 461 ms 41664 KB Output is correct
7 Correct 332 ms 45248 KB Output is correct
8 Correct 328 ms 44352 KB Output is correct
9 Correct 350 ms 44096 KB Output is correct
10 Correct 450 ms 42804 KB Output is correct
11 Correct 319 ms 41640 KB Output is correct
12 Correct 320 ms 42624 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 370 ms 31184 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 14444 KB Output is correct
2 Correct 10 ms 14444 KB Output is correct
3 Correct 11 ms 14444 KB Output is correct
4 Correct 10 ms 14444 KB Output is correct
5 Correct 11 ms 14444 KB Output is correct
6 Correct 11 ms 14444 KB Output is correct
7 Correct 12 ms 14572 KB Output is correct
8 Correct 11 ms 14572 KB Output is correct
9 Correct 12 ms 14572 KB Output is correct
10 Correct 11 ms 14444 KB Output is correct
11 Correct 11 ms 14444 KB Output is correct
12 Correct 10 ms 14444 KB Output is correct
13 Correct 10 ms 14444 KB Output is correct
14 Correct 10 ms 14444 KB Output is correct
15 Correct 12 ms 14444 KB Output is correct
16 Correct 12 ms 14572 KB Output is correct
17 Correct 12 ms 14464 KB Output is correct
18 Correct 13 ms 14444 KB Output is correct
19 Correct 11 ms 14572 KB Output is correct
20 Correct 11 ms 14444 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 11 ms 14568 KB Output is correct
25 Correct 11 ms 14460 KB Output is correct
26 Correct 10 ms 14444 KB Output is correct
27 Correct 11 ms 14444 KB Output is correct
28 Correct 10 ms 14444 KB Output is correct
29 Correct 10 ms 14444 KB Output is correct
30 Correct 10 ms 14444 KB Output is correct
31 Correct 3326 ms 21632 KB Output is correct
32 Correct 125 ms 19548 KB Output is correct
33 Correct 243 ms 19676 KB Output is correct
34 Correct 2411 ms 19844 KB Output is correct
35 Correct 1489 ms 21580 KB Output is correct
36 Correct 290 ms 21468 KB Output is correct
37 Correct 239 ms 18908 KB Output is correct
38 Correct 127 ms 18780 KB Output is correct
39 Correct 109 ms 18780 KB Output is correct
40 Correct 106 ms 18656 KB Output is correct
41 Correct 429 ms 18908 KB Output is correct
42 Correct 569 ms 18780 KB Output is correct
43 Correct 516 ms 21724 KB Output is correct
44 Correct 359 ms 19036 KB Output is correct
45 Correct 180 ms 18916 KB Output is correct
46 Correct 87 ms 19036 KB Output is correct
47 Correct 83 ms 18656 KB Output is correct
48 Correct 82 ms 18784 KB Output is correct
49 Correct 98 ms 18656 KB Output is correct
50 Correct 336 ms 18792 KB Output is correct
51 Correct 86 ms 18656 KB Output is correct
52 Execution timed out 5067 ms 24524 KB Time limit exceeded
53 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 14444 KB Output is correct
2 Correct 10 ms 14444 KB Output is correct
3 Correct 11 ms 14444 KB Output is correct
4 Correct 10 ms 14444 KB Output is correct
5 Correct 11 ms 14444 KB Output is correct
6 Correct 11 ms 14444 KB Output is correct
7 Correct 12 ms 14572 KB Output is correct
8 Correct 11 ms 14572 KB Output is correct
9 Correct 12 ms 14572 KB Output is correct
10 Correct 11 ms 14444 KB Output is correct
11 Correct 11 ms 14444 KB Output is correct
12 Correct 10 ms 14444 KB Output is correct
13 Correct 10 ms 14444 KB Output is correct
14 Correct 10 ms 14444 KB Output is correct
15 Correct 12 ms 14444 KB Output is correct
16 Correct 12 ms 14572 KB Output is correct
17 Correct 12 ms 14464 KB Output is correct
18 Correct 13 ms 14444 KB Output is correct
19 Correct 11 ms 14572 KB Output is correct
20 Correct 11 ms 14444 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 11 ms 14568 KB Output is correct
25 Correct 11 ms 14460 KB Output is correct
26 Correct 10 ms 14444 KB Output is correct
27 Correct 11 ms 14444 KB Output is correct
28 Correct 10 ms 14444 KB Output is correct
29 Correct 10 ms 14444 KB Output is correct
30 Correct 10 ms 14444 KB Output is correct
31 Correct 3326 ms 21632 KB Output is correct
32 Correct 125 ms 19548 KB Output is correct
33 Correct 243 ms 19676 KB Output is correct
34 Correct 2411 ms 19844 KB Output is correct
35 Correct 1489 ms 21580 KB Output is correct
36 Correct 290 ms 21468 KB Output is correct
37 Correct 239 ms 18908 KB Output is correct
38 Correct 127 ms 18780 KB Output is correct
39 Correct 109 ms 18780 KB Output is correct
40 Correct 106 ms 18656 KB Output is correct
41 Correct 429 ms 18908 KB Output is correct
42 Correct 569 ms 18780 KB Output is correct
43 Correct 516 ms 21724 KB Output is correct
44 Correct 359 ms 19036 KB Output is correct
45 Correct 180 ms 18916 KB Output is correct
46 Correct 87 ms 19036 KB Output is correct
47 Correct 83 ms 18656 KB Output is correct
48 Correct 82 ms 18784 KB Output is correct
49 Correct 98 ms 18656 KB Output is correct
50 Correct 336 ms 18792 KB Output is correct
51 Correct 86 ms 18656 KB Output is correct
52 Correct 324 ms 31056 KB Output is correct
53 Correct 481 ms 41724 KB Output is correct
54 Correct 339 ms 45532 KB Output is correct
55 Correct 342 ms 44432 KB Output is correct
56 Correct 437 ms 41152 KB Output is correct
57 Correct 461 ms 41664 KB Output is correct
58 Correct 332 ms 45248 KB Output is correct
59 Correct 328 ms 44352 KB Output is correct
60 Correct 350 ms 44096 KB Output is correct
61 Correct 450 ms 42804 KB Output is correct
62 Correct 319 ms 41640 KB Output is correct
63 Correct 320 ms 42624 KB Output is correct
64 Incorrect 370 ms 31184 KB Output isn't correct
65 Halted 0 ms 0 KB -