# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
72396 | 2018-08-26T07:43:43 Z | someone_aa | Ice Hockey World Championship (CEOI15_bobek) | C++17 | 506 ms | 21148 KB |
#include <bits/stdc++.h> #define ll long long #define pb push_back #define mp make_pair using namespace std; const int maxn = 42; vector<ll>suma, sumb; ll arr[maxn], n, fn, sn; ll budget; void get_f() { for(int i=0;i<(1<<fn);i++) { ll sum = 0LL; for(int j=0;j<fn;j++) { if(i&(1<<j)) { sum += arr[j]; } } suma.pb(sum); } sort(suma.begin(), suma.end()); } void get_s() { for(int i=0;i<(1<<sn);i++) { ll sum = 0LL; for(int j=0;j<sn;j++) { if(i&(1<<j)) { sum += arr[j+fn]; } } sumb.pb(sum); } sort(sumb.begin(), sumb.end()); } void solve() { ll result = 0LL; for(int i=0;i<suma.size();i++) { if(suma[i] > budget) continue; else { ll curr = lower_bound(sumb.begin(), sumb.end(), budget - suma[i]) - sumb.begin(); result += 1LL * (curr + 1); } } cout<<result; } int main() { cin>>n>>budget; for(int i=0;i<n;i++) { cin>>arr[i]; } fn = n / 2; sn = n - fn; get_f(); get_s(); solve(); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 248 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 360 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 400 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 440 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 37 ms | 2236 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 52 ms | 3040 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 81 ms | 3716 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 337 ms | 13024 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 43 ms | 13024 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 506 ms | 21148 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |