제출 #701337

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
701337		angelo_torres	Uplifting Excursion (BOI22_vault)	C++17	5 / 100	1041 ms	828 KiB

vault

#include <bits/stdc++.h>

using namespace std;
const int N = 63750;
const int inf = 1e9;
int m,l,a[300],dp[N*2+10];

int main(){
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> m >> l;
	for(int i = -m; i <= m; ++i) cin >> a[i+50];
	for(int i = -N; i <= N; ++i) dp[i+N] = -inf;
	dp[0+N] = 0;
	set<int> s;
	s.insert(0);
	for(int i = -m; i <= m; ++i){
		for(int j = 0; j < a[i+50]; ++j){
			if(i > 0) for(int k = N; k >= -N; k--){
				if(k-i < -N || k-i > N) continue;
				dp[k+N] = max(dp[k+N],dp[k-i+N]+1);
			}
			else for(int k = -N; k <= N; ++k){
				if(k-i < -N || k-i > N) continue;
				dp[k+N] = max(dp[k+N],dp[k-i+N]+1);
			}
			// for(int k = -5; k <= 5; ++k) cout << dp[N+k] << " ";
			// cout << "\n";
		}
	}
	if(l < -N || l > N || dp[l+N] < 0){
		cout << "impossible\n";
	}else{
		cout << dp[l+N] << "\n";
	}
	return 0;
}

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