Submission #1065231

#	Time	Username	Problem	Language	Result	Execution time	Memory
1065231		steveonalex	Bigger segments (IZhO19_segments)	C++17	100 / 100	90 ms	46336 KiB

segments

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }



int main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    clock_t start = clock();

    int n; cin >> n;
    vector<int> a(n+1);
    for(int i = 1; i<=n; ++i) cin >> a[i];

    vector<ll> b(n+1);
    for(int i = 1; i<=n; ++i) b[i] = b[i-1] + a[i];

    vector<pair<ll, int>> dp(n+1);
    vector<vector<int>> query(n+2);
    pair<int, int> cur = {0, 0};
    for(int i = 1; i<=n; ++i){
        for(int j: query[i]){
            if (dp[j].second > cur.second || (dp[j].second == cur.second && j > cur.first)) {
                cur = {j, dp[j].second};
            }
        }
        dp[i] = {b[i] - b[cur.first], cur.second + 1};

        int idx = lower_bound(ALL(b), b[i] + dp[i].first) - b.begin();
        query[idx].push_back(i);
    }

    cout << dp[n].second << "\n";

    cerr << "Time elapsed: " << clock() - start << " ms\n";
    return 0;
}

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