oj.uz

Submission #442099

# Submission time Handle Problem Language Result Execution time Memory
442099 2021-07-07T06:58:55 Z Evirir Feast (NOI19_feast) C++17
100 / 100
 167 ms 15124 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 dp[MAXN], cnt[MAXN];
ii pre[MAXN]; //best dp[j-1]+sum(j..i) for j<=i

int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	//freopen("test.in","r",stdin);
	
	cin>>n>>K;
	int pos=0;
	fore(i,1,n)
	{
		cin>>a[i];
		if(a[i]>0) pos++;
	}
	K=min(K, pos);
	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]-mid, cnt[i-1]+1});
			if(pre[i].F>=dp[i-1])
			{
				dp[i]=pre[i].F;
				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 97 ms 11588 KB Output is correct
2 Correct 99 ms 11972 KB Output is correct
3 Correct 101 ms 12032 KB Output is correct
4 Correct 101 ms 11844 KB Output is correct
5 Correct 102 ms 11816 KB Output is correct
6 Correct 98 ms 11644 KB Output is correct
7 Correct 100 ms 11588 KB Output is correct
8 Correct 100 ms 11828 KB Output is correct
9 Correct 100 ms 11684 KB Output is correct
10 Correct 106 ms 11732 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 11756 KB Output is correct
2 Correct 91 ms 12104 KB Output is correct
3 Correct 90 ms 11776 KB Output is correct
4 Correct 90 ms 11880 KB Output is correct
5 Correct 99 ms 11660 KB Output is correct
6 Correct 88 ms 11716 KB Output is correct
7 Correct 95 ms 12048 KB Output is correct
8 Correct 104 ms 11976 KB Output is correct
9 Correct 104 ms 11624 KB Output is correct
10 Correct 87 ms 11952 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 11864 KB Output is correct
2 Correct 123 ms 11764 KB Output is correct
3 Correct 119 ms 11824 KB Output is correct
4 Correct 120 ms 11696 KB Output is correct
5 Correct 119 ms 11768 KB Output is correct
6 Correct 125 ms 11952 KB Output is correct
7 Correct 130 ms 11988 KB Output is correct
8 Correct 120 ms 11780 KB Output is correct
9 Correct 124 ms 11916 KB Output is correct
10 Correct 125 ms 11972 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 320 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 320 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 328 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct

Subtask #7
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 11588 KB Output is correct
2 Correct 99 ms 11972 KB Output is correct
3 Correct 101 ms 12032 KB Output is correct
4 Correct 101 ms 11844 KB Output is correct
5 Correct 102 ms 11816 KB Output is correct
6 Correct 98 ms 11644 KB Output is correct
7 Correct 100 ms 11588 KB Output is correct
8 Correct 100 ms 11828 KB Output is correct
9 Correct 100 ms 11684 KB Output is correct
10 Correct 106 ms 11732 KB Output is correct
11 Correct 86 ms 11756 KB Output is correct
12 Correct 91 ms 12104 KB Output is correct
13 Correct 90 ms 11776 KB Output is correct
14 Correct 90 ms 11880 KB Output is correct
15 Correct 99 ms 11660 KB Output is correct
16 Correct 88 ms 11716 KB Output is correct
17 Correct 95 ms 12048 KB Output is correct
18 Correct 104 ms 11976 KB Output is correct
19 Correct 104 ms 11624 KB Output is correct
20 Correct 87 ms 11952 KB Output is correct
21 Correct 126 ms 11864 KB Output is correct
22 Correct 123 ms 11764 KB Output is correct
23 Correct 119 ms 11824 KB Output is correct
24 Correct 120 ms 11696 KB Output is correct
25 Correct 119 ms 11768 KB Output is correct
26 Correct 125 ms 11952 KB Output is correct
27 Correct 130 ms 11988 KB Output is correct
28 Correct 120 ms 11780 KB Output is correct
29 Correct 124 ms 11916 KB Output is correct
30 Correct 125 ms 11972 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 0 ms 332 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 320 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 1 ms 332 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 2 ms 332 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 1 ms 328 KB Output is correct
59 Correct 1 ms 332 KB Output is correct
60 Correct 1 ms 332 KB Output is correct
61 Correct 155 ms 14672 KB Output is correct
62 Correct 155 ms 15124 KB Output is correct
63 Correct 134 ms 14696 KB Output is correct
64 Correct 157 ms 14884 KB Output is correct
65 Correct 163 ms 15048 KB Output is correct
66 Correct 167 ms 14916 KB Output is correct
67 Correct 158 ms 14716 KB Output is correct
68 Correct 124 ms 14916 KB Output is correct
69 Correct 123 ms 14624 KB Output is correct
70 Correct 118 ms 14636 KB Output is correct