Submission #432157

# Submission time Handle Problem Language Result Execution time Memory
432157 2021-06-17T22:25:00 Z Ozy Packing Biscuits (IOI20_biscuits) C++17
12 / 100
1 ms 332 KB
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define rep(i,a,b) for(int i = (a); i <= (b); i++)
#define repa(i,a,b) for(int i = (a); i >= (b); i--)
#define debug(a) cout << #a << " = " << a << endl
#define debugsl(a) cout << #a << " = " << a << ", "

#define MAX 70

lli n,res,cant,sec,bloque;
lli pot[64];

void calcula() {
    pot[0] = 1;
    rep(i,1,63) pot[i] = pot[i-1]*2;
}

long long count_tastiness(long long x, std::vector<long long> a) {

	if (pot[0] == 0) calcula();

	if (x > 1) return 0;

	n = a.size();
	rep(i,n,63) a.push_back(0);
	n = 64;

	cant = 0;
	res = 1;
	sec = 1;
	bloque = 0;

	rep(i,0,n-1) {
        if (a[i] > 0) {
            sec += pot[bloque] * a[i];
            bloque++;
        }
        else if (bloque > 0){
            res *= sec;
            bloque = 0;
            sec = 1;
        }
	}

	return res;
}

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 292 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 292 KB Output isn't correct
3 Halted 0 ms 0 KB -