| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 726043 | NemanjaSo2005 | 비스킷 담기 (IOI20_biscuits) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
//#include <bits/stdc++.h>#define ll long longusing namespace std;const int MaxK=60;ll res,br,kol[MaxK*4],stepen[MaxK*4],del,K;ll count_tastiness(ll x,vector<ll> A){stepen[0]=1;for(int i=1;i<=MaxK;i++)stepen[i]=stepen[i-1]*2;for(int i=MaxK+1;i<MaxK*4;i++)stepen[i]=1;br=x;K=A.size();for(int i=0;i<K;i++)kol[i]=A[i];for(int i=K;i<4*MaxK;i++)kol[i]=0;res=1;ll br=0,maks=0;del=1;for(int i=0;i<4*MaxK;i++){if(br<x){res*=(maks/x+1);// cout<<i<<" "<<maks+1<<endl;br=0;maks=0;del=stepen[i];}br+=kol[i];maks+=#include <bits/stdc++.h>#define ll long longusing namespace std;const int MaxK=60;ll res,br,kol[MaxK*4],stepen[MaxK*4],del,K;ll count_tastiness(ll x,vector<ll> A){stepen[0]=1;for(int i=1;i<=MaxK;i++)stepen[i]=stepen[i-1]*2;for(int i=MaxK+1;i<MaxK*4;i++)stepen[i]=1;br=x;K=A.size();for(int i=0;i<K;i++)kol[i]=A[i];for(int i=K;i<4*MaxK;i++)kol[i]=0;res=1;ll br=0,maks=0;del=1;for(int i=0;i<4*MaxK;i++){if(br<x){res*=(maks/x+1);// cout<<i<<" "<<maks+1<<endl;br=0;maks=0;del=stepen[i];}br+=kol[i];maks+=kol[i]*stepen[i]/del;br/=2;}return res;}/#include <bits/stdc++.h>#define ll long longusing namespace std;const int MaxK=60;ll res,br,kol[MaxK*4],stepen[MaxK*4],del,K;ll count_tastiness(ll x,vector<ll> A){stepen[0]=1;for(int i=1;i<=MaxK;i++)stepen[i]=stepen[i-1]*2;for(int i=MaxK+1;i<MaxK*4;i++)stepen[i]=1;br=x;K=A.size();for(int i=0;i<K;i++)kol[i]=A[i];for(int i=K;i<4*MaxK;i++)kol[i]=0;res=1;ll br=0,maks=0;del=1;for(int i=0;i<4*MaxK;i++){if(br<x){res*=(maks/x+1);// cout<<i<<" "<<maks+1<<endl;br=0;maks=0;del=stepen[i];}br+=kol[i];maks+=kol[i]*stepen[i]/del;br/=2;}return res;}#include <bits/stdc++.h>#define ll long longusing namespace std;const int MaxK=60;ll res,br,kol[MaxK*4],stepen[MaxK*4],del,K;ll count_tastiness(ll x,vector<ll> A){stepen[0]=1;for(int i=1;i<=MaxK;i++)stepen[i]=stepen[i-1]*2;for(int i=MaxK+1;i<MaxK*4;i++)stepen[i]=1;br=x;K=A.size();for(int i=0;i<K;i++)kol[i]=A[i];for(int i=K;i<4*MaxK;i++)kol[i]=0;res=1;ll br=0,maks=0;del=1;for(int i=0;i<4*MaxK;i++){if(br<x){res*=(maks/x+1);// cout<<i<<" "<<maks+1<<endl;br=0;maks=0;del=stepen[i];}br+=kol[i];maks+=kol[i]*stepen[i]/del;br/=2;}return res;}#include <bits/stdc++.h>#define ll long longusing namespace std;const int MaxK=60;ll res,br,kol[MaxK*4],stepen[MaxK*4],del,K;ll count_tastiness(ll x,vector<ll> A){stepen[0]=1;for(int i=1;i<=MaxK;i++)stepen[i]=stepen[i-1]*2;for(int i=MaxK+1;i<MaxK*4;i++)stepen[i]=1;br=x;K=A.size();for(int i=0;i<K;i++)kol[i]=A[i];for(int i=K;i<4*MaxK;i++)kol[i]=0;res=1;ll br=0,maks=0;del=1;for(int i=0;i<4*MaxK;i++){if(br<x){res*=(maks/x+1);// cout<<i<<" "<<maks+1<<endl;br=0;maks=0;del=stepen[i];}br+=kol[i];maks+=kol[i]*stepen[i]/del;br/=2;}return res;}