oj.uz

Submission #428687

# Submission time Handle Problem Language Result Execution time Memory
428687 2021-06-15T13:51:30 Z egekabas Packing Biscuits (IOI20_biscuits) C++14
33 / 100
 1000 ms 222520 KB 
#include "biscuits.h"
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<int, int> pii;
typedef pair<ld, ld> pld;
long long count_tastiness(long long x, std::vector<long long> a) {
	ll n = a.size();
	vector<vector<ll>> dp(n+1, vector<ll>(x+2));
	for(ll i = 0; i < n-1; ++i)
		if(a[i] >= x){
			a[i+1] += (a[i]-x)/2;
			a[i] -= (a[i]-x)/2*2;
		}
	dp[0][0] = 1;
	for(ll i = 0; i < n-1; ++i)
		for(ll j = 0; j <= x+1; ++j){
			ll curval = a[i]+j;
			dp[i+1][curval/2] += dp[i][j];
			if(curval >= x)
				dp[i+1][(curval-x)/2] += dp[i][j];
		}
	ll ans = 0;
	for(ll j = 0; j <= x; ++j){

		ans += dp[n-1][j]*((a[n-1]+j)/x+1);
	}
	return ans;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 288 KB Output is correct
2 Runtime error 3 ms 460 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

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 296 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

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 5000 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 1 ms 500 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 300 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 51 ms 5172 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 8 ms 980 KB Output is correct
13 Correct 56 ms 5120 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1091 ms 222520 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 288 KB Output is correct
2 Runtime error 3 ms 460 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -