oj.uz

Submission #845972

# Submission time Handle Problem Language Result Execution time Memory
845972 2023-09-07T01:43:06 Z NK_ Examination (JOI19_examination) C++17
100 / 100
 319 ms 19392 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;

struct BIT {
	int N; V<int> data;
	void init(int _N) { N = _N; data = V<int>(N, 0); }
	void add(int p, int x) { for (++p;p<=N;p+=p&-p) data[p-1] += x; }
	int sum(int l, int r) { return sum(r+1)-sum(l); }
	int sum(int r) { int s = 0; for(;r;r-=r&-r)s+=data[r-1]; return s; }
};

int main() {
	cin.tie(0)->sync_with_stdio(0);

	int N, Q; cin >> N >> Q;

	vl 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 = [&](ll 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;

	vl COOR;
	for(int i = 0; i < N; i++) { 
		COOR.pb(A[i] + B[i]);
		COOR.pb(B[i]);
	}

	sort(begin(COOR), end(COOR));
	COOR.erase(unique(begin(COOR), end(COOR)), end(COOR));

	int M = sz(COOR);
	BIT ct, bt; ct.init(M + 1), bt.init(M + 1);
	for(int i = 0; i < N; i++) {
		int ab = lower_bound(begin(COOR), end(COOR), A[I[i]] + B[I[i]]) - begin(COOR);
		int b = lower_bound(begin(COOR), end(COOR), B[I[i]]) - begin(COOR);

		ct.add(ab, 1);
		bt.add(b, 1);

		for(auto q : QQ[i]) {
			if (q[1] == 0) {
				int x = lower_bound(begin(COOR), end(COOR), q[0]) - begin(COOR);
				ans[q[2]] += bt.sum(x, M - 1);
			} else {
				int x = lower_bound(begin(COOR), end(COOR), q[0]) - begin(COOR);
				ans[q[2]] += q[1] * ct.sum(x, M - 1);
			}
		}
	}

	for(int i = 0; i < Q; i++) cout << ans[i] << endl;

	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 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 7 ms 860 KB Output is correct
8 Correct 7 ms 856 KB Output is correct
9 Correct 10 ms 1112 KB Output is correct
10 Correct 7 ms 856 KB Output is correct
11 Correct 6 ms 856 KB Output is correct
12 Correct 5 ms 856 KB Output is correct
13 Correct 7 ms 856 KB Output is correct
14 Correct 7 ms 856 KB Output is correct
15 Correct 7 ms 860 KB Output is correct
16 Correct 5 ms 872 KB Output is correct
17 Correct 7 ms 856 KB Output is correct
18 Correct 4 ms 604 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 260 ms 19056 KB Output is correct
2 Correct 259 ms 18880 KB Output is correct
3 Correct 263 ms 18936 KB Output is correct
4 Correct 212 ms 18688 KB Output is correct
5 Correct 206 ms 14916 KB Output is correct
6 Correct 158 ms 14792 KB Output is correct
7 Correct 239 ms 19136 KB Output is correct
8 Correct 257 ms 18880 KB Output is correct
9 Correct 239 ms 19392 KB Output is correct
10 Correct 196 ms 14012 KB Output is correct
11 Correct 214 ms 18772 KB Output is correct
12 Correct 141 ms 10604 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 260 ms 19056 KB Output is correct
2 Correct 259 ms 18880 KB Output is correct
3 Correct 263 ms 18936 KB Output is correct
4 Correct 212 ms 18688 KB Output is correct
5 Correct 206 ms 14916 KB Output is correct
6 Correct 158 ms 14792 KB Output is correct
7 Correct 239 ms 19136 KB Output is correct
8 Correct 257 ms 18880 KB Output is correct
9 Correct 239 ms 19392 KB Output is correct
10 Correct 196 ms 14012 KB Output is correct
11 Correct 214 ms 18772 KB Output is correct
12 Correct 141 ms 10604 KB Output is correct
13 Correct 282 ms 16528 KB Output is correct
14 Correct 279 ms 18668 KB Output is correct
15 Correct 256 ms 18880 KB Output is correct
16 Correct 268 ms 17960 KB Output is correct
17 Correct 212 ms 12608 KB Output is correct
18 Correct 164 ms 14868 KB Output is correct
19 Correct 299 ms 16552 KB Output is correct
20 Correct 319 ms 18116 KB Output is correct
21 Correct 270 ms 15592 KB Output is correct
22 Correct 191 ms 13212 KB Output is correct
23 Correct 216 ms 18368 KB Output is correct
24 Correct 147 ms 10848 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 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 7 ms 860 KB Output is correct
8 Correct 7 ms 856 KB Output is correct
9 Correct 10 ms 1112 KB Output is correct
10 Correct 7 ms 856 KB Output is correct
11 Correct 6 ms 856 KB Output is correct
12 Correct 5 ms 856 KB Output is correct
13 Correct 7 ms 856 KB Output is correct
14 Correct 7 ms 856 KB Output is correct
15 Correct 7 ms 860 KB Output is correct
16 Correct 5 ms 872 KB Output is correct
17 Correct 7 ms 856 KB Output is correct
18 Correct 4 ms 604 KB Output is correct
19 Correct 260 ms 19056 KB Output is correct
20 Correct 259 ms 18880 KB Output is correct
21 Correct 263 ms 18936 KB Output is correct
22 Correct 212 ms 18688 KB Output is correct
23 Correct 206 ms 14916 KB Output is correct
24 Correct 158 ms 14792 KB Output is correct
25 Correct 239 ms 19136 KB Output is correct
26 Correct 257 ms 18880 KB Output is correct
27 Correct 239 ms 19392 KB Output is correct
28 Correct 196 ms 14012 KB Output is correct
29 Correct 214 ms 18772 KB Output is correct
30 Correct 141 ms 10604 KB Output is correct
31 Correct 282 ms 16528 KB Output is correct
32 Correct 279 ms 18668 KB Output is correct
33 Correct 256 ms 18880 KB Output is correct
34 Correct 268 ms 17960 KB Output is correct
35 Correct 212 ms 12608 KB Output is correct
36 Correct 164 ms 14868 KB Output is correct
37 Correct 299 ms 16552 KB Output is correct
38 Correct 319 ms 18116 KB Output is correct
39 Correct 270 ms 15592 KB Output is correct
40 Correct 191 ms 13212 KB Output is correct
41 Correct 216 ms 18368 KB Output is correct
42 Correct 147 ms 10848 KB Output is correct
43 Correct 301 ms 17252 KB Output is correct
44 Correct 304 ms 17088 KB Output is correct
45 Correct 312 ms 19268 KB Output is correct
46 Correct 260 ms 18040 KB Output is correct
47 Correct 246 ms 13720 KB Output is correct
48 Correct 156 ms 11628 KB Output is correct
49 Correct 318 ms 18720 KB Output is correct
50 Correct 282 ms 15556 KB Output is correct
51 Correct 303 ms 18412 KB Output is correct
52 Correct 198 ms 11380 KB Output is correct
53 Correct 222 ms 18612 KB Output is correct