Submission #304615

#	Time	Username	Problem	Language	Result	Execution time	Memory
304615		medmdg	Packing Biscuits (IOI20_biscuits)	C++14	0 / 100	1 ms	640 KiB

biscuits

#include <bits/stdc++.h>
#include "biscuits.h"
using namespace std;
long long int count_tastiness(long long int x,vector<long long int> a){
    long long int b[61];
    int k=61;
    bool an[k];
    memset(b,0,61);
    for(int i=0;i<a.size();i++)
        b[i]=a[i];
    memset(an,false,k);
    for(int i=0;i<61;i++){
        if(b[i]>=x){
            an[i]=true;
            b[i]-=x;
        }else{
            an[i]=false;
        }
        b[i+1]+=b[i]/2;
        b[i]=0; 
    }
    unsigned long long int ans=0;
    for(int i=0;i<61;i++){
        if(an[i])
            ans+=1<<i;
    }
    return ans;
}

Compilation message (stderr)

biscuits.cpp: In function 'long long int count_tastiness(long long int, std::vector<long long int>)':
biscuits.cpp:8:18: warning: 'memset' used with length equal to number of elements without multiplication by element size [-Wmemset-elt-size]
    8 |     memset(b,0,61);
      |                  ^
biscuits.cpp:9:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |     for(int i=0;i<a.size();i++)
      |                 ~^~~~~~~~~
biscuits.cpp:19:15: warning: iteration 60 invokes undefined behavior [-Waggressive-loop-optimizations]
   19 |         b[i+1]+=b[i]/2;
      |         ~~~~~~^~~~~~~~
biscuits.cpp:12:18: note: within this loop
   12 |     for(int i=0;i<61;i++){
      |                 ~^~~

• Subtask 1: 0 / 9
• Subtask 2: 0 / 12
• Subtask 3: 0 / 21
• Subtask 4: 0 / 35
• Subtask 5: 0 / 23