oj.uz

Submission #303407

# Submission time Handle Problem Language Result Execution time Memory
303407 2020-09-20T09:44:02 Z qiangbao Packing Biscuits (IOI20_biscuits) C++14
0 / 100
 21 ms 896 KB 
#include <iostream>
#include <vector>
#include "biscuits.h"

using namespace std;

typedef long long ll;

ll ways[63];

ll pow2[63];

void ini()
{
    ll i;
    
    pow2[0]=1;
    for(i=1;i<=62;i++)
        pow2[i]=pow2[i-1]*2;
    for(i=0;i<=62;i++)
        ways[i]=0;
    ways[0]=1;
}

ll count_tastiness(ll x, vector<ll> a)
{
    ll tot=0;
    ll i, j;
    a.resize(64);
    
    ini();
    
    for(i=0;i<62;i++){
        ll way=0;
        tot+=a[i]*pow2[i];
        ll tot2=tot;
        for(j=i;j>=0;j--)
            if(pow2[62]/x>pow2[j] && tot2>=x*pow2[j])
                tot2-=x*pow2[j], way+=ways[j];
        ways[i+1]=way+1;
    }
    
    return ways[62];
}

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

Subtask #1
0 / 9.0

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

Subtask #2
0 / 12.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 35.0

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

Subtask #5
0 / 23.0

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