제출 #257041

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
257041		akat	Collecting Stamps 3 (JOI20_ho_t3)	C++14	15 / 100	85 ms	63992 KiB

ho_t3

#include<bits/stdc++.h>
using namespace std;
const int N = 201;
int t[N], x[N], ans;
int dp[N][N][N][2];
void update(int l,int r,int cnt,int j,int time)
{
	int cur = l;
	if(j) cur = r;
	if(t[cur] >= time) cnt++;
	int &curr = dp[l][r][cnt][j];
	if(curr == -1 || curr > time) curr = time;
	ans = max(ans, cnt);
}
int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n, la, i, j, k;
	cin>>n>>la;
	for(i = 1; i <= n; i++)
		cin>>x[i];
	for(i = 1; i <= n; i++)
		cin>>t[i];
	memset(dp, -1, sizeof(dp));
	x[0] = 0;
	update(1, n, 0, 0, x[1]);
	update(1, n, 0, 1, la - x[n]);
	for(i = 1; i <= n; i++)
		for(j = 1; j <= i; j++)
			for(k = 0; k <= i; k++)
			{
				int l = j;
				int r = n - i + j;
				if(l >= r) continue;
				if(dp[l][r][k][0] != -1)
				{
					int time = dp[l][r][k][0];
					update(l+1, r, k, 0, time + x[l+1] - x[l]);
					update(l+1, r, k, 1, time + x[l] + la - x[r]);
				}
				if(dp[l][r][k][1] != -1)
				{
					int time = dp[l][r][k][1];
					update(l, r-1, k, 1, time + x[r] - x[r-1]);
					update(l, r-1, k, 0, time + la - x[r] + x[l]);
				}
			}
	cout<<ans<<'\n';
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 10
• Subtask 3: 10 / 10
• Subtask 4: 0 / 75