oj.uz

Submission #829108

# Submission time Handle Problem Language Result Execution time Memory
829108 2023-08-18T04:34:50 Z definitelynotmee Packing Biscuits (IOI20_biscuits) C++17
42 / 100
 1000 ms 42276 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 = numeric_limits<ll>::max();
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<pll> dp;

	auto resp_for_carry =[&](ll carry){
		return lower_bound(all(dp),pll({carry,0ll}))->ss;
	};

	auto getdp =[&](ll vi, ll carry){
		return resp_for_carry(2*(carry-vi)) + resp_for_carry(2*(carry+x-vi));
	};
	dp.push_back({0,1});
	dp.push_back({INFL,0});

	auto dc =[&](ll l, ll r, ll respl, ll respr, ll vi, vector<pll> & newdp, auto dc) -> void {
		if(l > r || respl == respr)
			return;
		ll m = (l+r)>>1;


		ll cur = getdp(vi,m);
		newdp.push_back({m,cur});

		dc(l,m-1,respl,cur,vi,newdp,dc);
		dc(m+1,r,cur,respr,vi,newdp,dc);
	};

	for(int i = 0; i < 60; i++){
		vector<pll> newdp;
		newdp.push_back({0,getdp(a[i],0)});
		newdp.push_back({INFL,0});

		dc(1,4e18, newdp[0].ss, 0, a[i], newdp, dc);

		sort(all(newdp));

		dp.swap(newdp);
	}
	return dp[0].ss;

}

Compilation message

biscuits.cpp: In function 'long long int count_tastiness(long long int, std::vector<long long int>)':
biscuits.cpp:17:6: warning: unused variable 'k' [-Wunused-variable]
   17 |  int k = a.size();
      |      ^

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 2 ms 212 KB Output is correct
3 Correct 3 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 2 ms 212 KB Output is correct
6 Correct 2 ms 212 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 2 ms 212 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Correct 2 ms 212 KB Output is correct
12 Correct 2 ms 212 KB Output is correct
13 Correct 3 ms 316 KB Output is correct
14 Correct 4 ms 212 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 2 ms 212 KB Output is correct
3 Correct 3 ms 212 KB Output is correct
4 Correct 3 ms 308 KB Output is correct
5 Correct 3 ms 212 KB Output is correct
6 Correct 3 ms 212 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 3 ms 212 KB Output is correct
9 Correct 2 ms 212 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 1904 KB Output is correct
2 Correct 200 ms 1380 KB Output is correct
3 Correct 329 ms 1332 KB Output is correct
4 Correct 3 ms 212 KB Output is correct
5 Correct 3 ms 212 KB Output is correct
6 Correct 3 ms 212 KB Output is correct
7 Correct 3 ms 212 KB Output is correct
8 Correct 797 ms 1860 KB Output is correct
9 Correct 550 ms 1876 KB Output is correct
10 Correct 3 ms 296 KB Output is correct
11 Correct 14 ms 212 KB Output is correct
12 Correct 121 ms 536 KB Output is correct
13 Correct 770 ms 2004 KB Output is correct

Subtask #4
0 / 35.0

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

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 2 ms 212 KB Output is correct
3 Correct 3 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 2 ms 212 KB Output is correct
6 Correct 2 ms 212 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 2 ms 212 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Correct 2 ms 212 KB Output is correct
12 Correct 2 ms 212 KB Output is correct
13 Correct 3 ms 316 KB Output is correct
14 Correct 4 ms 212 KB Output is correct
15 Correct 2 ms 212 KB Output is correct
16 Correct 2 ms 212 KB Output is correct
17 Correct 3 ms 212 KB Output is correct
18 Correct 3 ms 308 KB Output is correct
19 Correct 3 ms 212 KB Output is correct
20 Correct 3 ms 212 KB Output is correct
21 Correct 2 ms 212 KB Output is correct
22 Correct 3 ms 212 KB Output is correct
23 Correct 2 ms 212 KB Output is correct
24 Correct 96 ms 1904 KB Output is correct
25 Correct 200 ms 1380 KB Output is correct
26 Correct 329 ms 1332 KB Output is correct
27 Correct 3 ms 212 KB Output is correct
28 Correct 3 ms 212 KB Output is correct
29 Correct 3 ms 212 KB Output is correct
30 Correct 3 ms 212 KB Output is correct
31 Correct 797 ms 1860 KB Output is correct
32 Correct 550 ms 1876 KB Output is correct
33 Correct 3 ms 296 KB Output is correct
34 Correct 14 ms 212 KB Output is correct
35 Correct 121 ms 536 KB Output is correct
36 Correct 770 ms 2004 KB Output is correct
37 Execution timed out 1079 ms 42276 KB Time limit exceeded
38 Halted 0 ms 0 KB -