oj.uz

Submission #642409

# Submission time Handle Problem Language Result Execution time Memory
642409 2022-09-19T11:23:04 Z lis05st Packing Biscuits (IOI20_biscuits) C++17
12 / 100
 2 ms 340 KB 
#ifdef LIS05ST
    #define _GLIBCXX_DEBUG
    #define _GLIBCXX_DEBUG_PEDANTIC
#endif
//#pragma GCC optimize("O3")
//#pragma GCC target("avx2,popcnt,lzcnt,bmi,bmi2")
#include"bits/stdc++.h"
using namespace std;

typedef long long ll;
typedef long double ld;
typedef __int128_t i128;
#define int long long

long long count_tastiness(long long x, std::vector<long long> a){
    int k=a.size();
    while(a.size()<63)a.push_back(0);
    k=63;
    for(int i=0;i<k-1;i++){
        if(a[i]>=3){
            if(a[i]&1)a[i+1]+=a[i]/2,a[i]=1;
            else a[i+1]+=(a[i]-2)/2,a[i]=2;
        }
    }
    ll res=1,cur=1,bit=0;
    for(int i=0;i<k;i++){
        if(a[i]==0){
            res*=cur;
            cur=1;
            bit=0;
        }else{
            cur+=(1ll<<bit)*a[i];
            bit++;
        }
    }
    res*=cur;
    return res;
}

/*

1 2 2 0
2 4

2 2 2 1 0

1 1 1 1 0



*/


#define MULTITESTS false
void solve(int testCase){

}


void precalc(){

}
/*
signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    precalc();
    int t=1;
    if(MULTITESTS)cin>>t;
    for(int i=1;i<=t;i++){
        auto t1=clock();
        solve(i);
        auto t2=clock();
        float delta=t2-t1;
        delta/=CLOCKS_PER_SEC;
        #ifdef LIS05ST
        cout<<"("<<i<<")------------"<<fixed<<setprecision(2)<<delta<<"s\n";
        #endif
    }
}*/

Subtask #1
0 / 9.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct

Subtask #3
0 / 21.0

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

Subtask #4
0 / 35.0

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

Subtask #5
0 / 23.0

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