Submission #400009

#	Time	Username	Problem	Language	Result	Execution time	Memory
400009		faresbasbs	Packing Biscuits (IOI20_biscuits)	C++14	9 / 100	1096 ms	3456 KiB

biscuits

#include <bits/stdc++.h>
#include "biscuits.h"
using namespace std;
long long x,cnt,arr1[200001],arr2[200001];
vector<long long> a;
 
long long count_tastiness(long long X , vector<long long> A){
	a = A , x = X;
	while(a.size() < 60){
		a.push_back(0ll);
	}
	memset(arr1,-1,sizeof arr1);
	arr1[0] = 0;
	for(int i = 0 ; i < 60 ; i += 1){
		memset(arr2,-1,sizeof arr2);
		cnt = 0;
		for(int j = 0 ; j <= 200000 ; j += 1){
			if(arr1[j] == -1){
				break;
			}
			int p = arr1[j]+a[i];
			arr2[cnt++] = p/2;
			if(p >= x){
				arr2[cnt++] = (p-x)/2;
			}
		}
		swap(arr1,arr2);
	}
	long long ret = 0;
	for(int i = 0 ; i <= 200000 ; i += 1){
		if(arr1[i] == -1){
			break;
		}
		ret += 1;
	}
	return ret;
}

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