#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld, ld> pld;
//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T>
ostream &operator<<(ostream &os, vector<T> &a) {
os << "[";
for (int i = 0; i < ll(a.size()); i++) { os << a[i] << ((i != ll(a.size() - 1) ? " " : "")); }
os << "]\n";
return os;
}
#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> &p) {
os << "" << p.first << " " << p.second << "";
return os;
}
void usaco(string taskname) {
string fin = taskname + ".in";
string fout = taskname + ".out";
const char *FIN = fin.c_str();
const char *FOUT = fout.c_str();
freopen(FIN, "r", stdin);
freopen(FOUT, "w", stdout);
}
template<typename T>
void read(vector<T> &v) {
int n = v.size();
for (int i = 0; i < n; i++)
cin >> v[i];
}
template<typename T>
vector<T> UNQ(vector<T> a) {
vector<T> ans;
for (T t:a)
if (ans.empty() || t != ans.back())
ans.push_back(t);
return ans;
}
ll ceil(ll a, ll b) {
ll ans = a / b;
if (a % b)ans++;
return ans;
}
ld log(ld a, ld b) { return log(b) / log(a); }
ll power(ll base, ll exp, ll M = 1e18) {//(base^exp)%M
ll ans = 1;
while (exp) {
if (exp % 2 == 1)ans = ((ans % M) * (base % M)) % M;
base = ((base % M) * (base % M)) % M;
exp /= 2;
}
return ans;
}
string to_base(int n, int new_base) {
string s;
int nn = n;
while (nn) {
s += to_string(nn % new_base);
nn /= new_base;
}
reverse(all(s));
return s;
}
ll gcd(ll a, ll b) {
if (a < b)swap(a, b);
if (b == 0)return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll x = (a / gcd(a, b));
return b * x;
}
vl generate_array(ll n, ll mn = 1, ll mx = 1e18 + 1) {
if (mx == 1e18 + 1)
mx = n;
vl ans(n);
for (int i = 0; i < n; i++)
ans[i] = (mn + rand() % (mx - mn + 1));
return ans;
}
string substr(string s, int l, int r) {
string ans;
for (int i = l; i <= r; i++)
ans += s[i];
return ans;
}
void solve();
int main() {
GLHF;
int t = 1;
//cin >> t;
while (t--)
solve();
}
ll mod=1e9+7;
vl par,rnk,sum;
vvl a;
ll get(ll x){return par[x]=(x==par[x]?x:get(par[x]));}
vector<bool>vis;
void unite(ll u,ll v){
u=get(u),v=get(v);
if(u==v)return;
par[v]=u;
sum[u]=(sum[u]+sum[v])%mod;
vis[u]=vis[u]||vis[v];
}
ll C2(ll x){
ll mod=1e9+7;
return (((x*(x+1))/2)%mod);
}
void solve() {
//freopen("input0.txt","r",stdin);
int n;
cin >> n;
vis.resize(n);
a=vvl(n,vl(3));
for(int i=0; i<n; i++)
cin >> a[i][0];
for(int i=0; i<n; i++)
cin >> a[i][1];
ll W=0;
for(int i=0; i<n; i++)
W+=a[i][1];
out((C2(a[0][0])*C2(W%mod))%mod)
for(int i=0;i<n; i++)
a[i][2]=i;
par.resize(n);
sum.resize(n);
for(int i=0; i<n ;i++)
par[i]=i,sum[i]=a[i][1];
sort(all(a),greater<vl>());
ll ans=0;
for(int i=0; i<n; i++){
ll h=a[i][0],w=a[i][1],ix=a[i][2];
vis[ix]=1;
ll l=(ix && vis[get(ix-1)])?sum[get(ix-1)]:0;
ll r=(ix!=n-1 && vis[get(ix+1)])?sum[get(ix+1)]:0;
ans=(ans+C2(w)*C2(h))%mod;
ans=(ans+C2(h)*((w*l)%mod))%mod;
ans=(ans+C2(h)*((w*r)%mod))%mod;
if((ix && vis[get(ix-1)]))
unite(ix,ix-1);
if((ix!=n-1 && vis[get(ix+1)]))
unite(ix,ix+1);
}
out(ans)
}
Compilation message
fancyfence.cpp: In function 'std::vector<_Tp> UNQ(std::vector<_Tp>)':
fancyfence.cpp:70:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
70 | for (T t:a)
| ^~~
fancyfence.cpp:73:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
73 | return ans;
| ^~~~~~
fancyfence.cpp: In function 'void usaco(std::string)':
fancyfence.cpp:56:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
56 | freopen(FIN, "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~
fancyfence.cpp:57:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
57 | freopen(FOUT, "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
312 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
Output is correct |
| 2 |
Correct |
5 ms |
964 KB |
Output is correct |
| 3 |
Correct |
20 ms |
4044 KB |
Output is correct |
| 4 |
Correct |
31 ms |
7620 KB |
Output is correct |
| 5 |
Correct |
39 ms |
7820 KB |
Output is correct |
| 6 |
Correct |
1 ms |
204 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
