oj.uz

답안 #1106170

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1106170 2024-10-29T13:00:34 Z manhlinh1501 Feast (NOI19_feast) C++17
30 / 100
 33 ms 5080 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;
        for(int i = 1; i <= N; i++) maxx[i] = -a[i];
        for(int j = 1; j <= K; j++) {
            for(int i = 1; i <= N; i++)
                maximize(dp[i][j], maxx[i - 1] + a[i]);
            for(int i = 1; i <= N; i++) maxx[i] = max(maxx[i - 1], dp[i][j]);
            for(int i = 1; i <= N; i++) maxx[i] = max(maxx[i - 1], maxx[i] - a[i]);
        }
        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:101:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  101 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
feast.cpp:102:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  102 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 2640 KB Output is correct
2 Correct 22 ms 2896 KB Output is correct
3 Correct 20 ms 2776 KB Output is correct
4 Correct 20 ms 2896 KB Output is correct
5 Correct 21 ms 2896 KB Output is correct
6 Correct 30 ms 2640 KB Output is correct
7 Correct 22 ms 2640 KB Output is correct
8 Correct 23 ms 2908 KB Output is correct
9 Correct 20 ms 2772 KB Output is correct
10 Correct 22 ms 2780 KB Output is correct

Subtask #2
8.0 / 8.0

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

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 5076 KB Output is correct
2 Correct 25 ms 4944 KB Output is correct
3 Correct 24 ms 4944 KB Output is correct
4 Correct 24 ms 4944 KB Output is correct
5 Correct 26 ms 5076 KB Output is correct
6 Correct 33 ms 4984 KB Output is correct
7 Correct 23 ms 5080 KB Output is correct
8 Correct 23 ms 4944 KB Output is correct
9 Correct 23 ms 4944 KB Output is correct
10 Correct 23 ms 4944 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Correct 1 ms 2384 KB Output is correct
3 Incorrect 1 ms 2384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Correct 1 ms 2384 KB Output is correct
3 Incorrect 1 ms 2384 KB Output isn't correct
4 Halted 0 ms 0 KB -

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 Incorrect 1 ms 2384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 2640 KB Output is correct
2 Correct 22 ms 2896 KB Output is correct
3 Correct 20 ms 2776 KB Output is correct
4 Correct 20 ms 2896 KB Output is correct
5 Correct 21 ms 2896 KB Output is correct
6 Correct 30 ms 2640 KB Output is correct
7 Correct 22 ms 2640 KB Output is correct
8 Correct 23 ms 2908 KB Output is correct
9 Correct 20 ms 2772 KB Output is correct
10 Correct 22 ms 2780 KB Output is correct
11 Correct 15 ms 4944 KB Output is correct
12 Correct 18 ms 4944 KB Output is correct
13 Correct 15 ms 4944 KB Output is correct
14 Correct 14 ms 2896 KB Output is correct
15 Correct 22 ms 4936 KB Output is correct
16 Correct 14 ms 4944 KB Output is correct
17 Correct 15 ms 2896 KB Output is correct
18 Correct 23 ms 4944 KB Output is correct
19 Correct 21 ms 4944 KB Output is correct
20 Correct 14 ms 2896 KB Output is correct
21 Correct 26 ms 5076 KB Output is correct
22 Correct 25 ms 4944 KB Output is correct
23 Correct 24 ms 4944 KB Output is correct
24 Correct 24 ms 4944 KB Output is correct
25 Correct 26 ms 5076 KB Output is correct
26 Correct 33 ms 4984 KB Output is correct
27 Correct 23 ms 5080 KB Output is correct
28 Correct 23 ms 4944 KB Output is correct
29 Correct 23 ms 4944 KB Output is correct
30 Correct 23 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 Incorrect 1 ms 2384 KB Output isn't correct
34 Halted 0 ms 0 KB -