Submission #376566

# Submission time Handle Problem Language Result Execution time Memory
376566 2021-03-11T17:26:54 Z Jarif_Rahman Packing Biscuits (IOI20_biscuits) C++17
0 / 100
1000 ms 762620 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 long double ld;
typedef string str;
const int kk = 60;
ll count_tastiness(ll x, vector<ll> aa){
    vector<ld> a(kk);
    int k = aa.size();
    for(int i = 0; i < k; i++) a[i] = aa[i];
    ll ans = 0;
    vector<ld> s(kk, 0);
    for(int i = 0; i < kk; i++){
        if(i != 0) s[i] = s[i-1];
        s[i]+=(a[i]/x)*(1LL<<i);
    }
    vector<ld> v;
    v.pb({0});
    for(int i = 0; i < kk; i++){
        ld mx = s[i]; ll p = 1;
        p<<=i;
        mx-=(ld)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:16:8: warning: unused variable 'ans' [-Wunused-variable]
   16 |     ll ans = 0;
      |        ^~~
# 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 5 ms 1888 KB Output is correct
5 Correct 1 ms 748 KB Output is correct
6 Correct 13 ms 4124 KB Output is correct
7 Correct 2 ms 688 KB Output is correct
8 Correct 11 ms 3976 KB Output is correct
9 Incorrect 2 ms 800 KB Output isn't correct
10 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 4 ms 2528 KB Output is correct
2 Execution timed out 1128 ms 618476 KB Time limit exceeded
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1153 ms 762620 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1085 ms 7732 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 5 ms 1888 KB Output is correct
5 Correct 1 ms 748 KB Output is correct
6 Correct 13 ms 4124 KB Output is correct
7 Correct 2 ms 688 KB Output is correct
8 Correct 11 ms 3976 KB Output is correct
9 Incorrect 2 ms 800 KB Output isn't correct
10 Halted 0 ms 0 KB -