oj.uz

Submission #417372

# Submission time Handle Problem Language Result Execution time Memory
417372 2021-06-03T15:43:25 Z doowey Cigle (COI21_cigle) C++14
48 / 100
 1000 ms 58960 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

const int N = 5010;
int dp[N][N];
int D[N];

struct Node{
    int val;
    int lzy;
};

Node T[N * 4 + 16];

void push(int node, int cl, int cr){
    T[node].val += T[node].lzy;
    if(cl != cr){
        T[node * 2].lzy += T[node].lzy;
        T[node * 2 + 1].lzy += T[node].lzy;
    }
    T[node].lzy = 0;
}

void update(int node, int cl, int cr, int tl, int tr, int v){
    push(node, cl, cr);
    if(cr < tl || cl > tr) return;
    if(cl >= tl && cr <= tr){
        T[node].lzy = v;
        push(node, cl, cr);
        return;
    }
    int mid = (cl + cr) / 2;
    update(node * 2, cl, mid, tl, tr, v);
    update(node * 2 + 1, mid + 1, cr, tl, tr, v);
    T[node].val = max(T[node * 2].val, T[node * 2 + 1].val);
}

int en;

void build(int node, int cl, int cr, int en){
    T[node].lzy = 0;
    if(cl == cr){
        T[node].val = dp[cl][en - 1];
        return;
    }
    int mid = (cl + cr) / 2;
    build(node * 2, cl, mid, en);
    build(node * 2 + 1, mid + 1, cr, en);
    T[node].val = max(T[node * 2].val, T[node * 2 + 1].val);
}

