oj.uz

Submission #835162

# Submission time Handle Problem Language Result Execution time Memory
835162 2023-08-23T09:38:31 Z DJeniUp Packing Biscuits (IOI20_biscuits) C++17
0 / 100
 1 ms 340 KB 
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

#define pb push_back
#define fr first
#define sc second

ll res,n,d[67],k;

void S(ll x,ll y){
	if(x==n){
		res++;
		return ;
	}
	y+=d[x]*(1ll<<x);
	if(k*(1ll<<x)<=y){
		S(x+1,y-k*(1ll<<x));
	}
	S(x+1,y);
	return ;
}

long long count_tastiness(long long x, std::vector<long long> a) {
	res=0;
	n=a.size();
	k=x;
	for(int i=0;i<n;i++){
		d[i]=a[i];
	}
	S(0,0);
	return res;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 296 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -