oj.uz

Submission #543155

# Submission time Handle Problem Language Result Execution time Memory
543155 2022-03-29T14:41:08 Z SmolBrain Ice Hockey World Championship (CEOI15_bobek) C++17
100 / 100
 481 ms 20892 KB 
// Om Namah Shivaya
// GM in 126 days

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define endl '\n'
#define pb push_back
#define conts continue
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define ff first
#define ss second
#define ceil2(x,y) ((x+y-1) / (y))
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#ifndef ONLINE_JUDGE
#define debug(x) cout << #x <<" = "; print(x); cout << endl
#else
#define debug(x)
#endif

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

bool iseven(ll n) {if ((n & 1) == 0) return true; return false;}

void print(ll t) {cout << t;}
void print(int t) {cout << t;}
void print(string t) {cout << t;}
void print(char t) {cout << t;}
void print(double t) {cout << t;}
void print(ld t) {cout << t;}

template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(pair <T, V> p) {cout << "{"; print(p.ff); cout << ","; print(p.ss); cout << "}";}
template <class T> void print(vector <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(set <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(multiset <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T, class V> void print(map <T, V> v) {cout << "[ "; for (auto i : v) {print(i); cout << " ";} cout << "]";}
template<typename T> void amin(T &a, T b) { a = min(a, b); }
template<typename T> void amax(T &a, T b) { a = max(a, b); }

void usaco(string filename) {
    freopen((filename + ".in").c_str(), "r", stdin);
    freopen((filename + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const int maxn = 1e5 + 5;
const int inf1 = 1e9 + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n, m; cin >> n >> m;
    vector<ll> a(n);
    rep(i, n) cin >> a[i];

    ll group1 = n / 2, group2 = ceil2(n, 2);
    vector<ll> cost1, cost2;

    rep(mask, 1 << group1) {
        ll sum = 0;

        rep(i, group1) {
            ll f = 1ll << i;
            if (mask & f) {
                sum += a[i];
            }
        }

        cost1.pb(sum);
    }

    rep(mask, 1 << group2) {
        ll sum = 0;

        rep(i, group2) {
            ll f = 1ll << i;
            if (mask & f) {
                sum += a[i + group1];
            }
        }

        cost2.pb(sum);
    }

    sort(all(cost2));
    ll ans = 0;

    trav(x, cost1) {
        ll mx = m - x;
        ll toadd = upper_bound(all(cost2), mx) - cost2.begin();
        ans += toadd;
    }

    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;
    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Compilation message

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

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 1916 KB Output is correct
2 Correct 98 ms 5440 KB Output is correct
3 Correct 481 ms 20728 KB Output is correct
4 Correct 87 ms 5388 KB Output is correct
5 Correct 13 ms 1492 KB Output is correct
6 Correct 6 ms 960 KB Output is correct
7 Correct 13 ms 1588 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 2896 KB Output is correct
2 Correct 29 ms 1984 KB Output is correct
3 Correct 186 ms 10628 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 7 ms 984 KB Output is correct
6 Correct 13 ms 1620 KB Output is correct
7 Correct 12 ms 1600 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 3540 KB Output is correct
2 Correct 129 ms 6556 KB Output is correct
3 Correct 128 ms 6512 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 77 ms 6704 KB Output is correct
6 Correct 230 ms 20828 KB Output is correct
7 Correct 95 ms 6544 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 296 ms 12748 KB Output is correct
2 Correct 27 ms 2008 KB Output is correct
3 Correct 9 ms 964 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 6 ms 980 KB Output is correct
6 Correct 187 ms 12728 KB Output is correct
7 Correct 12 ms 1592 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 2008 KB Output is correct
2 Correct 96 ms 5356 KB Output is correct
3 Correct 10 ms 960 KB Output is correct
4 Correct 11 ms 968 KB Output is correct
5 Correct 79 ms 6568 KB Output is correct
6 Correct 21 ms 1992 KB Output is correct
7 Correct 226 ms 20892 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 382 ms 20764 KB Output is correct
2 Correct 29 ms 2008 KB Output is correct
3 Correct 9 ms 932 KB Output is correct
4 Correct 454 ms 20760 KB Output is correct
5 Correct 115 ms 10460 KB Output is correct
6 Correct 13 ms 1604 KB Output is correct
7 Correct 25 ms 2884 KB Output is correct