oj.uz

답안 #1106142

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1106142 2024-10-29T11:09:48 Z manhlinh1501 Feast (NOI19_feast) C++17
51 / 100
 1000 ms 27984 KB 
#include<bits/stdc++.h>
using namespace std;
using i64 = long long;

template<class X, class Y>
bool minimize(X &x, const Y &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template<class X, class Y>
bool maximize(X &x, const Y &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

const int MAXN = 3e5 + 5;
const int oo32 = 1e9 + 5;
const i64 oo64 = 1e18 + 5;

int N, K;
i64 a[MAXN];

namespace subtask1 {
    bool is_subtask() {
        for(int i = 1; i <= N; i++) {
            if(a[i] < 0) return false;
        }
        return true;
    }
    void solution() {
        if(is_subtask() == false) return;
        i64 ans = accumulate(a + 1, a + N + 1, 0LL);
        cout << ans;
        exit(0);
    }
}

namespace subtask2 {
    bool is_subtask() {
        int c = 0;
        for(int i = 1; i <= N; i++)
            c += (a[i] < 0);
        return c <= 1;
    }

    void solution() {
        if(is_subtask() == false) return;
        i64 tot = accumulate(a + 1, a + N + 1, 0LL);
        i64 ans = tot;
        for(int i = 1; i <= N; i++) ans = max(ans, tot - a[i]);
        cout << ans;
        exit(0);
    }
}

namespace subtask3 {
    bool is_subtask() {
        return K == 1;
    }
    i64 dp[MAXN];

    void solution() {
        if(is_subtask() == false) return;
        for(int i = 1; i <= N; i++) dp[i] = max(dp[i - 1], 0LL) + a[i];
        cout << *max_element(dp + 1, dp + N + 1);
        exit(0);
    }
}

namespace subtask {
    void solution() {
        for(int i = 1; i <= N; i++) a[i] += a[i - 1];
        vector<vector<i64>> dp(N + 1, vector<i64>(K + 1, -oo64));
        vector<i64> maxx(N + 1, 0);
        dp[0][0] = 0;
        maxx[0] = 0;
        for(int j = 1; j <= K; j++) {
            for(int i = 1; i <= N; i++) {
                for(int y = 1; y <= i; y++) {
                    maximize(dp[i][j], maxx[y - 1] + a[i] - a[y - 1]);
                }
            }
            for(int i = 1; i <= N; i++)
                maxx[i] = max(maxx[i - 1], dp[i][j]);
        }
        i64 ans = 0;
        for(int i = 1; i <= N; i++) {
            for(int j = 1; j <= K; j++)
                maximize(ans, dp[i][j]);
        }
        cout << ans;
    }
}

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 >> K;
    for(int i = 1; i <= N; i++) cin >> a[i];
    subtask1::solution();
    subtask3::solution();
    subtask2::solution();
    subtask::solution();
    return (0 ^ 0);
}

Compilation message

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

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 2812 KB Output is correct
2 Correct 19 ms 2896 KB Output is correct
3 Correct 20 ms 2896 KB Output is correct
4 Correct 20 ms 2908 KB Output is correct
5 Correct 19 ms 2896 KB Output is correct
6 Correct 19 ms 2640 KB Output is correct
7 Correct 24 ms 2640 KB Output is correct
8 Correct 20 ms 2888 KB Output is correct
9 Correct 19 ms 2652 KB Output is correct
10 Correct 19 ms 2896 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 4944 KB Output is correct
2 Correct 14 ms 4944 KB Output is correct
3 Correct 13 ms 4944 KB Output is correct
4 Correct 13 ms 2896 KB Output is correct
5 Correct 20 ms 4944 KB Output is correct
6 Correct 13 ms 5080 KB Output is correct
7 Correct 13 ms 2896 KB Output is correct
8 Correct 22 ms 4936 KB Output is correct
9 Correct 20 ms 4944 KB Output is correct
10 Correct 13 ms 2772 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 4940 KB Output is correct
2 Correct 22 ms 4944 KB Output is correct
3 Correct 23 ms 4956 KB Output is correct
4 Correct 23 ms 4944 KB Output is correct
5 Correct 22 ms 4944 KB Output is correct
6 Correct 22 ms 5088 KB Output is correct
7 Correct 24 ms 5076 KB Output is correct
8 Correct 25 ms 4936 KB Output is correct
9 Correct 26 ms 5072 KB Output is correct
10 Correct 26 ms 4944 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Correct 1 ms 2384 KB Output is correct
3 Correct 1 ms 2384 KB Output is correct
4 Correct 1 ms 2552 KB Output is correct
5 Correct 1 ms 2384 KB Output is correct
6 Correct 1 ms 2384 KB Output is correct
7 Correct 1 ms 2384 KB Output is correct
8 Correct 1 ms 2384 KB Output is correct
9 Correct 1 ms 2384 KB Output is correct
10 Correct 1 ms 2384 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Correct 1 ms 2384 KB Output is correct
3 Correct 1 ms 2384 KB Output is correct
4 Correct 1 ms 2552 KB Output is correct
5 Correct 1 ms 2384 KB Output is correct
6 Correct 1 ms 2384 KB Output is correct
7 Correct 1 ms 2384 KB Output is correct
8 Correct 1 ms 2384 KB Output is correct
9 Correct 1 ms 2384 KB Output is correct
10 Correct 1 ms 2384 KB Output is correct
11 Correct 3 ms 2384 KB Output is correct
12 Correct 3 ms 2640 KB Output is correct
13 Correct 2 ms 2384 KB Output is correct
14 Correct 3 ms 2384 KB Output is correct
15 Correct 2 ms 2608 KB Output is correct
16 Correct 2 ms 2556 KB Output is correct
17 Correct 3 ms 2640 KB Output is correct
18 Correct 1 ms 2384 KB Output is correct
19 Correct 1 ms 2384 KB Output is correct
20 Correct 1 ms 2384 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Correct 1 ms 2384 KB Output is correct
3 Correct 1 ms 2384 KB Output is correct
4 Correct 1 ms 2552 KB Output is correct
5 Correct 1 ms 2384 KB Output is correct
6 Correct 1 ms 2384 KB Output is correct
7 Correct 1 ms 2384 KB Output is correct
8 Correct 1 ms 2384 KB Output is correct
9 Correct 1 ms 2384 KB Output is correct
10 Correct 1 ms 2384 KB Output is correct
11 Correct 3 ms 2384 KB Output is correct
12 Correct 3 ms 2640 KB Output is correct
13 Correct 2 ms 2384 KB Output is correct
14 Correct 3 ms 2384 KB Output is correct
15 Correct 2 ms 2608 KB Output is correct
16 Correct 2 ms 2556 KB Output is correct
17 Correct 3 ms 2640 KB Output is correct
18 Correct 1 ms 2384 KB Output is correct
19 Correct 1 ms 2384 KB Output is correct
20 Correct 1 ms 2384 KB Output is correct
21 Correct 394 ms 5456 KB Output is correct
22 Execution timed out 1073 ms 27984 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 2812 KB Output is correct
2 Correct 19 ms 2896 KB Output is correct
3 Correct 20 ms 2896 KB Output is correct
4 Correct 20 ms 2908 KB Output is correct
5 Correct 19 ms 2896 KB Output is correct
6 Correct 19 ms 2640 KB Output is correct
7 Correct 24 ms 2640 KB Output is correct
8 Correct 20 ms 2888 KB Output is correct
9 Correct 19 ms 2652 KB Output is correct
10 Correct 19 ms 2896 KB Output is correct
11 Correct 14 ms 4944 KB Output is correct
12 Correct 14 ms 4944 KB Output is correct
13 Correct 13 ms 4944 KB Output is correct
14 Correct 13 ms 2896 KB Output is correct
15 Correct 20 ms 4944 KB Output is correct
16 Correct 13 ms 5080 KB Output is correct
17 Correct 13 ms 2896 KB Output is correct
18 Correct 22 ms 4936 KB Output is correct
19 Correct 20 ms 4944 KB Output is correct
20 Correct 13 ms 2772 KB Output is correct
21 Correct 22 ms 4940 KB Output is correct
22 Correct 22 ms 4944 KB Output is correct
23 Correct 23 ms 4956 KB Output is correct
24 Correct 23 ms 4944 KB Output is correct
25 Correct 22 ms 4944 KB Output is correct
26 Correct 22 ms 5088 KB Output is correct
27 Correct 24 ms 5076 KB Output is correct
28 Correct 25 ms 4936 KB Output is correct
29 Correct 26 ms 5072 KB Output is correct
30 Correct 26 ms 4944 KB Output is correct
31 Correct 1 ms 2384 KB Output is correct
32 Correct 1 ms 2384 KB Output is correct
33 Correct 1 ms 2384 KB Output is correct
34 Correct 1 ms 2552 KB Output is correct
35 Correct 1 ms 2384 KB Output is correct
36 Correct 1 ms 2384 KB Output is correct
37 Correct 1 ms 2384 KB Output is correct
38 Correct 1 ms 2384 KB Output is correct
39 Correct 1 ms 2384 KB Output is correct
40 Correct 1 ms 2384 KB Output is correct
41 Correct 3 ms 2384 KB Output is correct
42 Correct 3 ms 2640 KB Output is correct
43 Correct 2 ms 2384 KB Output is correct
44 Correct 3 ms 2384 KB Output is correct
45 Correct 2 ms 2608 KB Output is correct
46 Correct 2 ms 2556 KB Output is correct
47 Correct 3 ms 2640 KB Output is correct
48 Correct 1 ms 2384 KB Output is correct
49 Correct 1 ms 2384 KB Output is correct
50 Correct 1 ms 2384 KB Output is correct
51 Correct 394 ms 5456 KB Output is correct
52 Execution timed out 1073 ms 27984 KB Time limit exceeded
53 Halted 0 ms 0 KB -