# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
510064 | CraniXort | Ice Hockey World Championship (CEOI15_bobek) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define fin std::cin
#define fout std::cout
// std::ifstream fin("hockey.in");
// std::ofstream fout("hockey.out");
void compute(std::vector <long long>& v) {
std::vector <long long> x;
std::stack <long long> toAdd;
x.push_back(0);
for(auto value: v) {
for(auto sum: x)
toAdd.push(value + sum);
while(toAdd.empty() == false) {
x.push_back(toAdd.top());
toAdd.pop();
}
}
std::sort(x.begin(), x.end());
v = x;
}
void print(std::vector <int> &v) {
for(int i: v)
fout << i << ' ';
fout << '\n';
}
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
int n;
long long maxsum;
fin >> n >> maxsum;
std::vector <int> a, b;
for(int i = 0, value; i < n / 2; i ++) {
fin >> value;
a.push_back(value);
}
for(int i = n / 2, value; i < n; i ++){
fin >> value;
b.push_back(value);
}
compute(a);
compute(b);
// print(a);
// print(b);
long long ans = 0;
for(int i = 0, j = b.size() - 1; i < a.size(); i ++) {
while(j >= 0 and a[i] + b[j] > maxsum)
j --;
ans = ans + (j + 1);
}
fout << ans << '\n';
return 0;
}