Submission #35325756

---

Source Code Expand

/* Generated by powerful Codeforces Tool
 * You can download the binary file in here https://github.com/xalanq/cf-tool (Windows, macOS, Linux)
 * Author: shuger
 * Time: 2022-10-01 23:26:16
**/
#include <stdio.h>
#include <string>
#include <utility>
#include <algorithm>
#include <ctime>
#include <iostream>

using namespace std;

#define ll long long
#define P pair
#define mkp(a,b) make_pair(a,b)
#define fir first
#define sec second

//#define debug

bool _t(char c) {
    return ((c<='9' && c>='0') || c=='-');
}

template <typename Tp> 
void read(Tp &_a) {
    _a=0;
    int flg=1;
    char c;
    while(!_t(c=getchar())) ;
    if(c=='-') flg=-1,c=getchar();
    _a=c-'0';
    while((c=getchar())!='-' && _t(c)) _a=_a*10+c-'0';
    _a*=flg;
}

template <typename Tp> 
void write(Tp _a) {
    char s[45]={};
    int cnt=0;
    if(_a<0) putchar('-'),_a=-_a;
    if(_a==0) {
        putchar('0');
        return ;
    }
    while(_a) s[++cnt]=_a%10+48,_a/=10;
    while(cnt) putchar(s[cnt--]);
}

bool dp[10005][2]={};

string str[10005][2]={};

int a[105][2]={};

void wk() {
    int n,s;
    read(n),read(s);
    dp[0][0]=true;
    for(int i=1;i<=n;++i) {
        for(int j=0;j<=1;++j) read(a[i][j]);
    }
    for(int i=1;i<=n;++i) {
        for(int j=0;j<=s;++j) dp[j][i&1]=false,str[j][i&1]="";
        for(int j=0;j<=1;++j) {
            for(int k=a[i][j];k<=s;++k) {
                if(dp[k-a[i][j]][1-(i&1)]) {
                    dp[k][i&1]=true;
                    str[k][i&1]=str[k-a[i][j]][1-(i&1)]+(j==0?"H":"T");
                }
            }
        }
    }
    if(dp[s][n&1]) {
        printf("Yes\n");
        cout << str[s][n&1];
    }
    else printf("No\n");
}

signed main() {

#ifdef debug
    double st=clock();
#endif

    int t=1;
//    read(t);
    while(t--) wk();

#ifdef debug
    freopen("time_op.txt","w",stdout);
    printf("%.2lf ms",clock()-st);
#endif 

    return 0;
}

Submission Info

Judge Result