#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9+7;
int main(){
long long n; cin >> n;
long long x;
long long ans = 0;
vector<long long> w, h, comp;
long long wsum = 0;
for(long long i = 0; i < n; i++){
cin >> x;
h.push_back(x);
}
for(long long i = 0; i < n; i++){
cin >> x;
wsum += x;
wsum = wsum % MOD;
w.push_back(x);
}
for(long long i = 0; i < n; i++){
if(h[i] == 2){
if(i == 0) comp.push_back(w[i]);
else if(h[i-1] == 2) comp.back() += w[i];
else comp.push_back(w[i]);
}
}
for(long long k : comp) {
k = k % MOD;
ans += k*(k+1);
ans = ans % MOD;
}
ans += wsum*(wsum+1)/2;
ans = ans % MOD;
cout << ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
25 ms |
1356 KB |
Output is correct |
4 |
Correct |
49 ms |
2576 KB |
Output is correct |
5 |
Correct |
67 ms |
2504 KB |
Output is correct |
6 |
Correct |
49 ms |
2588 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Incorrect |
2 ms |
212 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |