Submission #790760

#	Time	Username	Problem	Language	Result	Execution time	Memory
790760		cig32	Advertisement 2 (JOI23_ho_t2)	C++17	100 / 100	502 ms	49780 KiB

Main

#include "bits/stdc++.h"
using namespace std;
#define int long long
const int MAXN = 5e5 + 10;
const int MOD = 1e9 + 7;
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
int bm(int b, int p) {
  if(p==0) return 1 % MOD;
  int r = bm(b, p >> 1);
  if(p&1) return (((r*r) % MOD) * b) % MOD;
  return (r*r) % MOD;
}
int inv(int b) { 
  return bm(b, MOD-2);
}
int fastlog(int x) {
  return (x == 0 ? -1 : 64 - __builtin_clzll(x) - 1);
}
void printcase(int i) { cout << "Case #" << i << ": "; }
void solve(int tc) {
  int n;
  cin>>n;
  set<pair<int,int>>st;
  for(int i=1;i<=n;i++){
    int x,y;
    cin>>x>>y;
    st.insert({x,y});
  }
  vector<pair<int,int>>vt;
  for(pair<int,int>k:st)vt.push_back(k);
  int l=vt.size();
  bool have[l];
  for(int i=0;i<l;i++)have[i]=0;
  int ma=0;
  for(int i=0;i<l;i++){
    if(ma>=vt[i].first+vt[i].second)have[i]=1;
    ma=max(ma,vt[i].first+vt[i].second);
  }
  int mi=1e18;
  for(int i=l-1;i>=0;i--){
    if(mi<=vt[i].first-vt[i].second)have[i]=1;
    mi=min(mi,vt[i].first-vt[i].second);
  }
  int s=0;
  for(int i=0;i<l;i++)s+=have[i];
  cout<<l-s<<'\n';
  
}
int32_t main() {
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
}
// 勿忘初衷

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