oj.uz

답안 #313824

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
313824 2020-10-17T06:30:13 Z srvlt 비스킷 담기 (IOI20_biscuits) C++14
21 / 100
 105 ms 384 KB 
#include "biscuits.h"
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define SZ(x) (int)(x).size()
#define all(x) begin(x), end(x)
using namespace std;

const int n0 = 1e5;

ll count_tastiness(ll x, vector<ll> a) {
	ll s = 0;
	for (ll i = 0; i < SZ(a); i++)
		s += (1ll << i) * a[i];
	if (x > s) return 1;
	ll res = 0;
	if (s <= n0) {
		for (ll i = 0; i <= s; i++) {
			ll cur = 0;
			for (ll j = 59; j >= 0; j--) {
				if (i >> j & 1) cur += x;
				if (j < SZ(a))
					cur -= min(cur, a[j]);
				cur *= 2;
			}
			res += (cur == 0);
		}
	}	else if (x == 1) {
		ll r = 0, cur = 1;
		res = 1;
		for (ll j = 0; j < SZ(a); j++) {
			if (!a[j]) continue;
			ll t = (1ll << j) / cur;
			if (t > r + 1) {
				res *= (r + 1);
				cur = (1ll << j);
				r = 0;
			}
			t = (1ll << j) / cur;
			if (t <= r + 1) r += a[j] * t;
		}
		res *= (r + 1);
	}
	return res;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 17 ms 256 KB Output is correct
4 Correct 28 ms 256 KB Output is correct
5 Correct 7 ms 256 KB Output is correct
6 Correct 83 ms 256 KB Output is correct
7 Correct 4 ms 256 KB Output is correct
8 Correct 81 ms 256 KB Output is correct
9 Correct 9 ms 256 KB Output is correct
10 Correct 91 ms 364 KB Output is correct
11 Correct 12 ms 256 KB Output is correct
12 Correct 105 ms 364 KB Output is correct
13 Correct 102 ms 256 KB Output is correct
14 Correct 102 ms 380 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 288 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 17 ms 256 KB Output is correct
4 Correct 28 ms 256 KB Output is correct
5 Correct 7 ms 256 KB Output is correct
6 Correct 83 ms 256 KB Output is correct
7 Correct 4 ms 256 KB Output is correct
8 Correct 81 ms 256 KB Output is correct
9 Correct 9 ms 256 KB Output is correct
10 Correct 91 ms 364 KB Output is correct
11 Correct 12 ms 256 KB Output is correct
12 Correct 105 ms 364 KB Output is correct
13 Correct 102 ms 256 KB Output is correct
14 Correct 102 ms 380 KB Output is correct
15 Correct 15 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Incorrect 1 ms 288 KB Output isn't correct
25 Halted 0 ms 0 KB -