http://acm.hdu.edu.cn/showproblem.php?pid=6501

題解：盡量取大的內(nèi)存

/* *@Author: STZG *@Language: C++ */ #include <bits/stdc++.h> #include<iostream> #include<algorithm> #include<cstdlib> #include<cstring> #include<cstdio> #include<string> #include<vector> #include<bitset> #include<queue> #include<deque> #include<stack> #include<cmath> #include<list> #include<map> #include<set> //#define DEBUG #define RI register int #define endl "\n" using namespace std; typedef long long ll; //typedef __int128 lll; const int N=100+10; const int M=100000+10; const int MOD=1e9+7; const double PI = acos(-1.0); const double EXP = 1E-8; const int INF = 0x3f3f3f3f; int t,n,m,k,p,l,r,u,v; ll ans,cnt,flag,temp,sum; ll a[N],station[M]; char str; struct node{}; int main() { #ifdef DEBUGfreopen("input.in", "r", stdin);//freopen("output.out", "w", stdout); #endif//ios::sync_with_stdio(false);//cin.tie(0);//cout.tie(0);//scanf("%d",&t);//while(t--){while(~scanf("%lld",&a[0])){for(int i=1;i<60;i++){scanf("%lld",&a[i]);}scanf("%d",&n);for(int i=1;i<=n;i++){scanf("%lld",&station[i]);}sort(station+1,station+n+1);flag=0;for(int i=1;i<=n;i++){for(int j=59;j>=0;j--){if(!a[j])continue;temp=(1ll<<j);if(temp>station[i])continue;cnt=station[i]/temp;if(cnt>=a[j]){station[i]-=a[j]*temp;a[j]=0;}else{station[i]-=cnt*temp;a[j]-=cnt;}}if(station[i]){flag=1;}}if(flag){cout<<-1<<endl;}else{ans=0;for(int i=59;i>=0;i--){ans=(ans+((a[i]%MOD)*((1ll<<i)%MOD))%MOD)%MOD;}cout<<ans<<endl;}}//}#ifdef DEBUGprintf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC); #endif//cout << "Hello world!" << endl;return 0; }

?

與50位技術(shù)專家面對(duì)面20年技術(shù)見(jiàn)證，附贈(zèng)技術(shù)全景圖

總結(jié)

以上是生活随笔為你收集整理的Memory Banks的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。