Submission #924629

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
924629	2024-02-09T10:24:31 Z	esomer	Advertisement 2 (JOI23_ho_t2)	C++17	100 / 100	181 ms	33204 KB

Main

#include <bits/stdc++.h>

using namespace std;

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	int N; cin >> N;
	vector<pair<int, int>> v(N);
	for(int i = 0; i < N; i++){
		cin >> v[i].first >> v[i].second;
	}
	sort(v.begin(), v.end());
	int useless = 0;
	set<pair<int, int>> left;
	int mxVal = -2e9;
	for(int i = 0; i < N; i++){
		int val1 = v[i].second - v[i].first;
		int val2 = v[i].first + v[i].second;
		if(mxVal >= val2){
			useless++;
			continue;
		}
		mxVal = val2;
		while(!left.empty() && (*left.begin()).first <= val1){
			useless++;
			left.erase(left.begin());
		}
		left.insert({val1, i});
	}
	cout << N - useless << "\n";
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	43 ms	9272 KB	Output is correct
3	Correct	50 ms	8568 KB	Output is correct
4	Correct	101 ms	11676 KB	Output is correct
5	Correct	56 ms	8528 KB	Output is correct
6	Correct	181 ms	33204 KB	Output is correct
7	Correct	161 ms	22508 KB	Output is correct
8	Correct	117 ms	12788 KB	Output is correct
9	Correct	86 ms	12520 KB	Output is correct

Subtask #2

23.0 / 23.0

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

Subtask #3

36.0 / 36.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	456 KB	Output is correct
5	Correct	0 ms	448 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	0 ms	344 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	1 ms	600 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct

Subtask #4

31.0 / 31.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	43 ms	9272 KB	Output is correct
3	Correct	50 ms	8568 KB	Output is correct
4	Correct	101 ms	11676 KB	Output is correct
5	Correct	56 ms	8528 KB	Output is correct
6	Correct	181 ms	33204 KB	Output is correct
7	Correct	161 ms	22508 KB	Output is correct
8	Correct	117 ms	12788 KB	Output is correct
9	Correct	86 ms	12520 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	456 KB	Output is correct
14	Correct	0 ms	448 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	1 ms	344 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	0 ms	344 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	1 ms	600 KB	Output is correct
35	Correct	1 ms	348 KB	Output is correct
36	Correct	76 ms	8528 KB	Output is correct
37	Correct	106 ms	10580 KB	Output is correct
38	Correct	131 ms	12972 KB	Output is correct
39	Correct	105 ms	10212 KB	Output is correct
40	Correct	117 ms	12372 KB	Output is correct
41	Correct	129 ms	12552 KB	Output is correct
42	Correct	117 ms	12368 KB	Output is correct
43	Correct	152 ms	17636 KB	Output is correct
44	Correct	122 ms	12532 KB	Output is correct
45	Correct	180 ms	32848 KB	Output is correct