oj.uz

Submission #308397

# Submission time Handle Problem Language Result Execution time Memory
308397 2020-10-01T05:30:47 Z azberjibiou Packing Biscuits (IOI20_biscuits) C++17
12 / 100
 2 ms 384 KB 
#include "biscuits.h"
#include <bits/stdc++.h>
#define fir first
#define sec second
#define pii pair<int, int>
#define ll long long
using namespace std;

long long count_tastiness(long long x, vector<long long> a) {
    while(a.size()<70)  a.push_back(0);
    for(int i=0;i<60;i++)
    {
        if(a[i]<=2) continue;
        a[i+1]+=(a[i]-1)/2;
        if(a[i]%2==0)   a[i]=2;
        else    a[i]=1;
    }
    ll cnt=1, ans=1;
    for(int i=59;i>=0;i--)
    {
        if(a[i]==0) cnt=ans;
        else if(a[i]==1)    ans*=2;
        else    ans=2*ans+cnt;
    }
	return ans;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Incorrect 0 ms 256 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 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 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 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

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