oj.uz

Submission #813800

# Submission time Handle Problem Language Result Execution time Memory
813800 2023-08-08T03:56:39 Z joonwu04 Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 21 ms 1236 KB 
#include "biscuits.h"
#include <vector>

using namespace std;

typedef long long ll;

ll b[61], c[70], var[70]; //cIdx는 1부터 사용 c[0]=0 
int aSize, cSize;
ll dp[70]; // dp[i]: c[1]~c[i] 만 사용해서 만들 수 있는 y의 개수 

void makeDp(ll x, int i);
ll useI(ll x, int i);
int changeVar(ll x, int i);
void setup(ll x, vector<ll> a);

long long count_tastiness(long long x, std::vector<long long> a) {
	setup(x, a);
	for(int i=0; i<=60; i++) {
		for(int i=0; i<70; i++) {
			var[i] = c[i];
		}
		
		makeDp(x, i);
	}
	return dp[60];
	/*return sub2(x);
	return sub1(x, 0);*/
}

void makeDp(ll x, int i) { // c[1]~c[i]만 사용해서 만들 수 있는 y의 개수 
	if(i == 0) {
		dp[i] = 1;
	}
	else if(c[i] >= x) {
		dp[i] = 2*dp[i-1];
	}
	else {
		dp[i] = dp[i-1];
		dp[i] += useI(x, i);
	}
}

// var[i]<x
// to make var[i]=x, change var[1]~var[i-1] 
// in changed var[1]~var[i-1], count the number of possible y
ll useI(ll x, int i) {
	int nextI = changeVar(x, i);
	if(nextI == 0) return 0;
	
	ll t=dp[nextI-1];
	t += useI(x, nextI);
	return t;
}

// var[i]<x 
// to make var[i]=x, change var[1]~var[i-1]
// return finalIdx
int changeVar(ll x, int i) {
	ll t=0;
	for(int j=1; j<=i-1; j++) {
		t += var[j];
		t /= 2;
	}
	t += var[i];
	if(t < x) return 0;
	
	ll need = 2*(x-var[i]);
	for(int j=i-1; j>=1; j--) {
		if(var[j] >= need) {
			var[j] -= need;
			return j;
		}
		
		need -= var[j];
		var[j] = 0;
		need *= 2;
	}
	
	return 1;
}

void setup(ll x, vector<ll> a) {
	for(int i=0; i<70; i++) {
		c[i] = 0;
		dp[i] = 0;
	}
	
	for(int i=0; i<a.size(); i++) {
		c[i+1] = a[i];
	}
	cSize = a.size();
	
	for(int i=1; i<=cSize-1; i++) {
		if(c[i] > x+1) {
			ll move = (c[i]-x)%2==0 ? c[i]-x:c[i]-x-1;
			c[i+1] += move/2;
			c[i] -= move;
		}
	}
	for(int i=cSize; c[i] > x+1; i++) {
		ll move = (c[i]-x)%2==0 ? c[i]-x:c[i]-x-1;
		c[i+1] += move/2;
		c[i] -= move;
		cSize++;
	}
	
	for(int i=1; i<=cSize; i++) {
		var[i] = c[i];
	}
}

Compilation message

biscuits.cpp: In function 'void setup(ll, std::vector<long long int>)':
biscuits.cpp:89:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |  for(int i=0; i<a.size(); i++) {
      |               ~^~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 288 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 288 KB Output is correct
5 Correct 0 ms 288 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 340 KB Output is correct
2 Correct 17 ms 1184 KB Output is correct
3 Correct 17 ms 1164 KB Output is correct
4 Correct 14 ms 1108 KB Output is correct
5 Correct 10 ms 1108 KB Output is correct
6 Correct 11 ms 1120 KB Output is correct
7 Correct 11 ms 1100 KB Output is correct
8 Correct 10 ms 1068 KB Output is correct
9 Correct 10 ms 1148 KB Output is correct
10 Correct 10 ms 1168 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 288 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 288 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 288 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 288 KB Output is correct
19 Correct 0 ms 288 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 300 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 296 KB Output is correct
29 Correct 1 ms 296 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 292 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 296 KB Output is correct
36 Correct 1 ms 288 KB Output is correct
37 Correct 6 ms 340 KB Output is correct
38 Correct 17 ms 1184 KB Output is correct
39 Correct 17 ms 1164 KB Output is correct
40 Correct 14 ms 1108 KB Output is correct
41 Correct 10 ms 1108 KB Output is correct
42 Correct 11 ms 1120 KB Output is correct
43 Correct 11 ms 1100 KB Output is correct
44 Correct 10 ms 1068 KB Output is correct
45 Correct 10 ms 1148 KB Output is correct
46 Correct 10 ms 1168 KB Output is correct
47 Correct 5 ms 392 KB Output is correct
48 Correct 9 ms 1236 KB Output is correct
49 Correct 5 ms 340 KB Output is correct
50 Correct 8 ms 1144 KB Output is correct
51 Correct 10 ms 1236 KB Output is correct
52 Correct 6 ms 304 KB Output is correct
53 Correct 15 ms 1068 KB Output is correct
54 Correct 15 ms 1156 KB Output is correct
55 Correct 15 ms 1108 KB Output is correct
56 Correct 21 ms 1180 KB Output is correct
57 Correct 13 ms 1164 KB Output is correct