Submission #415505

#	Time	Username	Problem	Language	Result	Execution time	Memory
415505		MKopchev	Packing Biscuits (IOI20_biscuits)	C++14	42 / 100	1090 ms	43456 KiB

biscuits

#include "biscuits.h"
#include<bits/stdc++.h>
using namespace std;

const int nmax=64;

long long inp[nmax],mem_x;

unordered_map<long long,long long> seen[nmax];

long long rec(int bit,long long high)
{
    if(bit==60)return 1;

    high=high+inp[bit];

    if(seen[bit].count(high))return seen[bit][high];

    long long ret=0;
    //0
    ret=ret+rec(bit+1,high/2);
    //1
    if(high>=mem_x)ret=ret+rec(bit+1,(high-mem_x)/2);

    seen[bit][high]=ret;

    //cout<<"f "<<bit<<" , "<<high<<" = "<<ret<<endl;

    return ret;
}
long long count_tastiness(long long x, std::vector<long long> a) {
    mem_x=x;

	for(int i=0;i<60;i++)
    {
        seen[i]={};
        inp[i]=0;
    }
    for(int i=0;i<a.size();i++)inp[i]=a[i];

    long long ret=rec(0,0);

    //for(int i=0;i<59;i++)cout<<i<<" -> "<<seen[i].size()<<endl;

    return ret;
}
/*
int main() {
	int q;
	assert(scanf("%d", &q) == 1);
	vector<int> k(q);
	vector<long long> x(q);
	vector<vector<long long>> a(q);
	vector<long long> results(q);
	for (int t = 0; t < q; t++) {
		assert(scanf("%d%lld", &k[t], &x[t]) == 2);
		a[t] = vector<long long>(k[t]);
		for (int i = 0; i < k[t]; i++) {
			assert(scanf("%lld", &a[t][i]) == 1);
		}
	}
	fclose(stdin);

	for (int t = 0; t < q; t++) {
		results[t] = count_tastiness(x[t], a[t]);
	}
	for (int t = 0; t < q; t++) {
		printf("%lld\n", results[t]);
	}
	fclose(stdout);
	return 0;
}
*/

Compilation message (stderr)

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

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