oj.uz

답안 #1017345

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1017345 2024-07-09T07:30:57 Z nathan4690 Feast (NOI19_feast) C++17
22 / 100
 125 ms 18156 KB 
// NOI19 Task 3: Feast
// https://oj.uz/problem/view/NOI19_feast
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define el cout << '\n'
#define f1(i,n) for(ll i=1;i<=n;i++)
#define __file_name ""
using namespace std;
const ll maxn = 1e6+5, inf=1e18;

ll n,k,a[maxn],b[maxn],L,R,mid;
pair<ll,ll> dp[2][maxn];

pair<ll,ll> check(ll lambda){
    // Penalty is lambda per subarray
    dp[1][0] = {-inf, 0};
    f1(i,n){
        dp[0][i] = max(dp[0][i-1], dp[1][i-1]);
        dp[1][i] = max(make_pair(dp[1][i-1].first + a[i], dp[1][i-1].second),
                       make_pair(dp[0][i-1].first + a[i] - lambda, dp[0][i-1].second + 1));
    }
    return max(dp[0][n], dp[1][n]);
}

int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

    if(fopen(__file_name ".inp", "r")){
        freopen(__file_name ".inp","r",stdin);
        freopen(__file_name ".out","w",stdout);
    }
    // code here
    cin >> n >> k;
    f1(i,n) cin >> a[i];
    f1(i,n) b[i] = a[i];
    sort(b+1,b+n+1);
    ll ans = 0;
    for(ll i=n;i>=1;i--) ans += b[i];
    L = 0; R = 1e18;
    while(L <= R){
        mid = (L+R)/2;
        if(check(mid).second >= k) L = mid+1;
        else R = mid-1;
    }
    // cout << L << ' ' << R << ' ' << check(L).second;el;
    pair<ll,ll> res = check(R);
    // cout << res.second;el;
    cout << max(ans, res.first + k * R);
    return 0;
}

/*
Code by: Nguyen Viet Trung Nhan
Cau Giay Secondary School
*/

Compilation message

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

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 15952 KB Output is correct
2 Correct 71 ms 16208 KB Output is correct
3 Correct 74 ms 16468 KB Output is correct
4 Correct 74 ms 16476 KB Output is correct
5 Correct 73 ms 16212 KB Output is correct
6 Correct 79 ms 16208 KB Output is correct
7 Correct 72 ms 15952 KB Output is correct
8 Correct 74 ms 18156 KB Output is correct
9 Correct 72 ms 15956 KB Output is correct
10 Correct 73 ms 16328 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 16036 KB Output is correct
2 Correct 63 ms 16464 KB Output is correct
3 Correct 62 ms 16208 KB Output is correct
4 Incorrect 62 ms 16212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 96 ms 16208 KB Output is correct
2 Correct 108 ms 16216 KB Output is correct
3 Correct 97 ms 16376 KB Output is correct
4 Correct 98 ms 16016 KB Output is correct
5 Correct 112 ms 16208 KB Output is correct
6 Correct 100 ms 16272 KB Output is correct
7 Correct 102 ms 16468 KB Output is correct
8 Correct 99 ms 16212 KB Output is correct
9 Correct 100 ms 16376 KB Output is correct
10 Correct 125 ms 16468 KB Output is correct

Subtask #4
0 / 10.0

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

Subtask #5
0 / 11.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 15952 KB Output is correct
2 Correct 71 ms 16208 KB Output is correct
3 Correct 74 ms 16468 KB Output is correct
4 Correct 74 ms 16476 KB Output is correct
5 Correct 73 ms 16212 KB Output is correct
6 Correct 79 ms 16208 KB Output is correct
7 Correct 72 ms 15952 KB Output is correct
8 Correct 74 ms 18156 KB Output is correct
9 Correct 72 ms 15956 KB Output is correct
10 Correct 73 ms 16328 KB Output is correct
11 Correct 65 ms 16036 KB Output is correct
12 Correct 63 ms 16464 KB Output is correct
13 Correct 62 ms 16208 KB Output is correct
14 Incorrect 62 ms 16212 KB Output isn't correct
15 Halted 0 ms 0 KB -