oj.uz

답안 #805192

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
805192 2023-08-03T13:52:48 Z alvingogo 비스킷 담기 (IOI20_biscuits) C++14
100 / 100
 12 ms 1324 KB 
#include "biscuits.h"
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define fs first
#define sc second
#define p_q priority_queue
using namespace std;
typedef long long ll;

ll count_tastiness(ll x, vector<ll> a) {
	{
		vector<ll> c(a.size()+1);
		for(int i=0;i<a.size();i++){
			c[i+1]=a[i];
		}
		a=c;
	}
	while(a.size()<=63){
		a.push_back(0);
	}
	vector<ll> b=a;
	int n=a.size();
	for(int i=1;i<n;i++){
		b[i]+=b[i-1]/2;
	}
	vector<ll> dp(n),pre(n),cost(n),cp(n);
	dp[0]=1;
	pre[0]=1;
	cost[0]=9e18;
	for(int i=1;i<n;i++){
		if(b[i]<x){
			dp[i]=0;
			pre[i]=pre[i-1];
			cost[i]=-1;
			cp[0]=9e18;
			continue;
		}
		if(a[i]>=x){
			dp[i]=pre[i-1];
			pre[i]=2*dp[i];
			cost[i]=b[i]-x;
			cp[i]=0;
			continue;
		}
		ll f=x-a[i];
		for(int j=i-1;j>0;j--){
			f*=2;
			if(cost[j]>=0){
				if(cost[j]>=f){
					f-=a[j]-x;
					f=max(f,cp[j]);
					if(j){
						dp[i]+=pre[j-1];
					}
				}
				else{
					f-=a[j];
				}
			}
			else{
				f-=a[j];
			}
		}
		dp[i]++;
		pre[i]=pre[i-1]+dp[i];
		cost[i]=b[i]-x;
		cp[i]=x-a[i];
	}
	return pre[n-1];
}

Compilation message

biscuits.cpp: In function 'll count_tastiness(ll, std::vector<long long int>)':
biscuits.cpp:13:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |   for(int i=0;i<a.size();i++){
      |               ~^~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 232 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 12 ms 1092 KB Output is correct
3 Correct 7 ms 1144 KB Output is correct
4 Correct 7 ms 1076 KB Output is correct
5 Correct 8 ms 1200 KB Output is correct
6 Correct 9 ms 1136 KB Output is correct
7 Correct 7 ms 1080 KB Output is correct
8 Correct 7 ms 1108 KB Output is correct
9 Correct 6 ms 1168 KB Output is correct
10 Correct 7 ms 1080 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 232 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 300 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 2 ms 340 KB Output is correct
38 Correct 12 ms 1092 KB Output is correct
39 Correct 7 ms 1144 KB Output is correct
40 Correct 7 ms 1076 KB Output is correct
41 Correct 8 ms 1200 KB Output is correct
42 Correct 9 ms 1136 KB Output is correct
43 Correct 7 ms 1080 KB Output is correct
44 Correct 7 ms 1108 KB Output is correct
45 Correct 6 ms 1168 KB Output is correct
46 Correct 7 ms 1080 KB Output is correct
47 Correct 2 ms 340 KB Output is correct
48 Correct 7 ms 1324 KB Output is correct
49 Correct 3 ms 340 KB Output is correct
50 Correct 6 ms 1108 KB Output is correct
51 Correct 6 ms 1308 KB Output is correct
52 Correct 2 ms 340 KB Output is correct
53 Correct 5 ms 1108 KB Output is correct
54 Correct 8 ms 1108 KB Output is correct
55 Correct 10 ms 1208 KB Output is correct
56 Correct 11 ms 1204 KB Output is correct
57 Correct 8 ms 1164 KB Output is correct