Submission #1662199

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7;
int n,m,tmp,a[100010],li[100010];

int main(){
	cin >> n >> m;
	REP(i,1,n) cin >> tmp,li[i+1]=li[i]+tmp;
	REP(i,0,m) cin >> a[i];
	
	int s=0,pos=1;
	REP(i,0,m) (s+=abs(li[pos+a[i]]-li[pos]))%=100000,pos+=a[i];
	
	cout << s << endl;
	return 0;
}

Submission Info

Judge Result