Submission #1002987

#	Time	Username	Problem	Language	Result	Execution time	Memory
1002987		whatthemomooofun1729	Ice Hockey World Championship (CEOI15_bobek)	C++17	10 / 100	151 ms	57800 KiB

bobek

#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)];
vc<pll> 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];
    }
    sort(all(a));
    for (int i = 0; i < sz(b); ++i) {
        cin >> b[i];
    }
    sort(all(b));
    A = sz(a), B = sz(b);
    ll ans = 0;
    for (int mask = 0; mask < (1 << A); ++mask) {
        if (mask > 0) {
            if (!suma.empty() && suma.back().ff == dp[0][mask]) {
                suma.back().ss++;
            } else {
                suma.PB({dp[0][mask], 1});
            }
        }
        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) {
            if (!sumb.empty() && sumb.back().ff == dp[1][mask]) {
                sumb.back().ss++;
            } else {
                sumb.PB({dp[1][mask], 1});
            }
        }
        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];
            }
        }
    }
    int it = 0;
    ll cnt2 = 0;
    for (; it < B; it++) {
        cnt2 += sumb[it].ss;
    }
    for (auto i = suma.begin(); i != suma.end(); i++) {
        ll leftover = M - i->ff;
        if (leftover > 0) {
            while (it > 0 && sumb[it - 1].ff > leftover) {
                cnt2 -= sumb[it - 1].ss;
                it--;
            }
            ll cnt1 = i->ss;
            ans += 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 (stderr)

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 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10