Submission #376367

# Submission time Handle Problem Language Result Execution time Memory
376367 2021-03-11T10:13:47 Z Jarif_Rahman Packing Biscuits (IOI20_biscuits) C++17
9 / 100
1000 ms 977392 KB
#include "biscuits.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
const int kk = 60;
ll count_tastiness(ll x, vector<ll> aa){
    vector<__int128> a(kk);
    int k = aa.size();
    for(int i = 0; i < k; i++) a[i] = aa[i];
    ll ans = 0;
    vector<__int128> s(kk, 0);
    for(int i = 0; i < kk; i++){
        if(i != 0) s[i] = s[i-1];
        s[i]+=a[i]*(1LL<<i);
    }
    vector<__int128> v;
    v.pb({0});
    for(int i = 0; i < kk; i++){
        __int128 mx = s[i]/x-mx, p = 1;
        p<<=i;
        mx-=p;
        int in = upper_bound(v.begin(), v.end(), mx) - v.begin();
        for(int j = 0; j < in; j++) v.pb(v[j]+p);
    }
    return v.size();
}

Compilation message

biscuits.cpp: In function 'll count_tastiness(ll, std::vector<long long int>)':
biscuits.cpp:14:8: warning: unused variable 'ans' [-Wunused-variable]
   14 |     ll ans = 0;
      |        ^~~
biscuits.cpp:23:29: warning: 'mx' may be used uninitialized in this function [-Wmaybe-uninitialized]
   23 |         __int128 mx = s[i]/x-mx, p = 1;
# Verdict Execution time Memory Grader output
1 Correct 4 ms 2528 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 4 ms 2016 KB Output is correct
5 Correct 2 ms 748 KB Output is correct
6 Correct 12 ms 4148 KB Output is correct
7 Correct 1 ms 540 KB Output is correct
8 Correct 11 ms 3976 KB Output is correct
9 Correct 2 ms 800 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 5 ms 1184 KB Output is correct
13 Correct 2 ms 700 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 2548 KB Output is correct
2 Execution timed out 1159 ms 900620 KB Time limit exceeded
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1173 ms 977392 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1042 ms 7932 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 4 ms 2528 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 4 ms 2016 KB Output is correct
5 Correct 2 ms 748 KB Output is correct
6 Correct 12 ms 4148 KB Output is correct
7 Correct 1 ms 540 KB Output is correct
8 Correct 11 ms 3976 KB Output is correct
9 Correct 2 ms 800 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 5 ms 1184 KB Output is correct
13 Correct 2 ms 700 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 4 ms 2548 KB Output is correct
16 Execution timed out 1159 ms 900620 KB Time limit exceeded
17 Halted 0 ms 0 KB -