oj.uz

Submission #415486

# Submission time Handle Problem Language Result Execution time Memory
415486 2021-06-01T07:13:45 Z MKopchev Packing Biscuits (IOI20_biscuits) C++14
9 / 100
 1000 ms 181612 KB 
#include "biscuits.h"
#include<bits/stdc++.h>
using namespace std;

const int nmax=64;

long long req[nmax];

map<long long,long long> seen[nmax];

long long rec(int bit,long long high)
{
    if(high<0)return 0;

    if(bit==-1)return 1;

    high=min(high,req[bit]);

    if(seen[bit].count(high))return seen[bit][high];

    long long ret=0;
    //0
    ret=ret+rec(bit-1,high);
    //1
    ret=ret+rec(bit-1,high-(1LL<<bit));

    seen[bit][high]=ret;
    return ret;
}
long long count_tastiness(long long x, std::vector<long long> a) {
	long long sum=0;
	for(int i=0;i<60;i++)
    {
        if(i<a.size())sum=sum+(1LL<<i)*a[i];

        req[i]=sum/x;

        seen[i]={};
    }

    return rec(59,req[59]);
}
/*
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:34:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |         if(i<a.size())sum=sum+(1LL<<i)*a[i];
      |            ~^~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 6296 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 12 ms 1248 KB Output is correct
5 Correct 7 ms 844 KB Output is correct
6 Correct 11 ms 1228 KB Output is correct
7 Correct 5 ms 716 KB Output is correct
8 Correct 11 ms 1228 KB Output is correct
9 Correct 9 ms 864 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 2 ms 204 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 6376 KB Output is correct
2 Execution timed out 1099 ms 79084 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1092 ms 181612 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1087 ms 12508 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 6296 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 12 ms 1248 KB Output is correct
5 Correct 7 ms 844 KB Output is correct
6 Correct 11 ms 1228 KB Output is correct
7 Correct 5 ms 716 KB Output is correct
8 Correct 11 ms 1228 KB Output is correct
9 Correct 9 ms 864 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 2 ms 204 KB Output is correct
15 Correct 43 ms 6376 KB Output is correct
16 Execution timed out 1099 ms 79084 KB Time limit exceeded
17 Halted 0 ms 0 KB -