oj.uz

답안 #520618

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
520618 2022-01-30T10:49:19 Z Vimmer Cigle (COI21_cigle) C++14
48 / 100
 1000 ms 218340 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;

si f[5001][5001][2];

vector <int> was[5001];

int pr[5001];

si now[5001][5001][2];

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

    memset(now, -1, sizeof now);

    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 (r)
                        now[l][r][t] = max(now[l][r][t], now[l][r - 1][t]);

                    f[l][r][t] = max(f[l][r][t], now[l][r][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)
                                {
                                    bn = 1;

                                    i++;
                                }

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

                                ans = max(ans, kl);

                                if (sm <= cur)
                                {
                                    now[r + 1][nw][t ^ 1] = max(now[r + 1][nw][t ^ 1], si(kl));

                                    break;
                                }
                            }
                        }
                }

    pri(ans);
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 196188 KB Output is correct
2 Correct 69 ms 196164 KB Output is correct
3 Correct 71 ms 196164 KB Output is correct
4 Correct 79 ms 196140 KB Output is correct
5 Correct 80 ms 196076 KB Output is correct
6 Correct 73 ms 196164 KB Output is correct
7 Correct 70 ms 196140 KB Output is correct
8 Correct 71 ms 196168 KB Output is correct
9 Correct 69 ms 196092 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 196188 KB Output is correct
2 Correct 69 ms 196164 KB Output is correct
3 Correct 71 ms 196164 KB Output is correct
4 Correct 79 ms 196140 KB Output is correct
5 Correct 80 ms 196076 KB Output is correct
6 Correct 73 ms 196164 KB Output is correct
7 Correct 70 ms 196140 KB Output is correct
8 Correct 71 ms 196168 KB Output is correct
9 Correct 69 ms 196092 KB Output is correct
10 Correct 69 ms 196120 KB Output is correct
11 Correct 69 ms 196088 KB Output is correct
12 Correct 74 ms 196132 KB Output is correct
13 Correct 71 ms 196112 KB Output is correct
14 Correct 70 ms 196168 KB Output is correct
15 Correct 68 ms 196132 KB Output is correct
16 Correct 69 ms 196104 KB Output is correct
17 Correct 81 ms 196124 KB Output is correct
18 Correct 83 ms 196152 KB Output is correct
19 Correct 78 ms 196296 KB Output is correct
20 Correct 71 ms 196184 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 157 ms 196364 KB Output is correct
2 Correct 164 ms 196584 KB Output is correct
3 Correct 172 ms 196292 KB Output is correct
4 Correct 165 ms 196340 KB Output is correct
5 Correct 162 ms 196408 KB Output is correct
6 Correct 185 ms 196388 KB Output is correct
7 Correct 170 ms 196444 KB Output is correct
8 Correct 164 ms 196364 KB Output is correct
9 Correct 167 ms 196420 KB Output is correct
10 Correct 159 ms 196400 KB Output is correct
11 Correct 159 ms 196292 KB Output is correct
12 Correct 160 ms 196404 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 196188 KB Output is correct
2 Correct 69 ms 196164 KB Output is correct
3 Correct 71 ms 196164 KB Output is correct
4 Correct 79 ms 196140 KB Output is correct
5 Correct 80 ms 196076 KB Output is correct
6 Correct 73 ms 196164 KB Output is correct
7 Correct 70 ms 196140 KB Output is correct
8 Correct 71 ms 196168 KB Output is correct
9 Correct 69 ms 196092 KB Output is correct
10 Correct 69 ms 196120 KB Output is correct
11 Correct 69 ms 196088 KB Output is correct
12 Correct 74 ms 196132 KB Output is correct
13 Correct 71 ms 196112 KB Output is correct
14 Correct 70 ms 196168 KB Output is correct
15 Correct 68 ms 196132 KB Output is correct
16 Correct 69 ms 196104 KB Output is correct
17 Correct 81 ms 196124 KB Output is correct
18 Correct 83 ms 196152 KB Output is correct
19 Correct 78 ms 196296 KB Output is correct
20 Correct 71 ms 196184 KB Output is correct
21 Correct 157 ms 196364 KB Output is correct
22 Correct 164 ms 196584 KB Output is correct
23 Correct 172 ms 196292 KB Output is correct
24 Correct 165 ms 196340 KB Output is correct
25 Correct 162 ms 196408 KB Output is correct
26 Correct 185 ms 196388 KB Output is correct
27 Correct 170 ms 196444 KB Output is correct
28 Correct 164 ms 196364 KB Output is correct
29 Correct 167 ms 196420 KB Output is correct
30 Correct 159 ms 196400 KB Output is correct
31 Correct 159 ms 196292 KB Output is correct
32 Correct 160 ms 196404 KB Output is correct
33 Correct 157 ms 196292 KB Output is correct
34 Correct 158 ms 196356 KB Output is correct
35 Correct 166 ms 196312 KB Output is correct
36 Correct 164 ms 196440 KB Output is correct
37 Correct 172 ms 196444 KB Output is correct
38 Correct 172 ms 196548 KB Output is correct
39 Correct 159 ms 196188 KB Output is correct
40 Correct 111 ms 196168 KB Output is correct
41 Correct 108 ms 196160 KB Output is correct
42 Correct 119 ms 196112 KB Output is correct
43 Correct 109 ms 196148 KB Output is correct
44 Correct 107 ms 196180 KB Output is correct
45 Correct 108 ms 196164 KB Output is correct
46 Correct 132 ms 196268 KB Output is correct
47 Correct 112 ms 196108 KB Output is correct
48 Correct 107 ms 196160 KB Output is correct
49 Correct 111 ms 196188 KB Output is correct

