Submission #850959

#TimeUsernameProblemLanguageResultExecution timeMemory
850959Nhoksocqt1Ice Hockey World Championship (CEOI15_bobek)C++17
100 / 100
314 ms10704 KiB
#include<bits/stdc++.h> using namespace std; #define inf 0x3f3f3f3f #define sz(x) int((x).size()) #define fi first #define se second typedef long long ll; typedef pair<int, int> ii; template<class X, class Y> inline bool maximize(X &x, const Y &y) {return (x < y ? x = y, 1 : 0);} template<class X, class Y> inline bool minimize(X &x, const Y &y) {return (x > y ? x = y, 1 : 0);} mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int Random(int l, int r) { return uniform_int_distribution<int>(l, r)(rng); } ll cost[40], m; int nArr; void process() { cin >> nArr >> m; for (int i = 0; i < nArr; ++i) cin >> cost[i]; ll res(0); vector<ll> p; int n1 = min(nArr, 20), n2 = nArr - n1; for (int mask = 0; mask < (1 << n1); ++mask) { ll sum(0); for (int i1 = mask; i1 > 0; i1 ^= i1 & -i1) { int i = __builtin_ctz(i1 & -i1); sum += cost[i]; } p.push_back(sum); } sort(p.begin(), p.end()); for (int mask = 0; mask < (1 << n2); ++mask) { ll sum(0); for (int i1 = mask; i1 > 0; i1 ^= i1 & -i1) { int i = __builtin_ctz(i1 & -i1); sum += cost[20 + i]; } int pos = upper_bound(p.begin(), p.end(), m - sum) - p.begin(); res += pos; } cout << res << '\n'; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); process(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...