Submission #1303865

#TimeUsernameProblemLanguageResultExecution timeMemory
1303865thelegendary08비스킷 담기 (IOI20_biscuits)C++17
100 / 100
57 ms960 KiB
#include "biscuits.h"
#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define f0r(i,n) for(int i = 0; i<n; i++)
#define FOR(i, k, n) for(int i = k; i<n; i++)
#define dout(x) cout<<x<<' '<<#x<<'\n';
#define vout(x) for(auto u : x)cout<<u<<' '; cout<<'\n';
#define vb vector<bool>
#define p2(x) (1LL << (x))
using namespace std;
vi p; map<int,int> mem; 
int mb(int x){
	int ret = 0; f0r(i,60)if(p2(i) & x)ret = i; if(p2(ret)==x)return ret-1; return ret; 
}
int f(int x){
	// dout(x);
	if(mem.count(x))return mem[x]; 
	if(x==1)return 1; if(x<=0)return 0; 
	int msb = mb(x); int ans = f(p2(msb)) + f(min(x - p2(msb), p[msb] + 1 - p2(msb))); 
	mem[x] = ans; return ans; 
}
long long count_tastiness(long long x, std::vector<long long> a) {
	mem.clear(); 
	while(a.size() < 60)a.pb(0); int n = a.size();
	p.resize(n); p[0] = a[0]; FOR(i,1,n)p[i] = p[i-1] + (1LL << i) * a[i]; int mx = p.back(); 
	f0r(i,n)p[i]/=x; 
	return f(mx+1); 
	return 0;
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...