Submission #1220367

#TimeUsernameProblemLanguageResultExecution timeMemory
1220367toast12Ice Hockey World Championship (CEOI15_bobek)C++20
100 / 100
298 ms20920 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { int n; ll m; cin >> n >> m; ll x = n/2; ll y = n-x; vector<ll> a(x), b(y); for (int i = 0; i < x; i++) cin >> a[i]; for (int i = 0; i < y; i++) cin >> b[i]; vector<ll> l, r; for (int mask = 0; mask < (1<<x); mask++) { ll sum = 0; for (int i = 0; i < x; i++) { if (mask & (1<<i)) sum += a[i]; } if (sum <= m) l.push_back(sum); } for (int mask = 0; mask < (1<<y); mask++) { ll sum = 0; for (int i = 0; i < y; i++) { if (mask & (1<<i)) sum += b[i]; } if (sum <= m) r.push_back(sum); } ll ans = 0; int idx = r.size()-1; sort(l.begin(), l.end()); sort(r.begin(), r.end()); for (int i = 0; i < l.size(); i++) { while (r[idx]+l[i] > m) idx--; ans += idx+1; } cout << ans << '\n'; 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...