제출 #1051634

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1051634		aykhn	비스킷 담기 (IOI20_biscuits)	C++17	0 / 100	1067 ms	348 KiB

biscuits

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

using namespace std;

long long x, k;
vector<long long> a, pre;

long long count_tastiness(long long X, vector<long long> A) 
{
	x = X, a = A, k = A.size();
	long long res = 0;
	for (long long y = 0; y <= 100000; y++)
	{
		a = A;
		pre = a;
		for (long long j = 1; j < k; j++) 
		{
			pre[j] = (pre[j] << j) + pre[j - 1];
		}
		// if (y * x > pre[k - 1]) continue;
		long long f = 1;
		for (long long i = 60; i >= 0; i--)
		{
			if (!(y >> i & 1)) continue;
			vector<long long> pre = a;
			for (long long j = 1; j < k; j++) 
			{
				pre[j] = (pre[j] << j) + pre[j - 1];
			}
			long long need = X;
			for (long long j = i; j >= 0; j--)
			{
				// if (need > pre[min(k - 1, j)]) break;
				if (j <= k - 1)
				{
					long long mn = min(need, a[j]);
					need -= mn, a[j] -= mn;
				}
				need <<= 1;
			}
			if (need) 
			{
				f = 0;
				break;
			}
		}
		res += f;
	}
	return res;
}

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