oj.uz

Submission #379546

# Submission time Handle Problem Language Result Execution time Memory
379546 2021-03-18T14:00:20 Z grt Packing Biscuits (IOI20_biscuits) C++17
9 / 100
 89 ms 512 KB 
#include <bits/stdc++.h>
#define PB push_back
#define ST first
#define ND second

//#pragma GCC optimize ("O3")
//#pragma GCC target("tune=native")

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

using namespace std;
using ll = long long;
using pi = pair<int, int>;
using vi = vector<int>;

ll count_tastiness(ll x, vector<ll>a) {
	while((int)a.size() < 60) a.PB(0);
	for(int i = 1; i < 60; ++i) {
		a[i] = a[i - 1] + (a[i] * (1LL << i));
	}
	ll cnt = 0;
	for(int i = 1; i <= 100 * 1000 / x + 1; ++i) {
		ll c = 0;
		bool ok = true;
		for(int j = 0; j < 60; ++j) {
			if((1LL << j) & i) {
				c += (ll)(1LL << j) * x;
			}
			if(c > a[j]) ok = false;
		}
		cnt += ok;
	}
	return cnt+1;
}


//int main() {
	//ios_base::sync_with_stdio(0);
	//cin.tie(0);
	//cout << count_tastiness(2, {2, 1, 2}) << "\n";
	//cout << count_tastiness(3, {5, 2, 1}) << "\n";
//}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 3 ms 364 KB Output is correct
4 Correct 39 ms 364 KB Output is correct
5 Correct 41 ms 368 KB Output is correct
6 Correct 42 ms 364 KB Output is correct
7 Correct 45 ms 364 KB Output is correct
8 Correct 38 ms 512 KB Output is correct
9 Correct 45 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 20 ms 364 KB Output is correct
13 Correct 9 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 368 KB Output is correct
2 Incorrect 52 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 3 ms 364 KB Output is correct
4 Correct 39 ms 364 KB Output is correct
5 Correct 41 ms 368 KB Output is correct
6 Correct 42 ms 364 KB Output is correct
7 Correct 45 ms 364 KB Output is correct
8 Correct 38 ms 512 KB Output is correct
9 Correct 45 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 20 ms 364 KB Output is correct
13 Correct 9 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 89 ms 368 KB Output is correct
16 Incorrect 52 ms 364 KB Output isn't correct
17 Halted 0 ms 0 KB -