2018浙江省赛(ACM) The 15th Zhejiang Provincial Collegiate Programming Contest Sponsored by TuSimple

比赛链接

F. Now Loading!!!

Time Limit: 1 Second Memory Limit: 131072 KB
DreamGrid has integers . DreamGrid also has queries, and each time he would like to know the value of
for a given number , where , .

Input
There are multiple test cases. The first line of input is an integer indicating the number of test cases. For each test case:

The first line contains two integers and () – the number of integers and the number of queries.

The second line contains integers ().

The third line contains integers ().

It is guaranteed that neither the sum of all nor the sum of all exceeds .

Output
For each test case, output an integer , where is the answer for the -th query.

Sample Input
2
3 2
100 1000 10000
100 10
4 5
2323 223 12312 3
1232 324 2 3 5
Sample Output
11366
45619

题目描述：

给出n个数，m次询问，每次询问给出一个p，对于每次询问按照公式求值，最后按照要求输出

代码：

#include <cstdio>
#include <cstring>
#include <string>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <queue>
#include <vector>
#include <stack>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
const int INF = 0x3f3f3f3f;
const int MaxN = 5e5 + 5;
const int pt = 1e9;

int n;
LL a[MaxN], sum[MaxN][32]; //注意爆内存

int get_R(LL x) {
    int l = 1, r = n, ans = 0;
    while(l <= r) {
        int mid = (l + r) >