제출 #1182347

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1182347		haitax51	Bouquet (EGOI24_bouquet)	C++20	24 / 100	74 ms	25492 KiB

Main

//   #include<bits/allocator.h>
//   #pragma GCC optimize("Ofast,unroll-loops")
//   #ifdef ONLINE_JUDGE
//   #pragma GCC target("avx2,fma,bmi,bmi2,popcnt,lzcnt,tune=native")
//   #endif
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

// VVI
#define fast                      \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);

#define ll long long
#define SZ(a) (ll)a.size()
#define UNIQUE(a) (a).erase(unique(all(a)), (a).end())
#define mp make_pair
#define mem(a, b) memset(a, b, sizeof(a))
#define all(x) x.begin(), x.end()

//Printings & debugging
#define nn '\n'
#define Setpre(n) cout << fixed << setprecision(n)
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define debug printf("I am here\n")

// CONSTANTS
#define md 10000007
#define PI acos(-1)
const  long double   EPS = 1e-9;
const ll N = 2e5 + 10;
const ll M = 1e9 + 7;

/// INLINE FUNCTIONS
inline ll GCD(ll a, ll b) { return b == 0 ? a : GCD(b, a % b); }
inline ll LCM(ll a, ll b) { return a * b / GCD(a, b); }
inline  long double   logb(ll base, ll num) { return ( long double  )log(num) / ( long double  )log(base); }


/// Data structures
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef vector<ll> vl;
typedef vector<pll> vpll;
typedef vector<vl> vvl;
template <typename T>
using PQ = priority_queue<T>;
template <typename T>
using QP = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T, typename R>
using ordered_map = tree<T, R, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T, typename R>
using ordered_multimap = tree<T, R, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
namespace io{
    template<typename First, typename Second> ostream& operator << ( ostream &os, const pair<First, Second> &p ) { return os << p.first << " " << p.second; }
    template<typename First, typename Second> ostream& operator << ( ostream &os, const map<First, Second> &mp ) { for( auto it : mp ) { os << it << endl;  } return os; }
    template<typename First> ostream& operator << ( ostream &os, const vector<First> &v ) { bool space = false; for( First x : v ) { if( space ) os << " "; space = true; os << x; } return os; }
    template<typename First> ostream& operator << ( ostream &os, const set<First> &st ) { bool space = false; for( First x : st ) { if( space ) os << " "; space = true; os << x; } return os; }
    template<typename First> ostream& operator << ( ostream &os, const multiset<First> &st ) { bool space = false; for( First x : st ) { if( space ) os << " "; space = true; os << x; } return os; }
    template<typename First, typename Second> istream& operator >> ( istream &is, pair<First, Second> &p ) { return is >> p.first >> p.second; }
    template<typename First> istream& operator >> ( istream &is, vector<First> &v ) { for( First &x : v ) { is >> x; } return is; }

    long long fastread(){ char c; long long d = 1, x = 0; do c = getchar(); while( c == ' ' || c == '\n' ); if( c == '-' ) c = getchar(), d = -1; while( isdigit( c ) ){ x = x * 10 + c - '0'; c = getchar(); } return d * x; }
    static bool sep = false;
    using std::to_string;
    string to_string( bool x ){ return ( x ? "true" : "false" ); }
    string to_string( const string & s ){ return "\"" + s + "\""; }
    string to_string( const char * s ){ return "\"" + string( s ) + "\""; }
    string to_string ( const char & c ) { string s; s += c; return "\'" + s + "\'"; }
    template<typename Type> string to_string( vector<Type> );
    template<typename First, typename Second> string to_string( pair<First, Second> );
    template<typename Collection> string to_string( Collection );
    template<typename First, typename Second> string to_string( pair<First, Second> p ){ return "{" + to_string( p.first ) + ", " + to_string( p.second ) + "}"; }
    template<typename Type> string to_string( vector<Type> v ) { bool sep = false; string s = "["; for( Type x: v ){ if( sep ) s += ", "; sep = true; s += to_string( x ); } s += "]"; return s; }
    template<typename Collection> string to_string( Collection collection ) { bool sep = false; string s = "{"; for( auto x: collection ){ if( sep ) s += ", "; sep = true; s += to_string( x ); } s += "}"; return s; }
    void print() { cerr << endl; sep = false; }
    template <typename First, typename... Other> void print( First first, Other... other ) { if( sep ) cerr << " | "; sep = true; cerr << to_string( first ); print( other... ); }
} using namespace io;
const ll INF=1e15+500;
// ll mul(ll x) {return x==0 ? 1 : mul(x-1)*10;}
const ll MAXN=3e5+100;
const ll MOD=1e9+7;
#define p(i,n) for(ll i=0; i<n; i++)
#define rp(i,n) for(ll i=n-1; i>=0; i--)
#define grid_ll vector<vector<ll>>
#define grid_char vector<vector<char>>
void ADD(ll& c,ll a, ll b, ll m) {c = ((a % m) + (b % m)) % m;return;}
void MUL(ll& c,ll a, ll b, ll m) {c = ((a % m) * (b % m)) % m;}
void SUB(ll& c,ll a, ll b, ll m) {c = ((a % m) - (b % m) + m) % m;}
void MIN(ll& a, ll b) {a = min(a, b);}
void MAX(ll& a, ll b) {a = max(a, b);}
ll gcdExtended(ll a, ll b, ll *x, ll *y);
ll modInverse(ll b, ll m){ll x,y;ll g = gcdExtended(b, m, &x, &y);if (g != 1)return -1;return (x%m + m) % m;}
ll modDivide(ll a, ll b, ll m){a = a % m;ll inv = modInverse(b, m);return (inv * a) % m;}
ll gcdExtended(ll a, ll b, ll *x, ll *y){if (a == 0){*x = 0, *y = 1;return b;}ll x1, y1;ll gcd = gcdExtended(b%a, a, &x1, &y1);*x = y1 - (b/a) * x1;*y = x1;return gcd;}
#define f first
#define s second

