제출 #1080841

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1080841		p4r4d0_x	Bouquet (EGOI24_bouquet)	C++14	28 / 100	3092 ms	5888 KiB

Main

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define PUT(a, b) freopen(a, "r", stdin); freopen(b, "w", stdout);
#define all(a) a.begin(), a.end()
#define answerNO {cout << "NO" << endl;}
#define answerYES {cout << "YES" << endl;}
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
ll mod = 1e9 + 7;
 
 
void solve(){
    ll n; cin >> n;
    VPL a(n);
    rep(i, n){
        cin >> a[i].ff >> a[i].ss;
    }
    VL dp(n);
    rep(i, n){
        dp[i] = 1;
        rep(j, i){
            if(j + a[j].ss < i && i - a[i].ff > j)dp[i] = max(dp[i], dp[j] + 1);
        }
    }
    ll ans = 0;
    rep(i, n)setmax(ans, dp[i]);
    cout << ans << "\n"; 
}
 
 
    
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL), cout.tie(NULL);
    //PUT("traffic.in", "traffic.out");
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
}

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