제출 #697130

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
697130		sunwukong123	비스킷 담기 (IOI20_biscuits)	C++14	42 / 100	1087 ms	75108 KiB

biscuits

#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long 
#define FOR(i,s,e) for(int i = s; i <= (int)e; ++i)
#define DEC(i,s,e) for(int i = s; i >= (int)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
#define db(x) cerr << #x << "=" << x << "\n"
#define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n"
#define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n"
#define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n"
#define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{"  << ite.f << ',' << ite.s << "} "; cerr << "\n"
#define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n"
#define reach cerr << "LINE: " << __LINE__ << "\n";
#else
#define reach 
#define db(x)
#define db2(x,y)
#define db3(a,b,c)
#define dbv(v)
#define dbvp(v)
#define dba(a,ss,ee)
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define f first 
#define s second
#define g0(x) get<0>(x)
#define g1(x) get<1>(x)
#define g2(x) get<2>(x)
#define g3(x) get<3>(x)
typedef pair <int, int> pi;
typedef tuple<int,int,int> ti3;
typedef tuple<int,int,int,int> ti4;
int rand(int a, int b) { return a + rng() % (b-a+1); }
const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 500;
const long long oo = (long long)1e18 + 500;
template <typename T> bool chmax(T& a, const T b) { return a<b ? a = b, 1 : 0; }
template <typename T> bool chmin(T& a, const T b) { return a>b ? a = b, 1 : 0; }
const int MAXN = -1;

map<int,int> dp[130]; // dp[index done][number of free things carried over] = number of ways
int k;
int l;
int X;

int ans;
map<int,int> memo;
int need[125]; // how many carry i need at this bit at least, to make sense
int diff[125];
vector<int> V;
bool cont(int idx, int carry) {
	// is it possible for this to be part of the ans?
	FOR(i,idx+1,124) {
		carry/=2;
		int d=diff[i];
		if(d>=0)return 1;
		else {
			int mi=-d; // things that i need. 

			if(carry >= mi)return 1;
			else return cont(idx+1, 0);
		}
	}
}
long long count_tastiness(long long X, std::vector<long long> vec) {
	V=vector<int>(125,0);
	memset(need,0,sizeof need);
	memset(diff,0,sizeof diff);
	::X=X;
	V=vec;
	l=V.size();
	FOR(i,0,l-1)V[i]=vec[i];
	FOR(i,0,124)dp[i].clear();
	dp[0][0]=1;
	FOR(i,0,124) {
		diff[i] = vec[i] - X;
	}


	ans=1;
	FOR(i,0,124) {
		for(auto j:dp[i]) {
			// have this bit turned: on 
			if(j.f + V[i] >= X) { // turned on
				
				ans+=j.s;
				int carry = j.f+V[i]-X;
				carry/=2;
				dp[i+1][carry] += j.s;
			} 
			// have this bit turned: off
			// check if this is even possible? 
			int carry = j.f+V[i];
			carry/=2;
			if(cont(i+1,carry))dp[i+1][carry] += j.s;
			
			
		}
	}



	return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

biscuits.cpp: In function 'bool cont(long long int, long long int)':
biscuits.cpp:69:1: warning: control reaches end of non-void function [-Wreturn-type]
   69 | }
      | ^

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