// struct segtree{
//     vector<pll> tree;
//     ll n;
//     segtree(ll t){
//         n=t;
//         tree.resize(4*t,mp(-INF,-1));
//         build(1,0,n-1);

//     }
//     void build (ll node, ll lo, ll hi){
//         if( lo==hi) {
//             tree[node]=mp(v[lo],lo);
//             return;
//         }
//         ll mid=(lo+hi)/2;
//         build(2*node,lo,mid);  build(2*node+1,mid+1,hi);
//         if (tree[2*node].f>=tree[2*node+1].f) tree[node]=tree[2*node];
//         else tree[node]=tree[2*node+1];
//     }
//     void update(ll node, ll lo, ll hi, ll idx, ll val){
//         if (lo==hi){
//             tree[node].f=val;
//             v[lo]=val; return;
//         }
//         ll mid=(lo+hi)/2;
//         if (idx<=mid) update(2*node,lo,mid,idx,val);
//         else update(2*node+1,mid+1,hi,idx,val);
//         if (tree[2*node].f>=tree[2*node+1].f) tree[node]=tree[2*node];
//         else tree[node]=tree[2*node+1];

//     }
//     ll query(ll node, ll lo,ll hi, ll l,ll r){
//         if (lo>r or l>hi) return -INF;
//         if (lo>=l and hi<=r) return tree[node].f;
//         ll mid=(lo+hi)/2;
//         ll a=query(2*node,lo,mid,l,r);
//         ll b=query(2*node+1,mid+1,hi,l,r);
//         return max(a,b);
//     }
//     ll show(){return tree[1].f;}
//     void dbg(){cout<<tree<<nn;}


// };
// struct segtree{
//     vector<pll> tree;
//     ll n;
//     segtree(ll t){
//         n=t;
//         tree.resize(4*t,mp(-INF,-1));
//         build(1,0,n-1);

//     }
//     void build (ll node, ll lo, ll hi){
//         if( lo==hi) {
//             if (v[lo]==1) tree[node]=mp(1,0);
//             else tree[node]=mp(0,1);
//             return;
//         }
//         ll mid=(lo+hi)/2;
//         build(2*node,lo,mid);  build(2*node+1,mid+1,hi);
//         tree[node].f=tree[2*node].f+max(0LL,tree[2*node+1].f-tree[2*node].s);
//         tree[node].s=tree[2*node+1].s+max(0LL,tree[2*node].s-tree[2*node+1].f);

//     }
//     void update(ll node, ll lo, ll hi, ll idx, ll val){
//         if (lo==hi){
//             tree[node].f+=1;
//             tree[node].s+=1;
//             tree[node].f%=2;
//             tree[node].s%=2;
//             return;
//         }
//         ll mid=(lo+hi)/2;
//         if (idx<=mid) update(2*node,lo,mid,idx,val);
//         else update(2*node+1,mid+1,hi,idx,val);
//         tree[node].f=tree[2*node].f+max(0LL,tree[2*node+1].f-tree[2*node].s);
//         tree[node].s=tree[2*node+1].s+max(0LL,tree[2*node].s-tree[2*node+1].f);

