Submission #1222150

#TimeUsernameProblemLanguageResultExecution timeMemory
1222150MalixPacking Biscuits (IOI20_biscuits)C++20
9 / 100
1093 ms416 KiB
#include "biscuits.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<vi> vii; typedef pair<int,int> pi; typedef vector<pi> pii; typedef tuple<int,int,int> ti; typedef vector<ll> li; typedef vector<li> lii; #define REP(i,a,b) for(int i=a;i<b;i++) #define F first #define S second #define PB push_back #define LSOne(s) ((s)&(-s)) #define all(x) (x).begin(),(x).end() ll INF=1000000000000000010; int inf=1e9+10; ll M=1e9+7; long long count_tastiness(long long x, std::vector<long long> a) { ll ans=1; int mx=100001; while(a.size()<20)a.PB(0); REP(i,1,mx){ vector<ll> c=a; bool flag=1; REP(j,0,20){ if((1<<j)&i)c[j]-=x; if(c[j]<0){ flag=0; break; } if(c[j]>0&&j!=19)c[j+1]+=c[j]/2; } if(flag)ans++; } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...