Submission #1017308

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1017308	2024-07-09T07:19:26 Z	vjudge1	Feast (NOI19_feast)	C++17	100 / 100	143 ms	12168 KB

feast

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#define ll long long
#define pb push_back
#define eb emplace_back
#define pu push
#define ins insert
#define bruh ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ff(x,a,b,c) for (auto x=a;x<=b;x+=c)
#define fd(x,a,b,c) for (auto x=a;x>=b;x-=c)
#define int ll

using namespace std;
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());

typedef pair<int, int> ii;
const int N = 3e5+5;
const int mod = 1e9+7;
const int INF = 1e18;
int power(int a,int b) {ll x = 1;if (a >= mod) a%=mod; while (b) {if (b & 1) x = x*a % mod;a = a*a % mod;b>>=1;}return x;} 

int n,k; 
int a[N];

pair<int,int> calc(int lmb)
{
	pair<int,int> dp[n][2];
	dp[0][0] = {0,0}; dp[0][1] = {a[0]-lmb,1};
	for (int i=1;i<n;i++)
	{
		dp[i][0] = max(dp[i-1][0],dp[i-1][1]);
		dp[i][1] = max(make_pair(dp[i-1][1].first+a[i],dp[i-1][1].second),make_pair(dp[i-1][0].first+a[i]-lmb,dp[i-1][0].second+1));
	}
	return max(dp[n-1][0],dp[n-1][1]);
}

void solve()
{
	cin>>n>>k;
	for (int i=0;i<n;i++) cin>>a[i];
	int l = 0,r = 1e18,ans = 0;
	while (l<=r)
	{
		int mid = (l+r)/2;
		auto tmp = calc(mid);
		if (tmp.second>=k) l = mid+1,ans = mid;
		else r = mid-1;
	}
	//cout<<ans<<endl;
	cout<<calc(ans).first+ans*k;
}

signed main()
{
	bruh
	//freopen("input.inp","r",stdin);
	//freopen("output.inp","w",stdout);
	int t = 1;
	//cin>>t;
	while (t--)
	{
		solve();
		cout<<"\n";
	}
}

Subtask #1
4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	105 ms	11600 KB	Output is correct
2	Correct	107 ms	11860 KB	Output is correct
3	Correct	113 ms	12120 KB	Output is correct
4	Correct	110 ms	11868 KB	Output is correct
5	Correct	111 ms	11912 KB	Output is correct
6	Correct	105 ms	11612 KB	Output is correct
7	Correct	108 ms	11816 KB	Output is correct
8	Correct	107 ms	11908 KB	Output is correct
9	Correct	106 ms	11612 KB	Output is correct
10	Correct	107 ms	11864 KB	Output is correct

Subtask #2
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	94 ms	11868 KB	Output is correct
2	Correct	96 ms	12120 KB	Output is correct
3	Correct	94 ms	11868 KB	Output is correct
4	Correct	97 ms	11868 KB	Output is correct
5	Correct	109 ms	11604 KB	Output is correct
6	Correct	94 ms	11864 KB	Output is correct
7	Correct	99 ms	12168 KB	Output is correct
8	Correct	101 ms	12096 KB	Output is correct
9	Correct	98 ms	11648 KB	Output is correct
10	Correct	98 ms	11868 KB	Output is correct

Subtask #3
18.0 / 18.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	110 ms	12048 KB	Output is correct
2	Correct	111 ms	11860 KB	Output is correct
3	Correct	104 ms	11864 KB	Output is correct
4	Correct	109 ms	11856 KB	Output is correct
5	Correct	112 ms	11860 KB	Output is correct
6	Correct	110 ms	11864 KB	Output is correct
7	Correct	110 ms	12112 KB	Output is correct
8	Correct	109 ms	11904 KB	Output is correct
9	Correct	112 ms	12116 KB	Output is correct
10	Correct	116 ms	12112 KB	Output is correct

Subtask #4
10.0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	344 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	344 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Correct	348 KB	Output is correct
10	Correct	596 KB	Output is correct

Subtask #5
11.0 / 11.0

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

