제출 #1047057

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1047057		amirhoseinfar1385	Packing Biscuits (IOI20_biscuits)	C++17	33 / 100	24 ms	924 KiB

biscuits

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

long long count_tastiness(long long x, std::vector<long long> a) {
	int n=60;
	while((int)a.size()<n){
		a.push_back(0);
	}
	if(x<=10000){
		vector<long long>dp(x*3+10),fake(x*3+10);
		long long unnow=0;
		for(int i=0;i<n;i++){
			a[i]+=unnow;
			if(a[i]>x){
				unnow=a[i]-x;
				unnow/=2;
				a[i]-=unnow*2;
			}else{
				unnow=0;
			}
			//cout<<i<<" "<<a[i]<<endl;
		}
		dp[0]=1;
		for(int i=0;i<n;i++){
			for(int j=0;j<=x*3;j++){
				fake[j/2+a[i]]+=dp[j];
				if(j/2>=(x-a[i])){
					fake[j/2-(x-a[i])]+=dp[j];
				}
			}
			for(int j=0;j<=x*3;j++){
				swap(dp[j],fake[j]);
				fake[j]=0;
			}
		}
		long long mainres=0;
		for(int i=0;i<=x*3;i++){
			mainres+=dp[i];
		}
		return mainres;
	}else{
		return 0;
	}	
}

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