oj.uz

Submission #1002985

# Submission time Handle Problem Language Result Execution time Memory
1002985 2024-06-19T22:59:16 Z whatthemomooofun1729 Ice Hockey World Championship (CEOI15_bobek) C++17
70 / 100
 1000 ms 148052 KB 
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <stack>
#include <map>
#include <queue>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cstring>
#include <cmath>
#include <functional>
#include <cassert>
#include <iomanip>
#include <numeric>
#include <bitset>
#include <sstream>
#include <chrono>
#include <random>

#define ff first
#define ss second
#define PB push_back
#define sz(x) int(x.size())
#define rsz resize
#define fch(xxx, yyy) for (auto xxx : yyy) // abusive notation
#define all(x) (x).begin(),(x).end()
#define eps 1e-9

// more abusive notation (use at your own risk):
// #define int ll

using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;

// debugging
void __print(int x) {std::cerr << x;}
void __print(ll x) {std::cerr << x;} /* remember to uncomment this when not using THE MACRO */
void __print(unsigned x) {std::cerr << x;}
void __print(ull x) {std::cerr << x;}
void __print(float x) {std::cerr << x;}
void __print(double x) {std::cerr << x;}
void __print(ld x) {std::cerr << x;}
void __print(char x) {std::cerr << '\'' << x << '\'';}
void __print(const char *x) {std::cerr << '\"' << x << '\"';}
void __print(const string& x) {std::cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V> void __print(const pair<T, V> &x) {std::cerr << '{'; __print(x.ff); std::cerr << ", "; __print(x.ss); std::cerr << '}';}
template<typename T> void __print(const T& x) {int f = 0; std::cerr << '{'; for (auto &i: x) std::cerr << (f++ ? ", " : ""), __print(i); std::cerr << "}";}
void _print() {std::cerr << "]\n";}
template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) std::cerr << ", "; _print(v...);}
void println() {std::cerr << ">--------------------<" << endl;}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

// templates
template <class T> bool ckmin(T &a, const T &b) {return b<a ? a = b, 1 : 0;}
template <class T> bool ckmax(T &a, const T &b) {return b>a ? a = b, 1 : 0;}
template <class T> using gr = greater<T>;
template <class T> using vc = vector<T>;
template <class T> using p_q = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vc<T>, gr<T>>;
template <class T1, class T2> using pr = pair<T1, T2>;
mt19937_64 rng_ll(chrono::steady_clock::now().time_since_epoch().count());
int rng(int M) {return (int)(rng_ll()%M);} /*returns any random number in [0, M) */

// const variables
constexpr int INF = (int)2e9;
constexpr int MOD = 998244353;
constexpr ll LL_INF = (ll)3e18;
constexpr int mod = (int)1e9 + 7;
constexpr ll inverse = 500000004LL; // inverse of 2 modulo 1e9 + 7

void setIO(const string& str) {// fast input/output
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    if (str.empty()) return;
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
}

int N, A, B;
ll M;
vll a, b;
ll dp[2][(1 << 20)];
map<ll, int> suma, sumb;

signed main() { // TIME YOURSELF !!!
    setIO("");
    cin >> N >> M;
    a.rsz(N/2), b.rsz((N+1)/2);
    for (int i = 0; i < sz(a); ++i) {
        cin >> a[i];
    }
    for (int i = 0; i < sz(b); ++i) {
        cin >> b[i];
    }
    A = sz(a), B = sz(b);
    ll ans = 0;
    for (int mask = 0; mask < (1 << A); ++mask) {
        if (mask > 0) suma[dp[0][mask]]++;
        if (dp[0][mask] <= M) ans++;
        for (int i = 0; i < A; ++i) {
            if (!(mask & (1 << i))) {
                int mask_ = mask ^ (1 << i);
                dp[0][mask_] = dp[0][mask] + a[i];
            }
        }
    }
    for (int mask = 0; mask < (1 << B); ++mask) {
        if (mask > 0) sumb[dp[1][mask]]++;
        if (dp[1][mask] <= M) ans++;
        for (int i = 0; i < B; ++i) {
            if (!(mask & (1 << i))) {
                int mask_ = mask ^ (1 << i);
                dp[1][mask_] = dp[1][mask] + b[i];
            }
        }
    }
    for (auto i = sumb.begin(), j = next(i); j != sumb.end(); i++, j++) {
        j->ss += i->ss;
    }
    for (auto i = suma.begin(); i != suma.end(); i++) {
        ll leftover = M - i->ff;
        if (leftover > 0) {
            auto it = sumb.upper_bound(leftover);
            if (it != sumb.begin()) {
                it--;
                int cnt1 = i->ss, cnt2 = it->ss; // should be the sum of cnt for all <= leftover
                ans += (ll) cnt1 * cnt2;
            }
        } else break;
    }
    cout << ans - 1;
    return 0;
}

// TLE -> TRY NOT USING DEFINE INT LONG LONG
// CE -> CHECK LINE 45
// 5000 * 5000 size matrices are kinda big (potential mle)
// Do something, start simpler

Compilation message

bobek.cpp: In function 'void setIO(const string&)':
bobek.cpp:88:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   88 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bobek.cpp:89:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 600 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 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 3360 KB Output is correct
2 Correct 185 ms 26144 KB Output is correct
3 Correct 846 ms 72016 KB Output is correct
4 Correct 191 ms 26448 KB Output is correct
5 Correct 10 ms 1372 KB Output is correct
6 Correct 9 ms 1628 KB Output is correct
7 Correct 38 ms 9456 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 5060 KB Output is correct
2 Correct 55 ms 9552 KB Output is correct
3 Correct 134 ms 9716 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 5 ms 860 KB Output is correct
6 Correct 29 ms 4696 KB Output is correct
7 Correct 40 ms 9556 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 128 ms 21208 KB Output is correct
2 Correct 242 ms 24640 KB Output is correct
3 Correct 238 ms 23824 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 52 ms 6620 KB Output is correct
6 Correct 315 ms 19028 KB Output is correct
7 Correct 423 ms 55640 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1065 ms 111080 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 14164 KB Output is correct
2 Correct 235 ms 37204 KB Output is correct
3 Correct 19 ms 4952 KB Output is correct
4 Correct 20 ms 4952 KB Output is correct
5 Correct 59 ms 6636 KB Output is correct
6 Correct 62 ms 14164 KB Output is correct
7 Execution timed out 1066 ms 148052 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1049 ms 143936 KB Time limit exceeded
2 Halted 0 ms 0 KB -