#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i,s,e) for(int i = s; i <= (int)e; ++i)
#define DEC(i,s,e) for(int i = s; i >= (int)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
#define db(x) cerr << #x << "=" << x << "\n"
#define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n"
#define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n"
#define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n"
#define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{" << ite.f << ',' << ite.s << "} "; cerr << "\n"
#define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n"
#define reach cerr << "LINE: " << __LINE__ << "\n";
#else
#define reach
#define db(x)
#define db2(x,y)
#define db3(a,b,c)
#define dbv(v)
#define dbvp(v)
#define dba(a,ss,ee)
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define f first
#define s second
#define g0(x) get<0>(x)
#define g1(x) get<1>(x)
#define g2(x) get<2>(x)
#define g3(x) get<3>(x)
typedef pair <int, int> pi;
typedef tuple<int,int,int> ti3;
typedef tuple<int,int,int,int> ti4;
int rand(int a, int b) { return a + rng() % (b-a+1); }
const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 500;
const long long oo = (long long)1e18 + 500;
template <typename T> bool chmax(T& a, const T b) { return a<b ? a = b, 1 : 0; }
template <typename T> bool chmin(T& a, const T b) { return a>b ? a = b, 1 : 0; }
const int MAXN = -1;
map<int,int> dp[130]; // dp[index done][number of free things carried over] = number of ways
int k;
int l;
int X;
vector<int> V;
int lst = 0;
vector<pi> ranges;
int out=1;
int lim = 123;
pi cur;
bool can(int debt, int idx) {
if(idx < cur.f && debt<=0)return 1;
DEC(i,idx,cur.f) {
if(debt>2*oo)return 0;
debt-=V[i];
debt*=2;
if(debt<=0)return 1;
}
return 0;
}
int get(pi range) {
cur=range;
// just find the biggest thing, and the thing will be continuous.
// how? biggest thing is just lexographically biggest string from the front or something. yay
int need = 0;
int res = 0;
DEC(i,cur.s,cur.f) { // try to activate it first. else don't
// you need to make it come from someone before
if(can((need + X-V[i])*2, i-1)){ // i can turn this on!
res += 1ll<<(i-cur.f);
need = (need + X-V[i]) * 2;
} else { // i cannot. just ignore
need*=2;
assert(need<=2*oo);
}
chmax(need, 0ll);
}
return res+1;
}
long long count_tastiness(long long X, std::vector<long long> vec) {
::X=X;
l=vec.size();
dbv(vec);
V=vector<int>(lim,0);
FOR(i,0,l-1)V[i]=vec[i];
int carry = 0;
FOR(i,0,l-1) {
if(V[i] + carry >= X) {
carry = vec[i] + carry - X;
carry/=2;
} else {
ranges.pb({lst, i});
lst=i+1;
carry=0;
}
}
if(ranges.back().s!=l-1)ranges.pb({lst,l-1});
dbvp(ranges);
for(auto i:ranges) {
db3(i.f,i.s,get(i));
out = out * get(i);
}
return out;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1 ms |
340 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1 ms |
468 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