Subtask #6
20.0 / 20.0

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

Subtask #7
29.0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	105 ms	11600 KB	Output is correct
2	Correct	107 ms	11860 KB	Output is correct
3	Correct	113 ms	12120 KB	Output is correct
4	Correct	110 ms	11868 KB	Output is correct
5	Correct	111 ms	11912 KB	Output is correct
6	Correct	105 ms	11612 KB	Output is correct
7	Correct	108 ms	11816 KB	Output is correct
8	Correct	107 ms	11908 KB	Output is correct
9	Correct	106 ms	11612 KB	Output is correct
10	Correct	107 ms	11864 KB	Output is correct
11	Correct	94 ms	11868 KB	Output is correct
12	Correct	96 ms	12120 KB	Output is correct
13	Correct	94 ms	11868 KB	Output is correct
14	Correct	97 ms	11868 KB	Output is correct
15	Correct	109 ms	11604 KB	Output is correct
16	Correct	94 ms	11864 KB	Output is correct
17	Correct	99 ms	12168 KB	Output is correct
18	Correct	101 ms	12096 KB	Output is correct
19	Correct	98 ms	11648 KB	Output is correct
20	Correct	98 ms	11868 KB	Output is correct
21	Correct	110 ms	12048 KB	Output is correct
22	Correct	111 ms	11860 KB	Output is correct
23	Correct	104 ms	11864 KB	Output is correct
24	Correct	109 ms	11856 KB	Output is correct
25	Correct	112 ms	11860 KB	Output is correct
26	Correct	110 ms	11864 KB	Output is correct
27	Correct	110 ms	12112 KB	Output is correct
28	Correct	109 ms	11904 KB	Output is correct
29	Correct	112 ms	12116 KB	Output is correct
30	Correct	116 ms	12112 KB	Output is correct
31	Correct	0 ms	344 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	344 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	0 ms	348 KB	Output is correct
40	Correct	0 ms	596 KB	Output is correct
41	Correct	0 ms	348 KB	Output is correct
42	Correct	0 ms	348 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	1 ms	348 KB	Output is correct
46	Correct	0 ms	348 KB	Output is correct
47	Correct	0 ms	348 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	0 ms	348 KB	Output is correct
50	Correct	0 ms	348 KB	Output is correct
51	Correct	1 ms	344 KB	Output is correct
52	Correct	1 ms	536 KB	Output is correct
53	Correct	1 ms	388 KB	Output is correct
54	Correct	1 ms	348 KB	Output is correct
55	Correct	1 ms	348 KB	Output is correct
56	Correct	1 ms	348 KB	Output is correct
57	Correct	1 ms	348 KB	Output is correct
58	Correct	1 ms	348 KB	Output is correct
59	Correct	1 ms	348 KB	Output is correct
60	Correct	1 ms	348 KB	Output is correct
61	Correct	138 ms	11860 KB	Output is correct
62	Correct	130 ms	12116 KB	Output is correct
63	Correct	120 ms	11844 KB	Output is correct
64	Correct	136 ms	11856 KB	Output is correct
65	Correct	143 ms	11856 KB	Output is correct
66	Correct	140 ms	12044 KB	Output is correct
67	Correct	139 ms	11860 KB	Output is correct
68	Correct	112 ms	11856 KB	Output is correct
69	Correct	110 ms	11864 KB	Output is correct
70	Correct	109 ms	11600 KB	Output is correct

Submission #1017308

Compilation message

Subtask #1 4.0 / 4.0

Subtask #2 8.0 / 8.0

Subtask #3 18.0 / 18.0

Subtask #4 10.0 / 10.0

Subtask #5 11.0 / 11.0

Subtask #6 20.0 / 20.0

Subtask #7 29.0 / 29.0

Subtask #1
4.0 / 4.0

Subtask #2
8.0 / 8.0

Subtask #3
18.0 / 18.0

Subtask #4
10.0 / 10.0

Subtask #5
11.0 / 11.0

Subtask #6
20.0 / 20.0

Subtask #7
29.0 / 29.0