oj.uz

답안 #407280

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
407280 2021-05-18T17:15:27 Z soroush Holding (COCI20_holding) C++17
110 / 110
 883 ms 102764 KB 
//叫んで 藻掻もがいて 瞼まぶたを腫らしても
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int , int> pii;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int maxn = 102;
const ll mod = 1e9+7;

#define pb push_back
#define endl '\n'
#define dokme(x) cout << x , exit(0)
#define ms(x , y) memset(x , y , sizeof x)
ll pw(ll a, ll b, ll md = mod){ll res = 1;while(b){if(b&1){res=(a*res)%md;}a=(a*a)%md;b>>=1;}return(res);}

int n , l , r , k , a[maxn] , prt[maxn];
int ina[maxn] , inb[maxn];
int dp[2510][maxn][maxn];

int Dp(int c , int f , int s){
	if(c < 0)return 1e9;
	if(dp[c][f][s] != -1)return dp[c][f][s];
	if(s == 0)return 0;
	if(f == 0)return prt[inb[s]];
	if(c == 0)return prt[inb[s]];
	dp[c][f][s] = Dp(c , f , s-1) + a[inb[s]];
	dp[c][f][s] = min(dp[c][f][s] , Dp(c-1 , f , s));
	dp[c][f][s] = min(dp[c][f][s] , Dp(c , f - 1 , s));
	dp[c][f][s] = min(dp[c][f][s] , Dp(c - abs(ina[f] - inb[s]) , f - 1 , s - 1) + a[ina[f]]);
	return dp[c][f][s];
}

int32_t main(){
	ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin >> n >> l >> r >> k;
	int sz = r - l + 1;
	for(int i = 1 ; i <= n ; i ++)
		cin >> a[i];
	for(int i = l ; i <= r ; i ++)
		prt[i] = a[i] + prt[i - 1] , inb[i - l + 1] = i;
	for(int i = 1 ; i < l ; i ++)
		ina[i] = i;
	for(int i = r + 1 ; i <= n ; i ++)
		ina[i - r - 1 + l] = i;
	ms(dp , -1);
	dp[0][0][0] = 0;
	cout << Dp(min(k , 2509) , n - sz , sz);
	return(0);
}

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 102472 KB Output is correct
2 Correct 51 ms 102436 KB Output is correct
3 Correct 51 ms 102456 KB Output is correct
4 Correct 51 ms 102476 KB Output is correct
5 Correct 51 ms 102460 KB Output is correct
6 Correct 52 ms 102484 KB Output is correct
7 Correct 58 ms 102620 KB Output is correct

Subtask #2
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 102472 KB Output is correct
2 Correct 51 ms 102436 KB Output is correct
3 Correct 51 ms 102456 KB Output is correct
4 Correct 51 ms 102476 KB Output is correct
5 Correct 51 ms 102460 KB Output is correct
6 Correct 52 ms 102484 KB Output is correct
7 Correct 58 ms 102620 KB Output is correct
8 Correct 50 ms 102468 KB Output is correct
9 Correct 54 ms 102528 KB Output is correct
10 Correct 54 ms 102428 KB Output is correct
11 Correct 55 ms 102480 KB Output is correct
12 Correct 60 ms 102480 KB Output is correct
13 Correct 187 ms 102764 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 102472 KB Output is correct
2 Correct 51 ms 102436 KB Output is correct
3 Correct 51 ms 102456 KB Output is correct
4 Correct 51 ms 102476 KB Output is correct
5 Correct 51 ms 102460 KB Output is correct
6 Correct 52 ms 102484 KB Output is correct
7 Correct 58 ms 102620 KB Output is correct
8 Correct 50 ms 102468 KB Output is correct
9 Correct 54 ms 102528 KB Output is correct
10 Correct 54 ms 102428 KB Output is correct
11 Correct 55 ms 102480 KB Output is correct
12 Correct 60 ms 102480 KB Output is correct
13 Correct 187 ms 102764 KB Output is correct
14 Correct 51 ms 102436 KB Output is correct
15 Correct 63 ms 102456 KB Output is correct
16 Correct 53 ms 102468 KB Output is correct
17 Correct 54 ms 102464 KB Output is correct
18 Correct 56 ms 102528 KB Output is correct
19 Correct 197 ms 102704 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 102472 KB Output is correct
2 Correct 51 ms 102436 KB Output is correct
3 Correct 51 ms 102456 KB Output is correct
4 Correct 51 ms 102476 KB Output is correct
5 Correct 51 ms 102460 KB Output is correct
6 Correct 52 ms 102484 KB Output is correct
7 Correct 58 ms 102620 KB Output is correct
8 Correct 50 ms 102468 KB Output is correct
9 Correct 54 ms 102528 KB Output is correct
10 Correct 54 ms 102428 KB Output is correct
11 Correct 55 ms 102480 KB Output is correct
12 Correct 60 ms 102480 KB Output is correct
13 Correct 187 ms 102764 KB Output is correct
14 Correct 51 ms 102436 KB Output is correct
15 Correct 63 ms 102456 KB Output is correct
16 Correct 53 ms 102468 KB Output is correct
17 Correct 54 ms 102464 KB Output is correct
18 Correct 56 ms 102528 KB Output is correct
19 Correct 197 ms 102704 KB Output is correct
20 Correct 78 ms 102520 KB Output is correct
21 Correct 79 ms 102476 KB Output is correct
22 Correct 57 ms 102500 KB Output is correct
23 Correct 113 ms 102672 KB Output is correct
24 Correct 86 ms 102532 KB Output is correct
25 Correct 883 ms 102708 KB Output is correct