답안 #905220

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
905220	2024-01-12T18:29:47 Z	Petrix	Advertisement 2 (JOI23_ho_t2)	C++17	100 / 100	129 ms	13924 KB

Main

#include <cstdio>
#include <vector>
#include <utility>
#include <algorithm>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}

int main() {
	int N = ri();
	std::vector<std::pair<int, int> > points(N);
	for (int i = 0; i < N; i++) {
		int X = ri();
		int E = ri();
		points[i] = {X - E, X + E}; // {a[i], b[i]}
	}
	
	// a同じならbé™é †ã«ã™ã‚‹ã¨ã€aが同じやつで複数回bの最大値を更新してしまったりしなくなる
	std::sort(points.begin(), points.end(), [] (auto &i, auto &j) {
		if (i.first != j.first) return i.first < j.first;
		return i.second > j.second;
	});
	int max = -1;
	int cnt = 0;
	for (auto i : points) if (max < i.second) max = i.second, cnt++;
	
	printf("%d\n", cnt);
	return 0;
}

Compilation message

Main.cpp: In function 'int ri()':
Main.cpp:8:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~

Subtask #1

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	34 ms	1372 KB	Output is correct
3	Correct	44 ms	1624 KB	Output is correct
4	Correct	105 ms	4032 KB	Output is correct
5	Correct	58 ms	2904 KB	Output is correct
6	Correct	118 ms	4440 KB	Output is correct
7	Correct	123 ms	4184 KB	Output is correct
8	Correct	113 ms	4188 KB	Output is correct
9	Correct	88 ms	4188 KB	Output is correct

Subtask #2

23.0 / 23.0

#	결과	실행 시간	메모리	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	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 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	1 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	1 ms	600 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct

Subtask #3

36.0 / 36.0

#	결과	실행 시간	메모리	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	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 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	1 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	1 ms	600 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	348 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	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct

Subtask #4

31.0 / 31.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	34 ms	1372 KB	Output is correct
3	Correct	44 ms	1624 KB	Output is correct
4	Correct	105 ms	4032 KB	Output is correct
5	Correct	58 ms	2904 KB	Output is correct
6	Correct	118 ms	4440 KB	Output is correct
7	Correct	123 ms	4184 KB	Output is correct
8	Correct	113 ms	4188 KB	Output is correct
9	Correct	88 ms	4188 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	1 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	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	1 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	1 ms	600 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	348 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	1 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	1 ms	348 KB	Output is correct
36	Correct	82 ms	9428 KB	Output is correct
37	Correct	105 ms	11860 KB	Output is correct
38	Correct	124 ms	13916 KB	Output is correct
39	Correct	112 ms	10844 KB	Output is correct
40	Correct	125 ms	13784 KB	Output is correct
41	Correct	126 ms	13924 KB	Output is correct
42	Correct	125 ms	13796 KB	Output is correct
43	Correct	126 ms	12908 KB	Output is correct
44	Correct	129 ms	13908 KB	Output is correct
45	Correct	110 ms	10080 KB	Output is correct