Submission #400002

# Submission time Handle Problem Language Result Execution time Memory
400002 2021-05-07T03:29:52 Z faresbasbs Packing Biscuits (IOI20_biscuits) C++14
21 / 100
1000 ms 52564 KB
#include <bits/stdc++.h>
#include "biscuits.h"
using namespace std;
map<pair<int,long long>,long long> dp;
vector<long long> a;
long long x;

long long ans(long long curr , long long val){
	if(curr == a.size()){
		return 1;
	}
	val += a[curr];
	if(dp.find({curr,val}) != dp.end()){
		return dp[{curr,val}];
	}
	long long ret = ans(curr+1,val/2);
	if(val >= x){
		ret += ans(curr+1,(val-x)/2);
	}
	return dp[{curr,val}] = ret;
}

long long count_tastiness(long long X , vector<long long> A){
	dp.clear();
	a = A , x = X;
	while(a.size() < 60){
		a.push_back(0ll);
	}
	return ans(0,0);
}

Compilation message

biscuits.cpp: In function 'long long int ans(long long int, long long int)':
biscuits.cpp:9:10: 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]
    9 |  if(curr == a.size()){
      |     ~~~~~^~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 262 ms 21908 KB Output is correct
2 Correct 561 ms 11200 KB Output is correct
3 Correct 954 ms 17868 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Execution timed out 1090 ms 22516 KB Time limit exceeded
9 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1095 ms 52564 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 262 ms 21908 KB Output is correct
25 Correct 561 ms 11200 KB Output is correct
26 Correct 954 ms 17868 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 208 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Execution timed out 1090 ms 22516 KB Time limit exceeded
32 Halted 0 ms 0 KB -