oj.uz

Submission #741810

# Submission time Handle Problem Language Result Execution time Memory
741810 2023-05-15T00:51:37 Z jamezzz Advertisement 2 (JOI23_ho_t2) C++17
100 / 100
 1135 ms 132576 KB 
#include <bits/stdc++.h>
using namespace std;

#define sf scanf
#define pf printf
#define fi first
#define se second
#define INF 2023456789
typedef pair<int,int> ii;

#define maxn 500005

int n,x[maxn],e[maxn],d[maxn];
vector<int> v;
set<ii> s1;

struct node{
	int s,e,m,v;
	node *l,*r;
	node(int _s,int _e){
		s=_s,e=_e,m=(s+e)>>1,v=-INF;
		if(s!=e)l=new node(s,m),r=new node(m+1,e);
	}
	void up(int x,int nv){
		if(s==x&&e==x){v=nv;return;}
		if(x<=m)l->up(x,nv);
		else r->up(x,nv);
		v=max(l->v,r->v);
	}
	int qry(int x,int y){
		if(s==x&&e==y)return v;
		if(y<=m)return l->qry(x,y);
		else if(x>m)return r->qry(x,y);
		else return max(l->qry(x,m),r->qry(m+1,y));
	}
}*rt,*rt2;

int main(){
	sf("%d",&n);
	for(int i=0;i<n;++i){
		sf("%d%d",&x[i],&e[i]);
		v.push_back(x[i]);
		s1.insert({e[i],i});
	}
	sort(v.begin(),v.end());
	v.resize(unique(v.begin(),v.end())-v.begin());
	for(int i=0;i<n;++i){
		d[i]=lower_bound(v.begin(),v.end(),x[i])-v.begin();
	}
	rt=new node(0,v.size()-1);
	rt2=new node(0,v.size()-1);
	int ans=0;
	while(!s1.empty()){
		auto[_,i]=*--s1.end();
		s1.erase(--s1.end());
		if(e[i]+x[i]<=rt->qry(0,d[i]))continue;
		if(e[i]-x[i]<=rt2->qry(d[i],v.size()-1))continue;
		++ans;
		rt->up(d[i],e[i]+x[i]);
		rt2->up(d[i],e[i]-x[i]);
	}
	pf("%d\n",ans);
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:39:4: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |  sf("%d",&n);
      |    ^
Main.cpp:41:5: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |   sf("%d%d",&x[i],&e[i]);
      |     ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 223 ms 30272 KB Output is correct
3 Correct 219 ms 26008 KB Output is correct
4 Correct 326 ms 32320 KB Output is correct
5 Correct 157 ms 22004 KB Output is correct
6 Correct 1130 ms 116840 KB Output is correct
7 Correct 802 ms 73892 KB Output is correct
8 Correct 375 ms 38932 KB Output is correct
9 Correct 259 ms 35380 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 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 0 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 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 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct

Subtask #3
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 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 0 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 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 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 223 ms 30272 KB Output is correct
3 Correct 219 ms 26008 KB Output is correct
4 Correct 326 ms 32320 KB Output is correct
5 Correct 157 ms 22004 KB Output is correct
6 Correct 1130 ms 116840 KB Output is correct
7 Correct 802 ms 73892 KB Output is correct
8 Correct 375 ms 38932 KB Output is correct
9 Correct 259 ms 35380 KB Output is correct
10 Correct 1 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 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 0 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 1 ms 212 KB Output is correct
22 Correct 0 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 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 667 ms 86896 KB Output is correct
37 Correct 876 ms 110908 KB Output is correct
38 Correct 1043 ms 130504 KB Output is correct
39 Correct 979 ms 93860 KB Output is correct
40 Correct 1106 ms 123844 KB Output is correct
41 Correct 991 ms 106304 KB Output is correct
42 Correct 862 ms 106564 KB Output is correct
43 Correct 943 ms 128508 KB Output is correct
44 Correct 840 ms 132576 KB Output is correct
45 Correct 1135 ms 128444 KB Output is correct