# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1121743 | vjudge1 | Ice Hockey World Championship (CEOI15_bobek) | C++17 | 447 ms | 22952 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 <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
// sinagdir hell sayilmir kocurmedir
void computeSubsetSums(const vector<ll>& arr, vector<ll>& subsetSums) {
int n = arr.size();
for (int mask = 0; mask < (1 << n); ++mask) {
ll sum = 0;
for (int i = 0; i < n; ++i) {
if (mask & (1 << i)) {
sum += arr[i];
}
}
subsetSums.push_back(sum);
}
}
int main() {
int N;
ll M;
cin >> N >> M;
vector<ll> costs(N);
for (int i = 0; i < N; ++i) {
cin >> costs[i];
}
vector<ll> firstHalf(costs.begin(), costs.begin() + N / 2);
vector<ll> secondHalf(costs.begin() + N / 2, costs.end());
# | 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... |