Submission #763838

# Submission time Handle Problem Language Result Execution time Memory
763838 2023-06-22T23:56:52 Z NK_ Advertisement 2 (JOI23_ho_t2) C++17
100 / 100
1875 ms 61988 KB
#include <bits/stdc++.h>

using namespace std;

#define nl '\n'

using ll = long long;

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

	int N; cin >> N;
	vector<array<int, 2>> A(N);
	for(auto& x : A) {
		cin >> x[0] >> x[1];
	}

	set<int> S; for(int i = 0; i < N; i++) S.insert(i);

	vector<int> IDX; for(int i = 0; i < N; i++) IDX.push_back(i);

	for(int t = 0; t < 2; t++) {
		sort(begin(IDX), end(IDX), [&](int x, int y) {
			if (A[x] == A[y]) return x < y;
			return A[x] < A[y];
		});	
		vector<int> stk = {-1};
		for(auto i : IDX) {
			while(stk.back() != -1 && (A[stk.back()][1] - A[stk.back()][0]) <= (A[i][1] - A[i][0])) {
				stk.pop_back();
			}
			stk.push_back(i);
		}

		set<int> NS;
		for(auto x : stk) {
			// cout << x << " ";
			if (S.count(x)) NS.insert(x);
		}
		// cout << nl;
		S.swap(NS);

		for(auto& x : A) x[0] = -x[0];
	}
	
	cout << size(S) << nl;

	return 0;
}

/*

*/
# Verdict Execution time Memory Grader output
1 Correct 0 ms 316 KB Output is correct
2 Correct 225 ms 15716 KB Output is correct
3 Correct 196 ms 18076 KB Output is correct
4 Correct 351 ms 32180 KB Output is correct
5 Correct 168 ms 26656 KB Output is correct
6 Correct 1534 ms 61988 KB Output is correct
7 Correct 672 ms 50544 KB Output is correct
8 Correct 355 ms 39644 KB Output is correct
9 Correct 258 ms 39632 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 232 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 324 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 0 ms 320 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 324 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 232 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 324 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 0 ms 320 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 324 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 352 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 316 KB Output is correct
2 Correct 225 ms 15716 KB Output is correct
3 Correct 196 ms 18076 KB Output is correct
4 Correct 351 ms 32180 KB Output is correct
5 Correct 168 ms 26656 KB Output is correct
6 Correct 1534 ms 61988 KB Output is correct
7 Correct 672 ms 50544 KB Output is correct
8 Correct 355 ms 39644 KB Output is correct
9 Correct 258 ms 39632 KB Output is correct
10 Correct 1 ms 232 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 1 ms 320 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 324 KB Output is correct
17 Correct 1 ms 320 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 324 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Correct 0 ms 320 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 324 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 352 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 207 ms 26964 KB Output is correct
37 Correct 283 ms 33796 KB Output is correct
38 Correct 331 ms 39460 KB Output is correct
39 Correct 340 ms 36416 KB Output is correct
40 Correct 341 ms 39468 KB Output is correct
41 Correct 348 ms 39440 KB Output is correct
42 Correct 360 ms 39524 KB Output is correct
43 Correct 799 ms 53580 KB Output is correct
44 Correct 1020 ms 57564 KB Output is correct
45 Correct 1875 ms 60348 KB Output is correct