oj.uz

Submission #415229

# Submission time Handle Problem Language Result Execution time Memory
415229 2021-05-31T17:25:37 Z mosiashvililuka Packing Biscuits (IOI20_biscuits) C++14
100 / 100
 23 ms 1316 KB 
#include "biscuits.h"
#include<bits/stdc++.h>
using namespace std;
long long a,b,c,d,e,i,j,ii,jj,zx,xc,f[209],x,S[209],JM,xr[209],E,jm,v[200009],vi,y;
long long g[209];
long long tes,te;
long long fun(long long q){
	if(q<0) return 0;
	if(q==0) return 1;
	long long w=0;
	while(xr[w]<=q) w++;
	w--;
	if(xr[w+1]-1==q) return g[w+1];
	y=S[w]/x;
	return g[w]+fun(min(y,q)-xr[w]);
}
long long count_tastiness(long long Xx, std::vector<long long> A) {
	x=Xx;
	a=A.size();a--;
	for(i=0; i<=a; i++){
		f[i]=A[i];
	}
	for(i=a+1; i<=a+135; i++){
		f[i]=0;
	}
	xr[0]=1;
	for(i=1; i<=62; i++){
		xr[i]=xr[i-1]*2;
	}
	jm=0;
	for(i=0; i<=a; i++){
		jm+=f[i]*xr[i];
	}
	JM=0;
	g[0]=1;vi=1;
	for(i=0; i<=a+134; i++){
		JM+=f[i]*xr[i];
		if(xr[i]>jm) break;
		S[i]=JM;
		y=S[i]/x;
		//g[i+1]=fun(xr[i+1]-1);
		g[i+1]=g[i]+fun(min(y,xr[i+1]-1)-xr[i]);
		vi=g[i+1];
	}
	//return v.size();
	return vi;
}
 
 
/*int main(){
	ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin>>tes;
	//tes=1;
	for(te=1; te<=tes; te++){
	cin>>a>>x;
	vector <long long> A;
	for(i=0; i<a; i++){
		cin>>c;
		A.push_back(c);
	}
	cout<<count_tastiness(x,A)<<endl;
	//count_tastiness(x,A);
	}
	return 0;
}*/

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 12 ms 1208 KB Output is correct
3 Correct 12 ms 1108 KB Output is correct
4 Correct 13 ms 1100 KB Output is correct
5 Correct 13 ms 1112 KB Output is correct
6 Correct 12 ms 1080 KB Output is correct
7 Correct 11 ms 1064 KB Output is correct
8 Correct 12 ms 1100 KB Output is correct
9 Correct 12 ms 1116 KB Output is correct
10 Correct 13 ms 1200 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 2 ms 280 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 2 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 312 KB Output is correct
30 Correct 1 ms 308 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 2 ms 380 KB Output is correct
38 Correct 12 ms 1208 KB Output is correct
39 Correct 12 ms 1108 KB Output is correct
40 Correct 13 ms 1100 KB Output is correct
41 Correct 13 ms 1112 KB Output is correct
42 Correct 12 ms 1080 KB Output is correct
43 Correct 11 ms 1064 KB Output is correct
44 Correct 12 ms 1100 KB Output is correct
45 Correct 12 ms 1116 KB Output is correct
46 Correct 13 ms 1200 KB Output is correct
47 Correct 3 ms 332 KB Output is correct
48 Correct 18 ms 1316 KB Output is correct
49 Correct 4 ms 332 KB Output is correct
50 Correct 15 ms 1100 KB Output is correct
51 Correct 11 ms 1288 KB Output is correct
52 Correct 3 ms 332 KB Output is correct
53 Correct 14 ms 1088 KB Output is correct
54 Correct 22 ms 1172 KB Output is correct
55 Correct 23 ms 1136 KB Output is correct
56 Correct 17 ms 1208 KB Output is correct
57 Correct 16 ms 1228 KB Output is correct