제출 #1303861

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

biscuits

#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;
long long count_tastiness(long long x, std::vector<long long> a) {
	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]; 
	f0r(i,n)p[i]/=x; 
	vi ans; if(p[0]==0)ans.pb(0); else ans.pb(0),ans.pb(1); 
	FOR(i,1,n){
		if(p[i]==p[i-1])break; int c = ans.size(); f0r(j,c){
			if(ans[j] + p2(i) <= p[i])ans.pb(ans[j] + p2(i)); 
			else break; 
		}
		// if(p[i] < p2(i)){
			// while(!ans.empty() && ans.back() > p[i])ans.pop_back(); 
		// }
		// else{
			// int c = ans.size(); f0r(j,c){
				// if(ans[j] + p2(i) <= p[i])ans.pb(ans[j] + p2(i)); 
				// else break; 
			// }
		// }
		// vout(ans); 
	}
	
	return ans.size();
	return 0;
}

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