제출 #1151832

#제출 시각아이디문제언어결과실행 시간메모리
1151832irmuunAdvertisement 2 (JOI23_ho_t2)C++20
100 / 100
113 ms24240 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define pb push_back #define ff first #define ss second #define all(s) s.begin(),s.end() #define rall(s) s.rbegin(),s.rend() int main(){ ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ll n; cin>>n; ll x[n+5],e[n+5]; for(ll i=1;i<=n;i++){ cin>>x[i]>>e[i]; } // condition is |x_i - x_j| <= E_i - E_j // xi-xj<=ei-ej and xj-xi<=ei-ej // xi-ei<=xj-ej and xj+ej<=xi+ei // aj<=ai and bi<=bj ll a[n+5],b[n+5]; vector<pair<ll,ll>>v; for(ll i=1;i<=n;i++){ a[i]=x[i]+e[i]; b[i]=x[i]-e[i]; v.pb({b[i],-a[i]}); } sort(all(v)); ll ans=0,mx=-1e9; for(auto [b,a]:v){ a=-a; if(a>mx){ mx=a; ans++; } } cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...