# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1013557 | 2024-07-03T16:17:40 Z | daffuwu | Fancy Fence (CEOI20_fancyfence) | C++14 | 19 ms | 5576 KB |
#include <bits/stdc++.h> using namespace std; #define fr first #define sc second mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); long long n, h[100069], w[100069], smw, ans, mn, sm, pv, cur; const long long dv = 1e9+7; vector<pair<long long, long long> > vc; long long calc(long long a, long long b) { if (a%2 == 0) a/=2; else b/=2; return a%dv*(b%dv)%dv; } int main() { long long i, j, up, dw; scanf("%lld", &n); for (i=1; i<=n; i++) { scanf("%lld", h+i); } for (i=1; i<=n; i++) { scanf("%lld", w+i); if (i>1 && h[i] != h[i-1]) { vc.push_back({smw, h[i-1]}); smw = 0; } smw += w[i]; sm += w[i]; } vc.push_back({smw, h[n]}); cur = sm; for (auto [wg, hg]:vc) { ans += calc(cur, cur+1)*((calc(hg, hg+1)-calc(pv, pv+1))%dv)%dv; pv = hg; cur -= wg; ans %= dv; } if (ans<0) ans += dv; printf("%lld\n", ans); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 1 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 2 ms | 604 KB | Output is correct |
3 | Correct | 8 ms | 1116 KB | Output is correct |
4 | Correct | 16 ms | 1780 KB | Output is correct |
5 | Correct | 16 ms | 1884 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 600 KB | Output is correct |
2 | Correct | 1 ms | 348 KB | Output is correct |
3 | Correct | 2 ms | 548 KB | Output is correct |
4 | Correct | 8 ms | 1116 KB | Output is correct |
5 | Correct | 16 ms | 1808 KB | Output is correct |
6 | Correct | 16 ms | 1884 KB | Output is correct |
7 | Correct | 1 ms | 348 KB | Output is correct |
8 | Correct | 2 ms | 1116 KB | Output is correct |
9 | Correct | 9 ms | 2516 KB | Output is correct |
10 | Correct | 19 ms | 5576 KB | Output is correct |
11 | Correct | 19 ms | 5572 KB | Output is correct |
12 | Correct | 0 ms | 344 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 372 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 1 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |