oj.uz

Submission #623644

# Submission time Handle Problem Language Result Execution time Memory
623644 2022-08-06T08:01:33 Z Jomnoi Packing Biscuits (IOI20_biscuits) C++17
0 / 100
 1000 ms 596 KB 
#include <bits/stdc++.h>
#include "biscuits.h"
using namespace std;

const int MAX_N = 1e5 + 5;

int K;
long long X, ans;
bool dp[2][MAX_N];

long long count_tastiness(long long x, vector <long long> a) {
	ans = 0;
	for(int i = 0; i <= 100000; i++) {
		dp[0][i] = dp[1][i] = false;
	}

	X = x, K = a.size();
	dp[1][0] = true;
	for(int i = 0; i < K; i++) {
		int now = i % 2, pre = now ^ 1;
		for(int j = a[i]; j >= 0; j--) {
			for(int k = 100000; k >= (1ll<<i) * j; k--) {
				dp[now][k] |= dp[pre][k - (1ll<<i) * j];
			}
		}
	}

	for(int i = 0; i <= 100000; i += x) {
		ans += dp[(K - 1) % 2][i];
	}
	return ans;
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 12.0

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

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1078 ms 468 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 596 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

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