oj.uz

답안 #825503

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
825503 2023-08-15T00:10:45 Z Edu175 비스킷 담기 (IOI20_biscuits) C++17
33 / 100
 887 ms 2097152 KB 
#include "biscuits.h"
#include <bits/stdc++.h>
#define pb push_back
#define fst first
#define snd second
#define fore(i,a,b) for(ll i=a,ioi=b;i<ioi;i++)
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(),x.end()
#define mset(a,v) memset((a),(v),sizeof(a))
#define imp(v) for(auto dfh:v)cout<<dfh<<" ";cout<<"\n"
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;
typedef __int128 bint;

vector<ll>a; ll n;
ll x;
vector<vector<bint>> dp;

long long count_tastiness(long long X, vector<long long> A){
	x=X; n=0;
	bint sum=0;
	fore(i,0,SZ(A)){
		sum+=bint(A[i])*bint(1ll<<i);
	}
	//cout<<(ll)sum<<" ";
	while(sum)n++,sum/=2;
	//cout<<n<<"\n";
	n+=3;
	a.clear();
	a.resize(n,0);
	fore(i,0,n)if(i<SZ(A))a[i]=A[i];
	fore(i,0,n-1){
		if(a[i]-x<0)continue;
		ll q=(a[i]-x)/2;
		a[i+1]+=q;
		a[i]-=2*q;
	}
	ll MAXN=n+3,MAXQ=3*x+5;
	dp.clear();
	dp.resize(MAXN,vector<bint>(MAXQ,0));
	//fore(i,1,x+5)dp[n][i]=0;
	//imp(a);
	dp[n][0]=1;
	for(ll i=n-1;i>=0;i--)fore(q,0,MAXQ){
		bint &res=dp[i][q];
		res=0;
		res+=dp[i+1][(a[i]+q)/2];
		if(a[i]+q>=x)res+=dp[i+1][(a[i]+q-x)/2];
		/*cout<<i<<" "<<q<<": ["<<(a[i]+q)/2<<"] ["<<(a[i]+q-x)/2<<"]: "<<dp[i+1][(a[i]+q)/2]<<" ";
		if(a[i]+q>=x)cout<<dp[i+1][(a[i]+q-x)/2];
		else cout<<0;
		cout<<": "<<res<<"\n";*/
	}
	ll res=dp[0][0];
	return res;
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 2 ms 560 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 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 1 ms 300 KB Output is correct
9 Correct 1 ms 300 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 81 ms 31796 KB Output is correct
2 Correct 43 ms 20452 KB Output is correct
3 Correct 60 ms 27776 KB Output is correct
4 Correct 0 ms 300 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 168 ms 32388 KB Output is correct
9 Correct 128 ms 27120 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 724 KB Output is correct
12 Correct 14 ms 4644 KB Output is correct
13 Correct 154 ms 31920 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 887 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 2 ms 560 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -