# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
374831 | 2021-03-08T09:42:58 Z | Jarif_Rahman | Packing Biscuits (IOI20_biscuits) | C++17 | 2 ms | 364 KB |
#include "biscuits.h" #include <bits/stdc++.h> #define pb push_back #define f first #define sc second using namespace std; typedef long long int ll; typedef string str; const int kk = 200; ll count_tastiness(ll x, vector<ll> a){ int k = a.size(); a.resize(kk, 0); ll ans = 1, c0 = 0, c1 = 0, cur = 0; int block = -1; for(int i = 0; i < kk; i++){ if(a[i] == 0){ ans*=max(cur, 1LL); cur = 0, c0 = 0, c1 = 0; block = i; continue; } if(a[i] == 1){ cur+=1; for(int j = i-1; j > block; j--){ if(a[j] == 1){ ll s = j-block-1; s = 1LL<<s; cur+=s; } } c1++; continue; } ll s = c0+c1; s = 1LL<<s; cur+=s; if(i != kk-1) a[i+1]+=a[i]/2; a[i]%=2; (a[i] == 0? c0: c1)++; } if(ans > 1) ans++; return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 364 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |