oj.uz

Submission #520611

# Submission time Handle Problem Language Result Execution time Memory
520611 2022-01-30T10:39:52 Z kartel Cigle (COI21_cigle) C++14
100 / 100
 260 ms 98564 KB 
#include <bits/stdc++.h>
//#include<ext/rope>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC target("avx2")


#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#define F first
#define S second
#define pb push_back
#define sz(x) int(x.size())
#define el '\n'
#define all(x) x.begin(), x.end()

using namespace std;
//using namespace __gnu_pbds;
//using  namespace __gnu_cxx;

typedef long long ll;
typedef long double ld;
typedef short int si;
typedef unsigned long long ull;
//typedef tree <ll, null_type, less <ll> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;

const int N = 5005;

int n, f[N][N], a[N];
int pf[N];

int main()
{
//    cerr.precision(7);
//    cerr << fixed;
    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//    in("23.in");
//    in("input.txt");
//    out("output.txt");
//    clock_t start = clock();

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

    for (int i = 0; i <= n; i++) {
        for (int j = 0; j <= n; j++) {
            f[i][j] = -1e9;
        }
    }
    for (int i = 1; i <= n; i++) {
        f[1][i] = 0;
    }
//    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
//            sum_now += a[j];
            for (int i = 1; i <= j; i++) {
                pf[i] = f[i][j];
            }
            for (int i = 1; i <= j; i++) {
                pf[i] = max(pf[i - 1], pf[i]);
            }
            int pj = j;
            int sum = 0;
            int sum_was = 0;
            int cnt = 0;
            int mx = pf[j];
            for (int k = j + 1; k <= n; k++) {
                f[j + 1][k] = mx;
                sum += a[k];
                while (pj >= 1 && sum_was < sum) {
                    sum_was += a[pj];
                    pj--;
                }
                if (pj > 0 && sum_was == sum) {
                    cnt++;
                    mx = max(mx, pf[pj] + cnt);
                }
            }
        }
//    }
    int ans = 0;
    for (int i = 1; i <= n; i++) {
        ans = max(ans, f[i][n]);
    }
    cout << ans;
}

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 320 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 0 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 320 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 0 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 576 KB Output is correct
12 Correct 1 ms 588 KB Output is correct
13 Correct 1 ms 576 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 576 KB Output is correct
17 Correct 1 ms 588 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 572 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3276 KB Output is correct
2 Correct 3 ms 3264 KB Output is correct
3 Correct 3 ms 3276 KB Output is correct
4 Correct 2 ms 3276 KB Output is correct
5 Correct 3 ms 3276 KB Output is correct
6 Correct 3 ms 3276 KB Output is correct
7 Correct 3 ms 3276 KB Output is correct
8 Correct 3 ms 3276 KB Output is correct
9 Correct 3 ms 3276 KB Output is correct
10 Correct 3 ms 3276 KB Output is correct
11 Correct 3 ms 3276 KB Output is correct
12 Correct 3 ms 3276 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 320 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 0 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 576 KB Output is correct
12 Correct 1 ms 588 KB Output is correct
13 Correct 1 ms 576 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 576 KB Output is correct
17 Correct 1 ms 588 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 572 KB Output is correct
21 Correct 3 ms 3276 KB Output is correct
22 Correct 3 ms 3264 KB Output is correct
23 Correct 3 ms 3276 KB Output is correct
24 Correct 2 ms 3276 KB Output is correct
25 Correct 3 ms 3276 KB Output is correct
26 Correct 3 ms 3276 KB Output is correct
27 Correct 3 ms 3276 KB Output is correct
28 Correct 3 ms 3276 KB Output is correct
29 Correct 3 ms 3276 KB Output is correct
30 Correct 3 ms 3276 KB Output is correct
31 Correct 3 ms 3276 KB Output is correct
32 Correct 3 ms 3276 KB Output is correct
33 Correct 2 ms 3276 KB Output is correct
34 Correct 3 ms 3276 KB Output is correct
35 Correct 3 ms 3268 KB Output is correct
36 Correct 3 ms 3276 KB Output is correct
37 Correct 3 ms 3264 KB Output is correct
38 Correct 3 ms 3276 KB Output is correct
39 Correct 3 ms 3276 KB Output is correct
40 Correct 2 ms 3276 KB Output is correct
41 Correct 3 ms 3276 KB Output is correct
42 Correct 2 ms 3276 KB Output is correct
43 Correct 3 ms 3276 KB Output is correct
44 Correct 2 ms 3264 KB Output is correct
45 Correct 3 ms 3276 KB Output is correct
46 Correct 2 ms 3276 KB Output is correct
47 Correct 3 ms 3276 KB Output is correct
48 Correct 3 ms 3276 KB Output is correct
49 Correct 3 ms 3276 KB Output is correct

