oj.uz

Submission #845978

# Submission time Handle Problem Language Result Execution time Memory
845978 2023-09-07T01:53:02 Z NK_ Examination (JOI19_examination) C++17
100 / 100
 298 ms 28300 KB 
// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>
 
using namespace std;
 
#define nl '\n'
#define pb push_back
#define pf push_front
 
#define mp make_pair
#define f first
#define s second
#define sz(x) int(x.size())
 
template<class T> using V = vector<T>;
using pi = pair<int, int>;
using vi = V<int>;
using vpi = V<pi>;
 
using ll = long long;
using pl = pair<ll, ll>;
using vpl = V<pl>;
using vl = V<ll>;
 
using db = long double;
 
template<class T> using pq = priority_queue<T, V<T>, less<T>>;
 
const int MOD = 1e9 + 7;
const ll INFL = ll(1e17);
const int LG = 19;
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
 
template<class T> using iset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
 
int main() {
	cin.tie(0)->sync_with_stdio(0);
 
	int N, Q; cin >> N >> Q;
 
	vi A(N), B(N); for(int i = 0; i < N; i++) {
		cin >> A[i] >> B[i];
	}
 
	vi I(N); iota(begin(I), end(I), 0);
 
	sort(begin(I), end(I), [&](int a, int b) {
		return A[a] > A[b];
	}); 
 
	V<V<array<ll, 3>>> QQ(N); vi ans(Q);
 
	auto find = [&](int x) {
		int lo = -1, hi = N - 1;
		while(lo < hi) {
			int mid = (lo + hi + 1) / 2;
			if (x <= A[I[mid]]) lo = mid;
			else hi = mid - 1;
		}
		return lo;
	};
 
	for(int i = 0; i < Q; i++) {
		ll a, b, c; cin >> a >> b >> c; 
		// cout << a << " " << b << " " << c << endl;
 
		// c-query
		int cq = find(a);
		if (cq != -1) {
			QQ[cq].pb({c, 1, i});
			// cout << i << " " << cq << endl;
		}
 
		// everything after is a b-query
		int bq = min(find(c - b), cq);
		if (bq != -1) {
			QQ[bq].pb({c, -1, i});
			QQ[bq].pb({b, 0, i});
			// cout << i << " " << bq << endl;
		}
	}
 
	// cout << endl;
 
	iset<pl> ct, bt; 
 
	for(int i = 0; i < N; i++) { 
		ct.insert(mp(A[I[i]] + B[I[i]], i));
		bt.insert(mp(B[I[i]], i));
 
		// cout << i << endl;
		for(auto q : QQ[i]) {
			if (q[1] == 0) {
				ans[q[2]] += int(sz(bt) - bt.order_of_key(mp(q[0], -MOD)));
				// cout << q[2] << " " << q[1] << " " << int(sz(bt) - bt.order_of_key(mp(q[0], -MOD))) << endl;
			} else {
				ans[q[2]] += q[1] * int(sz(ct) - ct.order_of_key(mp(q[0], -MOD)));
				// cout << "> " << sz(ct) << " " << ct.order_of_key(mp(q[0], -MOD)) << endl;
				// cout << q[2] << " " << q[1] << " " << q[1] * int(sz(ct) - ct.order_of_key(mp(q[0], -MOD))) << endl;
			}
		}
		// cout << endl;
	}
 
	for(int i = 0; i < Q; i++) cout << ans[i] << nl;
 
	exit(0-0);
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 4 ms 1368 KB Output is correct
8 Correct 4 ms 1116 KB Output is correct
9 Correct 4 ms 1112 KB Output is correct
10 Correct 5 ms 1112 KB Output is correct
11 Correct 3 ms 1112 KB Output is correct
12 Correct 3 ms 1116 KB Output is correct
13 Correct 4 ms 1112 KB Output is correct
14 Correct 4 ms 1112 KB Output is correct
15 Correct 4 ms 1112 KB Output is correct
16 Correct 3 ms 1052 KB Output is correct
17 Correct 4 ms 1112 KB Output is correct
18 Correct 3 ms 856 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 220 ms 28244 KB Output is correct
2 Correct 228 ms 28276 KB Output is correct
3 Correct 204 ms 28240 KB Output is correct
4 Correct 152 ms 28240 KB Output is correct
5 Correct 154 ms 24552 KB Output is correct
6 Correct 115 ms 24416 KB Output is correct
7 Correct 195 ms 27732 KB Output is correct
8 Correct 191 ms 28300 KB Output is correct
9 Correct 183 ms 27732 KB Output is correct
10 Correct 112 ms 21544 KB Output is correct
11 Correct 178 ms 27908 KB Output is correct
12 Correct 154 ms 19288 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 220 ms 28244 KB Output is correct
2 Correct 228 ms 28276 KB Output is correct
3 Correct 204 ms 28240 KB Output is correct
4 Correct 152 ms 28240 KB Output is correct
5 Correct 154 ms 24552 KB Output is correct
6 Correct 115 ms 24416 KB Output is correct
7 Correct 195 ms 27732 KB Output is correct
8 Correct 191 ms 28300 KB Output is correct
9 Correct 183 ms 27732 KB Output is correct
10 Correct 112 ms 21544 KB Output is correct
11 Correct 178 ms 27908 KB Output is correct
12 Correct 154 ms 19288 KB Output is correct
13 Correct 221 ms 25680 KB Output is correct
14 Correct 246 ms 27728 KB Output is correct
15 Correct 198 ms 28240 KB Output is correct
16 Correct 188 ms 27348 KB Output is correct
17 Correct 152 ms 22156 KB Output is correct
18 Correct 124 ms 24308 KB Output is correct
19 Correct 231 ms 25680 KB Output is correct
20 Correct 248 ms 26948 KB Output is correct
21 Correct 251 ms 24732 KB Output is correct
22 Correct 124 ms 22068 KB Output is correct
23 Correct 171 ms 27984 KB Output is correct
24 Correct 160 ms 18752 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 4 ms 1368 KB Output is correct
8 Correct 4 ms 1116 KB Output is correct
9 Correct 4 ms 1112 KB Output is correct
10 Correct 5 ms 1112 KB Output is correct
11 Correct 3 ms 1112 KB Output is correct
12 Correct 3 ms 1116 KB Output is correct
13 Correct 4 ms 1112 KB Output is correct
14 Correct 4 ms 1112 KB Output is correct
15 Correct 4 ms 1112 KB Output is correct
16 Correct 3 ms 1052 KB Output is correct
17 Correct 4 ms 1112 KB Output is correct
18 Correct 3 ms 856 KB Output is correct
19 Correct 220 ms 28244 KB Output is correct
20 Correct 228 ms 28276 KB Output is correct
21 Correct 204 ms 28240 KB Output is correct
22 Correct 152 ms 28240 KB Output is correct
23 Correct 154 ms 24552 KB Output is correct
24 Correct 115 ms 24416 KB Output is correct
25 Correct 195 ms 27732 KB Output is correct
26 Correct 191 ms 28300 KB Output is correct
27 Correct 183 ms 27732 KB Output is correct
28 Correct 112 ms 21544 KB Output is correct
29 Correct 178 ms 27908 KB Output is correct
30 Correct 154 ms 19288 KB Output is correct
31 Correct 221 ms 25680 KB Output is correct
32 Correct 246 ms 27728 KB Output is correct
33 Correct 198 ms 28240 KB Output is correct
34 Correct 188 ms 27348 KB Output is correct
35 Correct 152 ms 22156 KB Output is correct
36 Correct 124 ms 24308 KB Output is correct
37 Correct 231 ms 25680 KB Output is correct
38 Correct 248 ms 26948 KB Output is correct
39 Correct 251 ms 24732 KB Output is correct
40 Correct 124 ms 22068 KB Output is correct
41 Correct 171 ms 27984 KB Output is correct
42 Correct 160 ms 18752 KB Output is correct
43 Correct 230 ms 25824 KB Output is correct
44 Correct 222 ms 25928 KB Output is correct
45 Correct 231 ms 27728 KB Output is correct
46 Correct 298 ms 27440 KB Output is correct
47 Correct 146 ms 22152 KB Output is correct
48 Correct 118 ms 21120 KB Output is correct
49 Correct 269 ms 27220 KB Output is correct
50 Correct 220 ms 24164 KB Output is correct
51 Correct 244 ms 26960 KB Output is correct
52 Correct 129 ms 19644 KB Output is correct
53 Correct 221 ms 27984 KB Output is correct