oj.uz

Submission #829090

# Submission time Handle Problem Language Result Execution time Memory
829090 2023-08-18T03:47:31 Z definitelynotmee Packing Biscuits (IOI20_biscuits) C++17
0 / 100
 1000 ms 1148 KB 
#include "biscuits.h"
// #include"grader.cpp"
#include<bits/stdc++.h>
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using pii = pair<int,int>;

vector<ll> ct, v;

ll solve(int id, ll carry, ll x){
	if(id == -1)
		return 1;

	
	ll minus = min(v[id], carry);
	carry-=minus;
	ll ret = solve(id-1,carry*2,x);
	// cerr << id << ' ' << carry << ' ' << x << endl;
	// cerr << "->" << carry+x << ' ' << ct[id] << ' ' << minus << endl;
	if(carry+x <= ct[id]-minus)
		ret += solve(id-1, (max(0ll, x+carry-v[id]))*2, x);
	return ret;
}

long long count_tastiness(long long x, std::vector<long long> a) {
	a.resize(60,0);
	ct = v = a;
	int k = a.size();

	for(int i = 1; i < k; i++){
		ct[i]+=ct[i-1]/2;
	}

	return solve(k-1,0,x);
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 1 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Execution timed out 1073 ms 212 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

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

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 376 ms 392 KB Output is correct
2 Execution timed out 1084 ms 1148 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 1 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -