oj.uz

Submission #860493

# Submission time Handle Problem Language Result Execution time Memory
860493 2023-10-13T06:50:50 Z mychecksedad Packing Biscuits (IOI20_biscuits) C++17
9 / 100
 1000 ms 658144 KB 
#include<biscuits.h>
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
const int N = 1e6+100, M = 1e5+10, K = 22;

ll count_tastiness(ll x, vector<ll> a){
	vector<ll> p;
	p.pb(0);
	ll ans = 1;
	for(int i = 0; i < 100; ++i) a.pb(0);
	int n = a.size();
	for(int i = 0; i < n; ++i){
		ans += int(p.size()) - (lower_bound(all(p), x - a[i]) - p.begin());
		vector<ll> np, np2;
		for(auto y: p){
			np.pb((y+a[i])>>1);
			if(y+a[i]-x >= 0) np2.pb((y+a[i]-x)>>1);
		}
		p.clear();
		merge(all(np), all(np2), back_inserter(p));
		// for(auto f: p) cout << f << ' ';
		// en;
	// cout << ans << '\n';
	}
	return ans;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 3128 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 64 ms 1736 KB Output is correct
5 Correct 12 ms 1056 KB Output is correct
6 Correct 200 ms 3100 KB Output is correct
7 Correct 6 ms 604 KB Output is correct
8 Correct 187 ms 3112 KB Output is correct
9 Correct 17 ms 1092 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 86 ms 1116 KB Output is correct
13 Correct 30 ms 724 KB Output is correct
14 Correct 3 ms 348 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 3192 KB Output is correct
2 Execution timed out 1063 ms 263144 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 1072 ms 658144 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 1029 ms 6804 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 3128 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 64 ms 1736 KB Output is correct
5 Correct 12 ms 1056 KB Output is correct
6 Correct 200 ms 3100 KB Output is correct
7 Correct 6 ms 604 KB Output is correct
8 Correct 187 ms 3112 KB Output is correct
9 Correct 17 ms 1092 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 86 ms 1116 KB Output is correct
13 Correct 30 ms 724 KB Output is correct
14 Correct 3 ms 348 KB Output is correct
15 Correct 57 ms 3192 KB Output is correct
16 Execution timed out 1063 ms 263144 KB Time limit exceeded
17 Halted 0 ms 0 KB -