BZOJ2793 [Poi2012]Vouchers

来源：互联网发布：淘宝拖鞋底编辑：程序博客网时间：2024/06/05 16:00

记录每个值的倍数都取到哪了，如果大于最大的幸运数就肯定取不到了，根据调和级数复杂度n log n

#include<iostream>#include<cstdlib>#include<cstdio>#include<cstring>#include<cmath>#include<ctime>#include<algorithm>#include<iomanip>#include<vector>#include<stack>#include<queue>#include<map>#include<set>#include<bitset>using namespace std;#define MAXN 1000010#define MAXM 1010#define ll long long#define INF 1000000000#define MOD 1000000007#define eps 1e-8int m,n;bool lky[MAXN];int now[MAXN];bool vis[MAXN];int mx;ll tot;int ANS;ll ans[MAXN];int main(){int i,x;scanf("%d",&m);for(i=1;i<=m;i++){scanf("%d",&x);lky[x]=1;mx=max(mx,x);}scanf("%d",&n);for(i=1;i<MAXN;i++){now[i]=i;}while(n--){scanf("%d",&x);for(i=1;i<=x;i++){tot++;while(now[x]<=mx&&vis[now[x]]){now[x]+=x;}if(now[x]>mx){i++;break;}if(lky[now[x]]){ans[++ANS]=tot;}vis[now[x]]=1;}tot+=x-i+1; }printf("%d\n",ANS);for(i=1;i<=ANS;i++){printf("%lld\n",ans[i]);}return 0;}/**/

0 0