Subtask #5
0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 196188 KB Output is correct
2 Correct 69 ms 196164 KB Output is correct
3 Correct 71 ms 196164 KB Output is correct
4 Correct 79 ms 196140 KB Output is correct
5 Correct 80 ms 196076 KB Output is correct
6 Correct 73 ms 196164 KB Output is correct
7 Correct 70 ms 196140 KB Output is correct
8 Correct 71 ms 196168 KB Output is correct
9 Correct 69 ms 196092 KB Output is correct
10 Correct 69 ms 196120 KB Output is correct
11 Correct 69 ms 196088 KB Output is correct
12 Correct 74 ms 196132 KB Output is correct
13 Correct 71 ms 196112 KB Output is correct
14 Correct 70 ms 196168 KB Output is correct
15 Correct 68 ms 196132 KB Output is correct
16 Correct 69 ms 196104 KB Output is correct
17 Correct 81 ms 196124 KB Output is correct
18 Correct 83 ms 196152 KB Output is correct
19 Correct 78 ms 196296 KB Output is correct
20 Correct 71 ms 196184 KB Output is correct
21 Correct 157 ms 196364 KB Output is correct
22 Correct 164 ms 196584 KB Output is correct
23 Correct 172 ms 196292 KB Output is correct
24 Correct 165 ms 196340 KB Output is correct
25 Correct 162 ms 196408 KB Output is correct
26 Correct 185 ms 196388 KB Output is correct
27 Correct 170 ms 196444 KB Output is correct
28 Correct 164 ms 196364 KB Output is correct
29 Correct 167 ms 196420 KB Output is correct
30 Correct 159 ms 196400 KB Output is correct
31 Correct 159 ms 196292 KB Output is correct
32 Correct 160 ms 196404 KB Output is correct
33 Correct 157 ms 196292 KB Output is correct
34 Correct 158 ms 196356 KB Output is correct
35 Correct 166 ms 196312 KB Output is correct
36 Correct 164 ms 196440 KB Output is correct
37 Correct 172 ms 196444 KB Output is correct
38 Correct 172 ms 196548 KB Output is correct
39 Correct 159 ms 196188 KB Output is correct
40 Correct 111 ms 196168 KB Output is correct
41 Correct 108 ms 196160 KB Output is correct
42 Correct 119 ms 196112 KB Output is correct
43 Correct 109 ms 196148 KB Output is correct
44 Correct 107 ms 196180 KB Output is correct
45 Correct 108 ms 196164 KB Output is correct
46 Correct 132 ms 196268 KB Output is correct
47 Correct 112 ms 196108 KB Output is correct
48 Correct 107 ms 196160 KB Output is correct
49 Correct 111 ms 196188 KB Output is correct
50 Execution timed out 1105 ms 218340 KB Time limit exceeded
51 Halted 0 ms 0 KB -