oj.uz

Submission #321527

# Submission time Handle Problem Language Result Execution time Memory
321527 2020-11-12T16:22:28 Z grt Packing Biscuits (IOI20_biscuits) C++17
9 / 100
 1000 ms 372 KB 
#include <bits/stdc++.h>

using namespace std;

using vi = vector<int>;
using ll = long long;
using pi = pair<int,int>;

#define ST first
#define ND second
#define PB push_back

ll count_tastiness(ll x, vector<ll>a) {
    ll sum = 0;
    for(int i = 0; i < (int)a.size(); ++i) {
        sum += (1LL << i) * a[i];
    }
    while((int)a.size() < 20) a.PB(0);
    ll res = 0;
    for(ll i = 0; i <= sum; ++i) {
        ll cur = 0;
        bool ok = 1;
        for(int j = 0; j < 20; ++j) {
            cur += a[j];
            if(i & (1 << j)) {
                if(cur < x) {
                    ok = 0;
                    break;
                }
                cur -= x;
            }
            cur /= 2;
        }
        res += ok;
    }
    return res;
}

//int main() {
 //   cout << count_tastiness(2, {2, 1, 2});
//}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 364 KB Output is correct
2 Correct 4 ms 364 KB Output is correct
3 Correct 10 ms 364 KB Output is correct
4 Correct 25 ms 364 KB Output is correct
5 Correct 6 ms 364 KB Output is correct
6 Correct 75 ms 372 KB Output is correct
7 Correct 4 ms 364 KB Output is correct
8 Correct 67 ms 372 KB Output is correct
9 Correct 8 ms 364 KB Output is correct
10 Correct 5 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 48 ms 364 KB Output is correct
13 Correct 46 ms 364 KB Output is correct
14 Correct 28 ms 364 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 364 KB Output is correct
2 Execution timed out 1099 ms 364 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

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

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 364 KB Output is correct
2 Correct 4 ms 364 KB Output is correct
3 Correct 10 ms 364 KB Output is correct
4 Correct 25 ms 364 KB Output is correct
5 Correct 6 ms 364 KB Output is correct
6 Correct 75 ms 372 KB Output is correct
7 Correct 4 ms 364 KB Output is correct
8 Correct 67 ms 372 KB Output is correct
9 Correct 8 ms 364 KB Output is correct
10 Correct 5 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 48 ms 364 KB Output is correct
13 Correct 46 ms 364 KB Output is correct
14 Correct 28 ms 364 KB Output is correct
15 Correct 9 ms 364 KB Output is correct
16 Execution timed out 1099 ms 364 KB Time limit exceeded
17 Halted 0 ms 0 KB -