oj.uz

답안 #66061

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
66061 2018-08-09T13:16:34 Z bazsi700 Ice Hockey World Championship (CEOI15_bobek) C++14
40 / 100
 1000 ms 65764 KB 
#include <bits/stdc++.h>

using namespace std;
#define ll long long

//14:20
int n;
ll m;
ll c[45];
ll way[2150000];
unordered_map<ll,int> compr;
vector<ll> did;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m;
    for(int i = 0; i < n; i++) {
        cin >> c[i];
    }
    if(n <= 22) {
        ll ways = 0;
        for(int mask = 0; mask < (1<<n); mask++) {
            ll money = m;
            for(int i = 0; i < n; i++) {
                if(mask&(1<<i)) {
                    money-= c[i];
                }
            }
            if(money >= 0) {
                ways++;
            }
        }
        cout << ways;
    } else {
        ll ways = 0;
        int b1 = 20;
        for(int mask = 0; mask < (1<<b1); mask++) {
            ll money = m;
            for(int i = 0; i < b1; i++) {
                if(mask&(1<<i)) {
                    money-= c[i];
                }
            }
            if(money >= 0) {
                did.push_back(m-money);
            }
        }
        sort(did.begin(),did.end());
        int in = 1;
        ll prev = -1;
        for(ll el : did) {
            if(el != prev) {
                way[in]++;
                compr[el] = in++;
                prev = el;
            } else {
                way[in-1]++;
            }
        }
        cout << compr[did[did.size()/2]];
        return 0;
        for(int i = 1; i <= in; i++) {
            way[i]+=way[i-1];
        }
        for(int mask = 0; mask < (1<<(n-b1)); mask++) {
            ll money = m;
            for(int i = b1; i < n; i++) {
                if(mask&(1<<(i-b1))) {
                    money-= c[i];
                }
            }
            if(money >= 0) {
                auto it = upper_bound(did.begin(),did.end(),money);
                if(it != did.begin()) {
                    it--;
                    ways+= way[compr[*it]];
                }
            }
        }
        cout << ways;
    }
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 356 KB Output is correct
2 Correct 2 ms 432 KB Output is correct
3 Correct 2 ms 508 KB Output is correct
4 Correct 2 ms 584 KB Output is correct
5 Correct 2 ms 584 KB Output is correct
6 Correct 2 ms 616 KB Output is correct
7 Correct 2 ms 616 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 616 KB Output is correct
2 Correct 9 ms 744 KB Output is correct
3 Correct 11 ms 744 KB Output is correct
4 Correct 2 ms 744 KB Output is correct
5 Correct 7 ms 760 KB Output is correct
6 Correct 85 ms 760 KB Output is correct
7 Correct 13 ms 760 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 760 KB Output is correct
2 Correct 22 ms 760 KB Output is correct
3 Correct 8 ms 760 KB Output is correct
4 Correct 7 ms 760 KB Output is correct
5 Correct 85 ms 764 KB Output is correct
6 Correct 12 ms 764 KB Output is correct
7 Correct 12 ms 764 KB Output is correct

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 189 ms 9624 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 190 ms 10400 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 254 ms 24828 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1063 ms 65500 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1090 ms 65504 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 962 ms 65764 KB Output isn't correct
2 Halted 0 ms 0 KB -