oj.uz

Submission #415581

# Submission time Handle Problem Language Result Execution time Memory
415581 2021-06-01T08:53:49 Z MKopchev Packing Biscuits (IOI20_biscuits) C++14
100 / 100
 584 ms 1292 KB 
#include "biscuits.h"
#include<bits/stdc++.h>
using namespace std;

const int nmax=64;

long long inp[nmax],mem_x;

bool eq(long long p,long long q,int bit)
{
    //return p==q;

    long long coeff=1;

    while(bit<60)
    {
        p=p+inp[bit]*coeff;
        q=q+inp[bit]*coeff;

        if(min(2*coeff-1,p/mem_x)!=min(2*coeff-1,q/mem_x))return 0;

        bit++;

        coeff=coeff*2;
    }

    //if(p!=q)cout<<"gaz"<<endl;

    return 1;
}
long long rec(int SZ)
{
    vector< pair<long long/*high*/,long long/*dp*/> > seen={},help;
    seen.push_back({0,1});

    for(int bit=0;bit<SZ;bit++)
    {
        help={};

        for(auto w:seen)
        {
            long long high=w.first+inp[bit];

            help.push_back({high/2,w.second});

            if(high>=mem_x)help.push_back({(high-mem_x)/2,w.second});
        }

        sort(help.begin(),help.end());

        seen={};

        for(auto w:help)
        {
            if(seen.size()==0)seen.push_back(w);
            else if(eq(seen.back().first,w.first,bit+1))seen[seen.size()-1].second+=w.second;
            else seen.push_back(w);
        }

        //cout<<bit<<" -> "<<seen.size()<<endl;
    }

    //cout<<"seen: ";for(auto w:seen)cout<<w.first<<" with "<<w.second<<" , ";cout<<endl;

    long long ret=0;
    for(auto w:seen)
        ret+=(w.first/mem_x+1)*w.second;

    return ret;
}
long long count_tastiness(long long x, std::vector<long long> a) {

    while(a.size()>1&&a.back()==0)a.pop_back();

    mem_x=x;

	for(int i=0;i<60;i++)
    {
        inp[i]=0;
    }
    for(int i=0;i<a.size();i++)inp[i]=a[i];

    long long ret=rec(a.size());

    return ret;
}
/*
int main() {
	int q;
	assert(scanf("%d", &q) == 1);
	vector<int> k(q);
	vector<long long> x(q);
	vector<vector<long long>> a(q);
	vector<long long> results(q);
	for (int t = 0; t < q; t++) {
		assert(scanf("%d%lld", &k[t], &x[t]) == 2);
		a[t] = vector<long long>(k[t]);
		for (int i = 0; i < k[t]; i++) {
			assert(scanf("%lld", &a[t][i]) == 1);
		}
	}
	fclose(stdin);

	for (int t = 0; t < q; t++) {
		results[t] = count_tastiness(x[t], a[t]);
	}
	for (int t = 0; t < q; t++) {
		printf("%lld\n", results[t]);
	}
	fclose(stdout);
	return 0;
}
*/

Compilation message

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

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 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
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 296 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 2 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 2 ms 204 KB Output is correct
6 Correct 2 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 2 ms 204 KB Output is correct
9 Correct 2 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 1 ms 204 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 2 ms 204 KB Output is correct
6 Correct 2 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 5 ms 292 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 4 ms 204 KB Output is correct
11 Correct 6 ms 204 KB Output is correct
12 Correct 7 ms 204 KB Output is correct
13 Correct 7 ms 204 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 372 KB Output is correct
2 Correct 123 ms 796 KB Output is correct
3 Correct 114 ms 1180 KB Output is correct
4 Correct 113 ms 1100 KB Output is correct
5 Correct 102 ms 1172 KB Output is correct
6 Correct 414 ms 1112 KB Output is correct
7 Correct 371 ms 1128 KB Output is correct
8 Correct 331 ms 1128 KB Output is correct
9 Correct 269 ms 1148 KB Output is correct
10 Correct 150 ms 1140 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 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
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 296 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 2 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 2 ms 204 KB Output is correct
20 Correct 2 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 2 ms 204 KB Output is correct
23 Correct 2 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 1 ms 204 KB Output is correct
27 Correct 2 ms 204 KB Output is correct
28 Correct 2 ms 204 KB Output is correct
29 Correct 2 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 5 ms 292 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 4 ms 204 KB Output is correct
34 Correct 6 ms 204 KB Output is correct
35 Correct 7 ms 204 KB Output is correct
36 Correct 7 ms 204 KB Output is correct
37 Correct 3 ms 372 KB Output is correct
38 Correct 123 ms 796 KB Output is correct
39 Correct 114 ms 1180 KB Output is correct
40 Correct 113 ms 1100 KB Output is correct
41 Correct 102 ms 1172 KB Output is correct
42 Correct 414 ms 1112 KB Output is correct
43 Correct 371 ms 1128 KB Output is correct
44 Correct 331 ms 1128 KB Output is correct
45 Correct 269 ms 1148 KB Output is correct
46 Correct 150 ms 1140 KB Output is correct
47 Correct 3 ms 332 KB Output is correct
48 Correct 139 ms 1292 KB Output is correct
49 Correct 7 ms 360 KB Output is correct
50 Correct 122 ms 1116 KB Output is correct
51 Correct 12 ms 1228 KB Output is correct
52 Correct 3 ms 332 KB Output is correct
53 Correct 11 ms 1092 KB Output is correct
54 Correct 584 ms 1144 KB Output is correct
55 Correct 492 ms 1152 KB Output is correct
56 Correct 410 ms 1168 KB Output is correct
57 Correct 327 ms 1188 KB Output is correct