# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1122352 | ElayV13 | Ice Hockey World Championship (CEOI15_bobek) | C++17 | 314 ms | 22960 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>
using namespace std;
#define int long long
#define ld double
const int INF = 1e18;
const int mod = 12345;
const int sz = 3e5 + 5;
const int usz = 1e6 + 5;
signed main()
{
ios_base::sync_with_stdio(0);cin.tie(0);
int n , m;
cin >> n >> m;
vector < int > a(n);
for(int i = 0;i < n;i++) cin >> a[i];
sort(a.begin() , a.end());
vector < int > q1;
vector < int > q2;
for(int i = 0;i < n / 2 + (n & 1);i++) q1.push_back(a[i]);
for(int i = n / 2 + (n & 1);i < n;i++) q2.push_back(a[i]);
vector < int > pos1;
vector < int > pos2;
for(int bit = 0;bit <= pow(2 , q1.size()) - 1;bit++)
{
int sum = 0;
for(int i = 0;i < q1.size();i++)
{
if((1 << i) & bit)
{
sum += q1[i];
}
}
if(sum <= m) pos1.push_back(sum);
}
for(int bit = 0;bit <= pow(2 , q2.size()) - 1;bit++)
{
int sum = 0;
for(int i = 0;i < q2.size();i++)
{
if((1 << i) & bit)
{
sum += q2[i];
}
}
if(sum <= m) pos2.push_back(sum);
}
sort(pos1.begin() , pos1.end());
sort(pos2.begin() , pos2.end());
int ans = 0;
for(int i = 0;i < pos1.size();i++)
{
int l = 0 , r = pos2.size() - 1 , best = -1;
while(l <= r)
{
int mid = (l + r) >> 1;
if(pos2[mid] + pos1[i] <= m)
{
best = max(best , mid + 1);
l = mid + 1;
}
else r = mid - 1;
}
ans += best;
}
cout << ans << endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |