oj.uz

답안 #1001395

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1001395 2024-06-19T02:50:45 Z GrindMachine Bigger segments (IZhO19_segments) C++17
37 / 100
 127 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];

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

    rep1(i,n){
        for(int j = 2; j <= n; ++j){
            if(dp[i][j] < 0) break;
            assert(dp[i][j] >= dp[i][j-2]);
        }

        // 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 pos = lower_bound(p.begin()+1,p.begin()+n+1,sum1+p[i])-p.begin();
            amax(dp[pos][j+1],(ll)i);
            
            // 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.0 / 13.0

# 결과 실행 시간 메모리 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 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 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 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 2 ms 2396 KB Output is correct
19 Correct 2 ms 2396 KB Output is correct
20 Correct 2 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 1624 KB Output is correct
23 Correct 1 ms 1116 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 2 ms 2396 KB Output is correct
26 Correct 3 ms 2396 KB Output is correct
27 Correct 2 ms 2204 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 2 ms 2396 KB Output is correct
30 Correct 2 ms 2396 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 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 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 2 ms 2396 KB Output is correct
19 Correct 2 ms 2396 KB Output is correct
20 Correct 2 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 1624 KB Output is correct
23 Correct 1 ms 1116 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 2 ms 2396 KB Output is correct
26 Correct 3 ms 2396 KB Output is correct
27 Correct 2 ms 2204 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 2 ms 2396 KB Output is correct
30 Correct 2 ms 2396 KB Output is correct
31 Correct 46 ms 70940 KB Output is correct
32 Correct 51 ms 70996 KB Output is correct
33 Correct 50 ms 71116 KB Output is correct
34 Correct 60 ms 70996 KB Output is correct
35 Correct 47 ms 71188 KB Output is correct
36 Correct 54 ms 71248 KB Output is correct
37 Correct 39 ms 49488 KB Output is correct
38 Correct 22 ms 31836 KB Output is correct
39 Correct 51 ms 71100 KB Output is correct
40 Correct 52 ms 70992 KB Output is correct
41 Correct 50 ms 70996 KB Output is correct
42 Correct 51 ms 70992 KB Output is correct
43 Correct 50 ms 70992 KB Output is correct
44 Correct 51 ms 71180 KB Output is correct
45 Correct 50 ms 70984 KB Output is correct

Subtask #4
0 / 36.0

# 결과 실행 시간 메모리 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 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 2 ms 2396 KB Output is correct
19 Correct 2 ms 2396 KB Output is correct
20 Correct 2 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 1624 KB Output is correct
23 Correct 1 ms 1116 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 2 ms 2396 KB Output is correct
26 Correct 3 ms 2396 KB Output is correct
27 Correct 2 ms 2204 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 2 ms 2396 KB Output is correct
30 Correct 2 ms 2396 KB Output is correct
31 Correct 46 ms 70940 KB Output is correct
32 Correct 51 ms 70996 KB Output is correct
33 Correct 50 ms 71116 KB Output is correct
34 Correct 60 ms 70996 KB Output is correct
35 Correct 47 ms 71188 KB Output is correct
36 Correct 54 ms 71248 KB Output is correct
37 Correct 39 ms 49488 KB Output is correct
38 Correct 22 ms 31836 KB Output is correct
39 Correct 51 ms 71100 KB Output is correct
40 Correct 52 ms 70992 KB Output is correct
41 Correct 50 ms 70996 KB Output is correct
42 Correct 51 ms 70992 KB Output is correct
43 Correct 50 ms 70992 KB Output is correct
44 Correct 51 ms 71180 KB Output is correct
45 Correct 50 ms 70984 KB Output is correct
46 Runtime error 127 ms 262144 KB Execution killed with signal 9
47 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 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 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 2 ms 2396 KB Output is correct
19 Correct 2 ms 2396 KB Output is correct
20 Correct 2 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 1624 KB Output is correct
23 Correct 1 ms 1116 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 2 ms 2396 KB Output is correct
26 Correct 3 ms 2396 KB Output is correct
27 Correct 2 ms 2204 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 2 ms 2396 KB Output is correct
30 Correct 2 ms 2396 KB Output is correct
31 Correct 46 ms 70940 KB Output is correct
32 Correct 51 ms 70996 KB Output is correct
33 Correct 50 ms 71116 KB Output is correct
34 Correct 60 ms 70996 KB Output is correct
35 Correct 47 ms 71188 KB Output is correct
36 Correct 54 ms 71248 KB Output is correct
37 Correct 39 ms 49488 KB Output is correct
38 Correct 22 ms 31836 KB Output is correct
39 Correct 51 ms 71100 KB Output is correct
40 Correct 52 ms 70992 KB Output is correct
41 Correct 50 ms 70996 KB Output is correct
42 Correct 51 ms 70992 KB Output is correct
43 Correct 50 ms 70992 KB Output is correct
44 Correct 51 ms 71180 KB Output is correct
45 Correct 50 ms 70984 KB Output is correct
46 Runtime error 127 ms 262144 KB Execution killed with signal 9
47 Halted 0 ms 0 KB -