제출 #356845

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
356845		Kerim	비스킷 담기 (IOI20_biscuits)	C++17	21 / 100	1087 ms	492 KiB

biscuits

#include "biscuits.h"
#include "bits/stdc++.h"
#define ff first
#define ss second
using namespace std;
 
typedef long long ll;
ll X,tmp;vector<ll>a;
map<ll,ll>dp[61];
ll rec(int pos,ll cur){
	if(pos==61)return 1;
	if(dp[pos].find(cur)!=dp[pos].end())return dp[pos][cur];
	ll &ret=dp[pos][cur];
	ret=rec(pos+1,(cur+a[pos])/2);
	if(a[pos]+cur>=X)ret+=rec(pos+1,(a[pos]+cur-X)/2);
  	__typeof((dp[pos]).begin())it=dp[pos].upper_bound(cur),itt;
	if(it!=dp[pos].end() and it->ss==ret){
		itt=it;itt++;
		if(itt!=dp[pos].end() and itt->ss==ret)
			dp[pos].erase(it);
	}it--;
	if(it!=dp[pos].begin()){it--;
		if(it->ss==ret){itt=it;
			if(itt!=dp[pos].begin()){itt--;
				if(itt->ss==ret)dp[pos].erase(it);
			}
		}
	}
	return ret;
}
long long count_tastiness(long long x, vector<long long> A) {X=x;a=A;
	for(int i=0;i<61;i++)dp[i].clear();
	while(int(a.size())<61)a.push_back(0);
	for(int i=0;i<60;i++)if(a[i]>x)tmp=(a[i]-x)/2,a[i+1]+=tmp,a[i]-=tmp<<1;	
	return rec(0,0);
}

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