Submission #1220459

#	Time	Username	Problem	Language	Result	Execution time	Memory
1220459		YassirSalama	Advertisement 2 (JOI23_ho_t2)	C++17	100 / 100	114 ms	16080 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
using ull=unsigned long long;
using pii=pair<int,int>;
const int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1};
#define OVL(x,s) for(auto y:x) cout<<y<<s; cout<<"\n";
template <typename T> istream& operator>>(istream& is, vector<T> &OOO) {
    copy_n(istream_iterator<T>(is), OOO.size(), OOO.begin()); return is;}
#ifdef IOI
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }

void dbg_out() { cout << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__);
#else
#define dbg(...) 1337;
#endif
#define pb push_back
#define F first
#define S second
#define all(v) v.begin(),v.end()
const int inf = (1LL<<60);
const int maxn = 1000+100;
signed main() {
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n;
    cin>>n;
    vector<pair<int,int>> v;
    for(int i = 0;i<n;i++){
        int x,e;
        cin>>x>>e;
        v.pb({x,e});
    }
    sort(all(v));
    v.erase(unique(all(v)),v.end());
    int ans = 0;
    n = v.size();
    int pref[n],suff[n];
    int mx = -1e18;
    for(int i = 0;i<n;i++){
        pref[i] = mx;
        mx= max(mx,v[i].F+v[i].S);
    }
    mx = -1e18;
    for(int i = n-1;i>=0;i--){
        suff[i] = mx;
        mx =max(mx,v[i].S-v[i].F);
    }
    for(int i = 0;i<n;i++){
        int a = v[i].F+v[i].S,b = v[i].S-v[i].F;
        dbg(a,b,pref[i],suff[i])
        if(pref[i]>=a||suff[i]>=b){
            continue;
        }
        ans++;
    }
    cout<<ans<<endl;

}

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