제출 #367175

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
367175		SeDunion	Packing Biscuits (IOI20_biscuits)	C++17	0 / 100	1081 ms	364 KiB

biscuits

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

ll count_tastiness(ll x, vector<ll> a) {
	ll ans = 0;
	auto b = a;
	int K = min((int)a.size(), 30);
	for (int y = 0 ; y <= (100000) / x ; ++ y) {
		bool ok = true;
		b = a;
		for (int rep = 0 ; rep < x ; ++ rep) {
			int cur = y;
			for (int j = K - 1 ; j >= 0 ; -- j) {
				int q = min(b[j], (ll)cur / (1 << j));
				b[j] -= q;
				cur -= (1 << j) * q;
			}
			if (cur != 0) {
				ok = false;
				break;
			}
		}
		if (ok) ans++;
	}
	return ans;
}

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