oj.uz

Submission #361816

# Submission time Handle Problem Language Result Execution time Memory
361816 2021-01-31T16:43:48 Z ryansee Packing Biscuits (IOI20_biscuits) C++14
100 / 100
 16 ms 1408 KB 
#include "biscuits.h"
 
#include "bits/stdc++.h"
using namespace std;
 
#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusive
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }
 
using ll=long long; 
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>; 
 
long long LLINF = 1e18;
int INF = 1e9+1e6;
#define MAXN (200006)
long long count_tastiness(long long x, vector<long long> a) {
	ll n = siz(a);
	ll sum = 0;
	vector<ll> cnt(60, 0), ans(60, 0), store(60, 0);
	// vector<ll> v={0};
	// FOR(i,0,18ll) {
		// sum += (i < a.size() ? a[i] : 0) * (1ll<<i);
		// ll sz = siz(v);
		// FOR(j,0,sz-1) if(v[j] + (1ll<<i) <= sum / x) {
			// v.eb(v[j] + (1ll<<i));
		// }
	// }
	FOR(i,0,59) {
		if(i < n) sum += a[i] * (1ll<<i);
		ll left = sum / x - (1ll<<i);
		store[i] = left;
		if(left < 0) goto bruh;
		left = min(left, (1ll<<i) - 1);
		store[i] = left;
		DEC(j,i-1,0) {
			if((1ll<<j) == left) {
				cnt[i] += j ? ans[j-1] : 1;
				if(store[j] < 0) goto bruh;
				else break;
			} else if((1ll<<j) & left) {
				cnt[i] += j ? ans[j-1] : 1;
				left = min(left ^ (1ll<<j), store[j]);
				if(left < 0) goto bruh;
			}
		}
		++ cnt[i];
		bruh:;
		ans[i] = (i ? ans[i-1] : 1) + cnt[i];
		if(sum < (1ll<<i)) assert(cnt[i]==0);
		// if(i <= 3) cerr<<sum<<' '<<left<<' '<<cnt[i]<<' '<<store[i]<<'\n';
	}
	return ans[59];
}

long long count_tastiness2(long long x, vector<long long> a) {
	ll n = siz(a);
	ll sum = 0;
	vector<ll> v={0};
	FOR(i,19,n-1) assert(a[i]==0);
	FOR(i,0,18ll) {
		sum += (i < a.size() ? a[i] : 0) * (1ll<<i);
		ll sz = siz(v);
		FOR(j,0,sz-1) if(v[j] + (1ll<<i) <= sum / x) {
			v.eb(v[j] + (1ll<<i));
		}
	}
	assert(sum <= (1ll<<19));
	return siz(v);
}

Compilation message

biscuits.cpp: In function 'long long int count_tastiness2(long long int, std::vector<long long int>)':
biscuits.cpp:76:13: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |   sum += (i < a.size() ? a[i] : 0) * (1ll<<i);
      |           ~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 11 ms 876 KB Output is correct
3 Correct 12 ms 1260 KB Output is correct
4 Correct 12 ms 1280 KB Output is correct
5 Correct 12 ms 1260 KB Output is correct
6 Correct 13 ms 1132 KB Output is correct
7 Correct 14 ms 1132 KB Output is correct
8 Correct 14 ms 1280 KB Output is correct
9 Correct 11 ms 1260 KB Output is correct
10 Correct 10 ms 1260 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 2 ms 364 KB Output is correct
38 Correct 11 ms 876 KB Output is correct
39 Correct 12 ms 1260 KB Output is correct
40 Correct 12 ms 1280 KB Output is correct
41 Correct 12 ms 1260 KB Output is correct
42 Correct 13 ms 1132 KB Output is correct
43 Correct 14 ms 1132 KB Output is correct
44 Correct 14 ms 1280 KB Output is correct
45 Correct 11 ms 1260 KB Output is correct
46 Correct 10 ms 1260 KB Output is correct
47 Correct 3 ms 492 KB Output is correct
48 Correct 16 ms 1388 KB Output is correct
49 Correct 5 ms 492 KB Output is correct
50 Correct 14 ms 1260 KB Output is correct
51 Correct 11 ms 1408 KB Output is correct
52 Correct 2 ms 492 KB Output is correct
53 Correct 10 ms 1132 KB Output is correct
54 Correct 14 ms 1260 KB Output is correct
55 Correct 16 ms 1388 KB Output is correct
56 Correct 13 ms 1260 KB Output is correct
57 Correct 13 ms 1260 KB Output is correct