답안 #942086

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
942086	2024-03-10T08:35:19 Z	Kiameimon_Welt_Rene	Advertisement 2 (JOI23_ho_t2)	C++14	100 / 100	74 ms	27064 KB

Main

#include <bits/stdc++.h>
using namespace std;
#define int long long 
using ll = long long;
using pii = pair<int,int>;
#define elif else if
#define dbg(v)\
    cout << "Line(" << __LINE__ << ") -> " << #v << " = " << (v) << endl;

inline int readInt() {
    int x = 0;
    char ch = getchar();
    while (ch < '0' || ch > '9') ch = getchar_unlocked();
    while (ch >= '0' && ch <= '9'){
		x = (x << 3) + (x << 1) + ch - '0';
		ch = getchar_unlocked();
	}
    return x;
}

bool cover(pii a, pii b){
	return abs(a.first-b.first) <= a.second-b.second;
}

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	
	int n = readInt();
	pii arr[n];
	for(int i = 0; i < n; i++){
		arr[i].first = readInt();
		arr[i].second = readInt();
	}
  	sort(arr, arr+n);
	vector<pii> v;
	for(int i = 0; i < n; i++){
		while(!v.empty() && cover(arr[i], v.back())) v.pop_back();
		if(v.empty() || (!cover(arr[i], v.back()) && !cover(v.back(), arr[i]))) v.push_back(arr[i]);
	}
	cout << v.size();
	
    return 0;
}

Subtask #1

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	18 ms	6928 KB	Output is correct
3	Correct	27 ms	8864 KB	Output is correct
4	Correct	59 ms	16652 KB	Output is correct
5	Correct	26 ms	11892 KB	Output is correct
6	Correct	74 ms	27064 KB	Output is correct
7	Correct	73 ms	23464 KB	Output is correct
8	Correct	62 ms	17972 KB	Output is correct
9	Correct	40 ms	18020 KB	Output is correct

Subtask #2

23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	500 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	460 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	460 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	348 KB	Output is correct
10	Correct	1 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	344 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	360 KB	Output is correct
16	Correct	1 ms	356 KB	Output is correct
17	Correct	0 ms	356 KB	Output is correct
18	Correct	1 ms	456 KB	Output is correct

Subtask #3

36.0 / 36.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	500 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	460 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	460 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	348 KB	Output is correct
10	Correct	1 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	344 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	360 KB	Output is correct
16	Correct	1 ms	356 KB	Output is correct
17	Correct	0 ms	356 KB	Output is correct
18	Correct	1 ms	456 KB	Output is correct
19	Correct	1 ms	352 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	604 KB	Output is correct
22	Correct	1 ms	360 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	0 ms	344 KB	Output is correct
2	Correct	18 ms	6928 KB	Output is correct
3	Correct	27 ms	8864 KB	Output is correct
4	Correct	59 ms	16652 KB	Output is correct
5	Correct	26 ms	11892 KB	Output is correct
6	Correct	74 ms	27064 KB	Output is correct
7	Correct	73 ms	23464 KB	Output is correct
8	Correct	62 ms	17972 KB	Output is correct
9	Correct	40 ms	18020 KB	Output is correct
10	Correct	1 ms	500 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	460 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	460 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	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	344 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	360 KB	Output is correct
25	Correct	1 ms	356 KB	Output is correct
26	Correct	0 ms	356 KB	Output is correct
27	Correct	1 ms	456 KB	Output is correct
28	Correct	1 ms	352 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	1 ms	604 KB	Output is correct
31	Correct	1 ms	360 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	45 ms	12048 KB	Output is correct
37	Correct	57 ms	15260 KB	Output is correct
38	Correct	68 ms	17944 KB	Output is correct
39	Correct	68 ms	14896 KB	Output is correct
40	Correct	67 ms	17860 KB	Output is correct
41	Correct	69 ms	17896 KB	Output is correct
42	Correct	69 ms	17856 KB	Output is correct
43	Correct	71 ms	19096 KB	Output is correct
44	Correct	69 ms	18004 KB	Output is correct
45	Correct	58 ms	22648 KB	Output is correct