oj.uz

Submission #385993

# Submission time Handle Problem Language Result Execution time Memory
385993 2021-04-05T11:09:55 Z PedroBigMan Packing Biscuits (IOI20_biscuits) C++14
0 / 100
 1000 ms 512 KB 
#include "biscuits.h"
/*
Author of all code: Pedro BIGMAN Dias
Last edit: 15/02/2021
*/
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <list>
#include <iomanip>
#include <stdlib.h>
#include <time.h>
#include <cstring>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=(ll) a; i<(ll) b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define whole(x) x.begin(),x.end()
#define DEBUG(i) cout<<"Pedro Is The Master "<<i<<endl
#define INF 500000000LL
#define EPS 0.00000001
#define pi 3.14159
ll mod=1000000007LL;

template<class A=ll> 
void Out(vector<A> a) {REP(i,0,a.size()) {cout<<a[i]<<" ";} cout<<endl;}

template<class A=ll>
void In(vector<A> &a, ll N) {A cur; REP(i,0,N) {cin>>cur; a.pb(cur);}} 

ll count_tastiness(long long x, vector<ll> a) 
{
	while(a.size()<60) {a.pb(0LL);}
	ll ans=0LL;
	vector<ll> needed, ava; REP(i,0,60) {needed.pb(0LL); ava.pb(0LL);}
	for(ll y = 100000LL; y>=0LL; y--)
	{
		REP(i,0,60) {needed[i]=0LL; ava[i]=a[i];}
		ll z = y;
		REP(i,0,60) {if(z%2!=0) {needed[i]+=x;} z=z/2LL;}
		ll deficit;
		bool ok=true;
		for(ll pos = 59;pos>=0;pos--) 
		{
			if(ava[pos]>=needed[pos]) {needed[pos]=0LL; continue;}
			if(pos==0) {ok=false; break;}
			deficit = needed[pos]-ava[pos]; needed[pos-1]+=2LL*deficit;
		}
		if(ok) {ans++;}
	}
	return ans;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 253 ms 512 KB Output is correct
2 Incorrect 256 ms 492 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

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

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 222 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 1084 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 253 ms 512 KB Output is correct
2 Incorrect 256 ms 492 KB Output isn't correct
3 Halted 0 ms 0 KB -