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
using namespace std;
int main(){
// SUBTASK 4---->SOLUTION
ll n,z,s;
ll mod=1e9+7;
cin>>n;
ll h[n];
ll w[n];
for(ll i=0;i<n;i++){
cin>>h[i];
}
ll he=h[0];
ll we=0;
for(ll i=0;i<n;i++){
cin>>w[i];
we=(we+w[i])%mod;
}
if(he%2==0){
ll p=he/2;
z=p*(he+1)%mod;
}
else{
ll p=(he+1)/2;
z=(p*he)%mod;
}
if(we%2==0){
ll p=we/2;
s=p*(we+1)%mod;
}
else{
ll p=(we+1)/2;
s=(p*we)%mod;
}
ll res=z*s%mod;
cout<<res;
}
# | 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... |