oj.uz

Submission #928584

# Submission time Handle Problem Language Result Execution time Memory
928584 2024-02-16T17:21:04 Z sleepntsheep Ice Hockey World Championship (CEOI15_bobek) C++17
20 / 100
 199 ms 10432 KB 
#include <iostream>
#include <fstream>
#include <iomanip>
#include <cmath>
#include <cassert>
#include <cstring>
#include <vector>
#include <algorithm>
#include <deque>
#include <set>
#include <utility>
#include <array>
#include <complex>

using u32 = unsigned;
using i32 = int;
using i64 = long long;
using u64 = unsigned long long;
using f64 = double;
using f80 = long double;

using namespace std;
using pt = complex<f80>;
#define ALL(x) begin(x), end(x)
#define ShinLena cin.tie(nullptr)->sync_with_stdio(false);
#define N 400005

int n;
i64 z, a, b[44];
vector<i64> v;

int main()
{
    ShinLena;
    cin >> n >> a;
    for (int i = 0; i < n; ++i) cin >> b[i];

    for (int i = 0; i < (1 << min(20, n)); ++i)
    {
        i64 z = 0;
        for (int j = 0; j < min(20, n); ++j)
            if ((i >> j) & 1) z += b[j];
        if (z > a) continue;
        ++::z;
        v.emplace_back(z);
    }

    sort(ALL(v));

    if (n >= 20)
    {
        for (int i = 0; i < (1 << (n - 20)); ++i)
        {
            i64 z = {};
            for (int j = 20; j < n; ++j)
                if ((i >> j) & 1) z += b[j];
            if (z > a) continue;
            ++::z;

            auto it = upper_bound(ALL(v), a - z);
            ::z += it - begin(v);
        }
    }
    cout << z;

    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1500 KB Output is correct
2 Correct 5 ms 732 KB Output is correct
3 Correct 11 ms 992 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 6 ms 992 KB Output is correct
6 Incorrect 153 ms 10336 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 114 ms 9416 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 134 ms 10432 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 129 ms 9188 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 136 ms 9160 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 162 ms 10188 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 144 ms 9924 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 199 ms 9160 KB Output isn't correct
2 Halted 0 ms 0 KB -