int main(){
    fastIO;
    //freopen("in.txt","r",stdin);
    int n;
    cin >> n;
    for(int i = 1; i <= n; i ++ ){
        cin >> D[i];
    }
    int pp;
    int cum;
    int cur;
    int outp = 0;
    for(int cut = 2; cut <= n; cut ++ ){
        for(int ash = 2; ash <= cut - 1; ash ++ ){
            dp[ash][cut - 1] = max(dp[ash][cut - 1], dp[ash-1][cut-1]);
        }
        build(1, 1, cut - 1, cut);
        cur = 0;
        cum = 0;
        pp = cut;
        for(int go = cut; go <= n; go ++ ){
            dp[cut][go] = T[1].val;
            if(go == n)
                outp = max(outp, dp[cut][go]);

            cur += D[go];
            while(pp > 1 && cum < cur){
                pp --;
                cum += D[pp];
            }
            if(cum == cur){
                update(1, 1, cut - 1, 1, pp - 1, +1);
            }
        }
    }
    cout << outp << "\n";
    return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 588 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 1 ms 588 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 1 ms 588 KB Output is correct
15 Correct 1 ms 588 KB Output is correct
16 Correct 1 ms 588 KB Output is correct
17 Correct 1 ms 576 KB Output is correct
18 Correct 1 ms 588 KB Output is correct
19 Correct 1 ms 588 KB Output is correct
20 Correct 1 ms 588 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 2764 KB Output is correct
2 Correct 12 ms 2764 KB Output is correct
3 Correct 10 ms 2804 KB Output is correct
4 Correct 11 ms 2764 KB Output is correct
5 Correct 11 ms 2728 KB Output is correct
6 Correct 11 ms 2748 KB Output is correct
7 Correct 11 ms 2760 KB Output is correct
8 Correct 11 ms 2800 KB Output is correct
9 Correct 11 ms 2764 KB Output is correct
10 Correct 10 ms 2808 KB Output is correct
11 Correct 10 ms 2752 KB Output is correct
12 Correct 10 ms 2764 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 588 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 1 ms 588 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 1 ms 588 KB Output is correct
15 Correct 1 ms 588 KB Output is correct
16 Correct 1 ms 588 KB Output is correct
17 Correct 1 ms 576 KB Output is correct
18 Correct 1 ms 588 KB Output is correct
19 Correct 1 ms 588 KB Output is correct
20 Correct 1 ms 588 KB Output is correct
21 Correct 9 ms 2764 KB Output is correct
22 Correct 12 ms 2764 KB Output is correct
23 Correct 10 ms 2804 KB Output is correct
24 Correct 11 ms 2764 KB Output is correct
25 Correct 11 ms 2728 KB Output is correct
26 Correct 11 ms 2748 KB Output is correct
27 Correct 11 ms 2760 KB Output is correct
28 Correct 11 ms 2800 KB Output is correct
29 Correct 11 ms 2764 KB Output is correct
30 Correct 10 ms 2808 KB Output is correct
31 Correct 10 ms 2752 KB Output is correct
32 Correct 10 ms 2764 KB Output is correct
33 Correct 10 ms 2748 KB Output is correct
34 Correct 11 ms 2764 KB Output is correct
35 Correct 10 ms 2764 KB Output is correct
36 Correct 11 ms 2764 KB Output is correct
37 Correct 11 ms 2764 KB Output is correct
38 Correct 11 ms 2752 KB Output is correct
39 Correct 10 ms 2764 KB Output is correct
40 Correct 5 ms 2764 KB Output is correct
41 Correct 5 ms 2764 KB Output is correct
42 Correct 5 ms 2764 KB Output is correct
43 Correct 5 ms 2764 KB Output is correct
44 Correct 5 ms 2764 KB Output is correct
45 Correct 5 ms 2764 KB Output is correct
46 Correct 5 ms 2764 KB Output is correct
47 Correct 5 ms 2752 KB Output is correct
48 Correct 5 ms 2764 KB Output is correct
49 Correct 5 ms 2752 KB Output is correct

Subtask #5
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 588 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 1 ms 588 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 1 ms 588 KB Output is correct
15 Correct 1 ms 588 KB Output is correct
16 Correct 1 ms 588 KB Output is correct
17 Correct 1 ms 576 KB Output is correct
18 Correct 1 ms 588 KB Output is correct
19 Correct 1 ms 588 KB Output is correct
20 Correct 1 ms 588 KB Output is correct
21 Correct 9 ms 2764 KB Output is correct
22 Correct 12 ms 2764 KB Output is correct
23 Correct 10 ms 2804 KB Output is correct
24 Correct 11 ms 2764 KB Output is correct
25 Correct 11 ms 2728 KB Output is correct
26 Correct 11 ms 2748 KB Output is correct
27 Correct 11 ms 2760 KB Output is correct
28 Correct 11 ms 2800 KB Output is correct
29 Correct 11 ms 2764 KB Output is correct
30 Correct 10 ms 2808 KB Output is correct
31 Correct 10 ms 2752 KB Output is correct
32 Correct 10 ms 2764 KB Output is correct
33 Correct 10 ms 2748 KB Output is correct
34 Correct 11 ms 2764 KB Output is correct
35 Correct 10 ms 2764 KB Output is correct
36 Correct 11 ms 2764 KB Output is correct
37 Correct 11 ms 2764 KB Output is correct
38 Correct 11 ms 2752 KB Output is correct
39 Correct 10 ms 2764 KB Output is correct
40 Correct 5 ms 2764 KB Output is correct
41 Correct 5 ms 2764 KB Output is correct
42 Correct 5 ms 2764 KB Output is correct
43 Correct 5 ms 2764 KB Output is correct
44 Correct 5 ms 2764 KB Output is correct
45 Correct 5 ms 2764 KB Output is correct
46 Correct 5 ms 2764 KB Output is correct
47 Correct 5 ms 2752 KB Output is correct
48 Correct 5 ms 2764 KB Output is correct
49 Correct 5 ms 2752 KB Output is correct
50 Execution timed out 1081 ms 58960 KB Time limit exceeded
51 Halted 0 ms 0 KB -