Submission #574729

#	Time	Username	Problem	Language	Result	Execution time	Memory
574729		MohammadAghil	Ice Hockey World Championship (CEOI15_bobek)	C++14	100 / 100	188 ms	20844 KiB

bobek

      #include <bits/stdc++.h>
//   #pragma GCC optimize ("Ofast,unroll-loops")
// #pragma GCC target ("avx2")
    using namespace std;
  typedef long long ll;
   typedef pair<int, int> pp;
    #define er(args ...) cerr << __LINE__ << ": ", err(new istringstream(string(#args)), args), cerr << endl
      #define per(i,r,l) for(int i = (r); i >= (l); i--)
        #define rep(i,l,r) for(int i = (l); i < (r); i++)
           #define all(x) x.begin(), x.end()
              #define sz(x) (int)(x).size()
                  #define pb push_back
                      #define ss second
                           #define ff first
                                   void err(istringstream *iss){}template<typename T,typename ...Args> void err(istringstream *iss,const T &_val, const Args&...args){string _name;*iss>>_name;if(_name.back()==',')_name.pop_back();cerr<<_name<<" = "<<_val<<", ",err(iss,args...);}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll mod = 1e9 + 7, maxn = 1<<9, maxk = 101, lg = 21, inf = ll(1e9) + 5;
ll pw(ll a,ll b,ll md=mod){if(!b)return 1;ll k=pw(a,b>>1ll);return k*k%md*(b&1ll?a:1)%md;}

vector<ll> slv(vector<ll> a){
     vector<ll> res{0}; int n = sz(a);
     rep(i,1,1<<n){
          int f = __builtin_ctz(i);
          res.pb(res[i^(1<<f)] + a[f]); 
     }
     sort(all(res));
     return res;
}

int main(){
     cin.tie(0) -> sync_with_stdio(0); 
     ll n, m; cin >> n >> m;
     vector<ll> a(n);
     rep(i,0,n) cin >> a[i];
     vector<ll> resl = slv(vector<ll>(begin(a), begin(a) + (n>>1))), resr = slv(vector<ll>(begin(a) + (n>>1), end(a)));
     ll ans = 0, ptr = sz(resr)-1;
     for(ll c: resl){
          if(c > m) break;
          while(c + resr[ptr] > m) ptr--;
          ans += ptr + 1;
     }
     cout << ans << '\n';
     return 0; 
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10