# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1139670 | AmirMakaM | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
#define ull unsigned long long
#define ll long long
#define ld long double
#define pb push_back
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define pdd pair<double,double>
#define mp make_pair
#define AmirMakaM ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
// solve it
const ull SEED = chrono::steady_clock::now().time_since_epoch().count();
mt19937_64 mrand(SEED);
ull rnd(ull x = ~(0ull)) {return mrand() % x;}
const ll MOD = 998244353;
const ll INF = 1e16+20;
const int inf = 1e9 + 7;
const ll N = 1e4+5;
const ll M = 2e3+1;
const double pi = 2*acos(0.0);
const int dx[] = {1,-1,0,0}, dy[] = {0,0,1,-1};
vector<int> find_subset(int l, int r, vector<int> w) {
int dp[r+1] = {};
for(int i=1; i<=sz(w); i++) {
for(int j=r; j>=0; j--) {
if((j == 0 || dp[j]!=0) && j+w[i-1]<=r) {
dp[j+w[i-1]] = i;
}
}
}
vector<int> ans;
int cur = 0;
for(int i=l; i<=r; i++) {
if(dp[i]) {
cur = i;
break;
}
}
if(!cur) return ans;
for(int i=cur; i>0; i-=w[dp[i]-1]) {
ans.pb(dp[i]-1);
}
return ans;
}
//#ifndef ONLINE_JUDJE
int main() {
AmirMakaM;
srand(SEED);
int n, l, r;
cin >> n >> l >> r;
vector<int> w(n);
for(int i=1; i<=n; i++) {
cin >> w[i-1];
}
vector<int> ans = find_subset(l,r,w);
for(int x:ans) cout << w[x] << " ";
return 0;
}
//#endif