제출 #1292693

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1292693		julia_08	Packing Biscuits (IOI20_biscuits)	C++20	9 / 100	1096 ms	584 KiB

biscuits

#include <bits/stdc++.h>
#include "biscuits.h"

using ll = long long;

using namespace std;

const int MAXN = 70;
const int MAXY = 2e5 + 1;

ll a[MAXN], b[MAXN];

int k;

bool brute(int y, ll x){

	for(int i=0; i<20; i++) b[i] = a[i];

	for(int i=0; i<20; i++){

		if(!(y & (1 << i))){
			b[i + 1] += b[i] / 2;
			continue;
		}

		if(b[i] < x) return false;

		b[i + 1] += (b[i] - x) / 2;

	}

	return true;

}

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

	k = (int) a_.size();

	for(int i=0; i<64; i++) a[i] = 0;

	for(int i=0; i<k; i++) a[i] = a_[i];

	ll ans = 0;

	for(int i=0; i<MAXY; i++) ans += brute(i, x);

	return ans;

}

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