oj.uz

Submission #973729

# Submission time Handle Problem Language Result Execution time Memory
973729 2024-05-02T10:14:02 Z JwFXoiz Fancy Fence (CEOI20_fancyfence) C++14
100 / 100
 65 ms 14436 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long

const int mod = 1e9 + 7;

int add(int a, int b)
{
    a %= mod, b %= mod;
    return (((a + b) % mod) + mod) % mod;
}
int mult(int a, int b)
{
    a %= mod, b %= mod;
    return (((a * b) % mod) + mod) % mod;
}
int sum(int l, int r)
{
    return ((r - l + 1) * (l + r) / 2) % mod;
}

int res = 0;

struct DSU
{
    int n;
    vector<int> e, val;
    void init(int N)
    {
        n = N;
        e.assign(n + 1, -1);
        val.assign(n + 1, 0);
    }
    int get(int x)
    {
        if (e[x] < 0) return x;
        return e[x] = get(e[x]);
    }
    void makeval(int x, int y)
    {
        x = get(x);
        val[x] = y;
        res = add(res, val[x] * (val[x] + 1) / 2);
    }
    void unite(int x, int y)
    {
        x = get(x), y = get(y);
        if (x == y) return;
        if (e[x] > e[y]) swap(x, y);
        res = add(res, mult(val[x], val[y]));
        val[x] = add(val[x], val[y]);
        val[y] = 0;
        e[x] += e[y];
        e[y] = x;
    }
};

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    int 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];
    map<int, vector<int>> mp;
    for (int i = 1; i <= n; i++) mp[h[i]].push_back(i);
    DSU dsu;
    dsu.init(n);
    int ans = 0;
    for (auto it = mp.rbegin(); it != mp.rend(); it++)
    {
        auto &[a, b] = *it;
        for (int i : b) dsu.makeval(i, w[i]);
        for (int i : b) 
        {
            if (i - 1 >= 1 && h[i - 1] >= a) dsu.unite(i, i - 1);
            if (i + 1 <= n && h[i + 1] >= a) dsu.unite(i, i + 1);
        }
        auto it1 = it;
        it1++;
        int nxt = 0;
        if (it1 != mp.rend()) nxt = (*it1).first;
        ans = add(ans, mult(sum(nxt + 1, a), res));
    }
    cout << ans << '\n';
}

Compilation message

fancyfence.cpp: In function 'int main()':
fancyfence.cpp:76:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   76 |         auto &[a, b] = *it;
      |               ^

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 9 ms 2652 KB Output is correct
4 Correct 17 ms 4436 KB Output is correct
5 Correct 17 ms 4560 KB Output is correct
6 Correct 17 ms 4340 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 856 KB Output is correct
3 Correct 10 ms 2524 KB Output is correct
4 Correct 20 ms 4312 KB Output is correct
5 Correct 20 ms 4312 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 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 860 KB Output is correct
4 Correct 10 ms 2524 KB Output is correct
5 Correct 20 ms 4516 KB Output is correct
6 Correct 23 ms 4312 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 4 ms 1628 KB Output is correct
9 Correct 15 ms 4432 KB Output is correct
10 Correct 42 ms 14436 KB Output is correct
11 Correct 42 ms 14296 KB Output is correct
12 Correct 0 ms 344 KB Output is correct

Subtask #6
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 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 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct

Subtask #7
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 9 ms 2520 KB Output is correct
12 Correct 17 ms 4568 KB Output is correct
13 Correct 17 ms 4432 KB Output is correct
14 Correct 17 ms 4340 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 856 KB Output is correct
17 Correct 10 ms 2388 KB Output is correct
18 Correct 20 ms 4312 KB Output is correct
19 Correct 21 ms 4336 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 4 ms 1628 KB Output is correct
22 Correct 15 ms 4580 KB Output is correct
23 Correct 38 ms 14416 KB Output is correct
24 Correct 39 ms 14428 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 5 ms 1624 KB Output is correct
31 Correct 5 ms 1628 KB Output is correct
32 Correct 12 ms 2652 KB Output is correct
33 Correct 27 ms 7512 KB Output is correct
34 Correct 65 ms 13784 KB Output is correct
35 Correct 24 ms 4696 KB Output is correct
36 Correct 65 ms 14308 KB Output is correct
37 Correct 64 ms 10488 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 48 ms 8848 KB Output is correct
40 Correct 51 ms 14168 KB Output is correct
41 Correct 38 ms 14416 KB Output is correct
42 Correct 38 ms 14396 KB Output is correct