oj.uz

답안 #1085259

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1085259 2024-09-07T19:04:44 Z quan606303 Feast (NOI19_feast) C++14
30 / 100
 106 ms 17520 KB 
///0-0 : what is your motivation, quan606303?
///quan606303 : Hutao
/*idea : 



*/
#include <bits/stdc++.h>
#define int long long
#define ll long long
#define INTMAX INT_MAX
#define INTMIN INT_MIN
#define LONGMAX LLONG_MAX
#define LONGMIN LLONG_MIN
#define fi first
#define se second
#define memfull(a,b) memset(a,b,sizeof(a));
#define endl '\n'
#define file(a) freopen(a".inp","r",stdin); freopen(a".out","w",stdout);
using namespace std;
const int MOD=1e9+7;
const int maxn=3e5+7;;
int n,k,a[maxn],pre[maxn];
pair<int,int> dp[maxn][2];
pair<int,int> sub1(int pen)
{
    dp[1][0]={0,0};
    dp[1][1]={-pre[0]-pen,1};
    for (int i=2;i<=n;i++)
    {
        dp[i][1]=max(dp[i-1][1],make_pair(dp[i-1][0].fi-pre[i-1]-pen,dp[i-1][0].se+1));
        dp[i][0]=max(dp[i-1][0],make_pair(dp[i-1][1].fi+pre[i],dp[i-1][1].se));
    }
    return dp[n][0];
}
int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
   // file("MUABANCO");
    cin>>n>>k;
    for (int i=1;i<=n;i++)cin>>a[i];
    for (int i=1;i<=n;i++)pre[i]=pre[i-1]+a[i];
    int l=0,r=1e18,ans=0;
    while (l<=r)
    {
        int mid=(l+r)/2;
        pair<int,int> cnt=sub1(mid);
        if (cnt.se<=k)
        {
            r=mid-1;
            ans=cnt.fi+cnt.se*mid;
        }
        else l=mid+1;
    }
    cout<<ans;
    return 0;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 13904 KB Output is correct
2 Correct 68 ms 14348 KB Output is correct
3 Correct 68 ms 14424 KB Output is correct
4 Correct 66 ms 14428 KB Output is correct
5 Correct 66 ms 14168 KB Output is correct
6 Correct 67 ms 13916 KB Output is correct
7 Correct 65 ms 14008 KB Output is correct
8 Correct 68 ms 14172 KB Output is correct
9 Correct 65 ms 14128 KB Output is correct
10 Correct 66 ms 14264 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 14424 KB Output is correct
2 Correct 61 ms 14428 KB Output is correct
3 Correct 60 ms 14184 KB Output is correct
4 Correct 61 ms 14160 KB Output is correct
5 Correct 65 ms 13880 KB Output is correct
6 Correct 58 ms 14168 KB Output is correct
7 Correct 64 ms 14428 KB Output is correct
8 Correct 67 ms 14428 KB Output is correct
9 Correct 65 ms 13916 KB Output is correct
10 Correct 62 ms 14424 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 88 ms 14168 KB Output is correct
2 Correct 91 ms 17176 KB Output is correct
3 Correct 91 ms 17232 KB Output is correct
4 Correct 89 ms 16980 KB Output is correct
5 Correct 89 ms 17308 KB Output is correct
6 Correct 106 ms 17520 KB Output is correct
7 Correct 100 ms 17492 KB Output is correct
8 Correct 89 ms 17176 KB Output is correct
9 Correct 93 ms 17488 KB Output is correct
10 Correct 90 ms 17500 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 0 ms 348 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 0 ms 348 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 65 ms 13904 KB Output is correct
2 Correct 68 ms 14348 KB Output is correct
3 Correct 68 ms 14424 KB Output is correct
4 Correct 66 ms 14428 KB Output is correct
5 Correct 66 ms 14168 KB Output is correct
6 Correct 67 ms 13916 KB Output is correct
7 Correct 65 ms 14008 KB Output is correct
8 Correct 68 ms 14172 KB Output is correct
9 Correct 65 ms 14128 KB Output is correct
10 Correct 66 ms 14264 KB Output is correct
11 Correct 65 ms 14424 KB Output is correct
12 Correct 61 ms 14428 KB Output is correct
13 Correct 60 ms 14184 KB Output is correct
14 Correct 61 ms 14160 KB Output is correct
15 Correct 65 ms 13880 KB Output is correct
16 Correct 58 ms 14168 KB Output is correct
17 Correct 64 ms 14428 KB Output is correct
18 Correct 67 ms 14428 KB Output is correct
19 Correct 65 ms 13916 KB Output is correct
20 Correct 62 ms 14424 KB Output is correct
21 Correct 88 ms 14168 KB Output is correct
22 Correct 91 ms 17176 KB Output is correct
23 Correct 91 ms 17232 KB Output is correct
24 Correct 89 ms 16980 KB Output is correct
25 Correct 89 ms 17308 KB Output is correct
26 Correct 106 ms 17520 KB Output is correct
27 Correct 100 ms 17492 KB Output is correct
28 Correct 89 ms 17176 KB Output is correct
29 Correct 93 ms 17488 KB Output is correct
30 Correct 90 ms 17500 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Incorrect 0 ms 348 KB Output isn't correct
33 Halted 0 ms 0 KB -