oj.uz

답안 #785294

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
785294 2023-07-17T08:06:41 Z KLPP Advertisement 2 (JOI23_ho_t2) C++14
100 / 100
 134 ms 25664 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
typedef long long int lld;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define trav(a,v) for(auto a:v)

lld absol(lld x){return max(x,-x);}
bool dom(pair<lld,lld> a, pair<lld,lld> b){
	if(absol(a.first-b.first)<=a.second-b.second)return true;
	return false;
}
void solve(){
	int n;
	cin>>n;
	vector<pair<lld,lld> >V(n);
	rep(i,0,n)cin>>V[i].first>>V[i].second;
	sort(V.begin(),V.end());
	vector<pair<lld,lld> >ans;
	trav(a,V){
		if(ans.size()==0){
			ans.push_back(a);
		}else{
			if(!dom(ans[ans.size()-1],a)){
				while(ans.size()>0 && dom(a,ans[ans.size()-1]))ans.pop_back();
				ans.push_back(a);
			}
		}
	}
	cout<<ans.size()<<"\n";
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt=1;
	//cin>>tt;
	while(tt--){
		solve();
	}
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 39 ms 6900 KB Output is correct
3 Correct 43 ms 8736 KB Output is correct
4 Correct 103 ms 16684 KB Output is correct
5 Correct 65 ms 11688 KB Output is correct
6 Correct 119 ms 25664 KB Output is correct
7 Correct 132 ms 22016 KB Output is correct
8 Correct 120 ms 18004 KB Output is correct
9 Correct 93 ms 17868 KB Output is correct

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 0 ms 324 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 316 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 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 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 0 ms 324 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 316 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 340 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 340 KB Output is correct
26 Correct 1 ms 332 KB Output is correct

Subtask #4
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 39 ms 6900 KB Output is correct
3 Correct 43 ms 8736 KB Output is correct
4 Correct 103 ms 16684 KB Output is correct
5 Correct 65 ms 11688 KB Output is correct
6 Correct 119 ms 25664 KB Output is correct
7 Correct 132 ms 22016 KB Output is correct
8 Correct 120 ms 18004 KB Output is correct
9 Correct 93 ms 17868 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 0 ms 324 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 1 ms 320 KB Output is correct
18 Correct 1 ms 324 KB Output is correct
19 Correct 1 ms 320 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 316 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 340 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 340 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 80 ms 11924 KB Output is correct
37 Correct 102 ms 15124 KB Output is correct
38 Correct 130 ms 17736 KB Output is correct
39 Correct 132 ms 14792 KB Output is correct
40 Correct 122 ms 17736 KB Output is correct
41 Correct 119 ms 17768 KB Output is correct
42 Correct 134 ms 17864 KB Output is correct
43 Correct 134 ms 18964 KB Output is correct
44 Correct 120 ms 17868 KB Output is correct
45 Correct 117 ms 22260 KB Output is correct