oj.uz

답안 #727422

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
727422 2023-04-20T15:49:28 Z model_code Advertisement 2 (JOI23_ho_t2) C++17
100 / 100
 207 ms 4224 KB 
#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 0 ms 212 KB Output is correct
2 Correct 52 ms 1236 KB Output is correct
3 Correct 69 ms 1672 KB Output is correct
4 Correct 185 ms 3904 KB Output is correct
5 Correct 118 ms 2832 KB Output is correct
6 Correct 196 ms 4192 KB Output is correct
7 Correct 187 ms 4200 KB Output is correct
8 Correct 205 ms 4180 KB Output is correct
9 Correct 159 ms 4192 KB Output is correct

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 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 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct

Subtask #3
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 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 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 252 KB Output is correct
21 Correct 1 ms 292 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 224 KB Output is correct
26 Correct 1 ms 216 KB Output is correct

Subtask #4
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 52 ms 1236 KB Output is correct
3 Correct 69 ms 1672 KB Output is correct
4 Correct 185 ms 3904 KB Output is correct
5 Correct 118 ms 2832 KB Output is correct
6 Correct 196 ms 4192 KB Output is correct
7 Correct 187 ms 4200 KB Output is correct
8 Correct 205 ms 4180 KB Output is correct
9 Correct 159 ms 4192 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 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 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 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 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 252 KB Output is correct
30 Correct 1 ms 292 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 224 KB Output is correct
35 Correct 1 ms 216 KB Output is correct
36 Correct 127 ms 2880 KB Output is correct
37 Correct 155 ms 3596 KB Output is correct
38 Correct 207 ms 4196 KB Output is correct
39 Correct 185 ms 4188 KB Output is correct
40 Correct 169 ms 4192 KB Output is correct
41 Correct 189 ms 4192 KB Output is correct
42 Correct 186 ms 4224 KB Output is correct
43 Correct 180 ms 4192 KB Output is correct
44 Correct 188 ms 4188 KB Output is correct
45 Correct 153 ms 4188 KB Output is correct