This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vl vector<ll>
#define mp make_pair
#define pb push_back
using namespace std;
const int MOD = 1e9 + 7;
int main(){
int n;
cin>>n;
vl visina, sirina;
for(int i = 0; i < n; i++){
ll a;
cin>>a;
visina.pb(a);
}
for(int i = 0; i < n; i++){
ll a;
cin>>a;
sirina.pb(a);
}
ll rez = 0, cur = 0, sum = 0;
for(int i = 0; i < n; i++){
sum += sirina[i];
sum %= MOD;
if(visina[i] == 2)
{
cur += sirina[i];
cur %= MOD;
}
else{
if(cur > 0){
rez += cur * (cur + 1);
rez %= MOD;
cur = 0;
}
}
}
if(cur > 0){
rez += cur * (cur + 1);
rez %= MOD;
}
rez += sum * (sum + 1) / 2;
rez %= MOD;
cout<<rez<<endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |