Submission #609397

#	Time	Username	Problem	Language	Result	Execution time	Memory
609397		inventiontime	Packing Biscuits (IOI20_biscuits)	C++17	9 / 100	1093 ms	340 KiB

biscuits

#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;

#define int ll
#define endl '\n' //comment for interactive

#define fast_io ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define pb push_back
#define re resize
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define loop(i, n) for(int i = 0; i < n; i++)
#define loop1(i, n) for(int i = 1; i <= n; i++)
#define print(x) cout << #x << ": " << x << endl << flush

typedef long long ll;
typedef vector<int> vi;
typedef array<int, 2> ii;
typedef array<int, 3> ti;
typedef vector<ii> vii;
typedef vector<ti> vti;
typedef priority_queue<int> pq;

template<class T> bool ckmin(T&a, T b) { bool B = a > b; a = min(a, b); return B; }
template<class T> bool ckmax(T&a, T b) { bool B = a < b; a = max(a, b); return B; }

const int inf = 1e17;
//const int maxn = ;

ll count_tastiness(ll x, vector<ll> a) {

    int res = 1;
    int k = a.size();

    loop(_, 20-k) a.pb(0);

    int sum = 0;
    loop(i, k) 
        sum += a[i] * (1 << i);
    loop1(val, sum/x) {
        bitset<20> v(val);
        int tot = 0;
        bool possible = true;
        loop(i, 20) {
            tot += a[i] * (1 << i);
            tot -= x * v[i] * (1 << i);
            if(tot < 0) possible = false;
        }
        if(possible) res++;
    }

	return res;

}

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