oj.uz

Submission #394846

# Submission time Handle Problem Language Result Execution time Memory
394846 2021-04-27T11:04:18 Z snasibov05 Packing Biscuits (IOI20_biscuits) C++14
9 / 100
 1000 ms 332 KB 
#include "biscuits.h"

#define int long long

using namespace std;

const int kmax = 65;
const int ymax = 1e5;

vector<int> getBinary(int n){
    vector<int> bin(kmax);
    int k = 0;
    while (n > 0){
        if (n % 2) bin[k] = 1;
        k++;
        n /= 2;
    }
    return bin;
}

bool possible(int x, int y, vector<int> avail){
    vector<int> bin = getBinary(y);

    for (int i = kmax-1; i >= 0; --i) {
        bin[i] *= x;
    }

    for (int i = 0; i < kmax-1; ++i) {
        if (bin[i] > avail[i]) return false;
        avail[i] -= bin[i];
        avail[i+1] += avail[i] / 2;
    }

    return true;
}

int count_tastiness(int x, vector<int> a) {
    int ans = 0;

    vector<int> avail(kmax);
    for (int i = a.size()-1; i >= 0; --i) {
        avail[i] = a[i];
    }

    for (int i = 0; i <= ymax; ++i) {
        if (possible(x, i, avail)) ans++;
    }

	return ans;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 249 ms 256 KB Output is correct
2 Correct 247 ms 264 KB Output is correct
3 Correct 242 ms 264 KB Output is correct
4 Correct 259 ms 260 KB Output is correct
5 Correct 242 ms 324 KB Output is correct
6 Correct 298 ms 268 KB Output is correct
7 Correct 265 ms 204 KB Output is correct
8 Correct 277 ms 264 KB Output is correct
9 Correct 280 ms 268 KB Output is correct
10 Correct 242 ms 268 KB Output is correct
11 Correct 244 ms 324 KB Output is correct
12 Correct 259 ms 264 KB Output is correct
13 Correct 253 ms 284 KB Output is correct
14 Correct 244 ms 276 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 254 ms 208 KB Output is correct
2 Incorrect 179 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

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

Subtask #4
0 / 35.0

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

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 249 ms 256 KB Output is correct
2 Correct 247 ms 264 KB Output is correct
3 Correct 242 ms 264 KB Output is correct
4 Correct 259 ms 260 KB Output is correct
5 Correct 242 ms 324 KB Output is correct
6 Correct 298 ms 268 KB Output is correct
7 Correct 265 ms 204 KB Output is correct
8 Correct 277 ms 264 KB Output is correct
9 Correct 280 ms 268 KB Output is correct
10 Correct 242 ms 268 KB Output is correct
11 Correct 244 ms 324 KB Output is correct
12 Correct 259 ms 264 KB Output is correct
13 Correct 253 ms 284 KB Output is correct
14 Correct 244 ms 276 KB Output is correct
15 Correct 254 ms 208 KB Output is correct
16 Incorrect 179 ms 204 KB Output isn't correct
17 Halted 0 ms 0 KB -