oj.uz

답안 #697825

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
697825 2023-02-11T07:02:52 Z Filya Ice Hockey World Championship (CEOI15_bobek) C++14
100 / 100
 500 ms 20892 KB 
/////////////////////include/////////////////////
//#include <bits/stdc++.h>
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
#include <set>
#include <map>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stdio.h>
#include <climits>
#include <numeric>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//template <typename T>
//using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
/////////////////////define/////////////////////
#define ci(x) if(x) cout << "YES" << '\n'; else cout << "NO" << '\n';
#define cii(x) if(check(x))
#define MOD 1000000007
#define MOD2 998244353
#define oo 1e9
#define ool 1e18L
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mii map<int, int>
#define vi vector<int>
#define vpi vector<pair<int, int>>
#define vll vector <ll>
#define ff first
#define ss second
#define mp make_pair
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define sz(x) (int((x).size()))
#define all(x) (x).begin(), (x).end()
#define alll(x) (x), (x) + n
#define clr(x) (x).clear();
#define fri(x) for(int i = 0; i < x; ++i)
#define frj(x) for(int j = 0; j < x; ++j)
#define frp(x) for(int p = 0; p < x; ++p)
#define frr(a, b) for(int i = a; i < b; ++i)
#define frrj(a, b) for(int j = a; j < b; ++j)
#define fra(x) for(int i = 0; i < x; ++i) cin >> a[i];
#define frb(x) for(int i = 0; i < x; ++i) cin >> b[i];
#define frs(x) for(auto it = x.begin(); it != x.end(); ++it)
#define fr(x) for(auto it : x) //el
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);
#define dbg(x) cerr << #x << ": " << x << endl;
#define ce(x) cout << x << endl;
#define uniq(x) x.resize(unique(all(x)) - x.begin()); //make all one after sorting
#define blt __builtin_popcount
/////////////////////print array, vector, deque, set, multiset, pair, map /////////////////////
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]"; cout << endl;}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(stack <T> v) {cerr << "[ "; stack<T> s = v; while(s.size()) {T i = s.top(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(queue <T> v) {cerr << "[ "; queue<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(deque <T> v) {cerr << "[ "; deque<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop_front(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
/////////////////////code/////////////////////
ll a[200005];
int main() {
    fastio;
    int mask, i, n; ll m;
    cin >> n >> m;
    fra(n); 
    vector<ll> v1, v2;
    for (mask = 0; mask < (1 << (n / 2)); mask++) {
        ll s = 0;
        for (i = 0; i < n / 2; i++)
            if(mask & (1 << i))
                s += a[i];
        if(s <= m) v1.pb(s);
    }
    for (mask = 0; mask < (1 << (n - n / 2)); mask++) {
        ll s = 0;
        for (i = n / 2; i < n; i++)
            if(mask & (1 << (i - n / 2)))
                s += a[i];
        if(s <= m) v2.pb(s);
    }
    ll ans = 0, id;
    sort(all(v2));
    // print(v1); print(v2);
    for(ll x : v1) {
        auto it = ub(all(v2), m - x);
        if(it == v2.begin()) continue;
        it--;
        id = it - v2.begin();
        ans += id + 1;
    }
    cout << ans;
    return 0;
}

//	           ♥ ♥ ♥  ♥  ♥    ♥   ♥    ♥
//	           ♥      ♥  ♥     ♥ ♥    ♥ ♥
//	           ♥ ♥ ♥  ♥  ♥      ♥    ♥   ♥
//	           ♥      ♥  ♥      ♥   ♥ ♥ ♥ ♥
//	           ♥      ♥  ♥ ♥ ♥  ♥  ♥       ♥
//
//        God loves Fil, Fil accepts God's will

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 224 KB Output is correct
7 Correct 0 ms 212 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 0 ms 212 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 1988 KB Output is correct
2 Correct 89 ms 5452 KB Output is correct
3 Correct 500 ms 20808 KB Output is correct
4 Correct 88 ms 5452 KB Output is correct
5 Correct 13 ms 1620 KB Output is correct
6 Correct 7 ms 984 KB Output is correct
7 Correct 8 ms 324 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 2892 KB Output is correct
2 Correct 30 ms 2008 KB Output is correct
3 Correct 183 ms 10504 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 6 ms 984 KB Output is correct
6 Correct 13 ms 1620 KB Output is correct
7 Correct 7 ms 340 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 3540 KB Output is correct
2 Correct 131 ms 6596 KB Output is correct
3 Correct 137 ms 6596 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 71 ms 6580 KB Output is correct
6 Correct 217 ms 20728 KB Output is correct
7 Correct 45 ms 304 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 292 ms 12728 KB Output is correct
2 Correct 28 ms 2008 KB Output is correct
3 Correct 10 ms 984 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 7 ms 984 KB Output is correct
6 Correct 193 ms 12756 KB Output is correct
7 Correct 8 ms 212 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 1992 KB Output is correct
2 Correct 86 ms 5340 KB Output is correct
3 Correct 9 ms 972 KB Output is correct
4 Correct 10 ms 984 KB Output is correct
5 Correct 95 ms 6664 KB Output is correct
6 Correct 22 ms 1912 KB Output is correct
7 Correct 116 ms 212 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 354 ms 20892 KB Output is correct
2 Correct 32 ms 2028 KB Output is correct
3 Correct 9 ms 984 KB Output is correct
4 Correct 408 ms 20808 KB Output is correct
5 Correct 103 ms 10552 KB Output is correct
6 Correct 14 ms 1620 KB Output is correct
7 Correct 14 ms 332 KB Output is correct