제출 #1233637

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1233637		ByeWorld	Arcade (NOI20_arcade)	C++20	30 / 100	6 ms	8520 KiB

Arcade

#include <bits/stdc++.h>
#pragma GCC optimize("O3", "Ofast")
#define int long long
#define ll long long
#define se second
#define fi first
#define pb push_back
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii,pii> ipii;
const int MAXN = 5e5+10;
const int MAXA = 5e5+10;
const int SQRT = 450;
const ll INF = 1e18;
const int MOD = 1e9+7;
const int LOG = 60;
int sum(int a, int b){ return (a+MOD+b)%MOD; }
void chsum(int &a, int b){ a = sum(a,b); }
int mul(int a, int b){ return (a*b)%MOD; }
void chmul(int &a, int b){ a = mul(a,b); }
void chmn(auto &a, auto b){ a = min(a, b); }
void chmx(auto &a, auto b){ a = max(a, b); }
vector<int> dx = {0, 0, -1, 1};
vector<int> dy = {1, -1, 0, 0};

int x, n, a[MAXN], t[MAXN];
bool p[110][110];
int dp[110][110][110];

int solve(){
	int nw = a[1];
	bool can = 1;
	for(int i=2; i<=n; i++){
		if(abs(a[i-1]-a[i]) > t[i]-t[i-1]) can = 0;
	}
	if(can) return 1;

	for(int j=1; j<=x; j++) 
		p[1][j] = 1;
	for(int i=1; i<=n-1; i++){ // update ke i+1
		for(int j=1; j<=x; j++){
			if(!p[i][j]) continue;
			int tim = t[i+1]-t[i];
			if(abs(a[i+1]-a[i]) > tim && abs(a[i+1]-j) > tim) continue;
			// i ke i+1
			for(int k=max(1ll, j-tim); k<=min(x, j+tim); k++)
				p[i+1][k] = 1;
			// j ke i+1
			for(int k=max(1ll, a[i]-tim); k<=min(x, a[i]+tim); k++)
				p[i+1][k] = 1;
		}
	}
	can = 0;
	for(int i=1; i<=x; i++) can |= p[n][i];
	if(can) return 2;
	
	for(int j=1; j<=x; j++) 
		for(int k=1; k<=x; k++) dp[1][j][k] = 1;
	for(int i=1; i<=n-1; i++){ // update ke i+1
		for(int j=1; j<=x; j++){
			for(int k=1; k<=x; k++){
				if(dp[i][j][k]==0) continue;
				int tim = t[i+1]-t[i];
				if(abs(a[i+1]-a[i]) <= tim){
					// i ke i+1
					// build dari j-tim ke j+tim, k-tim, k+tim
					dp[i+1][max(1ll, j-tim)][max(1ll, k-tim)]++;
					dp[i+1][max(1ll, j-tim)][min(x, k+tim)+1]--;

					dp[i+1][min(x, j+tim)+1][max(1ll, k-tim)]--;
					dp[i+1][min(x, j+tim)+1][min(x, k+tim)+1]++;
				}

				if(abs(a[i+1]-j) <= tim){
					// i ke i+1
					int j = a[i];
					// build dari j-tim ke j+tim, k-tim, k+tim
					dp[i+1][max(1ll, j-tim)][max(1ll, k-tim)]++;
					dp[i+1][max(1ll, j-tim)][min(x, k+tim)+1]--;

					dp[i+1][min(x, j+tim)+1][max(1ll, k-tim)]--;
					dp[i+1][min(x, j+tim)+1][min(x, k+tim)+1]++;
				}

				if(abs(a[i+1]-k) <= tim){
					// i ke i+1
					int k = a[i];
					// build dari j-tim ke j+tim, k-tim, k+tim
					dp[i+1][max(1ll, j-tim)][max(1ll, k-tim)]++;
					dp[i+1][max(1ll, j-tim)][min(x, k+tim)+1]--;

					dp[i+1][min(x, j+tim)+1][max(1ll, k-tim)]--;
					dp[i+1][min(x, j+tim)+1][min(x, k+tim)+1]++;
				}
			}
		}

		for(int j=1; j<=x+1; j++)
			for(int k=1; k<=x+1; k++)
				dp[i+1][j][k] += dp[i+1][j-1][k]+dp[i+1][j][k-1]
						-dp[i+1][j-1][k-1];

						// cout << dp[3][1][10] << " pp\n";
	}

	can = 0;
	for(int i=1; i<=x; i++)
		for(int j=1; j<=x; j++)
			can |= dp[n][i][j];
	if(can) return 3;
	return 4;
}
signed main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>x>>n; vector<pii> vec; vec.pb({-1, -1});
	for(int i=1; i<=n; i++) cin>>t[i];
	for(int i=1; i<=n; i++){
		cin>> a[i];
		vec.pb({t[i], a[i]});
	}
	sort(vec.begin(), vec.end());
	for(int i=1; i<=n; i++)
		t[i] = vec[i].fi, a[i] = vec[i].se;
	cout << solve() << '\n';
}

• Subtask 1: 7 / 7
• Subtask 2: 11 / 11
• Subtask 3: 12 / 12
• Subtask 4: 0 / 21
• Subtask 5: 0 / 14
• Subtask 6: 0 / 20
• Subtask 7: 0 / 15