답안 #1082764

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1082764	2024-09-01T13:31:44 Z	steveonalex	Ice Hockey World Championship (CEOI15_bobek)	C++17	100 / 100	404 ms	8884 KB

bobek

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }



int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
    clock_t start = clock();

    int n; ll w; cin >> n >> w;
    vector<ll> a(n);
    for(int i = 0; i<n; ++i) cin >> a[i];

    vector<ll> sum = {0};
    if (n > 20){
        for(int mask = 1; mask < MASK(n - 20); ++mask){
            ll cur = 0;
            for(int i = 0; i<n - 20; ++i) if (GETBIT(mask, i)) 
                cur += a[i + 20];
            sum.push_back(cur);
        }
    }
    sort(ALL(sum));
    ll ans = 0;
    for(int mask = 0; mask < MASK(min(n, 20)); ++mask){
        ll cur = 0;
        for(int i = 0; i < min(n, 20); ++i) if (GETBIT(mask, i)) 
            cur += a[i];
        ans += upper_bound(ALL(sum), w - cur) - sum.begin();
    }
    cout << ans << "\n";

    cerr << "Time elapsed: " << clock() - start << " ms\n";
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	348 KB	Output is correct
2	Correct	4 ms	348 KB	Output is correct
3	Correct	7 ms	464 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	3 ms	604 KB	Output is correct
6	Correct	64 ms	348 KB	Output is correct
7	Correct	8 ms	348 KB	Output is correct

Subtask #4
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	57 ms	348 KB	Output is correct
2	Correct	16 ms	348 KB	Output is correct
3	Correct	4 ms	348 KB	Output is correct
4	Correct	3 ms	348 KB	Output is correct
5	Correct	53 ms	460 KB	Output is correct
6	Correct	8 ms	348 KB	Output is correct
7	Correct	8 ms	460 KB	Output is correct

Subtask #5
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	104 ms	596 KB	Output is correct
2	Correct	153 ms	1096 KB	Output is correct
3	Correct	404 ms	8648 KB	Output is correct
4	Correct	157 ms	988 KB	Output is correct
5	Correct	74 ms	496 KB	Output is correct
6	Correct	67 ms	344 KB	Output is correct
7	Correct	75 ms	348 KB	Output is correct

Subtask #6
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	119 ms	688 KB	Output is correct
2	Correct	96 ms	348 KB	Output is correct
3	Correct	205 ms	2636 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	71 ms	596 KB	Output is correct
6	Correct	68 ms	348 KB	Output is correct
7	Correct	73 ms	348 KB	Output is correct

Subtask #7
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	115 ms	736 KB	Output is correct
2	Correct	187 ms	1500 KB	Output is correct
3	Correct	184 ms	1512 KB	Output is correct
4	Correct	13 ms	344 KB	Output is correct
5	Correct	89 ms	1496 KB	Output is correct
6	Correct	200 ms	8744 KB	Output is correct
7	Correct	90 ms	1604 KB	Output is correct

Subtask #8
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	265 ms	4564 KB	Output is correct
2	Correct	97 ms	344 KB	Output is correct
3	Correct	87 ms	348 KB	Output is correct
4	Correct	2 ms	344 KB	Output is correct
5	Correct	68 ms	448 KB	Output is correct
6	Correct	143 ms	4564 KB	Output is correct
7	Correct	84 ms	344 KB	Output is correct

Subtask #9
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	104 ms	348 KB	Output is correct
2	Correct	143 ms	992 KB	Output is correct
3	Correct	76 ms	348 KB	Output is correct
4	Correct	79 ms	348 KB	Output is correct
5	Correct	110 ms	1500 KB	Output is correct
6	Correct	71 ms	348 KB	Output is correct
7	Correct	217 ms	8640 KB	Output is correct

Subtask #10
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	309 ms	8656 KB	Output is correct
2	Correct	123 ms	348 KB	Output is correct
3	Correct	78 ms	344 KB	Output is correct
4	Correct	392 ms	8884 KB	Output is correct
5	Correct	112 ms	2520 KB	Output is correct
6	Correct	78 ms	344 KB	Output is correct
7	Correct	82 ms	600 KB	Output is correct

답안 #1082764

Compilation message