| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1181401 | guagua0407 | Packing Biscuits (IOI20_biscuits) | C++20 | 1094 ms | 24100 KiB |
#include "biscuits.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
long long count_tastiness(long long x, std::vector<long long> a) {
while((int)a.size()<60) a.push_back(0);
map<ll,ll> mp,nmp;
mp[0]=1;
for(int i=0;i<60;i++){
for(auto v:mp){
ll cur=a[i]+v.f;
{
ll nxt=cur/2;
nmp[nxt]+=v.s;
}
if(cur>=x){
ll nxt=(cur-x)/2;
nmp[nxt]+=v.s;
}
}
swap(mp,nmp);
nmp.clear();
}
ll ans=0;
for(auto v:mp){
ans+=v.s;
}
return ans;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
