oj.uz

답안 #987866

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
987866 2024-05-23T17:39:39 Z VMaksimoski008 Fancy Fence (CEOI20_fancyfence) C++17
100 / 100
 66 ms 11132 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%mod) - C((l-1+mod)%mod) + mod) % mod; }

struct DSU {
    int n, comp;
    vector<int> par, size;
    vector<ll> W;

    void config(int _n) {
        n = _n + 1;
        comp = _n;
        par.resize(n+1);
        size.resize(n+1, 1);
        W.resize(n+1);
        for(int i=1; i<=n; i++) par[i] = i;
    }

    int get(int u) {
        if(u == par[u]) return u;
        return par[u] = get(par[u]);
    }

    bool uni(int u, int v) {
        u = get(u), v = get(v);

        if(u == v) return false;
        if(size[u] < size[v]) swap(u, v);

        size[u] += size[v];
        W[u] = (W[u] + W[v]) % mod;
        par[v] = u;
        comp--;

        return true;
    }

    int getComp() { return comp; }
    int getSize(int u) { return size[get(u)]; }
    bool sameSet(int u, int v) { return get(u) == get(v); }
    void setW(int p, int w) { W[get(p)] += w; }
    ll getW(int p) { return W[get(p)]; }
};

struct Edge {
    int a, b, w;
    bool operator<(Edge &e) { return w > e.w;}
};


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];

    //gl&hf
    ll ans = 0;

    for(int i=1; i<=n; i++) ans = (ans + C(w[i]) * C(h[i])) % mod;

    DSU dsu; dsu.config(n);
    for(int i=1; i<=n; i++) dsu.setW(i, w[i]);

    vector<Edge> edges;
    for(int i=1; i<n; i++) edges.push_back({ i, i + 1, min(h[i], h[i+1]) });
    sort(all(edges));

    for(Edge &e : edges) {
        ll L = dsu.getW(e.a);
        ll R = dsu.getW(e.b);
        dsu.uni(e.a, e.b);
        ans = (ans + (R + mod) % mod * C(e.w) % mod * (L + mod) % mod) % mod;
    }

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

Subtask #1
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 2 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 348 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 29 ms 4044 KB Output is correct
4 Correct 53 ms 8136 KB Output is correct
5 Correct 55 ms 7376 KB Output is correct
6 Correct 58 ms 9036 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 7 ms 1428 KB Output is correct
3 Correct 29 ms 4820 KB Output is correct
4 Correct 58 ms 8648 KB Output is correct
5 Correct 59 ms 8648 KB Output is correct
6 Correct 1 ms 344 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 408 KB Output is correct
3 Correct 7 ms 1432 KB Output is correct
4 Correct 29 ms 4812 KB Output is correct
5 Correct 59 ms 10184 KB Output is correct
6 Correct 59 ms 9928 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 6 ms 1516 KB Output is correct
9 Correct 29 ms 4816 KB Output is correct
10 Correct 61 ms 9160 KB Output is correct
11 Correct 58 ms 8644 KB Output is correct
12 Correct 1 ms 348 KB Output is correct

Subtask #6
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 412 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct

Subtask #7
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 28 ms 4544 KB Output is correct
12 Correct 59 ms 9436 KB Output is correct
13 Correct 57 ms 9668 KB Output is correct
14 Correct 54 ms 8648 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 8 ms 1560 KB Output is correct
17 Correct 29 ms 5072 KB Output is correct
18 Correct 58 ms 9416 KB Output is correct
19 Correct 60 ms 11132 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 8 ms 1560 KB Output is correct
22 Correct 30 ms 5076 KB Output is correct
23 Correct 57 ms 9160 KB Output is correct
24 Correct 56 ms 10204 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 7 ms 1564 KB Output is correct
31 Correct 7 ms 1564 KB Output is correct
32 Correct 30 ms 4820 KB Output is correct
33 Correct 32 ms 5076 KB Output is correct
34 Correct 63 ms 10696 KB Output is correct
35 Correct 63 ms 10692 KB Output is correct
36 Correct 66 ms 10208 KB Output is correct
37 Correct 63 ms 10476 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 63 ms 9452 KB Output is correct
40 Correct 60 ms 10436 KB Output is correct
41 Correct 59 ms 9412 KB Output is correct
42 Correct 57 ms 10192 KB Output is correct