oj.uz

답안 #308657

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
308657 2020-10-01T16:30:56 Z cheetose 비스킷 담기 (IOI20_biscuits) C++17
0 / 100
 179 ms 384 KB 
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<db> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const int MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) { ll ret = 1; for (; b; b >>= 1, a = (a*a) % MMM)if (b & 1)ret = (ret*a) % MMM; return ret; }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
int ddx[] = { -1,-2,1,-2,2,-1,2,1 }, ddy[] = { -2,-1,-2,1,-1,2,1,2 };

#include "biscuits.h"
ll count_tastiness(ll x, Vll a){
	ll ans=1;
	int n=a.size();
	n=62;
	a.resize(n);
	fup(i,0,n-1,1){
		ll l=(1LL<<i),r=l*2-1;
		while(l<=r){
			ll k=l+r>>1;
			ll rem=0;
			fdn(j,i,0,1){
				rem*=2;
				if(j<=60 && k&(1LL<<j)){
					rem+=x;
				}
				if(rem>1e18){
						break;
				}
				rem=max(0LL,rem-a[j]);
			}
			if(rem==0)l=k+1;
			else r=k-1;
		}
		ans+=r-(1LL<<i)+1;
	}
	return ans;
}
/*
int main() {
	ll x;
	int n;
	scanf("%d%lld",&n,&x);
	Vll v(n);
	fup(i,0,n-1,1)scanf("%lld",&v[i]);
	printf("%lld\n",count_tastiness(x,v));
}*/

Compilation message

biscuits.cpp: In function 'll count_tastiness(ll, Vll)':
biscuits.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
biscuits.cpp:48:2: note: in expansion of macro 'fup'
   48 |  fup(i,0,n-1,1){
      |  ^~~
biscuits.cpp:51:10: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   51 |    ll k=l+r>>1;
      |         ~^~
biscuits.cpp:11:30: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   11 | #define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
      |                              ^
biscuits.cpp:53:4: note: in expansion of macro 'fdn'
   53 |    fdn(j,i,0,1){
      |    ^~~

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 179 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -