Submission #825377

#	Time	Username	Problem	Language	Result	Execution time	Memory
825377		Lobo	Packing Biscuits (IOI20_biscuits)	C++17	21 / 100	1086 ms	63336 KiB

biscuits

#include "biscuits.h"
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define fr first
#define sc second

int x;
vector<int> a;
vector<map<int,int>> dp;

int sol(int i, int q) {
	if(dp[i].count(q)) return dp[i][q];

	// cout << i << " " << q << " " << a[i] << endl;

	if(i == 60) return dp[i][q] = 1;
	return dp[i][q] = sol(i+1,(q+a[i])/2) + (q+a[i] >= x ? sol(i+1,(q+a[i]-x)/2) : 0);
}


long long count_tastiness(long long X, std::vector<long long> A) {

	x = X;
	a.clear(); a.resize(61,0);
	for(int i = 0; i < A.size(); i++) a[i] = A[i];
	dp.clear(); dp.resize(61);
	return sol(0,0);
}

Compilation message (stderr)

biscuits.cpp: In function 'long long int count_tastiness(long long int, std::vector<long long int>)':
biscuits.cpp:28:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |  for(int i = 0; i < A.size(); i++) a[i] = A[i];
      |                 ~~^~~~~~~~~~

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