Submission #765420

#	Time	Username	Problem	Language	Result	Execution time	Memory
765420		lollipop	Advertisement 2 (JOI23_ho_t2)	C++17	100 / 100	160 ms	18012 KiB

Main

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define int long long
#define pb push_back
#define s second
#define f first
#define pf push_front
#define inf 100000000000000000
#define bitebi __builtin_popcountll
#define FOR( i , n ) for( int i = 0 ; i < n ; i ++ )
#define YES cout <<"YES\n"
#define NO cout << "NO\n"
#define debug cout << "Here Fine" << endl ;
#define pr pair < int , int >
#define fbo find_by_order // returns iterator
#define ook order_of_key // returns strictly less numbers than key
using namespace std ;
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const double Pi=acos(-1.0);
const double EPS=1E-8;
const int mod =  1000000007 ;
const int mod1 = 998244353 ;
const int N = 2e5 + 10 ;
mt19937 R(time(0));
map < int , int > ma , ma1 ;
bool sortby( pair < int , int > a , pair < int , int > b ){
	 if( a.f < b.f ) return true ;
	 if( a.f > b.f ) return false ;
	 if( a.s > b.s ) return true ;
	 return false ; 
}
void solve(){
     int n ; cin >> n ;
     vector < pair < int , int > > v ;
     FOR( i , n ){
     	int x , e ; 
     	cin >> x >> e ;
     	int X = x - e ;
     	int Y = x + e ;
     	v.pb( { X , Y } ) ; 
	 }
     sort( v.begin() , v.end() , sortby ) ;
     int cnt = 0 ;
     int hg = -inf ;
     for( auto x : v ){
     	if( x.s > hg ){
     		hg = x.s ; cnt ++ ;
		 }
	 }
	 cout << cnt <<"\n" ;
}
signed main() {
   ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
 //  freopen("laserin.txt" , "r" , stdin ) ;
 //  freopen("laserout.txt" , "w" , stdout) ; 
   int t = 1 ; // cin >> t ;
   while( t -- ){
   	 solve() ;
   }

}

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