Submission #429067

# Submission time Handle Problem Language Result Execution time Memory
429067 2021-06-15T17:09:11 Z abdzag Packing Biscuits (IOI20_biscuits) C++17
0 / 100
2 ms 332 KB
#include<bits/stdc++.h>
#include<unordered_map>
#include<unordered_set>
#include "biscuits.h"
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
#define rrep(i,a,b) for(int i=int(a);i>int(b);i--)
#define trav(a,v) for(auto& a: v)
#define sz(v) v.size()
#define all(v) v.begin(),v.end()
#define vi vector<int>

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const long long inf = 2e9;

using namespace std;

long long count_tastiness(long long x, std::vector<long long> a) {
	ll ans = 0;
	while (a.size() < 70) {
		a.push_back(0);
	}
	rep(i, 0, a.size()) {
		if (a[i]) {
			ans++;
			a[i]--;
			a[i + 1] += a[i] / 2;
		}
	}
	return ans;
}
# 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 204 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 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 2 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -