oj.uz

Submission #987828

# Submission time Handle Problem Language Result Execution time Memory
987828 2024-05-23T16:21:03 Z VMaksimoski008 Fancy Fence (CEOI20_fancyfence) C++17
30 / 100
 66 ms 8556 KB 
#include <bits/stdc++.h>

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

ll exp(ll a, ll b) {
    ll ans = 1;
    while(b) {
        if(b & 1) ans = (ans * a) % mod;
        a = (a * a) % mod;
        b /= 2;
    }
    return ans;
}

ll inv(ll a) {
    return exp(a, mod - 2);
}

ll C(ll a) {
    return a * (a + 1) % mod * inv(2) % mod;
}

ll S(ll l, ll r) {
    return (C(r) - C(l-1) + mod) % mod;
}

int32_t main() {
    ios_base::sync_with_stdio(false);
    cout.tie(0); cin.tie(0);

    int n;
    cin >> n;
    vector<ll> h(n+1), w(n+1);
    for(int i=1; i<=n; i++) cin >> h[i];
    for(int i=1; i<=n; i++) cin >> w[i];

    set<ll> s;
    for(int i=1; i<=n; i++) s.insert(h[i]);

    if(s.size() == 1) {
        ll W = 0, H = h[1];
        for(int i=1; i<=n; i++) W = (W + w[i]) % mod;
        cout << C(W) * C(H) % mod << '\n'; 
        return 0;
    }

    bool inc = true;
    for(int i=1; i<n; i++) if(h[i] > h[i+1]) inc = false;

    if(inc) {
        ll ans = 0;

        ll W = 0;

        for(int i=n; i>=1; i--) {
            W = (W + w[i]) % mod;
            //select vertical line from this one, and another random
            // for(int j=0; j<w[i]; j++) {
            //     ans = (ans + (W - j + mod) % mod * C(h[i])) % mod;
            // }
            ans = (ans + S(W-w[i]+1, W) * C(h[i])) % mod;
        }

        cout << ans << '\n';
        return 0;
    }

    return 0;
}

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 8 ms 1116 KB Output is correct
4 Correct 17 ms 2040 KB Output is correct
5 Correct 17 ms 1884 KB Output is correct
6 Correct 1 ms 348 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 3 ms 604 KB Output is correct
4 Correct 9 ms 2136 KB Output is correct
5 Correct 17 ms 3928 KB Output is correct
6 Correct 20 ms 3932 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 8 ms 1116 KB Output is correct
9 Correct 32 ms 3192 KB Output is correct
10 Correct 66 ms 8528 KB Output is correct
11 Correct 66 ms 8556 KB Output is correct
12 Correct 1 ms 344 KB Output is correct

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -