| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1327995 | inimad | Fancy Fence (CEOI20_fancyfence) | C++20 | 1 ms | 332 KiB |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
const int MOD = 1e9 + 7;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
LL n, ans = 0;
cin >> n;
LL h[n], w[n];
for(auto &i : h) cin >> i;
for(auto &i : w) cin >> i;
for(int i = 0; i < n; i++){
LL mn = 1e9;
for(int j = i; j < n; j++){
mn = min(mn, h[j]);
ans += (mn * (mn + 1)) / 2;
// ans %= MOD;
}
}
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... | ||||
