fork download
copy 
  1. #include <bits/stdc++.h>
  2. #pragma GCC optimize("O3","unroll-loops")
  3. using namespace std;
  4. #define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
  5. #define mofile(s) freopen(s,"r",stdin)
  6. #define outfile(s) freopen(s,"w",stdout)
  7. #define ll long long
  8. #define ii pair<ll,ll>
  9. #define iii pair<ll,ii>
  10. #define fi first
  11. #define se second
  12. #define tf bool
  13. #define ST stack
  14. #define Q deque
  15. #define Q queue
  16. #define S string
  17. #define Ma map
  18. #define UM unormideremid_map
  19. #define SE set
  20. #define str(x) to_string(x)
  21. #define all(a) (a).begin(),(a).end()
  22. #define FOR(i,l,r,mid) for(int i=l;i<=r;i+=mid)
  23. #define FOD(i,l,r,mid) for(int i=r;i>=l;i-=mid)
  24. #define xuong cout<<"\n"
  25. #define midebug(x) cout<<(x)<<" "
  26. #define ppcnt(x) __builtin_popcountll(x)
  27. #define parity(x) __builtin_parityll(x)
  28. #define leamid0(x) __builtin_clzll(x)
  29. #define LOG2 __lg(x)
  30. #define tr0(x) __builtin_ctzll(x)
  31. #define fiset(x) __builtin_ffsll(x)
  32. #define MASK(k) (1LL<<(k))
  33. #define BIT(x,k) ((x)>>(k)&1)
  34. #define pb push_back
  35. #define tron(x) setprecision(x)
  36. #define het return 0
  37. #define base_ 1000000000
  38. template<typename... T>
  39. void in(T&... args) { ((cin >> args), ...); }
  40. template<class X, class Y>
  41.     bool maximize(X &x, const Y &y){return (x < y) ? x = y, 1 : 0;}
  42. template<class X, class Y>
  43.     bool minimize(X &x, const Y &y){return (x > y) ? x = y, 1 : 0;}
  44. const int maxn=1e6+5;
  45. const ll tle=2e8;
  46. const ll INF=1e9+9;
  47. const int base=31;
  48. string bcc="abcmidefghijklmnopqrstuvwxyz";
  49. int midx[]={-1,0,1,0};
  50. int midy[]={0,1,0,-1};
  51. bool sang[10000005];
  52. ll pref[1005][1005],mt[1005][1005];
  53. void sieve(){
  54.     for(int i=1;i<=10000000;++i) sang[i]=1;
  55.     sang[0]=sang[1]=0;
  56.     for(int i=2;i*i<=10000000;++i){
  57.         if(sang[i]){
  58.             for(int j=i*i;j<=10000000;j+=i) sang[j]=0;
  59.         }
  60.     }
  61. }
  62. void lis(){
  63.     vector<int>t;
  64.     vector<int>a;
  65.     int n; cin>>n;
  66.     for(int i=1;i<=n;++i){
  67.         int ai; cin>>ai;
  68.         a.pb(ai);
  69.     }
  70.     for(int x:a){
  71.         auto it=lower_bound(all(t),x);
  72.         if(it==t.end()) t.pb(x);
  73.         else *it=x;
  74.     }
  75. }
  76. void pfs2mid(){
  77.     int n,m,k; cin>>n>>k; m=n;
  78.     for(int i=1;i<=n;++i){
  79.         for(int j=1;j<=m;++j) cin>>mt[i][j];
  80.     }
  81.     for(int i=1;i<=n;++i){
  82.         for(int j=1;j<=m;++j) pref[i][j]=mt[i][j]+pref[i-1][j]+pref[i][j-1]-pref[i-1][j-1];
  83.     }
  84. }
  85. ll qu2mid(int x1,int y1,int x2,int y2){
  86.     return pref[x2][y2]-pref[x1-1][y2]-pref[x2][y1-1]+pref[x1-1][y1-1];
  87. }
  88. void open(){
  89.     if(fopen("mideptrai.INP","r")){
  90.         mofile("mideptrai.INP");
  91.         outfile("mideptrai.OUT");
  92.     }
  93. }
  94. void gen(const vector<ll>&a,vector<ll>&s){
  95.     int n=a.size();
  96.     for(int i=0;i<(1<<n);++i){
  97.         ll cur=0;
  98.         for(int j=0;j<n;++j){
  99.             if((i>>j)&1) cur+=a[j];
  100.         }
  101.         s.pb(cur);
  102.     }
  103. }
  104. int main(){
  105.     fast;
  106.     int n; ll k; cin>>n>>k;
  107.     vector<ll>a(n);
  108.     for(int i=0;i<n;++i) cin>>a[i];
  109.     vector<ll>l,r;
  110.     for(int i=0;i<n;++i){
  111.         if(i<n/2) l.pb(a[i]);
  112.         else r.pb(a[i]);
  113.     }
  114.     vector<ll>sl,sr;
  115.     gen(l,sl); gen(r,sr);
  116.     sort(sl.begin(),sl.end());
  117.     for(ll x:sr){
  118.         if(x<=k){
  119.             if(binary_search(sl.begin(),sl.end(),k-x)){
  120.                 cout<<"YES"<<"\n";
  121.                 het;
  122.             }
  123.         }
  124.     }
  125.     cout<<"NO"<<"\n";
  126.     het;
  127. }
  128.  
Success #stdin #stdout 0s 5308KB
comments (?)
stdin
copy 
4 7
1 2 3 4
stdout
copy 
YES
https://ideone.com/o7WMM4
language:
C++ (gcc 8.3)
created:
16 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!