oj.uz

답안 #407424

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
407424 2021-05-18T23:46:02 Z 534351 Cigle (COI21_cigle) C++17
48 / 100
 1000 ms 11252 KB 
#include <bits/stdc++.h>

using namespace std;

template<class T, class U>
void ckmin(T &a, U b)
{
    if (a > b) a = b;
}

template<class T, class U>
void ckmax(T &a, U b)
{
    if (a < b) a = b;
}

#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)
#define SZ(x) ((int) (x).size())
#define ALL(x) (x).begin(), (x).end()

const int MAXN = 5013;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;

int N;
int arr[MAXN], pref[MAXN];
int dp[MAXN][MAXN];
int ans;

int32_t main()
{
    ios_base::sync_with_stdio(false); cin.tie(0);
    cout << fixed << setprecision(12);
    cerr << fixed << setprecision(4);
    cin >> N;
    FOR(i, 0, N)
    {
        cin >> arr[i];
        pref[i + 1] = pref[i] + arr[i];
    }
    // dp[0][0] = 0;
    FOR(i, 1, N + 1)
    {
        int iter = i - 1;
        FOR(j, i, N + 1)
        {
            dp[i][j] = 0;
            FOR(k, 1, i)
            {
                ckmax(dp[i][j], dp[k][i - 1]);
            }
            int c = 2 * pref[i - 1] - pref[j];
            while(iter != 0 && pref[iter] > c)
            {
                iter--;
            }
            // cerr << "dp " << i << ' ' << j << " = " << dp[i][j] << endl;
            if (pref[iter] == c)
            {
                //c(x, i-1) += 1 for all x <= idx.
                // #warning check this
                FOR(k, 1, iter + 1)
                {
                    // cerr << "ADD " << k << ' ' << i - 1 << endl;
                    dp[k][i - 1]++;
                }
            }
            //i...j. that means you use i-1....j-1.
            //count how many s i-2...k = si-1...c
            //pref[i-1] - pref[k] = pref[j] - pref[i - 1].
            //pref[k] = 2 pref[i - 1] - pref[j]
            //find dp[i][j].
            //dp[i][j] = max(dp[i][j], dp[k][i - 1] + c(k, i, j))
            //c(k, i, j) is # of positions l such that s[k] +
            //there's always some poition
        }
    }
    FOR(i, 1, N + 1)
    {
        ckmax(ans, dp[i][N]);
    }
    cout << ans << '\n';
    return 0;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 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 332 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 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 332 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 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 588 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 2756 KB Output is correct
2 Correct 41 ms 2872 KB Output is correct
3 Correct 37 ms 2756 KB Output is correct
4 Correct 41 ms 2756 KB Output is correct
5 Correct 45 ms 2756 KB Output is correct
6 Correct 44 ms 2756 KB Output is correct
7 Correct 46 ms 2776 KB Output is correct
8 Correct 45 ms 2800 KB Output is correct
9 Correct 46 ms 2796 KB Output is correct
10 Correct 48 ms 2716 KB Output is correct
11 Correct 48 ms 2696 KB Output is correct
12 Correct 45 ms 2756 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 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 332 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 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 588 KB Output is correct
21 Correct 38 ms 2756 KB Output is correct
22 Correct 41 ms 2872 KB Output is correct
23 Correct 37 ms 2756 KB Output is correct
24 Correct 41 ms 2756 KB Output is correct
25 Correct 45 ms 2756 KB Output is correct
26 Correct 44 ms 2756 KB Output is correct
27 Correct 46 ms 2776 KB Output is correct
28 Correct 45 ms 2800 KB Output is correct
29 Correct 46 ms 2796 KB Output is correct
30 Correct 48 ms 2716 KB Output is correct
31 Correct 48 ms 2696 KB Output is correct
32 Correct 45 ms 2756 KB Output is correct
33 Correct 38 ms 2812 KB Output is correct
34 Correct 37 ms 2748 KB Output is correct
35 Correct 42 ms 2756 KB Output is correct
36 Correct 39 ms 2756 KB Output is correct
37 Correct 46 ms 2732 KB Output is correct
38 Correct 44 ms 2908 KB Output is correct
39 Correct 44 ms 2796 KB Output is correct
40 Correct 34 ms 2736 KB Output is correct
41 Correct 45 ms 2720 KB Output is correct
42 Correct 51 ms 2700 KB Output is correct
43 Correct 42 ms 2756 KB Output is correct
44 Correct 35 ms 2732 KB Output is correct
45 Correct 43 ms 2704 KB Output is correct
46 Correct 41 ms 2700 KB Output is correct
47 Correct 39 ms 2868 KB Output is correct
48 Correct 37 ms 2744 KB Output is correct
49 Correct 42 ms 2740 KB Output is correct

Subtask #5
0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 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 332 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 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 588 KB Output is correct
21 Correct 38 ms 2756 KB Output is correct
22 Correct 41 ms 2872 KB Output is correct
23 Correct 37 ms 2756 KB Output is correct
24 Correct 41 ms 2756 KB Output is correct
25 Correct 45 ms 2756 KB Output is correct
26 Correct 44 ms 2756 KB Output is correct
27 Correct 46 ms 2776 KB Output is correct
28 Correct 45 ms 2800 KB Output is correct
29 Correct 46 ms 2796 KB Output is correct
30 Correct 48 ms 2716 KB Output is correct
31 Correct 48 ms 2696 KB Output is correct
32 Correct 45 ms 2756 KB Output is correct
33 Correct 38 ms 2812 KB Output is correct
34 Correct 37 ms 2748 KB Output is correct
35 Correct 42 ms 2756 KB Output is correct
36 Correct 39 ms 2756 KB Output is correct
37 Correct 46 ms 2732 KB Output is correct
38 Correct 44 ms 2908 KB Output is correct
39 Correct 44 ms 2796 KB Output is correct
40 Correct 34 ms 2736 KB Output is correct
41 Correct 45 ms 2720 KB Output is correct
42 Correct 51 ms 2700 KB Output is correct
43 Correct 42 ms 2756 KB Output is correct
44 Correct 35 ms 2732 KB Output is correct
45 Correct 43 ms 2704 KB Output is correct
46 Correct 41 ms 2700 KB Output is correct
47 Correct 39 ms 2868 KB Output is correct
48 Correct 37 ms 2744 KB Output is correct
49 Correct 42 ms 2740 KB Output is correct
50 Execution timed out 1090 ms 11252 KB Time limit exceeded
51 Halted 0 ms 0 KB -