#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod=1000000007;
int f(int wossz, int hossz){
return (((((hossz*(hossz+1)/2)%mod) * wossz)%mod)*(wossz+1)/2)%mod;
}
int32_t main() {
// all hi are equal --> téglalap
int s;
cin>>s;
int h[s];
int w[s];
int wossz = 0;
bool teglalap = true;
for (int i=0; i<s; i++){
cin >> h[i];
if (h[i] != h[0]) teglalap = false;
}
int hossz = h[0];
for(int i=0; i<s; i++){
cin>>w[i];
wossz = (w[i] + wossz) % mod;
}
if (teglalap){
cout << f(wossz, hossz);
return 0;
}
//cout << (((((hossz*(hossz+1)/2)%mod) * wossz)%mod)*(wossz+1)/2)%mod<<"\n";
// --------------- lépcső -----------------
int ans = f(wossz, h[0]);
wossz = (wossz - w[0])%mod;
for (int i=1; i<s; i++){
ans = (ans + f((wossz+mod)%mod, h[i]))%mod;
ans = (ans - f((wossz+mod)%mod, h[i-1]))%mod;
wossz = (wossz - w[i])%mod;
}
ans=(ans+mod)%mod;
cout << ans<<"\n";
return 0;
}
# |
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 |
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 |
Correct |
8 ms |
340 KB |
Output is correct |
3 |
Correct |
35 ms |
980 KB |
Output is correct |
4 |
Correct |
73 ms |
1748 KB |
Output is correct |
5 |
Correct |
77 ms |
1748 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
8 ms |
448 KB |
Output is correct |
4 |
Correct |
37 ms |
980 KB |
Output is correct |
5 |
Correct |
72 ms |
1832 KB |
Output is correct |
6 |
Correct |
75 ms |
1748 KB |
Output is correct |
7 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 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 |
0 ms |
212 KB |
Output is correct |
2 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |