Submission #35308073

---

Source Code Expand

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define fastio cin.tie(0)->sync_with_stdio(0); cout.tie(0);
#define all(x) x.begin(),x.end()
#define ff first
#define ss second

int dp[101][10001],n,s;
pair<int,int> a[101];
string ans;

int solve(int idx, int sum, string flip){
	if(idx==n){
		if(sum==0){
			ans = flip;
			return 1;
		}
		else return 0;
	}
	int& ret = dp[idx][sum];
	if(ret!=-1) return ret;
	
	ret = max(solve(idx+1,sum-a[idx].ff,flip+"H"),solve(idx+1,sum-a[idx].ss,flip+"T"));
	return ret;
}

int main(){
	fastio;
	memset(dp,-1,sizeof(dp));
	cin >> n >> s;
	for(int i=0;i<n;i++) cin >> a[i].ff >> a[i].ss;
	int k = solve(0,s,"");
	if(k){
		cout << "Yes\n";
		cout << ans;
	}
	else cout << "No\n";
}

Submission Info

Judge Result