oj.uz

Submission #696083

# Submission time Handle Problem Language Result Execution time Memory
696083 2023-02-05T11:20:06 Z garam1732 Packing Biscuits (IOI20_biscuits) C++14
21 / 100
 99 ms 1356 KB 
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
priority_queue<ll> pq;
ll cnt[100];

long long count_tastiness(long long x, std::vector<long long> a) {
	if(x == 1) {
        for(int i = (int)a.size()-1; i > 0; i--) if(a[i-1]) a[i-1] += 2*a[i], a[i] = 0;

        ll res = 1;
        for(ll x : a) res *= (x+1);
        return res;
	}

	while(a.size() > 17) a.pop_back();
	if(x > 100000) return 1;

	ll ans = 1;
	for(int v = 1; v <= 100000/x; v++) {
        while(pq.size()) pq.pop();
        for(int i = 0; i < x; i++) pq.push(v);

        vector<ll> b = a;
        for(int i = (int)b.size()-1; i >= 0; i--) {
            while(b[i] && pq.size() && pq.top() >= (1<<i)) {
                ll y = pq.top(); pq.pop();
                int z = min(b[i], y/(1<<i));
                b[i] -= z, y -= z*(1<<i);
                if(y) pq.push(y);
            }
        }

        if(pq.empty()) ans++;
	}

	return ans;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 18 ms 292 KB Output is correct
4 Correct 32 ms 272 KB Output is correct
5 Correct 20 ms 304 KB Output is correct
6 Correct 52 ms 212 KB Output is correct
7 Correct 14 ms 212 KB Output is correct
8 Correct 48 ms 212 KB Output is correct
9 Correct 26 ms 296 KB Output is correct
10 Correct 21 ms 1356 KB Output is correct
11 Correct 44 ms 544 KB Output is correct
12 Correct 99 ms 280 KB Output is correct
13 Correct 84 ms 300 KB Output is correct
14 Correct 93 ms 280 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct

Subtask #3
0 / 21.0

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

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 19 ms 984 KB Output isn't correct
2 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 0 ms 212 KB Output is correct
3 Correct 18 ms 292 KB Output is correct
4 Correct 32 ms 272 KB Output is correct
5 Correct 20 ms 304 KB Output is correct
6 Correct 52 ms 212 KB Output is correct
7 Correct 14 ms 212 KB Output is correct
8 Correct 48 ms 212 KB Output is correct
9 Correct 26 ms 296 KB Output is correct
10 Correct 21 ms 1356 KB Output is correct
11 Correct 44 ms 544 KB Output is correct
12 Correct 99 ms 280 KB Output is correct
13 Correct 84 ms 300 KB Output is correct
14 Correct 93 ms 280 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Incorrect 35 ms 468 KB Output isn't correct
25 Halted 0 ms 0 KB -