제출 #963651

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
963651		NotLinux	Uplifting Excursion (BOI22_vault)	C++17	0 / 100	1 ms	348 KiB

vault

//author : FatihCihan
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin() , v.end()
#define sz(a) (int)a.size()
const int inf = 1e9 + 7;
const int N = 10;
void solve(){
	int m,l;
	cin >> m >> l;
	vector < int > v;
	for(int i = -m;i<=m;i++){
		int x;
		cin >> x;
		for(int j = 0;j<x;j++){
			v.push_back(i);
		}
	}
	vector < int > knapsack(2 * N + 1 , -inf);
	knapsack[N] = 0;
	// for(int i = 0;i<=2*N;i++){
	// 	cout << i - N << " : " << knapsack[i] << endl;
	// }
	// cout << endl;
	for(auto itr : v){
		vector < int > newknapsack = knapsack;
		for(int i = 0;i<=2*N;i++){
			newknapsack[i] = max(newknapsack[i] , knapsack[i]);
			if((i - itr) <= 2*N and (i - itr) >= 0){
				newknapsack[i] = max(newknapsack[i] , knapsack[i - itr] + 1);
			}
		}
		swap(knapsack , newknapsack);
		// for(int i = 0;i<=2*N;i++){
		// 	cout << i - N << " : " << knapsack[i] << endl;
		// }
	}
	// cout << endl;
	// for(int i = 0;i<=2*N;i++){
	// 	cout << i - N << " : " << knapsack[i] << endl;
	// }
	// cout << endl;
	if(abs(l) <= N){
		if(abs(knapsack[l + N]) <= N)cout << knapsack[l + N] << endl;
		else cout << "impossible" << endl;
	}
	else{
		cout << "impossible" << endl;
	}
}
signed main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	int testcase = 1;//cin >> testcase;
	while(testcase--)solve();
	cerr << 1000.0 * clock() / CLOCKS_PER_SEC << " ms" << endl;
}

• Subtask 1: 0 / 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