Submission #309697

#	Time	Username	Problem	Language	Result	Execution time	Memory
309697		georgerapeanu	Packing Biscuits (IOI20_biscuits)	C++17	0 / 100	1098 ms	16528 KiB

biscuits

#include "biscuits.h"
#include <vector>
#include <algorithm>
#include <unordered_map>

using namespace std;


long long count_tastiness(long long x, vector<long long> a) {

    unordered_map<long long,long long> mp;

    mp[0] = 1;

    for(int i = 0;i < (int)a.size() || (int)mp.size() > 1;i++){
        unordered_map<long long,long long> tmp;
        for(auto it2:mp){
            pair<long long,long long> it = it2;
            if(i < (int)a.size()){
                it.first += a[i];
            }
            tmp[it.first / 2] += it.second;
            if(it.first >= x){
                tmp[(it.first - x) / 2] += it.second;
            }
        }
        mp.swap(tmp);
    }

	return mp[0];
}

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