oj.uz

Submission #1001397

# Submission time Handle Problem Language Result Execution time Memory
1001397 2024-06-19T02:53:31 Z GrindMachine Bigger segments (IZhO19_segments) C++17
27 / 100
 713 ms 262144 KB 
#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

dp[i][j] = max k s.t [k..i] is the last segment and #of jumps = j
only consider the best 2 j works because:
dp[i][j] >= dp[i][j-2] (for all valid j)
can be proved by induction

*/

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

    vector<map<ll,ll>> dp(n+5);
    dp[1][0] = 0;

    rep1(i,n){
        for(auto [j,k] : dp[i]){
            // append
            amax(dp[i+1][j],dp[i][j]);

            // jump
            ll sum1 = p[i]-p[k];
            ll pos = lower_bound(p.begin()+1,p.begin()+n+1,sum1+p[i])-p.begin();
            amax(dp[pos][j+1],(ll)i);
        }
    }

    ll ans = dp[n].rbegin()->first+1;
    cout << ans << endl;
}

int main()
{
    fastio;

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

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

    return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 4 ms 1628 KB Output is correct
19 Correct 14 ms 6844 KB Output is correct
20 Correct 25 ms 8136 KB Output is correct
21 Correct 2 ms 1116 KB Output is correct
22 Correct 2 ms 860 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 3 ms 1364 KB Output is correct
25 Correct 2 ms 1116 KB Output is correct
26 Correct 23 ms 8284 KB Output is correct
27 Correct 8 ms 4444 KB Output is correct
28 Correct 5 ms 2140 KB Output is correct
29 Correct 23 ms 8132 KB Output is correct
30 Correct 21 ms 7516 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 4 ms 1628 KB Output is correct
19 Correct 14 ms 6844 KB Output is correct
20 Correct 25 ms 8136 KB Output is correct
21 Correct 2 ms 1116 KB Output is correct
22 Correct 2 ms 860 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 3 ms 1364 KB Output is correct
25 Correct 2 ms 1116 KB Output is correct
26 Correct 23 ms 8284 KB Output is correct
27 Correct 8 ms 4444 KB Output is correct
28 Correct 5 ms 2140 KB Output is correct
29 Correct 23 ms 8132 KB Output is correct
30 Correct 21 ms 7516 KB Output is correct
31 Correct 1 ms 600 KB Output is correct
32 Correct 2 ms 1372 KB Output is correct
33 Correct 65 ms 19232 KB Output is correct
34 Correct 680 ms 221252 KB Output is correct
35 Runtime error 713 ms 262144 KB Execution killed with signal 9
36 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 4 ms 1628 KB Output is correct
19 Correct 14 ms 6844 KB Output is correct
20 Correct 25 ms 8136 KB Output is correct
21 Correct 2 ms 1116 KB Output is correct
22 Correct 2 ms 860 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 3 ms 1364 KB Output is correct
25 Correct 2 ms 1116 KB Output is correct
26 Correct 23 ms 8284 KB Output is correct
27 Correct 8 ms 4444 KB Output is correct
28 Correct 5 ms 2140 KB Output is correct
29 Correct 23 ms 8132 KB Output is correct
30 Correct 21 ms 7516 KB Output is correct
31 Correct 1 ms 600 KB Output is correct
32 Correct 2 ms 1372 KB Output is correct
33 Correct 65 ms 19232 KB Output is correct
34 Correct 680 ms 221252 KB Output is correct
35 Runtime error 713 ms 262144 KB Execution killed with signal 9
36 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 4 ms 1628 KB Output is correct
19 Correct 14 ms 6844 KB Output is correct
20 Correct 25 ms 8136 KB Output is correct
21 Correct 2 ms 1116 KB Output is correct
22 Correct 2 ms 860 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 3 ms 1364 KB Output is correct
25 Correct 2 ms 1116 KB Output is correct
26 Correct 23 ms 8284 KB Output is correct
27 Correct 8 ms 4444 KB Output is correct
28 Correct 5 ms 2140 KB Output is correct
29 Correct 23 ms 8132 KB Output is correct
30 Correct 21 ms 7516 KB Output is correct
31 Correct 1 ms 600 KB Output is correct
32 Correct 2 ms 1372 KB Output is correct
33 Correct 65 ms 19232 KB Output is correct
34 Correct 680 ms 221252 KB Output is correct
35 Runtime error 713 ms 262144 KB Execution killed with signal 9
36 Halted 0 ms 0 KB -