oj.uz

답안 #742918

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
742918 2023-05-17T06:07:58 Z zaneyu Advertisement 2 (JOI23_ho_t2) C++14
100 / 100
 1096 ms 42328 KB 
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll maxn=5e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-4;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
pii arr[maxn];
map<int,int> mp;
struct seg{
	int seg[4*maxn];
	void upd(int idx,int l,int r,int p,int x){
		if(r<p or l>p) return;
		int mid=(l+r)/2;
		MXTO(seg[idx],x);
		if(l==r) return;
		upd(idx*2,l,mid,p,x);
		upd(idx*2+1,mid+1,r,p,x);
	}
	int query(int idx,int l,int r,int ql,int qr){
		int mid=(l+r)/2;
		if(r<ql or l>qr) return -INF;
		if(ql<=l and r<=qr) return seg[idx];
		return max(query(idx*2,l,mid,ql,qr),query(idx*2+1,mid+1,r,ql,qr));
	}
}seg,seg2;
int main(){
	int n;
	cin>>n;
	vector<int> dsc;
	REP(i,n){
		cin>>arr[i].s>>arr[i].f;
		dsc.pb(arr[i].s);
	}
	SORT_UNIQUE(dsc);
	REP(i,sz(dsc)) mp[dsc[i]]=i;
	sort(arr,arr+n);
	reverse(arr,arr+n);
	multiset<int> ms;
	int ans=0;
	REP(i,n){
		int p=mp[arr[i].s];
		//cout<<seg.query(1,0,n-1,0,p)<<' ';
		if(seg.query(1,0,n-1,0,p)>=arr[i].s+arr[i].f or seg2.query(1,0,n-1,p,n-1)>=arr[i].f-arr[i].s+INF) continue;
		seg.upd(1,0,n-1,p,arr[i].s+arr[i].f);
		seg2.upd(1,0,n-1,p,arr[i].f-arr[i].s+INF);
		++ans;
	}
	cout<<ans<<'\n';
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 192 ms 9372 KB Output is correct
3 Correct 214 ms 10172 KB Output is correct
4 Correct 429 ms 9660 KB Output is correct
5 Correct 318 ms 6004 KB Output is correct
6 Correct 784 ms 35092 KB Output is correct
7 Correct 655 ms 21880 KB Output is correct
8 Correct 473 ms 12940 KB Output is correct
9 Correct 425 ms 10072 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 316 KB Output is correct
4 Correct 0 ms 320 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 320 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 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 316 KB Output is correct
4 Correct 0 ms 320 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 320 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 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 2 ms 340 KB Output is correct
20 Correct 2 ms 316 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 2 ms 320 KB Output is correct
26 Correct 2 ms 340 KB Output is correct

Subtask #4
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 192 ms 9372 KB Output is correct
3 Correct 214 ms 10172 KB Output is correct
4 Correct 429 ms 9660 KB Output is correct
5 Correct 318 ms 6004 KB Output is correct
6 Correct 784 ms 35092 KB Output is correct
7 Correct 655 ms 21880 KB Output is correct
8 Correct 473 ms 12940 KB Output is correct
9 Correct 425 ms 10072 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 316 KB Output is correct
13 Correct 0 ms 320 KB Output is correct
14 Correct 1 ms 320 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 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 320 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 320 KB Output is correct
25 Correct 1 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 2 ms 340 KB Output is correct
29 Correct 2 ms 316 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 2 ms 340 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 2 ms 320 KB Output is correct
35 Correct 2 ms 340 KB Output is correct
36 Correct 644 ms 29000 KB Output is correct
37 Correct 907 ms 36616 KB Output is correct
38 Correct 1096 ms 42328 KB Output is correct
39 Correct 905 ms 29068 KB Output is correct
40 Correct 1022 ms 37624 KB Output is correct
41 Correct 952 ms 34000 KB Output is correct
42 Correct 715 ms 32968 KB Output is correct
43 Correct 705 ms 34684 KB Output is correct
44 Correct 673 ms 37068 KB Output is correct
45 Correct 694 ms 40968 KB Output is correct