Submission #1281827

#	Time	Username	Problem	Language	Result	Execution time	Memory
1281827		m.zeeshanrashid	Advertisement 2 (JOI23_ho_t2)	C++20	100 / 100	690 ms	63836 KiB

Main

#ifdef __AVX2__
#pragma GCC target "avx2"
#endif
#pragma GCC optimize "O3"
#pragma GCC optimize "unroll-loops"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds; 
using namespace std;
#define int long long
#define elif else if
#define all(l) begin(l),end(l)
#define rall(l) rbegin(l),rend(l)
#define append push_back
#define print(l) for(auto i:l) cout<<i<<' '; cout<<endl;
#define pprint(a,b) cout<<a<<' '<<b<<endl;
#define inp(l) for(auto &i:l) cin>>i;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pai make_pair
#define endl "\n"
#define pii pair<int,int>
#define fi first
#define se second
#define vec vector

// const int mod=998244353;
const int mod1=998244353;
const int mod=1e9+7;
const int N=2e5+5;

struct segtreemax{
	int size;
	vector<int>sums;
	void init(int n){
		size=1;
		while(size<n) size*=2;
		sums.assign(2*size,-1e18);
	}
	void set(int i,int v,int x,int lx,int rx){
		if(rx-lx==1){
			sums[x]=v;
			return;
		}
		int m=(lx+rx)/2;
		if(i<m){
			set(i,v,2*x+1,lx,m);
		}
		else{
			set(i,v,2*x+2,m,rx);
		}
		sums[x]=max(sums[2*x+1],sums[2*x+2]);
	}
	void set(int i, int v){
		set(i,v,0,0,size);
	}
	int sum(int l,int r,int x,int lx,int rx){
		if(lx>=r or l>=rx) return -1e18;
		if(lx>=l and rx<=r) return sums[x];
		int m=(lx+rx)/2;
		int s1=sum(l,r,2*x+1,lx,m);
		int s2=sum(l,r,2*x+2,m,rx);
		return max(s1,s2);
	}
	int sum(int l,int r){
		return sum(l,r,0,0,size);
	}
	void build(vector<int>&a,int x,int lx,int rx){
		if(rx-lx==1){
			if(lx<(int)a.size()){
				sums[x]=a[lx];
			}
			return;
		}
		int m=(lx+rx)/2;
		build(a,2*x+1,lx,m);
		build(a,2*x+2,m,rx);
		sums[x]=max(sums[2*x+1],sums[2*x+2]);
	}
	void build(vector<int>&a){
		build(a,0,0,size);
	}
};

struct segtreemin{
	int size;
	vector<int>sums;
	void init(int n){
		size=1;
		while(size<n) size*=2;
		sums.assign(2*size,1e18);
	}
	void set(int i,int v,int x,int lx,int rx){
		if(rx-lx==1){
			sums[x]=v;
			return;
		}
		int m=(lx+rx)/2;
		if(i<m){
			set(i,v,2*x+1,lx,m);
		}
		else{
			set(i,v,2*x+2,m,rx);
		}
		sums[x]=min(sums[2*x+1],sums[2*x+2]);
	}
	void set(int i, int v){
		set(i,v,0,0,size);
	}
	int sum(int l,int r,int x,int lx,int rx){
		if(lx>=r or l>=rx) return 1e18;
		if(lx>=l and rx<=r) return sums[x];
		int m=(lx+rx)/2;
		int s1=sum(l,r,2*x+1,lx,m);
		int s2=sum(l,r,2*x+2,m,rx);
		return min(s1,s2);
	}
	int sum(int l,int r){
		return sum(l,r,0,0,size);
	}
	void build(vector<int>&a,int x,int lx,int rx){
		if(rx-lx==1){
			if(lx<(int)a.size()){
				sums[x]=a[lx];
			}
			return;
		}
		int m=(lx+rx)/2;
		build(a,2*x+1,lx,m);
		build(a,2*x+2,m,rx);
		sums[x]=min(sums[2*x+1],sums[2*x+2]);
	}
	void build(vector<int>&a){
		build(a,0,0,size);
	}
};

int iter=1,itera=1;
void solve(){
	int n;
	cin>>n;
	vec<pii>a(n),b(n);
	for(int i=0;i<n;i++){
		int x,e;
		cin>>x>>e;
		a[i]={e,x};
		b[i]={x,e};
	}
	sort(rall(a));
	sort(all(b));
	map<pii,int>d;
	for(int i=0;i<n;i++) d[{b[i].se,b[i].fi}]=i;
	int ans=0;
	segtreemin mi;
	segtreemax ma;
	mi.init(n+5);
	ma.init(n+5);
	for(int i=0;i<n;i++){
		int e=a[i].se,x=a[i].fi;
		// cout<<i<<' '<<mi.sum(d[a[i]],n)<<endl;
		if(ma.sum(0,d[a[i]])<x+e and mi.sum(d[a[i]],n)>e-x){
			// cout<<i<<' '<<e<<' '<<x<<' '<<d[a[i]]<<endl;
			ans++;
			ma.set(d[a[i]],x+e);
			mi.set(d[a[i]],e-x);
		}
	}
	cout<<ans<<endl;
}
signed main(){
	// freopen("","r",stdin);
	// freopen("","w",stdout);
	ios_base::sync_with_stdio(false);
	cin.tie(NULL); 
	cout.tie(NULL);
	cout<<fixed<<setprecision(20);
	// cin>>itera;
	for(iter=1;iter<=itera;iter++) solve();
}

• Subtask 1: 10 / 10
• Subtask 2: 23 / 23
• Subtask 3: 36 / 36
• Subtask 4: 31 / 31