| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1334580 | tomvip0919 | Fancy Fence (CEOI20_fancyfence) | C++20 | 1 ms | 344 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fastio ios::sync_with_stdio(0); cin.tie(0);
const ll MOD = 1e9 + 7;
const ll MAXN = 500000004;
const ll N = 100005;
int h[N], w[N];
int n;
ll tri(ll n) {
n %= MOD;
return (n * (n + 1) % MOD) * MAXN % MOD;
}
ll sub2() {
ll ans = 0;
for (int i = 1; i <= n; i++) {
int minn = h[i];
for (int j = i; j <= n; j++) {
minn = min(minn, h[j]);
ans = (ans + tri(minn)) % MOD;
}
}
return ans;
}
ll sub4() {
}
int main() {
cin >> n;
bool sub2, sub3, sub4, sub5;
sub4 = true;
sub2 = true;
for(int i = 1; i <= n; i++){
cin >> h[i];
if (h[i] != h[i - 1] && i > 1) {
sub4 = false;
}
if (h[i] <= 50) sub2 = false;
}
ll sum = 0;
for(int i = 1; i <= n; i++){
cin >> w[i];
sum += w[i];
if (w[i] != 1) sub2 = false;
}
// if (n <= 50 && sub2) {
cout << sub2;
return(0);
// }
if (sub4) {
cout << tri(h[1]) * tri(sum) % MOD;
return(0);
}
return 0;
}
Compilation message (stderr)
| # | 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... | ||||
