oj.uz

Submission #829151

# Submission time Handle Problem Language Result Execution time Memory
829151 2023-08-18T05:33:07 Z definitelynotmee Packing Biscuits (IOI20_biscuits) C++17
9 / 100
 1000 ms 1251408 KB 
#include "biscuits.h"
//#include"grader.cpp"
#include<bits/stdc++.h>
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using pii = pair<int,int>;
const ll INFL = 2e18;
using pll = pair<ll,ll>;


long long count_tastiness(long long x, std::vector<long long> a) {
	a.resize(60,0);

	int k = a.size();

	vector<ll> ct(k);

	ct[0] = a[0];

	for(int i = 1; i < k; i++){
		ct[i] = a[i]*(1ll<<i)+ct[i-1];
	}

	vector<ll> poss = {0};

	for(int i = 0; i < k; i++){
		if((1ll<<i)*x >= INFL)
			break;
		int n = poss.size();

		for(int j = 0; j < n; j++){
			if(ct[i]-poss[j]*x >= (1ll<<i)*x)
				poss.push_back((1ll<<i)+poss[j]);
		}
	}

	return poss.size();
	
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1356 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 6 ms 1100 KB Output is correct
5 Correct 2 ms 524 KB Output is correct
6 Correct 15 ms 2024 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 16 ms 2052 KB Output is correct
9 Correct 3 ms 496 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 292 KB Output is correct
12 Correct 6 ms 708 KB Output is correct
13 Correct 3 ms 468 KB Output is correct
14 Correct 1 ms 212 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1356 KB Output is correct
2 Execution timed out 1120 ms 1051016 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 1106 ms 1251408 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 1059 ms 4020 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1356 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 6 ms 1100 KB Output is correct
5 Correct 2 ms 524 KB Output is correct
6 Correct 15 ms 2024 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 16 ms 2052 KB Output is correct
9 Correct 3 ms 496 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 292 KB Output is correct
12 Correct 6 ms 708 KB Output is correct
13 Correct 3 ms 468 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 4 ms 1356 KB Output is correct
16 Execution timed out 1120 ms 1051016 KB Time limit exceeded
17 Halted 0 ms 0 KB -