제출 #1082819

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1082819		beaconmc	Packing Biscuits (IOI20_biscuits)	C++14	42 / 100	1037 ms	50016 KiB

biscuits

#include "biscuits.h"
#include <bits/stdc++.h>
 
typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
 
using namespace std;


vector<ll> A(200);
ll X;

unordered_map<ll,unordered_map<ll,ll>> dps;

ll cnt = 0;
ll dp(ll pos, ll add){
	cnt++;

	if (dps[pos].count(add)) return dps[pos][add];
	if (pos>200) return 1;

	ll temp = 0;
	if (add==0){
		ll cur = 0;
		while (cur <= X && cur <= A[pos]){
			temp += dp(pos+1, (A[pos]-cur)/2);
			cur += X;
		}

	}else{
		ll idk = (A[pos] + add);
		ll cur = 0;
		while (cur <= X && cur <= idk){
			temp += dp(pos+1, (idk-cur)/2);
			cur += X;
		}
	}
	dps[pos][add] = temp;
	return temp;

}
long long count_tastiness(long long x, std::vector<long long> a) {
	X = x;
	FOR(i,0,200) A[i] = 0;
	dps.clear();

	FOR(i,0,a.size()) A[i] = a[i];
	FOR(i,0,199){
		bool flag = false;
		if (A[i]>=X) A[i]-=X, flag = true;
		if (!flag) continue;
		A[i+1] += A[i]/2;
		A[i] = A[i]%2;
		if (flag) A[i] += X;
	}





	// cout << dp(0,0) << endl;
	// cout << cnt << endl;

	return dp(0,0);


}

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

biscuits.cpp: In function 'long long int count_tastiness(long long int, std::vector<long long int>)':
biscuits.cpp:5:33: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | #define FOR(i,x,y) for(ll i=x; i<y; i++)
......
   48 |  FOR(i,0,a.size()) A[i] = a[i];
      |      ~~~~~~~~~~~~                
biscuits.cpp:48:2: note: in expansion of macro 'FOR'
   48 |  FOR(i,0,a.size()) A[i] = a[i];
      |  ^~~

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