Subtask #5
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 0 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 576 KB Output is correct
12 Correct 1 ms 588 KB Output is correct
13 Correct 1 ms 576 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 576 KB Output is correct
17 Correct 1 ms 588 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 572 KB Output is correct
21 Correct 3 ms 3276 KB Output is correct
22 Correct 3 ms 3264 KB Output is correct
23 Correct 3 ms 3276 KB Output is correct
24 Correct 2 ms 3276 KB Output is correct
25 Correct 3 ms 3276 KB Output is correct
26 Correct 3 ms 3276 KB Output is correct
27 Correct 3 ms 3276 KB Output is correct
28 Correct 3 ms 3276 KB Output is correct
29 Correct 3 ms 3276 KB Output is correct
30 Correct 3 ms 3276 KB Output is correct
31 Correct 3 ms 3276 KB Output is correct
32 Correct 3 ms 3276 KB Output is correct
33 Correct 2 ms 3276 KB Output is correct
34 Correct 3 ms 3276 KB Output is correct
35 Correct 3 ms 3268 KB Output is correct
36 Correct 3 ms 3276 KB Output is correct
37 Correct 3 ms 3264 KB Output is correct
38 Correct 3 ms 3276 KB Output is correct
39 Correct 3 ms 3276 KB Output is correct
40 Correct 2 ms 3276 KB Output is correct
41 Correct 3 ms 3276 KB Output is correct
42 Correct 2 ms 3276 KB Output is correct
43 Correct 3 ms 3276 KB Output is correct
44 Correct 2 ms 3264 KB Output is correct
45 Correct 3 ms 3276 KB Output is correct
46 Correct 2 ms 3276 KB Output is correct
47 Correct 3 ms 3276 KB Output is correct
48 Correct 3 ms 3276 KB Output is correct
49 Correct 3 ms 3276 KB Output is correct
50 Correct 220 ms 98432 KB Output is correct
51 Correct 200 ms 98340 KB Output is correct
52 Correct 208 ms 98316 KB Output is correct
53 Correct 206 ms 98316 KB Output is correct
54 Correct 220 ms 98316 KB Output is correct
55 Correct 210 ms 98396 KB Output is correct
56 Correct 245 ms 98244 KB Output is correct
57 Correct 260 ms 98208 KB Output is correct
58 Correct 253 ms 98316 KB Output is correct
59 Correct 253 ms 98248 KB Output is correct
60 Correct 242 ms 98320 KB Output is correct
61 Correct 238 ms 98564 KB Output is correct
62 Correct 219 ms 98244 KB Output is correct
63 Correct 224 ms 98328 KB Output is correct
64 Correct 232 ms 98372 KB Output is correct
65 Correct 219 ms 98308 KB Output is correct
66 Correct 223 ms 98376 KB Output is correct
67 Correct 215 ms 98440 KB Output is correct
68 Correct 212 ms 98308 KB Output is correct
69 Correct 216 ms 98444 KB Output is correct
70 Correct 242 ms 98316 KB Output is correct
71 Correct 237 ms 98320 KB Output is correct
72 Correct 231 ms 98320 KB Output is correct