oj.uz

Submission #1065969

# Submission time Handle Problem Language Result Execution time Memory
1065969 2024-08-19T13:41:00 Z manhlinh1501 Bigger segments (IZhO19_segments) C++17
27 / 100
 40 ms 6496 KB 
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const int MAXN = 5e5 + 5;

int N;
int a[MAXN];

namespace subtask12 {
    const int MAXN = 505;

    int dp[MAXN][MAXN];
    i64 prefix[MAXN];

    void solution() {
        for(int i = 1; i <= N; i++) prefix[i] = prefix[i - 1] + a[i];
        memset(dp, -0x3f, sizeof dp);
        for(int i = 1; i <= N; i++) dp[i][1] = 1;
        for(int i = 1; i <= N; i++) {
            for(int j = 1; j <= i; j++) {
                for(int z = 1; z <= j; z++) {
                    if(prefix[i] + prefix[z - 1] >= 2 * prefix[j - 1] and (i != j or j != z))
                        dp[i][j] = max(dp[i][j], dp[j - 1][z] + 1);
                }
            }
        }
        int ans = 0;
        for(int i = 1; i <= N; i++) ans = max(ans, dp[N][i]);
        cout << ans << "\n";
    }
}

namespace subtask3 {
    const int MAXN = 3e3 + 5;

    int dp[MAXN][MAXN];
    i64 prefix[MAXN];

    void solution() {
        for(int i = 1; i <= N; i++) prefix[i] = prefix[i - 1] + a[i];
        memset(dp, -0x3f, sizeof dp);
        for(int i = 1; i <= N; i++) dp[i][1] = 1;
        for(int i = 1; i <= N; i++) {
            for(int j = 1; j <= i; j++) {
                int z = 1;
                for(; z <= j and 2 * prefix[j - 1] - prefix[i] <= prefix[z - 1]; z++) {
                    if(i != j or j != z)
                        dp[i][j] = max(dp[i][j], dp[j - 1][z] + 1);
                }
            }
        }
        int ans = 0;
        for(int i = 1; i <= N; i++) ans = max(ans, dp[N][i]);
        cout << ans << "\n";
    }
}

signed main() {
#define TASK "code"

    if (fopen(TASK ".inp", "r")) {
        freopen(TASK ".inp", "r", stdin);
        freopen(TASK ".out", "w", stdout);
    }

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin >> N;
    for(int i = 1; i <= N; i++) cin >> a[i];
    subtask12::solution();
    return (0 ^ 0);
}

/**
4
2 3 1 7
**/

/**
5
6 2 3 9 13
**/

/**
3
3 1 2
**/

Compilation message

