oj.uz

Submission #442088

# Submission time Handle Problem Language Result Execution time Memory
442088 2021-07-07T06:20:01 Z Evirir Feast (NOI19_feast) C++17
30 / 100
 130 ms 14384 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'
#define mset(d,val) memset(d,val,sizeof(d))
#define setp(x) cout<<fixed<<setprecision(x)
#define forn(i,a,b) for(int i=(a);i<(b);i++)
#define fore(i,a,b) for(int i=(a);i<=(b);i++)
#define pb push_back
#define F first
#define S second
#define pqueue priority_queue
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef long double ld;
template<typename T>
using pbds = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
void amin(ll &a, ll b){ a=min(a,b); }
void amax(ll &a, ll b){ a=max(a,b); }
void YES(){cout<<"YES\n";} void NO(){cout<<"NO\n";}
void SD(int t=0){ cout<<"PASSED "<<t<<endl; }
const ll INF = ll(1e18);
const int MOD = 998244353;

const bool DEBUG = 0;
const int MAXN = 300005;

int n,K;
ll a[MAXN];
ll p[MAXN];
ll dp[MAXN], cnt[MAXN];
ii pre[MAXN]; //best dp[j-1]+sum(j..i) for j<=i

ll sum(int l, int r){ return p[r]-(l?p[l-1]:0LL); }

int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	
	cin>>n>>K;
	fore(i,1,n)
	{
		cin>>a[i];
		p[i]=p[i-1]+a[i];
	}
	dp[0]=0;
	cnt[0]=0;
	pre[0]={-INF,0};
	
	ll ans=0;
	for(ll L=0,R=1e16;L<=R;)
	{
		ll mid=(L+R)>>1;
		
		fore(i,1,n)
		{
			ii tmp=pre[i-1];
			tmp.F+=a[i];
			pre[i]=max(tmp, {dp[i-1]+a[i],cnt[i-1]+1});
			if(pre[i].F-mid>=dp[i-1])
			{
				dp[i]=pre[i].F-mid;
				cnt[i]=pre[i].S;
			}
			else
			{
				dp[i]=dp[i-1];
				cnt[i]=cnt[i-1];
			}
		}
		if(cnt[n]>=K)
		{
			ans=dp[n]+min((ll)K,cnt[n])*mid;
			L=mid+1;
		}
		else R=mid-1;
		
		if(0)
		{
			cout<<"mid="<<mid<<'\n';
			cout<<"a: "; fore(i,1,n) cout<<a[i]<<" "; cout<<'\n';
			cout<<"dp: "; fore(i,1,n) cout<<dp[i]<<" "; cout<<'\n';
			cout<<"cnt: "; fore(i,1,n) cout<<cnt[i]<<" "; cout<<'\n';
			cout<<"pre: "; fore(i,1,n) cout<<"("<<pre[i].F<<","<<pre[i].S<<") "; cout<<'\n';
			cout<<"ans: "<<dp[n]+cnt[n]*mid<<"\n\n";
		}
	}
	
	cout<<ans<<'\n';
	
	return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 14072 KB Output is correct
2 Correct 101 ms 14288 KB Output is correct
3 Correct 100 ms 14308 KB Output is correct
4 Correct 101 ms 14284 KB Output is correct
5 Correct 100 ms 14148 KB Output is correct
6 Correct 108 ms 13892 KB Output is correct
7 Correct 97 ms 14020 KB Output is correct
8 Correct 98 ms 14172 KB Output is correct
9 Correct 98 ms 13992 KB Output is correct
10 Correct 100 ms 14136 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 14020 KB Output is correct
2 Correct 87 ms 14264 KB Output is correct
3 Correct 86 ms 14028 KB Output is correct
4 Correct 85 ms 14168 KB Output is correct
5 Correct 96 ms 13880 KB Output is correct
6 Correct 89 ms 14020 KB Output is correct
7 Correct 91 ms 14384 KB Output is correct
8 Correct 103 ms 14244 KB Output is correct
9 Correct 119 ms 13892 KB Output is correct
10 Correct 86 ms 14184 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 14240 KB Output is correct
2 Correct 119 ms 14052 KB Output is correct
3 Correct 119 ms 14124 KB Output is correct
4 Correct 119 ms 13996 KB Output is correct
5 Correct 124 ms 14192 KB Output is correct
6 Correct 120 ms 14236 KB Output is correct
7 Correct 121 ms 14328 KB Output is correct
8 Correct 117 ms 14148 KB Output is correct
9 Correct 121 ms 14272 KB Output is correct
10 Correct 130 ms 14364 KB Output is correct

Subtask #4
0 / 10.0

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

Subtask #5
0 / 11.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 14072 KB Output is correct
2 Correct 101 ms 14288 KB Output is correct
3 Correct 100 ms 14308 KB Output is correct
4 Correct 101 ms 14284 KB Output is correct
5 Correct 100 ms 14148 KB Output is correct
6 Correct 108 ms 13892 KB Output is correct
7 Correct 97 ms 14020 KB Output is correct
8 Correct 98 ms 14172 KB Output is correct
9 Correct 98 ms 13992 KB Output is correct
10 Correct 100 ms 14136 KB Output is correct
11 Correct 90 ms 14020 KB Output is correct
12 Correct 87 ms 14264 KB Output is correct
13 Correct 86 ms 14028 KB Output is correct
14 Correct 85 ms 14168 KB Output is correct
15 Correct 96 ms 13880 KB Output is correct
16 Correct 89 ms 14020 KB Output is correct
17 Correct 91 ms 14384 KB Output is correct
18 Correct 103 ms 14244 KB Output is correct
19 Correct 119 ms 13892 KB Output is correct
20 Correct 86 ms 14184 KB Output is correct
21 Correct 121 ms 14240 KB Output is correct
22 Correct 119 ms 14052 KB Output is correct
23 Correct 119 ms 14124 KB Output is correct
24 Correct 119 ms 13996 KB Output is correct
25 Correct 124 ms 14192 KB Output is correct
26 Correct 120 ms 14236 KB Output is correct
27 Correct 121 ms 14328 KB Output is correct
28 Correct 117 ms 14148 KB Output is correct
29 Correct 121 ms 14272 KB Output is correct
30 Correct 130 ms 14364 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Incorrect 0 ms 332 KB Output isn't correct
33 Halted 0 ms 0 KB -