oj.uz

Submission #371273

# Submission time Handle Problem Language Result Execution time Memory
371273 2021-02-26T10:31:08 Z pit4h Packing Biscuits (IOI20_biscuits) C++14
0 / 100
 1 ms 364 KB 
#include "biscuits.h"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 2e18+1;

ll count_tastiness(ll x, vector<ll> a) {
	int k = a.size();
	vector<ll> dp(k), dp0(k), pref(k);
	pref[0] = a[0];
	for(int i=1; i<k; ++i) {
		pref[i] = pref[i-1]/2 + a[i];
	}
	for(int i=0; i<k; ++i) {
		if(i>0) {
			dp0[i] = dp[i-1];
		}
		else {
			dp0[i] = 1;
		}
		ll sum = 0;
		dp[i] = 1;
		for(int j=i; j>=0; --j) {
			if(pref[j] - sum >= x) {
				dp[i] += dp0[j];
				if(sum + x < INF/2) {
					sum += max(0LL, x - a[j]);
					sum *= 2;
				}
				else {
					sum = INF;
				}
			}
			else {
				if(sum < INF/2) sum *= 2;
				else sum = INF;
			}
		}
	}
	return dp[k-1];
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 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 364 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 364 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 364 KB Output isn't correct
2 Halted 0 ms 0 KB -