제출 #1231476

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1231476		Trumling	Packing Biscuits (IOI20_biscuits)	C++20	0 / 100	1165 ms	2034708 KiB

biscuits

#include "biscuits.h"
//Trumling ©
//Αφόδευε υψηλά και ηγνάντει 
#include <bits/stdc++.h>
using namespace std; 
 
typedef long long ll;
#define pb push_back
#define F first
#define S second
#define enter cout<<'\n';
#define INF 99999999999999
#define MOD 1000000007
#define all(x) x.begin(),x.end()

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

	vector<vector<ll>>dp(122,vector<ll>(2*x,0));
	vector<ll>arr(122,0);

	for(int i=0;i<a.size();i++)
		arr[i]=a[i];
		
	queue<ll>q;
	for(int i=0;i<120;i++)
	{
		ll give=((arr[i]<x)?0:(arr[i]-x)/2);
		arr[i+1]+=give;
		arr[i]-=give*2;

		if(!arr[i])
			q.push(i);
	}

	dp[0][0]=1;
	for(int i=0;i<=120;i++)
		for(int j=0;j<2*x-arr[i]-1;j++)
		{
			if(j+arr[i]>=x)
				dp[i+1][(j+arr[i]-x)/2]+=dp[i][j];
			
			dp[i+1][(j+arr[i])/2]+=dp[i][j];
		}

	ll ans=0;
	for(int i=0;i<2*x;i++)
		ans+=dp[121][i];
	return ans;
}

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