oj.uz

답안 #892795

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
892795 2023-12-26T01:57:07 Z votranngocvy Feast (NOI19_feast) C++14
51 / 100
 30 ms 6748 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define ld long double
#define fi first
#define se second
#define mp make_pair
const int N = 3e5 + 5;
const int inf = 0x3f3f3f3f3f3f3f3f;
int a[N],pre[N],n,k;

namespace sub1 {
    bool check_condition() {
        for (int i = 1; i <= n; i++)
            if (a[i] < 0) return false;
        return true;
    }
    void solve() {
        int ans = 0;
        for (int i = 1; i <= n; i++) ans += a[i];
        cout << ans << "\n";
    }
}

namespace sub2 {
    bool check_condition() {
        int cnt = 0;
        for (int i = 1; i <= n; i++)
            if (a[i] < 0) cnt++;
        return (cnt == 1);
    }
    void solve() {
        pre[0] = 0;
        int pos = 0;
        for (int i = 1; i <= n; i++) {
            pre[i] = pre[i - 1] + a[i];
            if (a[i] < 0) pos = i;
        }
        if (k == 1) cout << max(max(pre[pos - 1],pre[n] - pre[pos]),pre[n]) << "\n";
        else cout << pre[n] - a[pos] << "\n";
    }
}

namespace sub3 {
    void solve() {
        int ans = -inf,sum = 0;
        for (int i = 1; i <= n; i++) {
            sum = max(sum + a[i],a[i]);
            ans = max(ans,sum);
        }
        cout << ans << "\n";
    }
}

namespace sub5 {
    int dp[305][305];
    void solve() {
        pre[0] = 0;
        for (int i = 1; i <= n; i++) pre[i] = pre[i - 1] + a[i];
        dp[0][0] = 0;
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= k; j++) {
                dp[i][j] = dp[i - 1][j];
                for (int z = 1; z <= i; z++)
                    dp[i][j] = max(dp[i][j],dp[z - 1][j - 1] + pre[i] - pre[z - 1]);
            }
        cout << dp[n][k] << "\n";
    }
}

namespace sub7 {
    pair<ld,int>dp[N][3];
    bool check(ld val) {
        dp[0][0] = mp(0,0),dp[0][1] = mp(-inf,0);
        for (int i = 1; i <= n; i++) {
            dp[i][0] = max(dp[i - 1][0],dp[i - 1][1]);
            dp[i][1] = max(mp(dp[i - 1][0].fi + a[i] - val,dp[i - 1][0].se + 1),mp(dp[i - 1][1].fi + a[i],dp[i - 1][1].se));
        }
        return (max(dp[n][0],dp[n][1]).se <= k);
    }
    void alien_trick() {
        ld l = 0,r = inf;
        int ans;
        while (l + 1e-3 < r) {
            ld mid = (l + r) / 2.0;
            if (check(mid)) {
                l = mid;
                ans = k * mid + max(dp[n][0],dp[n][1]).fi;
            }
            else r = mid;
        }
        cout << ans << "\n";
    }
}