segments.cpp: In function 'int main()':
segments.cpp:62:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   62 |         freopen(TASK ".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
segments.cpp:63:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   63 |         freopen(TASK ".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1368 KB Output is correct
2 Correct 1 ms 1368 KB Output is correct
3 Correct 1 ms 1372 KB Output is correct
4 Correct 1 ms 1372 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 1372 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 1 ms 1232 KB Output is correct
10 Correct 1 ms 1624 KB Output is correct
11 Correct 1 ms 1372 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 1 ms 1460 KB Output is correct
14 Correct 1 ms 1372 KB Output is correct
15 Correct 1 ms 1372 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1368 KB Output is correct
2 Correct 1 ms 1368 KB Output is correct
3 Correct 1 ms 1372 KB Output is correct
4 Correct 1 ms 1372 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 1372 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 1 ms 1232 KB Output is correct
10 Correct 1 ms 1624 KB Output is correct
11 Correct 1 ms 1372 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 1 ms 1460 KB Output is correct
14 Correct 1 ms 1372 KB Output is correct
15 Correct 1 ms 1372 KB Output is correct
16 Correct 20 ms 1372 KB Output is correct
17 Correct 21 ms 1372 KB Output is correct
18 Correct 30 ms 1488 KB Output is correct
19 Correct 19 ms 1372 KB Output is correct
20 Correct 22 ms 1636 KB Output is correct
21 Correct 24 ms 1376 KB Output is correct
22 Correct 11 ms 1372 KB Output is correct
23 Correct 6 ms 1376 KB Output is correct
24 Correct 26 ms 1272 KB Output is correct
25 Correct 35 ms 1628 KB Output is correct
26 Correct 33 ms 1460 KB Output is correct
27 Correct 19 ms 1372 KB Output is correct
28 Correct 21 ms 1376 KB Output is correct
29 Correct 40 ms 1488 KB Output is correct
30 Correct 21 ms 1368 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1368 KB Output is correct
2 Correct 1 ms 1368 KB Output is correct
3 Correct 1 ms 1372 KB Output is correct
4 Correct 1 ms 1372 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 1372 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 1 ms 1232 KB Output is correct
10 Correct 1 ms 1624 KB Output is correct
11 Correct 1 ms 1372 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 1 ms 1460 KB Output is correct
14 Correct 1 ms 1372 KB Output is correct
15 Correct 1 ms 1372 KB Output is correct
16 Correct 20 ms 1372 KB Output is correct
17 Correct 21 ms 1372 KB Output is correct
18 Correct 30 ms 1488 KB Output is correct
19 Correct 19 ms 1372 KB Output is correct
20 Correct 22 ms 1636 KB Output is correct
21 Correct 24 ms 1376 KB Output is correct
22 Correct 11 ms 1372 KB Output is correct
23 Correct 6 ms 1376 KB Output is correct
24 Correct 26 ms 1272 KB Output is correct
25 Correct 35 ms 1628 KB Output is correct
26 Correct 33 ms 1460 KB Output is correct
27 Correct 19 ms 1372 KB Output is correct
28 Correct 21 ms 1376 KB Output is correct
29 Correct 40 ms 1488 KB Output is correct
30 Correct 21 ms 1368 KB Output is correct
31 Runtime error 5 ms 6496 KB Execution killed with signal 11
32 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1368 KB Output is correct
2 Correct 1 ms 1368 KB Output is correct
3 Correct 1 ms 1372 KB Output is correct
4 Correct 1 ms 1372 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 1372 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 1 ms 1232 KB Output is correct
10 Correct 1 ms 1624 KB Output is correct
11 Correct 1 ms 1372 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 1 ms 1460 KB Output is correct
14 Correct 1 ms 1372 KB Output is correct
15 Correct 1 ms 1372 KB Output is correct
16 Correct 20 ms 1372 KB Output is correct
17 Correct 21 ms 1372 KB Output is correct
18 Correct 30 ms 1488 KB Output is correct
19 Correct 19 ms 1372 KB Output is correct
20 Correct 22 ms 1636 KB Output is correct
21 Correct 24 ms 1376 KB Output is correct
22 Correct 11 ms 1372 KB Output is correct
23 Correct 6 ms 1376 KB Output is correct
24 Correct 26 ms 1272 KB Output is correct
25 Correct 35 ms 1628 KB Output is correct
26 Correct 33 ms 1460 KB Output is correct
27 Correct 19 ms 1372 KB Output is correct
28 Correct 21 ms 1376 KB Output is correct
29 Correct 40 ms 1488 KB Output is correct
30 Correct 21 ms 1368 KB Output is correct
31 Runtime error 5 ms 6496 KB Execution killed with signal 11
32 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1368 KB Output is correct
2 Correct 1 ms 1368 KB Output is correct
3 Correct 1 ms 1372 KB Output is correct
4 Correct 1 ms 1372 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 1372 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 1 ms 1232 KB Output is correct
10 Correct 1 ms 1624 KB Output is correct
11 Correct 1 ms 1372 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 1 ms 1460 KB Output is correct
14 Correct 1 ms 1372 KB Output is correct
15 Correct 1 ms 1372 KB Output is correct
16 Correct 20 ms 1372 KB Output is correct
17 Correct 21 ms 1372 KB Output is correct
18 Correct 30 ms 1488 KB Output is correct
19 Correct 19 ms 1372 KB Output is correct
20 Correct 22 ms 1636 KB Output is correct
21 Correct 24 ms 1376 KB Output is correct
22 Correct 11 ms 1372 KB Output is correct
23 Correct 6 ms 1376 KB Output is correct
24 Correct 26 ms 1272 KB Output is correct
25 Correct 35 ms 1628 KB Output is correct
26 Correct 33 ms 1460 KB Output is correct
27 Correct 19 ms 1372 KB Output is correct
28 Correct 21 ms 1376 KB Output is correct
29 Correct 40 ms 1488 KB Output is correct
30 Correct 21 ms 1368 KB Output is correct
31 Runtime error 5 ms 6496 KB Execution killed with signal 11
32 Halted 0 ms 0 KB -