oj.uz

Submission #377789

# Submission time Handle Problem Language Result Execution time Memory
377789 2021-03-15T05:52:51 Z autumn_eel Packing Biscuits (IOI20_biscuits) C++14
21 / 100
 1000 ms 492 KB 
#include "biscuits.h"

#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<int(n);i++)
using namespace std;
typedef long long ll;

long long count_tastiness(long long x, std::vector<long long> a) {
	if(x==1){
		a.resize(61);
		vector<map<ll,ll>>dp(61);
		dp[0][0]=1;
		rep(i,60){
			for(auto&p:dp[i]){
				ll c=p.first+a[i];
				//use
				if(c)dp[i+1][(c-1)/2]+=p.second;
				//don't use
				dp[i+1][c/2]+=p.second;
			}
		}
		ll ans=0;
		for(auto&p:dp[60]){
			ans+=p.second;
		}
		return ans;
	}
	ll sum=0;
	rep(i,a.size()){
		sum+=(1LL<<i)*a[i];
	}
	ll ans=0;
	for(ll i=0;i<=sum;i++){
		auto b=a;
		b.resize(61);
		bool ok=true;
		for(int j=0;j<60;j++){
			if(i>>j&1){
				if(b[j]<x){ok=false;break;}
				b[j]-=x;
			}
			b[j+1]+=b[j]/2;
		}
		if(ok)ans++;
	}
	return ans;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 84 ms 364 KB Output is correct
3 Correct 40 ms 364 KB Output is correct
4 Correct 63 ms 364 KB Output is correct
5 Correct 17 ms 364 KB Output is correct
6 Correct 154 ms 364 KB Output is correct
7 Correct 10 ms 364 KB Output is correct
8 Correct 155 ms 364 KB Output is correct
9 Correct 18 ms 364 KB Output is correct
10 Correct 108 ms 364 KB Output is correct
11 Correct 18 ms 364 KB Output is correct
12 Correct 176 ms 364 KB Output is correct
13 Correct 157 ms 492 KB Output is correct
14 Correct 124 ms 492 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct

Subtask #3
0 / 21.0

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

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1090 ms 364 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 364 KB Output is correct
2 Correct 84 ms 364 KB Output is correct
3 Correct 40 ms 364 KB Output is correct
4 Correct 63 ms 364 KB Output is correct
5 Correct 17 ms 364 KB Output is correct
6 Correct 154 ms 364 KB Output is correct
7 Correct 10 ms 364 KB Output is correct
8 Correct 155 ms 364 KB Output is correct
9 Correct 18 ms 364 KB Output is correct
10 Correct 108 ms 364 KB Output is correct
11 Correct 18 ms 364 KB Output is correct
12 Correct 176 ms 364 KB Output is correct
13 Correct 157 ms 492 KB Output is correct
14 Correct 124 ms 492 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Execution timed out 1084 ms 364 KB Time limit exceeded
25 Halted 0 ms 0 KB -