oj.uz

Submission #1085270

# Submission time Handle Problem Language Result Execution time Memory
1085270 2024-09-07T19:25:02 Z quan606303 Feast (NOI19_feast) C++14
12 / 100
 104 ms 14456 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[0][0]={0,0};
    dp[0][1]={-pre[0]-pen,1};
    for (int i=1;i<=n;i++)
    { 
		dp[i][0]=max(dp[i-1][0],make_pair(dp[i-1][1].fi+pre[i],dp[i-1][1].se));
        dp[i][1]=max(dp[i-1][1],make_pair(dp[i][0].fi-pre[i]-pen,dp[i][0].se+1));
       
    }
    return max(dp[n][1],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

# Verdict Execution time Memory Grader output
1 Correct 62 ms 13908 KB Output is correct
2 Correct 64 ms 14172 KB Output is correct
3 Correct 72 ms 14456 KB Output is correct
4 Correct 62 ms 14316 KB Output is correct
5 Correct 64 ms 14164 KB Output is correct
6 Correct 60 ms 13912 KB Output is correct
7 Correct 69 ms 14160 KB Output is correct
8 Correct 62 ms 14172 KB Output is correct
9 Correct 61 ms 13916 KB Output is correct
10 Correct 62 ms 14164 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 14172 KB Output is correct
2 Correct 57 ms 14424 KB Output is correct
3 Correct 53 ms 14160 KB Output is correct
4 Correct 60 ms 14172 KB Output is correct
5 Correct 60 ms 13912 KB Output is correct
6 Correct 53 ms 13912 KB Output is correct
7 Correct 55 ms 14424 KB Output is correct
8 Correct 61 ms 14416 KB Output is correct
9 Correct 61 ms 13912 KB Output is correct
10 Correct 55 ms 14428 KB Output is correct

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 11.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 13908 KB Output is correct
2 Correct 64 ms 14172 KB Output is correct
3 Correct 72 ms 14456 KB Output is correct
4 Correct 62 ms 14316 KB Output is correct
5 Correct 64 ms 14164 KB Output is correct
6 Correct 60 ms 13912 KB Output is correct
7 Correct 69 ms 14160 KB Output is correct
8 Correct 62 ms 14172 KB Output is correct
9 Correct 61 ms 13916 KB Output is correct
10 Correct 62 ms 14164 KB Output is correct
11 Correct 55 ms 14172 KB Output is correct
12 Correct 57 ms 14424 KB Output is correct
13 Correct 53 ms 14160 KB Output is correct
14 Correct 60 ms 14172 KB Output is correct
15 Correct 60 ms 13912 KB Output is correct
16 Correct 53 ms 13912 KB Output is correct
17 Correct 55 ms 14424 KB Output is correct
18 Correct 61 ms 14416 KB Output is correct
19 Correct 61 ms 13912 KB Output is correct
20 Correct 55 ms 14428 KB Output is correct
21 Incorrect 104 ms 14164 KB Output isn't correct
22 Halted 0 ms 0 KB -