답안 #467073

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
467073 2021-08-21T15:36:10 Z armand 비스킷 담기 (IOI20_biscuits) C++14
9 / 100
1000 ms 332 KB
#include "biscuits.h"
#include <algorithm>
using namespace std;

int check_y(long long x, std::vector<long long> a, int y)
{
	int i;
	vector<int> b;
	i = 0;
	while (y) {
		b.push_back(y % 2);
		y = y >> 1;
	}
	while (b.size() > a.size())
		a.push_back(0);
	i = b.size()-1;
	while (i) {
		if (a[i] < 0) {
			a[i - 1] += 2 * a[i];
			a[i] = 0;
		}
		if (b[i]) {
			if (a[i] < x)
				a[i - 1] -= 2 * (x - a[i]);
		}
		i--;
	}
	if(b[0])
		return a[0] >= x;
	return a[0] >= 0;
}

long long count_tastiness(long long x, std::vector<long long> a) 
{
	int res = 1;
	int k = a.size();
	long long total = 0;
	long long two = 1;
	for (int i = 0; i < k; i++) {
		total += two*a[i];
		two <<= 1;
	}
	for (int y = 1; y*x <= total; y++)
		res += check_y(x, a, y);
	return res;
}

# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 2 ms 204 KB Output is correct
4 Correct 68 ms 204 KB Output is correct
5 Correct 16 ms 272 KB Output is correct
6 Correct 158 ms 260 KB Output is correct
7 Correct 10 ms 204 KB Output is correct
8 Correct 154 ms 256 KB Output is correct
9 Correct 25 ms 284 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 83 ms 268 KB Output is correct
13 Correct 29 ms 204 KB Output is correct
14 Correct 3 ms 204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 260 KB Output is correct
2 Execution timed out 1083 ms 204 KB Time limit exceeded
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1077 ms 284 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1094 ms 332 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 2 ms 204 KB Output is correct
4 Correct 68 ms 204 KB Output is correct
5 Correct 16 ms 272 KB Output is correct
6 Correct 158 ms 260 KB Output is correct
7 Correct 10 ms 204 KB Output is correct
8 Correct 154 ms 256 KB Output is correct
9 Correct 25 ms 284 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 83 ms 268 KB Output is correct
13 Correct 29 ms 204 KB Output is correct
14 Correct 3 ms 204 KB Output is correct
15 Correct 76 ms 260 KB Output is correct
16 Execution timed out 1083 ms 204 KB Time limit exceeded
17 Halted 0 ms 0 KB -