//     }
//     pll query(ll node, ll lo,ll hi, ll l,ll r){
//         if (lo>r or l>hi) return {0,0};
//         if (lo>=l and hi<=r) return tree[node];
//         ll mid=(lo+hi)/2;
//         pll a=query(2*node,lo,mid,l,r);
//         pll b=query(2*node+1,mid+1,hi,l,r);
//         return mp(a.f+max(0LL,b.f-a.s),b.s+max(0LL,a.s-b.f));
//     }
//     ll show(){return tree[1].f;}
//     void dbg(){cout<<tree<<nn;}


// };
vector<ll> v; 
 struct segtree {
    vector<ll> tree;
    ll n;

    segtree(ll t) {
        n = t;
        tree.resize(4 * t, 0);
        build(1, 0, n - 1);
    }

    void build(ll node, ll lo, ll hi) {
        if (lo == hi) {
            tree[node] = v[lo];
            return;
        }
        ll mid = (lo + hi) / 2;
        build(2 * node, lo, mid);
        build(2 * node + 1, mid + 1, hi);
        tree[node] = max(tree[2 * node],tree[2 * node + 1]);
    }

    void update(ll node, ll lo, ll hi, ll idx, ll val) {
        if (lo == hi) {
            v[lo]=val;
            tree[node] = val;
            return;
        }
        ll mid = (lo + hi) / 2;
        if (idx <= mid) {
            update(2 * node, lo, mid, idx, val);
        } else {
            update(2 * node + 1, mid + 1, hi, idx, val);
        }
        tree[node] = max(tree[2 * node],tree[2 * node + 1]);
    }

    ll query(ll node, ll lo, ll hi, ll l, ll r) {
        if (lo > r || hi < l) return 0;
        if (lo >= l && hi <= r) return tree[node];
        ll mid = (lo + hi) / 2;
        ll left = query(2 * node, lo, mid, l, r);
        ll right = query(2 * node + 1, mid + 1, hi, l, r);
        return max(left,right);
    }

    ll show() { return tree[1]; }

    void dbg() {
        for (ll i = 1; i < 4 * n; ++i) {
            cout << "Node " << i << ": " << tree[i] << "\n";
        }
    }
};


// struct dsu{
//     vector<ll> par;
//     ll n;
//     dsu (ll t){par.resize(t);n=t;}
//     void build(){
//         for(ll i=0; i<n; i++) par[i]=i;
//     }
//     ll find(ll node){
//         if (par[node]!=node) par[node]=find(par[node]);
//         return par[node];
//     }
//     void unite(ll node, ll node2){
//         ll r1=find(node); ll r2=find(node2);
//         if (rand()%2){
//             par[r1]=r2;
//         }
//         else par[r2]=r1;
//     }
// };
int lim; 
inline bool mo_cmp(const pair< pair<ll, ll>, ll> &x,
         const pair< pair<ll, ll>, ll> &y)
 {
     ll block_x = x.first.first / lim;
    ll block_y = y.first.first / lim;
    if(block_x != block_y)
        return block_x < block_y;
    return x.first.second < y.first.second;
 }

signed main(){
    
    fast
    ll n; cin>>n; v.resize(n,0LL);
    vector<pll> dp(n,mp(0LL,0LL));
    segtree Tree(n);
    vector<ll> l(n); vector<ll> r(n);
    for (ll i=0; i<n; i++){
        cin>>l[i]>>r[i];
    }
    vector<vector<ll>> idx(n);
    dp[0].f=0; dp[0].s=1;
    if (r[0]<n) idx[r[0]].push_back(0);
    for(ll i=1; i<n; i++){
        for(auto j : idx[i-1]){
            Tree.update(1,0,n-1,j,max(dp[j].s,dp[j].f));
        }
        dp[i].f=max(dp[i-1].f,dp[i-1].s); 
        ll x; 
        if (i-l[i]-1<0) x=0; 
        else x=Tree.query(1,0,n-1,0,i-l[i]-1);
        dp[i].s=x+1;
        if (i+r[i]<n) idx[i+r[i]].push_back(i);
        for(auto j : idx[i]){
            Tree.update(1,0,n-1,j,max(dp[j].s,dp[j].f));
        }
    }
    cout<<max(dp[n-1].f,dp[n-1].s)<<nn; 
    

    
    



}

     
    
    



    

• Subtask 1: 8 / 8
• Subtask 2: 16 / 16
• Subtask 3: 0 / 28
• Subtask 4: 0 / 18
• Subtask 5: 0 / 30