Submission #1001039

#	Time	Username	Problem	Language	Result	Execution time	Memory
1001039		GrindMachine	Bigger segments (IZhO19_segments)	C++17	37 / 100	137 ms	262144 KiB

segments

#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;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

/*

refs:
https://codeforces.com/blog/entry/64479?#comment-484350

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n; cin >> n;
    vector<ll> a(n+5);
    rep1(i,n) cin >> a[i];
    vector<ll> p(n+5);
    rep1(i,n) p[i] = p[i-1]+a[i];

    ll dp[n+5][n+5];
    memset(dp,-0x3f,sizeof dp);
    dp[1][0] = 0;

    rep1(i,n){
        // append
        rep(j,n+1){
            amax(dp[i+1][j],dp[i][j]);
        }
        
        // jump
        ll cnt = 0;
        rev(j,n,0){
            ll k = dp[i][j];
            if(k < 0) conts;
            cnt++;
            if(cnt > 2) break;
            ll sum1 = p[i]-p[k];
            ll sum2 = 0;
            for(int i2 = i+1; i2 <= n; ++i2){
                sum2 += a[i2];
                if(sum2 >= sum1){
                    amax(dp[i2][j+1],(ll)i);
                    break;
                }
            }
        }
    }

    ll ans = 0;
    rep(j,n+1){
        if(dp[n][j] >= 0){
            ans = j+1;
        }
    }

    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

• Subtask 1: 13 / 13
• Subtask 2: 14 / 14
• Subtask 3: 10 / 10
• Subtask 4: 0 / 36
• Subtask 5: 0 / 27