#735549 (C++14) No.1538 引きこもりさんは引き算が得意。

• 問題: No.1538 引きこもりさんは引き算が得意。
• ユーザー: t98slider
• 提出日時: 2022-01-29 14:29:19
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 26 ms / 2,000 ms
• コード長: 5,695 bytes
• コンパイル時間: 3,314 ms
• コンパイル使用メモリ: 177,084 KB
• 実行使用メモリ: 4,628 KB
• 最終ジャッジ日時: 2023-08-30 12:25:21
• 合計ジャッジ時間: 4,811 ms
• ジャッジサーバーID （参考情報）: judge11 / judge13

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 4,376 KB
testcase_01	AC	2 ms; 4,380 KB
testcase_02	AC	1 ms; 4,380 KB
testcase_03	AC	2 ms; 4,380 KB
testcase_04	AC	1 ms; 4,376 KB
testcase_05	AC	2 ms; 4,384 KB
testcase_06	AC	1 ms; 4,380 KB
testcase_07	AC	1 ms; 4,380 KB
testcase_08	AC	1 ms; 4,380 KB
testcase_09	AC	2 ms; 4,376 KB
testcase_10	AC	2 ms; 4,384 KB
testcase_11	AC	1 ms; 4,380 KB
testcase_12	AC	2 ms; 4,380 KB
testcase_13	AC	1 ms; 4,380 KB
testcase_14	AC	1 ms; 4,380 KB
testcase_15	AC	1 ms; 4,380 KB
testcase_16	AC	2 ms; 4,376 KB
testcase_17	AC	1 ms; 4,380 KB
testcase_18	AC	2 ms; 4,376 KB
testcase_19	AC	1 ms; 4,380 KB
testcase_20	AC	2 ms; 4,380 KB
testcase_21	AC	1 ms; 4,380 KB
testcase_22	AC	2 ms; 4,376 KB
testcase_23	AC	2 ms; 4,376 KB
testcase_24	AC	1 ms; 4,380 KB
testcase_25	AC	1 ms; 4,380 KB
testcase_26	AC	1 ms; 4,380 KB
testcase_27	AC	1 ms; 4,380 KB
testcase_28	AC	2 ms; 4,380 KB
testcase_29	AC	2 ms; 4,376 KB
testcase_30	AC	2 ms; 4,380 KB
testcase_31	AC	1 ms; 4,380 KB
testcase_32	AC	2 ms; 4,384 KB
testcase_33	AC	1 ms; 4,376 KB
testcase_34	AC	2 ms; 4,384 KB
testcase_35	AC	2 ms; 4,376 KB
testcase_36	AC	2 ms; 4,380 KB
testcase_37	AC	19 ms; 4,380 KB
testcase_38	AC	19 ms; 4,392 KB
testcase_39	AC	20 ms; 4,628 KB
testcase_40	AC	17 ms; 4,424 KB
testcase_41	AC	17 ms; 4,380 KB
testcase_42	AC	20 ms; 4,472 KB
testcase_43	AC	1 ms; 4,384 KB
testcase_44	AC	19 ms; 4,380 KB
testcase_45	AC	19 ms; 4,468 KB
testcase_46	AC	17 ms; 4,496 KB
testcase_47	AC	8 ms; 4,376 KB
testcase_48	AC	21 ms; 4,380 KB
testcase_49	AC	20 ms; 4,476 KB
testcase_50	AC	2 ms; 4,380 KB
testcase_51	AC	25 ms; 4,376 KB
testcase_52	AC	23 ms; 4,612 KB
testcase_53	AC	25 ms; 4,400 KB
testcase_54	AC	26 ms; 4,456 KB
testcase_55	AC	24 ms; 4,456 KB
testcase_56	AC	25 ms; 4,384 KB

ソースコード

#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yes(ans) if(ans)printf("yes\n");else printf("no\n")
#define Yes(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YES(ans) if(ans)printf("YES\n");else printf("NO\n")
#define popcount(v) __builtin_popcountll(v)
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
#define vector4d(type,name,h,w,d,...) vector<vector<vector<vector<type>>>>name(h,vector<vector<vector<type>>>(w,vector<vector<type>>(d,vector<type>(__VA_ARGS__))))
using namespace std;
using ll = long long;
template<class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
const int MOD=1000000007;
const int MOD2=998244353;
const int INF=1<<30;
const ll INF2=1LL<<60;
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}
template<class T,class U,class V>void scan(tuple<T,U,V>& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));}
template<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i);}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}
ll updivide(ll a,ll b){return (a+b-1)/b;}
int msb(ll v){return 63-__builtin_clzll(v);}
template<class T> void chmax(T &a,const T b){if(b>a)a=b;}
template<class T> void chmin(T &a,const T b){if(b<a)a=b;}

int main(){
    LL(n,k);
    int m1=n/2,m2=n-n/2;
    vector<ll> a(m1),b(m2);
    vector<vector<ll>> c1(3),c2(3);
    rep(i,n){
        if(i<m1)in(a[i]);
        else in(b[i-m1]);
    }
    rep(i,n){
        if(i<m1&&a[i]==k){
            out("Yes");
            return 0;
        }
        if(i>=m1&&b[i-m1]==k){
            out("Yes");
            return 0;
        }
    }
    rep(S,1<<m1){
        ll sumv=0;
        rep(i,n)if(S>>i&1)sumv+=a[i];
        c1[0].push_back(sumv);
        c1[1].push_back(-sumv);
        for(int T=(S-1)&S;T>0;T=(T-1)&S){
            ll sumv=0;
            rep(i,m1){
                if(S>>i&1){
                    if(T>>i&1)sumv+=a[i];
                    else sumv-=a[i];
                }
            }
            c1[2].push_back(sumv);
        }
    }
    rep(S,1<<m2){
        ll sumv=0;
        rep(i,m2)if(S>>i&1)sumv+=b[i];
        c2[0].push_back(sumv);
        c2[1].push_back(-sumv);
        for(int T=(S-1)&S;T>0;T=(T-1)&S){
            ll sumv=0;
            rep(i,m2){
                if(S>>i&1){
                    if(T>>i&1)sumv+=b[i];
                    else sumv-=b[i];
                }
            }
            c2[2].push_back(sumv);
        }
    }
    reverse(all(c1[0])),c1[0].pop_back();
    reverse(all(c1[1])),c1[1].pop_back();
    reverse(all(c2[0])),c2[0].pop_back();
    reverse(all(c2[1])),c2[1].pop_back();
    rep(i,3)sort(all(c1[i])),sort(all(c2[i]));
    auto match=[&](int pos1,int pos2){
        rep(i,c1[pos1].size()){
            int j=lower_bound(all(c2[pos2]),k-c1[pos1][i])-c2[pos2].begin();
            if(j==c2[pos2].size())continue;
            if(c1[pos1][i]+c2[pos2][j]==k)return true;
        }
        return false;
    };
    auto match2=[&](int pos){
        rep(i,c1[pos].size()){
            if(c1[pos][i]==k)return true;
        }
        rep(i,c2[pos].size()){
            if(c2[pos][i]==k)return true;
        }
        return false;
    };
    if(match(0,1)||match(1,0)||match(0,2)||match(2,0)||match(1,2)||match(2,1)||match(2,2)){
        out("Yes");
        return 0;
    }
    if(match2(2)){
        out("Yes");
        return 0;
    }
    out("No");
}