oj.uz

Submission #520613

# Submission time Handle Problem Language Result Execution time Memory
520613 2022-01-30T10:42:25 Z Vimmer Cigle (COI21_cigle) C++14
48 / 100
 1000 ms 218616 KB 
#include <bits/stdc++.h>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)

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

#define F first
#define S second
#define PB push_back
#define M ll(1e9 + 7)
#define sz(x) (ll)x.size()
#define N 1000500
#define pri(x) cout << x << endl
#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define _ << " " <<

using namespace std;
//typedef tree <ll, null_type, less_equal <ll> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
//using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef short int si;
typedef unsigned long long ull;

int f[5005][5005][2];

vector <int> was[5005];

int pr[5005];

int main()
{
    istream::sync_with_stdio(0); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    memset(f, -1, sizeof f);

    int n;

    cin >> n;

    int a[n], ans = 0;

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

    for (int i = 0; i < n; i++)
    {
        pr[i] = a[i];

        if (i)
            pr[i] += pr[i - 1];
    }

    for (int l = 0; l < n; l++)
        {
            int sum = 0;

            for (int r = l; r < n; r++)
            {
                sum += a[r];

                int L = r + 1, R = n - 1;

                while (L < R)
                {
                    int md = (L + R) >> 1;

                    if (pr[md] - pr[r] >= sum)
                        R = md;
                            else L = md + 1;
                }

                if (pr[L] - pr[r] == sum)
                    {
                        was[r].PB(L);
                    }
            }
        }

    for (int i = 0; i < n; i++)
        sort(all(was[i]));

    for (int i = 0; i < n; i++)
        f[0][i][0] = 0;

    for (int r = 0; r < n; r++)
        for (int l = 0; l <= r; l++)
                for (int t = 0; t < 2; t++)
                    if (f[l][r][t] != -1)
                    {
                        int kl = f[l][r][t];

                        int sm = pr[r], cur = 0;

                        if (l)
                            sm -= pr[l - 1];

                        int i = 0, bn = 0;

                        for (int nw = r + 1; nw < n; nw++)
                        {
                            cur += a[nw];

                            if (bn)
                            {
                                kl++;

                                bn = 0;
                            }

                            while (i < sz(was[r]) && was[r][i] == nw && cur < sm)
                            {
                                bn = 1;

                                i++;
                            }

                            f[r + 1][nw][t ^ 1] = max(f[r + 1][nw][t ^ 1], kl);

                            ans = max(ans, kl);
                        }
                    }

    pri(ans);
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 196420 KB Output is correct
2 Correct 69 ms 196404 KB Output is correct
3 Correct 70 ms 196440 KB Output is correct
4 Correct 71 ms 196492 KB Output is correct
5 Correct 82 ms 196544 KB Output is correct
6 Correct 72 ms 196412 KB Output is correct
7 Correct 71 ms 196420 KB Output is correct
8 Correct 74 ms 196416 KB Output is correct
9 Correct 72 ms 196420 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 196420 KB Output is correct
2 Correct 69 ms 196404 KB Output is correct
3 Correct 70 ms 196440 KB Output is correct
4 Correct 71 ms 196492 KB Output is correct
5 Correct 82 ms 196544 KB Output is correct
6 Correct 72 ms 196412 KB Output is correct
7 Correct 71 ms 196420 KB Output is correct
8 Correct 74 ms 196416 KB Output is correct
9 Correct 72 ms 196420 KB Output is correct
10 Correct 72 ms 196504 KB Output is correct
11 Correct 83 ms 196484 KB Output is correct
12 Correct 71 ms 196488 KB Output is correct
13 Correct 83 ms 196444 KB Output is correct
14 Correct 80 ms 196456 KB Output is correct
15 Correct 75 ms 196420 KB Output is correct
16 Correct 74 ms 196380 KB Output is correct
17 Correct 77 ms 196404 KB Output is correct
18 Correct 78 ms 196524 KB Output is correct
19 Correct 78 ms 196420 KB Output is correct
20 Correct 92 ms 196480 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 183 ms 196668 KB Output is correct
2 Correct 174 ms 196780 KB Output is correct
3 Correct 176 ms 196720 KB Output is correct
4 Correct 193 ms 196740 KB Output is correct
5 Correct 179 ms 196808 KB Output is correct
6 Correct 196 ms 196764 KB Output is correct
7 Correct 197 ms 196756 KB Output is correct
8 Correct 198 ms 196864 KB Output is correct
9 Correct 194 ms 196756 KB Output is correct
10 Correct 188 ms 196732 KB Output is correct
11 Correct 190 ms 196716 KB Output is correct
12 Correct 184 ms 196604 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 196420 KB Output is correct
2 Correct 69 ms 196404 KB Output is correct
3 Correct 70 ms 196440 KB Output is correct
4 Correct 71 ms 196492 KB Output is correct
5 Correct 82 ms 196544 KB Output is correct
6 Correct 72 ms 196412 KB Output is correct
7 Correct 71 ms 196420 KB Output is correct
8 Correct 74 ms 196416 KB Output is correct
9 Correct 72 ms 196420 KB Output is correct
10 Correct 72 ms 196504 KB Output is correct
11 Correct 83 ms 196484 KB Output is correct
12 Correct 71 ms 196488 KB Output is correct
13 Correct 83 ms 196444 KB Output is correct
14 Correct 80 ms 196456 KB Output is correct
15 Correct 75 ms 196420 KB Output is correct
16 Correct 74 ms 196380 KB Output is correct
17 Correct 77 ms 196404 KB Output is correct
18 Correct 78 ms 196524 KB Output is correct
19 Correct 78 ms 196420 KB Output is correct
20 Correct 92 ms 196480 KB Output is correct
21 Correct 183 ms 196668 KB Output is correct
22 Correct 174 ms 196780 KB Output is correct
23 Correct 176 ms 196720 KB Output is correct
24 Correct 193 ms 196740 KB Output is correct
25 Correct 179 ms 196808 KB Output is correct
26 Correct 196 ms 196764 KB Output is correct
27 Correct 197 ms 196756 KB Output is correct
28 Correct 198 ms 196864 KB Output is correct
29 Correct 194 ms 196756 KB Output is correct
30 Correct 188 ms 196732 KB Output is correct
31 Correct 190 ms 196716 KB Output is correct
32 Correct 184 ms 196604 KB Output is correct
33 Correct 163 ms 196556 KB Output is correct
34 Correct 194 ms 196716 KB Output is correct
35 Correct 172 ms 196676 KB Output is correct
36 Correct 179 ms 196848 KB Output is correct
37 Correct 201 ms 196760 KB Output is correct
38 Correct 186 ms 196756 KB Output is correct
39 Correct 160 ms 196636 KB Output is correct
40 Correct 147 ms 196504 KB Output is correct
41 Correct 127 ms 196396 KB Output is correct
42 Correct 135 ms 196480 KB Output is correct
43 Correct 135 ms 196676 KB Output is correct
44 Correct 134 ms 196444 KB Output is correct
45 Correct 131 ms 196476 KB Output is correct
46 Correct 133 ms 196432 KB Output is correct
47 Correct 137 ms 196536 KB Output is correct
48 Correct 132 ms 196424 KB Output is correct
49 Correct 132 ms 196504 KB Output is correct

Subtask #5
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 196420 KB Output is correct
2 Correct 69 ms 196404 KB Output is correct
3 Correct 70 ms 196440 KB Output is correct
4 Correct 71 ms 196492 KB Output is correct
5 Correct 82 ms 196544 KB Output is correct
6 Correct 72 ms 196412 KB Output is correct
7 Correct 71 ms 196420 KB Output is correct
8 Correct 74 ms 196416 KB Output is correct
9 Correct 72 ms 196420 KB Output is correct
10 Correct 72 ms 196504 KB Output is correct
11 Correct 83 ms 196484 KB Output is correct
12 Correct 71 ms 196488 KB Output is correct
13 Correct 83 ms 196444 KB Output is correct
14 Correct 80 ms 196456 KB Output is correct
15 Correct 75 ms 196420 KB Output is correct
16 Correct 74 ms 196380 KB Output is correct
17 Correct 77 ms 196404 KB Output is correct
18 Correct 78 ms 196524 KB Output is correct
19 Correct 78 ms 196420 KB Output is correct
20 Correct 92 ms 196480 KB Output is correct
21 Correct 183 ms 196668 KB Output is correct
22 Correct 174 ms 196780 KB Output is correct
23 Correct 176 ms 196720 KB Output is correct
24 Correct 193 ms 196740 KB Output is correct
25 Correct 179 ms 196808 KB Output is correct
26 Correct 196 ms 196764 KB Output is correct
27 Correct 197 ms 196756 KB Output is correct
28 Correct 198 ms 196864 KB Output is correct
29 Correct 194 ms 196756 KB Output is correct
30 Correct 188 ms 196732 KB Output is correct
31 Correct 190 ms 196716 KB Output is correct
32 Correct 184 ms 196604 KB Output is correct
33 Correct 163 ms 196556 KB Output is correct
34 Correct 194 ms 196716 KB Output is correct
35 Correct 172 ms 196676 KB Output is correct
36 Correct 179 ms 196848 KB Output is correct
37 Correct 201 ms 196760 KB Output is correct
38 Correct 186 ms 196756 KB Output is correct
39 Correct 160 ms 196636 KB Output is correct
40 Correct 147 ms 196504 KB Output is correct
41 Correct 127 ms 196396 KB Output is correct
42 Correct 135 ms 196480 KB Output is correct
43 Correct 135 ms 196676 KB Output is correct
44 Correct 134 ms 196444 KB Output is correct
45 Correct 131 ms 196476 KB Output is correct
46 Correct 133 ms 196432 KB Output is correct
47 Correct 137 ms 196536 KB Output is correct
48 Correct 132 ms 196424 KB Output is correct
49 Correct 132 ms 196504 KB Output is correct
50 Execution timed out 1101 ms 218616 KB Time limit exceeded
51 Halted 0 ms 0 KB -