oj.uz

Submission #484466

# Submission time Handle Problem Language Result Execution time Memory
484466 2021-11-03T14:59:29 Z Carmel_Ab1 Ice Hockey World Championship (CEOI15_bobek) C++17
100 / 100
 445 ms 16732 KB 
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld, ld> pld;
typedef vector<pi> vpi;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T>
ostream &operator<<(ostream &os, vector<T> &a) {
    os << "[";
    for (int i = 0; i < ll(a.size()); i++) { os << a[i] << ((i != ll(a.size() - 1) ? " " : "")); }
    os << "]\n";
    return os;
}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map

template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
    is >> p.first >> p.second;
    return is;
}

template<typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> &p) {
    os << "" << p.first << " " << p.second << "";
    return os;
}

void usaco(string taskname) {
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char *FIN = fin.c_str();
    const char *FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
}

template<typename T>
void read(vector<T> &v) {
    int n = v.size();
    for (int i = 0; i < n; i++)
        cin >> v[i];
}

template<typename T>
vector<T> UNQ(vector<T> a) {
    vector<T> ans;
    for (T t: a)
        if (ans.empty() || t != ans.back())
            ans.push_back(t);
    return ans;
}

ll ceil(ll a, ll b) {
    ll ans = a / b;
    if (a % b)ans++;
    return ans;
}

ld log(ld a, ld b) { return log(b) / log(a); }

ll power(ll base, ll exp, ll M = 1e18) {//(base^exp)%M
    ll ans = 1;
    while (exp) {
        if (exp % 2 == 1)ans = ((ans % M) * (base % M)) % M;
        base = ((base % M) * (base % M)) % M;
        exp /= 2;
    }
    return ans;
}

string to_base(int n, int new_base) {
    string s;
    int nn = n;
    while (nn) {
        s += to_string(nn % new_base);
        nn /= new_base;
    }
    reverse(all(s));
    return s;
}

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    ll x = (a / gcd(a, b));
    return b * x;
}

vl generate_array(ll n, ll mn = 1, ll mx = 1e18 + 1) {
    if (mx == 1e18 + 1)
        mx = n;
    vl ans(n);
    for (int i = 0; i < n; i++)
        ans[i] = (mn + rand() % (mx - mn + 1));
    return ans;
}

string substr(string s, int l, int r) {
    string ans;
    for (int i = l; i <= r; i++)
        ans += s[i];
    return ans;
}


void solve();

int main() {
    GLHF;
    int t = 1;
    //cin >> t;
    while (t--)
        solve();
}

void solve() {
    ll n,x;
    cin >> n >> x;
    vl a(n);
    read(a);

    vl L(1<<(n/2)),R(1<<ceil(n,2));

    for(int i=0; i<(1<<(n/2)); i++){
        ll sum=0;
        for(int j=0; j<n/2; j++)
            if(i&(1<<j))
                sum+=a[j];
        L[i]=sum;
    }
    for(int i=0; i<(1<<ceil(n,2)); i++){
        ll sum=0;
        for(int j=0; j<ceil(n,2); j++)
            if(i&(1<<j))
                sum+=a[j+n/2];
        R[i]=sum;
    }

    ll ans=0;
    sort(all(R));
    for(int i=0; i<1<<(n/2); i++){
        if(L[i]>x)continue;
        ll ix= upper_bound(all(R),x-L[i])-R.begin();
        if(0<=ix)
            ans+=ix;
    }
    out(ans)
}

Compilation message

bobek.cpp: In function 'void usaco(std::string)':
bobek.cpp:57:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
bobek.cpp:58:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |     freopen(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 1868 KB Output is correct
2 Correct 90 ms 4428 KB Output is correct
3 Correct 445 ms 16732 KB Output is correct
4 Correct 87 ms 4428 KB Output is correct
5 Correct 11 ms 1228 KB Output is correct
6 Correct 6 ms 840 KB Output is correct
7 Correct 11 ms 1352 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 2380 KB Output is correct
2 Correct 27 ms 1868 KB Output is correct
3 Correct 160 ms 8524 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 6 ms 716 KB Output is correct
6 Correct 15 ms 1228 KB Output is correct
7 Correct 11 ms 1356 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 3404 KB Output is correct
2 Correct 123 ms 6476 KB Output is correct
3 Correct 126 ms 6532 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 66 ms 6476 KB Output is correct
6 Correct 202 ms 16716 KB Output is correct
7 Correct 79 ms 6476 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 293 ms 12740 KB Output is correct
2 Correct 25 ms 1868 KB Output is correct
3 Correct 9 ms 716 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 6 ms 844 KB Output is correct
6 Correct 176 ms 12620 KB Output is correct
7 Correct 11 ms 1356 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 1740 KB Output is correct
2 Correct 83 ms 4428 KB Output is correct
3 Correct 8 ms 716 KB Output is correct
4 Correct 9 ms 716 KB Output is correct
5 Correct 71 ms 6452 KB Output is correct
6 Correct 20 ms 1868 KB Output is correct
7 Correct 192 ms 16648 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 331 ms 16696 KB Output is correct
2 Correct 27 ms 1740 KB Output is correct
3 Correct 9 ms 844 KB Output is correct
4 Correct 431 ms 16716 KB Output is correct
5 Correct 97 ms 8524 KB Output is correct
6 Correct 12 ms 1228 KB Output is correct
7 Correct 22 ms 2356 KB Output is correct