oj.uz

답안 #1017624

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1017624 2024-07-09T09:12:25 Z vjudge1 Feast (NOI19_feast) C++17
12 / 100
 95 ms 12368 KB 
#include<bits/stdc++.h>
using namespace std;
#ifdef ONPC
#include"debug.h"
#else
#define debug(...) 42
#endif
#define endl '\n'
#define ll long long
#define pii pair<int,int>
#define F first
#define S second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define int long long
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
const int mod = 1e9 + 7;
const int MAXN = 3e5 + 15;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
int a[MAXN], n, k;
int dp[4 * MAXN]; // i * 0 + 0, i * 0 + 1, i * 0 * 2, i * 0 + 3

//char buf[1 << 25 | 1], *p1, *p2;
//#define gc() ((p1==p2)?(p2=(p1=buf)+fread(buf,1,1<<25,stdin),p1==p2?EOF:*p1++):*p1++)
#define gc() getchar()
ll R(){
	int x = 0, f = 0;
	char c = gc();
	while (!isdigit(c)){
		if (c == '-') f = 1;
		c = gc();
	}
	while (isdigit(c)){
		x = x * 10 + (c ^ 48);
		c = gc();
	}
	return f ? -x : x;
}

void solve(ll lampda){
	dp[0 * 4 + 0] = 0;
	dp[0 * 4 + 1] = 0;
	dp[0 * 4 + 2] = -lampda;
	dp[0 * 4 + 3] = 1;
	for (int i = 1; i <= n; i++){
		dp[i * 4 + 0] = max(dp[(i - 1) * 4 + 0], dp[(i - 1) * 4 + 2]);
		dp[i * 4 + 1] = (dp[(i - 1) * 4 + 0] > dp[(i - 1) * 4 + 2] ? dp[(i - 1) * 4 + 1] : dp[(i - 1) * 4 + 3]);
		dp[i * 4 + 2] = max(dp[(i - 1) * 4 + 0] + a[i] - lampda, dp[(i - 1) * 4 + 2] + a[i]);
		dp[i * 4 + 3] = (dp[(i - 1) * 4 + 0] + a[i] - lampda > dp[(i - 1) * 4 + 2] + a[i] ? dp[(i - 1) * 4 + 1] : dp[(i - 1) * 4 + 3]);

		//dp[i][0] = max(dp[i - 1][0], dp[i - 1][1]);
		//dp[i][1] = max(make_pair(dp[i - 1][0].F + a[i] - lampda, dp[i - 1][0].S + 1), 
				//make_pair(dp[i - 1][1].F + a[i], dp[i - 1][1].S));
	}
	return;
}

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> k;
	for (int i = 1; i <= n; i++){
		//a[i] = R();
		cin >> a[i];
	}
	ll lo = 0, hi = 1e18;
	while (hi - lo > 1){
		ll mi = (lo + hi) >> 1;
		solve(mi);
		if ((dp[n * 4 + 0] > dp[n * 4 + 2] ? dp[n * 4 + 1] : dp[n * 4 + 3]) >= k){
			lo = mi;
		} else {
			hi = mi;
		}
	}
	solve(lo);
	cout << max(dp[n * 4 + 0], dp[n * 4 + 2]) + k * lo;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 11856 KB Output is correct
2 Correct 53 ms 12112 KB Output is correct
3 Correct 52 ms 12116 KB Output is correct
4 Correct 53 ms 12160 KB Output is correct
5 Correct 52 ms 12144 KB Output is correct
6 Correct 59 ms 12368 KB Output is correct
7 Correct 52 ms 12112 KB Output is correct
8 Correct 53 ms 12112 KB Output is correct
9 Correct 52 ms 12124 KB Output is correct
10 Correct 52 ms 12148 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 12124 KB Output is correct
2 Correct 44 ms 12120 KB Output is correct
3 Correct 42 ms 11936 KB Output is correct
4 Correct 44 ms 12124 KB Output is correct
5 Correct 49 ms 12108 KB Output is correct
6 Correct 42 ms 12124 KB Output is correct
7 Correct 45 ms 12124 KB Output is correct
8 Correct 50 ms 12120 KB Output is correct
9 Correct 49 ms 11864 KB Output is correct
10 Correct 45 ms 12124 KB Output is correct

Subtask #3
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 95 ms 12152 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2392 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2392 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2392 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 11856 KB Output is correct
2 Correct 53 ms 12112 KB Output is correct
3 Correct 52 ms 12116 KB Output is correct
4 Correct 53 ms 12160 KB Output is correct
5 Correct 52 ms 12144 KB Output is correct
6 Correct 59 ms 12368 KB Output is correct
7 Correct 52 ms 12112 KB Output is correct
8 Correct 53 ms 12112 KB Output is correct
9 Correct 52 ms 12124 KB Output is correct
10 Correct 52 ms 12148 KB Output is correct
11 Correct 50 ms 12124 KB Output is correct
12 Correct 44 ms 12120 KB Output is correct
13 Correct 42 ms 11936 KB Output is correct
14 Correct 44 ms 12124 KB Output is correct
15 Correct 49 ms 12108 KB Output is correct
16 Correct 42 ms 12124 KB Output is correct
17 Correct 45 ms 12124 KB Output is correct
18 Correct 50 ms 12120 KB Output is correct
19 Correct 49 ms 11864 KB Output is correct
20 Correct 45 ms 12124 KB Output is correct
21 Incorrect 95 ms 12152 KB Output isn't correct
22 Halted 0 ms 0 KB -