Kiritow/OJ-Problems-Source
1
0
Fork 0
mirror of https://github.com/Kiritow/OJ-Problems-Source.git synced 2024-03-22 13:11:29 +08:00
Code Issues Projects Releases Wiki Activity

From http://blog.csdn.net/qq_33765907/article/details/51228610

Browse Source
This commit is contained in:
KiritoTRw 2016-04-27 20:34:30 +08:00
parent ff3a999fb6
commit 1beb2efb0a
1 changed files with 38 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

38
ZOJ/3940_csdn.cpp Normal file
View File

@ -0,0 +1,38 @@
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100000 + 10, M = 1e9 + 7;
int a[MAXN], n, m;
map<int, int> last;
void run() {
scanf("%d%d", &n, &m);
last.clear(); last[m] = 1;
for (int i = 0; i < n; ++i) {
int x, s = 0; scanf("%d", &x);
auto it = last.lower_bound(x);
for (; it != last.end(); ) {
last[it->first % x] += it->second;
s += it->second * (it->first / x);
it = last.erase(it);
}
if (s) last[x - 1] += s;
}
int s = 0;
for (auto it = last.rbegin(); it != last.rend(); ++it) {
it->second += s; s = it->second;
}
int q, ret = 0; scanf("%d", &q);
for (int i = 1; i <= q; ++i) {
int x; scanf("%d", &x);
auto it = last.lower_bound(x);
if (it != last.end()) ret += 1ll * it->second * i % M;
if (ret >= M) ret -= M;
}
printf("%d\n", ret);
}
int main() {
int T; scanf("%d", &T);
for (int cas = 1; cas <= T; ++cas) run();
return 0;
}