signed main() {
    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];
    if (sub1::check_condition()) sub1::solve();
    else if (sub2::check_condition()) sub2::solve();
    else if (k == 1) sub3::solve();
    else if (n <= 300) sub5::solve();
    else sub7::alien_trick();
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 4956 KB Output is correct
2 Correct 24 ms 4980 KB Output is correct
3 Correct 22 ms 4956 KB Output is correct
4 Correct 22 ms 4948 KB Output is correct
5 Correct 23 ms 5068 KB Output is correct
6 Correct 21 ms 4944 KB Output is correct
7 Correct 21 ms 4948 KB Output is correct
8 Correct 22 ms 4956 KB Output is correct
9 Correct 22 ms 5072 KB Output is correct
10 Correct 22 ms 4944 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 4956 KB Output is correct
2 Correct 15 ms 4956 KB Output is correct
3 Correct 15 ms 4956 KB Output is correct
4 Correct 15 ms 5080 KB Output is correct
5 Correct 25 ms 4948 KB Output is correct
6 Correct 15 ms 4952 KB Output is correct
7 Correct 16 ms 4956 KB Output is correct
8 Correct 23 ms 4944 KB Output is correct
9 Correct 23 ms 4956 KB Output is correct
10 Correct 17 ms 4956 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 5084 KB Output is correct
2 Correct 24 ms 4944 KB Output is correct
3 Correct 24 ms 4948 KB Output is correct
4 Correct 24 ms 4952 KB Output is correct
5 Correct 26 ms 5080 KB Output is correct
6 Correct 27 ms 4996 KB Output is correct
7 Correct 25 ms 4944 KB Output is correct
8 Correct 25 ms 4956 KB Output is correct
9 Correct 30 ms 5100 KB Output is correct
10 Correct 26 ms 5068 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 6500 KB Output is correct
11 Correct 3 ms 6608 KB Output is correct
12 Correct 3 ms 6492 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 3 ms 6492 KB Output is correct
15 Correct 2 ms 6624 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 3 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 6500 KB Output is correct
11 Correct 3 ms 6608 KB Output is correct
12 Correct 3 ms 6492 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 3 ms 6492 KB Output is correct
15 Correct 2 ms 6624 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 3 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Incorrect 2 ms 6748 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 4956 KB Output is correct
2 Correct 24 ms 4980 KB Output is correct
3 Correct 22 ms 4956 KB Output is correct
4 Correct 22 ms 4948 KB Output is correct
5 Correct 23 ms 5068 KB Output is correct
6 Correct 21 ms 4944 KB Output is correct
7 Correct 21 ms 4948 KB Output is correct
8 Correct 22 ms 4956 KB Output is correct
9 Correct 22 ms 5072 KB Output is correct
10 Correct 22 ms 4944 KB Output is correct
11 Correct 15 ms 4956 KB Output is correct
12 Correct 15 ms 4956 KB Output is correct
13 Correct 15 ms 4956 KB Output is correct
14 Correct 15 ms 5080 KB Output is correct
15 Correct 25 ms 4948 KB Output is correct
16 Correct 15 ms 4952 KB Output is correct
17 Correct 16 ms 4956 KB Output is correct
18 Correct 23 ms 4944 KB Output is correct
19 Correct 23 ms 4956 KB Output is correct
20 Correct 17 ms 4956 KB Output is correct
21 Correct 24 ms 5084 KB Output is correct
22 Correct 24 ms 4944 KB Output is correct
23 Correct 24 ms 4948 KB Output is correct
24 Correct 24 ms 4952 KB Output is correct
25 Correct 26 ms 5080 KB Output is correct
26 Correct 27 ms 4996 KB Output is correct
27 Correct 25 ms 4944 KB Output is correct
28 Correct 25 ms 4956 KB Output is correct
29 Correct 30 ms 5100 KB Output is correct
30 Correct 26 ms 5068 KB Output is correct
31 Correct 1 ms 4440 KB Output is correct
32 Correct 1 ms 6492 KB Output is correct
33 Correct 1 ms 6492 KB Output is correct
34 Correct 1 ms 6492 KB Output is correct
35 Correct 1 ms 6492 KB Output is correct
36 Correct 1 ms 6492 KB Output is correct
37 Correct 1 ms 6492 KB Output is correct
38 Correct 1 ms 6492 KB Output is correct
39 Correct 1 ms 4444 KB Output is correct
40 Correct 1 ms 6500 KB Output is correct
41 Correct 3 ms 6608 KB Output is correct
42 Correct 3 ms 6492 KB Output is correct
43 Correct 2 ms 6492 KB Output is correct
44 Correct 3 ms 6492 KB Output is correct
45 Correct 2 ms 6624 KB Output is correct
46 Correct 2 ms 6492 KB Output is correct
47 Correct 3 ms 6492 KB Output is correct
48 Correct 1 ms 6492 KB Output is correct
49 Correct 1 ms 6492 KB Output is correct
50 Correct 1 ms 6492 KB Output is correct
51 Incorrect 2 ms 6748 KB Output isn't correct
52 Halted 0 ms 0 KB -