oj.uz

Submission #931519

# Submission time Handle Problem Language Result Execution time Memory
931519 2024-02-22T01:59:15 Z pcc Advertisement 2 (JOI23_ho_t2) C++14
100 / 100
 267 ms 43548 KB 
#include <bits/stdc++.h>
using namespace std;


#define pii pair<int,int>
#define fs first
#define sc second
#define ll long long
#define int ll

const ll inf = 1e12;
const ll mxn = 5e5+10;
pii arr[mxn];
int brr[mxn];
bitset<mxn> done;
int N;

struct SEG{
	ll seg[mxn*4];
	SEG(){
		fill(seg,seg+mxn*4,-inf);
	}
	void modify(int now,int l,int r,int s,int e,int v){
		if(l>=s&&e>=r){
			seg[now] = max(seg[now],v);
			return;
		}
		int mid = (l+r)>>1;
		if(mid>=s)modify(now*2+1,l,mid,s,e,v);
		if(mid<e)modify(now*2+2,mid+1,r,s,e,v);
	}
	int getval(int now,int l,int r,int p){
		if(l == r)return seg[now];
		int mid = (l+r)>>1;
		if(mid>=p)return max(seg[now],getval(now*2+1,l,mid,p));
		else return max(seg[now],getval(now*2+2,mid+1,r,p));
	}
};

SEG lseg,rseg;

main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>N;
	for(int i = 1;i<=N;i++){
		cin>>arr[i].fs>>arr[i].sc;
		brr[i] = i;
	}
	sort(arr+1,arr+N+1);
	sort(brr+1,brr+N+1,[](int a,int b){return arr[a].sc>arr[b].sc;});
	int ans = 0;
	for(int i = 1;i<=N;i++){
		int now = brr[i];
		if(lseg.getval(0,1,N,now)>=arr[now].sc-arr[now].fs||rseg.getval(0,1,N,now)>=arr[now].sc+arr[now].fs)continue;
		ans++;
		lseg.modify(0,1,N,1,now,arr[now].sc-arr[now].fs);
		rseg.modify(0,1,N,now,N,arr[now].sc+arr[now].fs);
	}
	cout<<ans;
}

Compilation message

Main.cpp:42:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   42 | main(){
      | ^~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 35420 KB Output is correct
2 Correct 65 ms 37568 KB Output is correct
3 Correct 79 ms 37468 KB Output is correct
4 Correct 154 ms 42936 KB Output is correct
5 Correct 91 ms 41648 KB Output is correct
6 Correct 251 ms 43348 KB Output is correct
7 Correct 209 ms 43448 KB Output is correct
8 Correct 167 ms 43344 KB Output is correct
9 Correct 134 ms 43440 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 35416 KB Output is correct
2 Correct 5 ms 35420 KB Output is correct
3 Correct 5 ms 35268 KB Output is correct
4 Correct 5 ms 35420 KB Output is correct
5 Correct 5 ms 35420 KB Output is correct
6 Correct 6 ms 35420 KB Output is correct
7 Correct 6 ms 35420 KB Output is correct
8 Correct 6 ms 35420 KB Output is correct
9 Correct 5 ms 35472 KB Output is correct
10 Correct 5 ms 35508 KB Output is correct
11 Correct 5 ms 35420 KB Output is correct
12 Correct 5 ms 35420 KB Output is correct
13 Correct 5 ms 35676 KB Output is correct
14 Correct 5 ms 35420 KB Output is correct
15 Correct 5 ms 35420 KB Output is correct
16 Correct 6 ms 35420 KB Output is correct
17 Correct 5 ms 35420 KB Output is correct
18 Correct 5 ms 35420 KB Output is correct

Subtask #3
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 35416 KB Output is correct
2 Correct 5 ms 35420 KB Output is correct
3 Correct 5 ms 35268 KB Output is correct
4 Correct 5 ms 35420 KB Output is correct
5 Correct 5 ms 35420 KB Output is correct
6 Correct 6 ms 35420 KB Output is correct
7 Correct 6 ms 35420 KB Output is correct
8 Correct 6 ms 35420 KB Output is correct
9 Correct 5 ms 35472 KB Output is correct
10 Correct 5 ms 35508 KB Output is correct
11 Correct 5 ms 35420 KB Output is correct
12 Correct 5 ms 35420 KB Output is correct
13 Correct 5 ms 35676 KB Output is correct
14 Correct 5 ms 35420 KB Output is correct
15 Correct 5 ms 35420 KB Output is correct
16 Correct 6 ms 35420 KB Output is correct
17 Correct 5 ms 35420 KB Output is correct
18 Correct 5 ms 35420 KB Output is correct
19 Correct 6 ms 35420 KB Output is correct
20 Correct 6 ms 35420 KB Output is correct
21 Correct 6 ms 35520 KB Output is correct
22 Correct 6 ms 35420 KB Output is correct
23 Correct 6 ms 35512 KB Output is correct
24 Correct 6 ms 35416 KB Output is correct
25 Correct 5 ms 35420 KB Output is correct
26 Correct 6 ms 35520 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 35420 KB Output is correct
2 Correct 65 ms 37568 KB Output is correct
3 Correct 79 ms 37468 KB Output is correct
4 Correct 154 ms 42936 KB Output is correct
5 Correct 91 ms 41648 KB Output is correct
6 Correct 251 ms 43348 KB Output is correct
7 Correct 209 ms 43448 KB Output is correct
8 Correct 167 ms 43344 KB Output is correct
9 Correct 134 ms 43440 KB Output is correct
10 Correct 5 ms 35416 KB Output is correct
11 Correct 5 ms 35420 KB Output is correct
12 Correct 5 ms 35268 KB Output is correct
13 Correct 5 ms 35420 KB Output is correct
14 Correct 5 ms 35420 KB Output is correct
15 Correct 6 ms 35420 KB Output is correct
16 Correct 6 ms 35420 KB Output is correct
17 Correct 6 ms 35420 KB Output is correct
18 Correct 5 ms 35472 KB Output is correct
19 Correct 5 ms 35508 KB Output is correct
20 Correct 5 ms 35420 KB Output is correct
21 Correct 5 ms 35420 KB Output is correct
22 Correct 5 ms 35676 KB Output is correct
23 Correct 5 ms 35420 KB Output is correct
24 Correct 5 ms 35420 KB Output is correct
25 Correct 6 ms 35420 KB Output is correct
26 Correct 5 ms 35420 KB Output is correct
27 Correct 5 ms 35420 KB Output is correct
28 Correct 6 ms 35420 KB Output is correct
29 Correct 6 ms 35420 KB Output is correct
30 Correct 6 ms 35520 KB Output is correct
31 Correct 6 ms 35420 KB Output is correct
32 Correct 6 ms 35512 KB Output is correct
33 Correct 6 ms 35416 KB Output is correct
34 Correct 5 ms 35420 KB Output is correct
35 Correct 6 ms 35520 KB Output is correct
36 Correct 159 ms 41820 KB Output is correct
37 Correct 206 ms 42348 KB Output is correct
38 Correct 267 ms 43548 KB Output is correct
39 Correct 236 ms 43348 KB Output is correct
40 Correct 252 ms 43348 KB Output is correct
41 Correct 243 ms 43348 KB Output is correct
42 Correct 197 ms 43340 KB Output is correct
43 Correct 226 ms 43344 KB Output is correct
44 Correct 193 ms 43348 KB Output is correct
45 Correct 239 ms 43344 KB Output is correct