oj.uz

Submission #397174

# Submission time Handle Problem Language Result Execution time Memory
397174 2021-05-01T16:35:05 Z rocks03 Packing Biscuits (IOI20_biscuits) C++14
9 / 100
 1000 ms 525740 KB 
//#pragma GCC target("avx2")
//#pragma GCC optimization("O3")
//#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define SZ(x) ((int)(x).size())
#define all(x) x.begin(), x.end()
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int N;
ll x;
vector<ll> a;

long long count_tastiness(long long X, vector<long long> A){
    while(SZ(A) < 62) A.pb(0);
    a = A, x = X, N = SZ(A);
    rep(i, 0, N){
        a[i] = a[i] * (1ll << i);
        if(i) a[i] += a[i - 1];
    }
    ll ans = 1;
    vector<ll> v = {0};
    rep(b, 0, N){
        int csz = SZ(v);
        rep(i, 0, csz){
            ll y = v[i] + (1ll << b);
            if(a[b] / x >= y){
                v.pb(y);
                ans++;
            } else break;
        }
    }
    return ans;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1352 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 1064 KB Output is correct
5 Correct 1 ms 516 KB Output is correct
6 Correct 7 ms 2112 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 7 ms 2016 KB Output is correct
9 Correct 2 ms 484 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 3 ms 680 KB Output is correct
13 Correct 1 ms 464 KB Output is correct
14 Correct 1 ms 204 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1348 KB Output is correct
2 Execution timed out 1109 ms 525664 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 1096 ms 525740 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 4040 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1352 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 1064 KB Output is correct
5 Correct 1 ms 516 KB Output is correct
6 Correct 7 ms 2112 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 7 ms 2016 KB Output is correct
9 Correct 2 ms 484 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 3 ms 680 KB Output is correct
13 Correct 1 ms 464 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 3 ms 1348 KB Output is correct
16 Execution timed out 1109 ms 525664 KB Time limit exceeded
17 Halted 0 ms 0 KB -