-
Notifications
You must be signed in to change notification settings - Fork 0
/
0549.cpp
56 lines (50 loc) · 1.05 KB
/
0549.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
#include <iostream>
#include <algorithm>
using namespace std;
class BIT{
public:
int *p;
int num;
BIT(int arg){
p = new int[arg+1];
for(int i=0;i<arg+1;i++) p[i] = 0;
num = arg;
}
//return sum of p[1] ... p[arg]
int sum(int arg){
int ret=0;
while(arg > 0){
ret += p[arg];
arg -= arg & -arg;
}
return ret;
}
//add value to index-th node
void add(int index, int value){
while(index <= num){
p[index] += value;
index += index & -index;
}
}
};
int main(){
int n, m, tmp;
int mod = 100000;
int ret = 0;
cin >> n >> m;
BIT bit(n);
for(int i=1;i<n;i++){
cin >> tmp;
bit.add(i,tmp%mod);
}
int pos = 0;
for(int i=0;i<m;i++){
cin >> tmp;
ret += abs(bit.sum(pos) - bit.sum(pos+tmp)) % mod;
ret %= mod;
pos += tmp;
// cout << "ret = " << ret << endl;
// cout << "pos = " << pos << endl;
}
cout << ret << endl;
}