| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1340958 | nathlol2 | Fancy Fence (CEOI20_fancyfence) | C++20 | 1095 ms | 1188 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) * mn * (mn + 1) / 4) % MD;
for(int j = i + 1;j<=n;j++){
mn = min(mn, h[j]);
ans = (ans + a[i] * a[j] * ((mn * (mn + 1)) / 2)) % MD;
}
}
cout << ans;
}| # | 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... | ||||
