oj.uz

Submission #1085258

# Submission time Handle Problem Language Result Execution time Memory
1085258 2024-09-07T19:04:20 Z quan606303 Feast (NOI19_feast) C++14
0 / 100
 16 ms 3676 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=2e5+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
0 / 4.0

# Verdict Execution time Memory Grader output
1 Runtime error 16 ms 3672 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 1880 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Runtime error 16 ms 3676 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 344 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 344 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 344 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Runtime error 16 ms 3672 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -