제출 #1325941

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1325941		Mauricio_Cruz	Advertisement 2 (JOI23_ho_t2)	C++20	100 / 100	114 ms	8248 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define all(x) x.begin(), x.end()

#define srtl(x)sort(all(x))
#define srtg(x)sort((x).begin(),(x).end(),greater<>())
#define rev(x) reverse(all(x))
#define lb(x,y) lower_bound(x.begin(),x.end(),y)-x.begin()
#define ub(x,y) upper_bound(x.begin(),x.end(),y)-x.begin()

#define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

#define f first
#define s second
#define pb push_back
#define ins insert
#define next next_permutation
#define _b __builtin_popcount

#define ve vector
#define pii pair<int,int>
#define piii pair<int,pii>
#define vi vector<int>
#define vii vector<pii>
#define viii vector<piii>
#define vvi vector<vi>
#define vs vector<string>
#define vb vector<bool>

#define pV(x)for(auto i:x)cout<<i<<" ";

#define geta(a){for(auto &i:a)cin>>i;}

#define fr(n)for(int i=0;i<n;i++)
#define Fr(n)for(int i=n-1;i>=0;i--)

#define suma(a)accumulate(a.begin(),a.end(),0LL)

#define br(x){cout<<x<<"\n";return;}
#define yesn cout<<"YES\n";

#define yes()br("YES");
#define no(){br("NO")}

#define alice() br("Alice");
#define bob() br("Bob");

#define cn continue;

#define cint const int
#define int long long


int mod=1000000007;
cint mod1=100000007;
cint mod2=998244353;

int ax[8]={0,1,0,-1,-1,1,1,-1};
int ay[8]={1,0,-1,0,1,-1,1,-1};

//bool on(int x,int y){return (x>=0&&x<n&&y>=0&&y<m);}
//int euc(int a,int b,int c,int d){return abs(a-c)+abs(b-d);}

int bp(int x,int y){
	if(y==0)return 1;
	int r=bp(x,y/2);
	return (y&1)?r*r%mod*x%mod:r*r%mod;
}
int bpm(int x,int y){
	if(y==0)return 1;
	int r=bp(x,y/2);
	return (y&1)?r*r*x:r*r;
}
int cinn(){
	int n;
	cin>>n;
	return n;
}
#define w cinn()

void solve(){
	int n=w;
	
	vii v(n);
	fr(n){
		int x=w,e=w;
		v[i]={x-e,x+e};
		v[i].s=-v[i].s;//pp que jugada mas sucia pp ñioooooooo (son las 3am no me juzguen)
	}
	
	srtl(v);
	
	fr(n){
		v[i].s=-v[i].s;//reversa 
	}
	
	int res=0;
	int ant=-1e18;
	fr(n){
		if(ant<v[i].s){
			res++;
			ant=v[i].s;
		}
	}
	
	cout<<res;
	
}

int32_t main(){
	
	ios;

	int t=1;
	
	while(t--){
		solve();
	}
	
	return 0;
}

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