ZOJ4029 Now Loading!!! （预处理+二分）

#include<iostream>
#include<cstring>
#include<cstdio>
#include<map>
#include<algorithm>
#include<queue>
#define ull unsigned long long
using namespace std;
typedef long long ll;
typedef pair<int,int> pll;
const int N=5e5+10;
const int mod=1e9;
int sum[N];
int f[31][N];
int a[N];
int p[N];
int cnt[N];
int n,m;
void init(){
    int i,j;
    for(i=1;i<=30;i++){
        f[i][0]=0;
        for(j=1;j<=n;j++){
            f[i][j]=(f[i][j-1]+a[j]/i)%mod;
        }
    }
}
int main(){
    int t;
    cin>>t;
    while(t--){
        cin>>n>>m;
        int i;
        for(i=1;i<=n;i++){
            scanf("%d",&a[i]);
        }
        for(i=1;i<=m;i++){
            scanf("%d",&p[i]);
        }
        sort(a+1,a+1+n);
        init();
        ll sum=0;
        for(i=1;i<=m;i++){
            ll tmp=1;
            int idx=0;
            ll ans=0;
            while(tmp*p[i]<=a[n]){
                tmp*=p[i];
                int l=0,r=n;
                while(l<r){
                    int mid=l+r+1>>1;
                    if(a[mid]<=tmp)
                        l=mid;
                    else
                        r=mid-1;
                }
                cnt[++idx]=r;
            }
            if(cnt[idx]<n){
                cnt[++idx]=n;
            }
            for(int j=1;j<=idx;j++){
                ans=(ans+f[j][cnt[j]]-f[j][cnt[j-1]]+mod)%mod;
            }
            sum=(sum+ans*i)%mod;
        }
        cout<<(sum+mod)%mod<<endl;
    }
}