oj.uz

답안 #250520

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
250520 2020-07-18T08:57:44 Z Vladikus004 San (COCI17_san) C++14
0 / 120
 351 ms 8896 KB 
#include <bits/stdc++.h>
#define inf 2e9
#define int long long
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;

const int N = 41;
int n, h[N], g[N];
ll k;
vector <ll> v1[21], v2[21];

bool can(int mask){
    int mx = -inf;
    for (int i = 0; i < n; i++){
        if (!(mask & (1LL<<i))) continue;
        if (mx > h[i]) return false;
        mx = h[i];
    }
    return true;
}

ll get_sum(int mask){
    ll sum = 0;
    for (int i = 0; i < n; i++){
        if (!(mask & (1LL<<i))) continue;
        sum += g[i];
    }
    return sum;
}

int f(int x, int sz){
    int cnt = 0;
    for (int i = sz - 1; i >= 0; i--){
        if ((1LL<<i)&x) return cnt;
        cnt++;
    }
}

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    #ifdef LOCAL
        freopen("input.txt", "r", stdin);
    #endif // LOCAL
//    cout << __builtin_ctz(4) << "\n";
    cin >> n >> k;
    for (int i = 0; i < n; i++){
        cin >> h[i] >> g[i];
    }
    if (n & 1){
        h[n] = inf;
        ++n;
    }
    int ans = 0;
    int sz = n / 2;
    for (int mask = 1; mask < (1LL<<sz); mask++){
        if (can(mask)){
            ll sum = get_sum(mask);
            v1[f(mask, sz)].push_back(sum);
            if (sum >= k)
            ans += 1;
        }
    }
    for (int mask = 1; mask < (1LL<<sz); mask++){
        int cmask = mask<<sz;
        if (can(cmask)){
            ll sum = get_sum(cmask);
            v2[__builtin_ctz(cmask) - sz].push_back(sum);
            if (sum >= k)
            ans += 1;
        }
    }
    for (int i = 0; i < sz; i++){
        for (int g = 0; g < sz; g++){
            if (h[sz - 1 - i] > h[g + sz]) continue;
            for (int j = 0; j < v1[i].size(); j++){
//                cout << i << " : " << v1[i][j] << "\n";
                ans += v2[g].size()-(lower_bound(all(v2[g]), k - v1[i][j])-v2[g].begin());
            }
        }
    }
    cout << ans;
}

Compilation message

san.cpp: In function 'int32_t main()':
san.cpp:80:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for (int j = 0; j < v1[i].size(); j++){
                             ~~^~~~~~~~~~~~~~
san.cpp: In function 'long long int f(long long int, long long int)':
san.cpp:40:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
0 / 24.0

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

Subtask #2
0 / 24.0

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

Subtask #3
0 / 24.0

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

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 1808 KB Output is correct
2 Incorrect 52 ms 760 KB Output isn't correct

Subtask #5
0 / 24.0

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