| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1279176 | abyfu | Fancy Fence (CEOI20_fancyfence) | C++20 | 0 ms | 0 KiB |
//OwO
//#pragma GCC optimize("O3", "unroll-loops", "O2", "Ofast")
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define namein "input.txt"
#define nameout "output.txt"
#define all(x) x.begin(),x.end()
#define fi first
#define se second
#define pb push_back
#define m_pi acos(-1)
using namespace std;
const ll inf = 1e18;
const int linf = 1.5e9;
void file(){
if (fopen(namein, "r")){
freopen(namein, "r", stdin);
freopen(nameout, "w", stdout);
}
}
const ll mod = 1e9 + 7;
const int N = 2e5 + 5, M = 5e5 + 5;
int n;
int h[N], w[N];
set<int> x;
ll sub4(){
ll u = h[1];
ll v = 0;
for (int i = 1; i <= n; i++){
v += w[i];
v %= mod;
}
return (v*(v + 1)/2 % mod)*(u*(u + 1)/2 % mod) % mod;
}
ll sub3(){
ll u = 0;
for (int i = 1; i <= n; i++) u += w[i];
u %= mod;
u = u*(u + 1)/2 % mod;
ll v = 0;
for (int i = 1; i <= n + 1; i++){
if (h[i] < 2){
v %= mod;
u = (u + v*(v + 1) % mod) % mod;
v = 0;
}
else v += w[i];
}
return u;
}
void run(){
cin >> n;
for (int i = 1; i <= n; i++){
cin >> h[i];
x.insert(h[i]);
}
for (int i = 1; i <= n; i++) cin >> w[i];
if (x.size() == 1){
cout << sub4();
return;
}
else if (*prev(x.size()) <= 2){
cout << sub3();
return;
}
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
file();
run();
}