oj.uz

답안 #987864

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
987864 2024-05-23T17:27:21 Z VMaksimoski008 Fancy Fence (CEOI20_fancyfence) C++17
25 / 100
 54 ms 8648 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) * (L + mod) % mod) % mod;
    }

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

Subtask #1
0.0 / 0.0

# 결과 실행 시간 메모리 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
12.0 / 12.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

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 28 ms 4040 KB Output is correct
4 Correct 52 ms 8136 KB Output is correct
5 Correct 54 ms 8648 KB Output is correct
6 Correct 54 ms 8644 KB Output is correct

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 1 ms 344 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 540 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# 결과 실행 시간 메모리 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 -