oj.uz

답안 #882181

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
882181 2023-12-02T18:43:23 Z TB_ Ice Hockey World Championship (CEOI15_bobek) C++17
100 / 100
 171 ms 22472 KB 
#include <bits/stdc++.h>
using namespace std;

// #undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
// #pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
// #pragma GCC optimize ("unroll-loops")

// #pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
// #pragma GCC target("movbe")                                      // byte swap
// #pragma GCC target("aes,pclmul,rdrnd")                           // encryption
// #pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD

// #include <bits/extc++.h>
// using namespace __gnu_pbds;
// template<class T>using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// template<class T>using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define ll long long
#define INF ((ll)(1e9+7))
#define fo(i, n) for(ll i=0;i<((ll)n);i++)
#define deb(x) cout << #x << " = " << (x) << endl;
#define deb2(x, y) cout << #x << " = " << (x) << ", " << #y << " = " << (y) << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LSOne(S) ((S) & (-S))
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
inline int readint(){ int v = 0; char c; while((c = getchar()) != EOF && c != ' ' && c != '\n'){ v *= 10; v += c - '0'; } return v; }
inline int readintsigned() { int v = 0; int sign = 1; char c = getchar(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } return v * sign; }
inline string readstring() { string s; char c; while ((c = getchar()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } return s; }
template <class result_t=std::chrono::milliseconds,class clock_t=std::chrono::steady_clock,class duration_t = std::chrono::milliseconds>
auto since(std::chrono::time_point<clock_t, duration_t> const& start){return std::chrono::duration_cast<result_t>(clock_t::now() - start);}
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vpii> vvpii;
typedef vector<vpl> vvpl;

ll n, k;
vl v;
vl a, b;

void dp(int pos, int end, ll cost = 0){
    if(pos == end) {
        a.pb(cost);
        return;
    }
    dp(pos+1, end, cost);
    if(cost+v[pos]<=k) dp(pos+1, end, cost+v[pos]);
}

int main() {
    // cout << fixed << setprecision(20);
    // auto start = std::chrono::steady_clock::now(); // since(start).count()
    cin.tie(0)->sync_with_stdio(0);

    cin >> n >> k;
    v.reserve(n);
    fo(i, n){
        cin >> v[i];
    }

    dp(0, min(n, 20ll));
    swap(a, b);
    dp(20, max(n, 20ll));

    sort(all(a));
    sort(all(b));
    ll ans = 0, pos = ((ll)a.size())-1;
    for(auto &va : b){
        while(pos>=0 && a[pos]+va>k)pos--;
        ans +=pos+1;
    }
    cout << ans;

    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 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 5 ms 1500 KB Output is correct
2 Correct 2 ms 736 KB Output is correct
3 Correct 4 ms 992 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 2 ms 1096 KB Output is correct
6 Correct 79 ms 9224 KB Output is correct
7 Correct 1 ms 600 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 59 ms 8656 KB Output is correct
2 Correct 5 ms 988 KB Output is correct
3 Correct 4 ms 992 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 15 ms 4820 KB Output is correct
6 Correct 10 ms 1500 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 10040 KB Output is correct
2 Correct 86 ms 9672 KB Output is correct
3 Correct 165 ms 22472 KB Output is correct
4 Correct 85 ms 9676 KB Output is correct
5 Correct 40 ms 10700 KB Output is correct
6 Correct 64 ms 9084 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 9892 KB Output is correct
2 Correct 77 ms 10704 KB Output is correct
3 Correct 76 ms 12744 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 37 ms 10000 KB Output is correct
6 Correct 71 ms 10192 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 84 ms 9680 KB Output is correct
2 Correct 89 ms 10700 KB Output is correct
3 Correct 87 ms 10612 KB Output is correct
4 Correct 13 ms 2520 KB Output is correct
5 Correct 41 ms 10700 KB Output is correct
6 Correct 129 ms 21452 KB Output is correct
7 Correct 0 ms 344 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 127 ms 16844 KB Output is correct
2 Correct 81 ms 9420 KB Output is correct
3 Correct 80 ms 10704 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 43 ms 9168 KB Output is correct
6 Correct 128 ms 16844 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 9164 KB Output is correct
2 Correct 92 ms 9676 KB Output is correct
3 Correct 80 ms 9932 KB Output is correct
4 Correct 65 ms 9164 KB Output is correct
5 Correct 46 ms 10696 KB Output is correct
6 Correct 81 ms 9424 KB Output is correct
7 Correct 0 ms 344 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 166 ms 20940 KB Output is correct
2 Correct 84 ms 10700 KB Output is correct
3 Correct 77 ms 10192 KB Output is correct
4 Correct 171 ms 21624 KB Output is correct
5 Correct 56 ms 12744 KB Output is correct
6 Correct 83 ms 8912 KB Output is correct
7 Correct 1 ms 348 KB Output is correct