제출 #308355

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
308355		4fecta	비스킷 담기 (IOI20_biscuits)	C++14	0 / 100	2 ms	384 KiB

biscuits

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

#define ll long long
#define int ll
#define ld long double
#define pii pair<int, int>
#define f first
#define s second
#define readl(_s) getline(cin, (_s));
#define boost() cin.tie(0); cin.sync_with_stdio(0)

const int MN = 65;

int k, dp[MN], psa[MN];

int count_tastiness(int x, vector<int> a) {
    k = a.size();
    memset(dp, 0, sizeof(dp));
    memset(psa, 0, sizeof(psa));
    psa[0] = a[0];
    for (int i = 1; i < k; i++) {
        psa[i] = a[i] * (1 << i) + psa[i - 1];
        //printf("%d\n", psa[i]);
    }
    set<int> ans;
    ans.insert(0);
    if (psa[0] >= x) ans.insert(1);
    for (int i = 0; i < 30; i++) {
        vector<int> tmp;
        for (int val : ans) {
            int y = val + (1 << i);
            //printf("%d\n", y);
            if (psa[i] >= x * y) tmp.push_back(y);
        }
        for (int p : tmp) ans.insert(p);
    }
    /*for (int i = 1; i <= 1000000; i++) {
        int b = 0;
        for (int s = 0; s < 30; s++) if (i & (1 << s)) b = s;
        if (psa[b] >= x * i && ans.count(i - (1 << b))) ans.insert(i);
    }*/
    return ans.size();
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 12
• Subtask 3: 0 / 21
• Subtask 4: 0 / 35
• Subtask 5: 0 / 23