제출 #1340961

#제출 시각아이디문제언어결과실행 시간메모리
1340961nathlol2Fancy Fence (CEOI20_fancyfence)C++20
30 / 100
1095 ms1152 KiB
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e5 + 5, MD = 1e9 + 7;
int n, ans, a[N], h[N];

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n;
    for(int i = 1;i<=n;i++) cin >> h[i];
    for(int i = 1;i<=n;i++) cin >> a[i];
    for(int i = 1;i<=n;i++){
        int mn = h[i];
        ans = (ans + (((a[i] * (a[i] + 1)) / 2) % MD) * (((mn * (mn + 1)) / 2) % MD)) % MD;
        for(int j = i + 1;j<=n;j++){
            mn = min(mn, h[j]);
            ans = (ans + ((a[i] * a[j]) % MD) * (((mn * (mn + 1)) / 2) % MD)) % MD;
        }
    }
    cout << ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...