oj.uz

답안 #257502

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
257502 2020-08-04T11:04:14 Z karma Feast (NOI19_feast) C++14
30 / 100
 144 ms 11000 KB 
#include <bits/stdc++.h>
#define pb          emplace_back
#define ll          long long
#define fi          first
#define se          second
#define mp          make_pair
//#define int         int64_t

using namespace std;

const int N = int(6e5) + 7;
typedef pair<ll, int> pii;

pii f[N][2];
int n, k, a[N];

/// 0 - ok
/// 1 - opening

pii operator - (const pii& a, const ll& x) {
    return pii(a.fi - x, a.se + 1);
}
pii operator + (const pii& a, const ll& x) {
    return pii(a.fi + x, a.se);
}
pii max(const pii& x, const pii& y) {
    if(x.fi == y.fi) return x.se < y.se? x: y;
    return x.fi > y.fi? x: y;
}

pii check(ll mid) {
    f[0][1] = {-mid, 1};
    for(int i = 1; i <= n; ++i) {
        f[i][1] = max(f[i - 1][1], f[i - 1][0] - mid) + a[i];
        f[i][0] = max(f[i - 1][1] + a[i], f[i - 1][0]);
    }
    return max(f[n][0], f[n][1]);
}

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    #define Task        "test"
    if(fopen(Task".inp", "r")) {
        freopen(Task".inp", "r", stdin);
        freopen(Task".out", "w", stdout);
    }
    cin >> n >> k;
    for(int i = 1; i <= n; ++i) cin >> a[i];
    ll low = 0, mid, high = 1ll * n * (int)1e9;
    while(low <= high) {
        mid = (low + high) >> 1;
        if(check(mid).se > k) low = mid + 1;
        else high = mid - 1;
    }
    cout << check(low).fi + 1ll * low * k;
}

Compilation message

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

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 115 ms 10616 KB Output is correct
2 Correct 119 ms 10836 KB Output is correct
3 Correct 116 ms 10944 KB Output is correct
4 Correct 116 ms 10872 KB Output is correct
5 Correct 115 ms 10824 KB Output is correct
6 Correct 118 ms 10744 KB Output is correct
7 Correct 113 ms 10616 KB Output is correct
8 Correct 117 ms 10880 KB Output is correct
9 Correct 114 ms 10616 KB Output is correct
10 Correct 127 ms 10744 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 101 ms 10624 KB Output is correct
2 Correct 105 ms 10952 KB Output is correct
3 Correct 98 ms 10624 KB Output is correct
4 Correct 97 ms 10748 KB Output is correct
5 Correct 115 ms 10616 KB Output is correct
6 Correct 99 ms 10680 KB Output is correct
7 Correct 100 ms 11000 KB Output is correct
8 Correct 118 ms 10872 KB Output is correct
9 Correct 126 ms 10624 KB Output is correct
10 Correct 97 ms 10872 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 143 ms 10744 KB Output is correct
2 Correct 139 ms 10704 KB Output is correct
3 Correct 137 ms 10752 KB Output is correct
4 Correct 137 ms 10616 KB Output is correct
5 Correct 137 ms 10744 KB Output is correct
6 Correct 138 ms 10872 KB Output is correct
7 Correct 140 ms 10788 KB Output is correct
8 Correct 136 ms 10816 KB Output is correct
9 Correct 142 ms 10960 KB Output is correct
10 Correct 144 ms 11000 KB Output is correct

Subtask #4
0 / 10.0

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

Subtask #5
0 / 11.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 115 ms 10616 KB Output is correct
2 Correct 119 ms 10836 KB Output is correct
3 Correct 116 ms 10944 KB Output is correct
4 Correct 116 ms 10872 KB Output is correct
5 Correct 115 ms 10824 KB Output is correct
6 Correct 118 ms 10744 KB Output is correct
7 Correct 113 ms 10616 KB Output is correct
8 Correct 117 ms 10880 KB Output is correct
9 Correct 114 ms 10616 KB Output is correct
10 Correct 127 ms 10744 KB Output is correct
11 Correct 101 ms 10624 KB Output is correct
12 Correct 105 ms 10952 KB Output is correct
13 Correct 98 ms 10624 KB Output is correct
14 Correct 97 ms 10748 KB Output is correct
15 Correct 115 ms 10616 KB Output is correct
16 Correct 99 ms 10680 KB Output is correct
17 Correct 100 ms 11000 KB Output is correct
18 Correct 118 ms 10872 KB Output is correct
19 Correct 126 ms 10624 KB Output is correct
20 Correct 97 ms 10872 KB Output is correct
21 Correct 143 ms 10744 KB Output is correct
22 Correct 139 ms 10704 KB Output is correct
23 Correct 137 ms 10752 KB Output is correct
24 Correct 137 ms 10616 KB Output is correct
25 Correct 137 ms 10744 KB Output is correct
26 Correct 138 ms 10872 KB Output is correct
27 Correct 140 ms 10788 KB Output is correct
28 Correct 136 ms 10816 KB Output is correct
29 Correct 142 ms 10960 KB Output is correct
30 Correct 144 ms 11000 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Incorrect 1 ms 384 KB Output isn't correct
33 Halted 0 ms 0 KB -