oj.uz

Submission #333312

# Submission time Handle Problem Language Result Execution time Memory
333312 2020-12-05T11:19:10 Z katearima Packing Biscuits (IOI20_biscuits) C++14
100 / 100
 487 ms 1516 KB 
#include "biscuits.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int k=61;
int i;
int nearest(ll u){
	vector<int> v;
	while(u>0){
		v.push_back(u%2);
		u/=2;
	}
	for(int i=v.size()-1; i>=0; i--){
		if(v[i]==1) return i; 
	}
	return -1;
}
long long count_tastiness(long long x, vector<long long> a) {
	vector<ll> s(k+1),ans(k+1), s1(k+1);
	int n=a.size();
	for(i=0; i<n; i++){
		ll p=pow(2,i);
		//s[i]=(long long)((double)a[i]/x*pow(2,i));
		s[i]=a[i]*p/x;
		s1[i]=((a[i]%x)*((ll)pow(2,i)%x))%x;
	}

	for(i=1; i<k; i++){
		s[i]+=s[i-1];
		s1[i]+=s1[i-1];
		s[i]+=s1[i]/x;
		s1[i]%=x;
	}
    ans[0]=1;
    for(i=1; i<k; i++){
    	ans[i]+=ans[i-1];
    	int j=i-1;
    	ll c=1; ll p;
    	int t=0;
		while(c>0){
   			p=pow(2,j);
   			
			if(t==0) c=min(s[j],2*p-1)-p; 
			else c=min(s[j], c)-p;
    		if(c==0){
				ans[i]++;
				break;
			}
			if(c<0) break;
			//if(i==58) cout<<c<<endl;
			j=nearest(c);
    		ans[i]+=ans[j];
    		t++;
    	}
    	//cout<<i<<" "<<ans[i]<<endl;
	}
	return ans[k-1];
	return 0;
}

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 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
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 2 ms 364 KB Output is correct
3 Correct 5 ms 364 KB Output is correct
4 Correct 4 ms 364 KB Output is correct
5 Correct 5 ms 364 KB Output is correct
6 Correct 6 ms 364 KB Output is correct
7 Correct 4 ms 364 KB Output is correct
8 Correct 5 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 364 KB Output is correct
2 Correct 60 ms 1284 KB Output is correct
3 Correct 62 ms 1388 KB Output is correct
4 Correct 57 ms 1260 KB Output is correct
5 Correct 56 ms 1388 KB Output is correct
6 Correct 47 ms 1132 KB Output is correct
7 Correct 47 ms 1132 KB Output is correct
8 Correct 47 ms 1132 KB Output is correct
9 Correct 49 ms 1260 KB Output is correct
10 Correct 53 ms 1132 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 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
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 2 ms 364 KB Output is correct
17 Correct 5 ms 364 KB Output is correct
18 Correct 4 ms 364 KB Output is correct
19 Correct 5 ms 364 KB Output is correct
20 Correct 6 ms 364 KB Output is correct
21 Correct 4 ms 364 KB Output is correct
22 Correct 5 ms 364 KB Output is correct
23 Correct 2 ms 364 KB Output is correct
24 Correct 2 ms 364 KB Output is correct
25 Correct 2 ms 364 KB Output is correct
26 Correct 3 ms 364 KB Output is correct
27 Correct 7 ms 364 KB Output is correct
28 Correct 4 ms 364 KB Output is correct
29 Correct 6 ms 364 KB Output is correct
30 Correct 3 ms 364 KB Output is correct
31 Correct 3 ms 364 KB Output is correct
32 Correct 2 ms 364 KB Output is correct
33 Correct 3 ms 364 KB Output is correct
34 Correct 3 ms 364 KB Output is correct
35 Correct 4 ms 364 KB Output is correct
36 Correct 3 ms 364 KB Output is correct
37 Correct 29 ms 364 KB Output is correct
38 Correct 60 ms 1284 KB Output is correct
39 Correct 62 ms 1388 KB Output is correct
40 Correct 57 ms 1260 KB Output is correct
41 Correct 56 ms 1388 KB Output is correct
42 Correct 47 ms 1132 KB Output is correct
43 Correct 47 ms 1132 KB Output is correct
44 Correct 47 ms 1132 KB Output is correct
45 Correct 49 ms 1260 KB Output is correct
46 Correct 53 ms 1132 KB Output is correct
47 Correct 105 ms 584 KB Output is correct
48 Correct 487 ms 1516 KB Output is correct
49 Correct 277 ms 492 KB Output is correct
50 Correct 454 ms 1260 KB Output is correct
51 Correct 24 ms 1388 KB Output is correct
52 Correct 7 ms 492 KB Output is correct
53 Correct 21 ms 1260 KB Output is correct
54 Correct 175 ms 1260 KB Output is correct
55 Correct 141 ms 1296 KB Output is correct
56 Correct 112 ms 1260 KB Output is correct
57 Correct 90 ms 1260 KB Output is correct