oj.uz

Submission #379541

# Submission time Handle Problem Language Result Execution time Memory
379541 2021-03-18T13:50:25 Z grt Packing Biscuits (IOI20_biscuits) C++17
9 / 100
 1000 ms 492 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() < 64) a.PB(0);
	ll cnt = 0;
	for(int i = 1; i <= 100 * 1000; ++i) {
		ll c = 0;
		bool ok = true;
		for(int j = 0; j < 64; ++j) {
			c += a[j];
			if((1LL << j) & i) {
				if(c < x) {
					ok = false;
					break;
				}
				c -= x;
			}
			c /= 2;
		}
		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 26 ms 492 KB Output is correct
2 Correct 4 ms 364 KB Output is correct
3 Correct 30 ms 364 KB Output is correct
4 Correct 69 ms 364 KB Output is correct
5 Correct 53 ms 364 KB Output is correct
6 Correct 89 ms 364 KB Output is correct
7 Correct 43 ms 364 KB Output is correct
8 Correct 96 ms 364 KB Output is correct
9 Correct 55 ms 364 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 6 ms 364 KB Output is correct
12 Correct 56 ms 364 KB Output is correct
13 Correct 50 ms 384 KB Output is correct
14 Correct 27 ms 364 KB Output is correct

Subtask #2
0 / 12.0

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

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 40 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 Execution timed out 1088 ms 364 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 492 KB Output is correct
2 Correct 4 ms 364 KB Output is correct
3 Correct 30 ms 364 KB Output is correct
4 Correct 69 ms 364 KB Output is correct
5 Correct 53 ms 364 KB Output is correct
6 Correct 89 ms 364 KB Output is correct
7 Correct 43 ms 364 KB Output is correct
8 Correct 96 ms 364 KB Output is correct
9 Correct 55 ms 364 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 6 ms 364 KB Output is correct
12 Correct 56 ms 364 KB Output is correct
13 Correct 50 ms 384 KB Output is correct
14 Correct 27 ms 364 KB Output is correct
15 Correct 26 ms 364 KB Output is correct
16 Incorrect 64 ms 372 KB Output isn't correct
17 Halted 0 ms 0 KB -