oj.uz

Submission #432451

# Submission time Handle Problem Language Result Execution time Memory
432451 2021-06-18T10:07:50 Z Hazem Packing Biscuits (IOI20_biscuits) C++14
21 / 100
 1000 ms 38836 KB 
#include "biscuits.h"
#include <bits/stdc++.h>
#define LL long long

using namespace std;

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

LL bt(int i,LL cur){

	if(i==60)
		return 1;

	if(dp.find({i,cur})!=dp.end())
		return dp[{i,cur}];

	LL ret = 0;
	ret += bt(i+1,(cur+a[i])/2);
	if(cur+a[i]>=x)
		ret += bt(i+1,(cur+a[i]-x)/2);
	
	return dp[{i,cur}] = ret;
}

long long count_tastiness(long long X, std::vector<long long> A) {
	
	x = X;a = A;
	while(a.size()<=60)
		a.push_back(0);

	LL ans = bt(0,0);
	dp.clear();
	return ans;
}

Subtask #1
9.0 / 9.0

# 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 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
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 204 KB Output is correct

Subtask #2
12.0 / 12.0

# 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 332 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 256 KB Output is correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 296 ms 21948 KB Output is correct
2 Correct 796 ms 11076 KB Output is correct
3 Execution timed out 1095 ms 17852 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1086 ms 38836 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 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 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
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 204 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 332 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 256 KB Output is correct
24 Correct 296 ms 21948 KB Output is correct
25 Correct 796 ms 11076 KB Output is correct
26 Execution timed out 1095 ms 17852 KB Time limit exceeded
27 Halted 0 ms 0 KB -