oj.uz

Submission #871294

# Submission time Handle Problem Language Result Execution time Memory
871294 2023-11-10T13:36:48 Z andrei_boaca Packing Biscuits (IOI20_biscuits) C++17
9 / 100
 1000 ms 500 KB 
#include "biscuits.h"
#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
typedef long long ll;
ll f[65];
long long count_tastiness(long long x, std::vector<long long> a)
{
    for(int i=0;i<=60;i++)
        f[i]=0;
    ll suma=0;
    for(int i=0;i<a.size();i++)
    {
        f[i]=a[i];
        suma+=(1LL<<i)*a[i];
    }
    ll ans=0;
    for(ll p=0;p<=suma/x;p++)
    {
        bool ok=1;
        ll cnt=0;
        for(ll i=0;i<=60;i++)
        {
            cnt+=f[i];
            if((p>>i)&1)
            {
                if(cnt<x)
                {
                    ok=0;
                    break;
                }
                cnt-=x;
            }
            cnt/=2;
        }
        if(ok)
            ans++;
    }
    return ans;
}

Compilation message

biscuits.cpp: In function 'long long int count_tastiness(long long int, std::vector<long long int>)':
biscuits.cpp:12:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |     for(int i=0;i<a.size();i++)
      |                 ~^~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 500 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 20 ms 344 KB Output is correct
5 Correct 5 ms 348 KB Output is correct
6 Correct 65 ms 412 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 58 ms 348 KB Output is correct
9 Correct 7 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 436 KB Output is correct
12 Correct 19 ms 344 KB Output is correct
13 Correct 8 ms 348 KB Output is correct
14 Correct 1 ms 412 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 348 KB Output is correct
2 Execution timed out 1079 ms 348 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1053 ms 348 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1047 ms 348 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 500 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 20 ms 344 KB Output is correct
5 Correct 5 ms 348 KB Output is correct
6 Correct 65 ms 412 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 58 ms 348 KB Output is correct
9 Correct 7 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 436 KB Output is correct
12 Correct 19 ms 344 KB Output is correct
13 Correct 8 ms 348 KB Output is correct
14 Correct 1 ms 412 KB Output is correct
15 Correct 13 ms 348 KB Output is correct
16 Execution timed out 1079 ms 348 KB Time limit exceeded
17 Halted 0 ms 0 KB -