제출 #871443

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
871443		Cyber_Wolf	The short shank; Redemption (BOI21_prison)	C++17	15 / 100	45 ms	13484 KiB

prison

#include <bits/stdc++.h>

using namespace std;

#define lg long long 
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

const lg N = 505;

lg n, d, tim;
lg dp[2][N][N];
lg t[N];

int main()
{
	fastio;
	cin >> n >> d >> tim;
	for(int i = 1; i <= n; i++)	
	{
		cin >> t[i];
	}
	d = min(n, d);
	t[0] = 1e18;
	memset(dp, 0x3f, sizeof(dp));
	dp[0][0][d] = 0;
	for(int i = 1; i <= n; i++)
	{
		for(int j = 0; j <= d; j++)
		{
			for(int k = 0; k < i; k++)	dp[i&1][k][j] = 3e9;
		}
		for(int j = 0; j <= d; j++)
		{
			lg mnm = t[i];
			for(int k = i-1; k >= 0; k--)
			{
				mnm = min(mnm, t[k]+i-k);
				dp[i&1][i][j] = min(dp[(i-1)&1][k][j+1]+(t[i] <= tim), dp[i&1][i][j]);
				dp[i&1][k][j] = min(dp[(i-1)&1][k][j]+(mnm <= tim), dp[i&1][k][j]);
			}
		}
	}
	lg ans = n+1;
	for(int i = 0; i <= n; i++)
	{
		for(int j = 0; j <= d; j++)
		{
			ans = min(ans, dp[n&1][i][j]);
		}
	}
	cout << ans << '\n';
}

• Subtask 1: 15 / 15
• Subtask 2: 0 / 10
• Subtask 3: 0 / 20
• Subtask 4: 0 / 10
• Subtask 5: 0 / 25
• Subtask 6: 0 / 20