oj.uz

Submission #1080454

# Submission time Handle Problem Language Result Execution time Memory
1080454 2024-08-29T10:06:37 Z RecursiveCo Fancy Fence (CEOI20_fancyfence) C++17
100 / 100
 31 ms 7292 KB 
// CF template, version 3.0

#include <bits/stdc++.h>

using namespace std;

#define improvePerformance ios_base::sync_with_stdio(false); cin.tie(0)
#define getTest int t; cin >> t
#define eachTest for (int _var=0;_var<t;_var++)
#define get(name) int (name); cin >> (name)
#define out(o) cout << (o)
#define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); }
#define sortl(name) sort((name).begin(), (name).end())
#define rev(name) reverse((name).begin(), (name).end())
#define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
#define decision(b) if (b){out("YES");}else{out("NO");}

#define int long long int

template <typename T, typename I>
struct segtree {
    int n;
    vector<T> tree;
    vector<I> initial;
    T id;

    segtree(int i_n, vector<I> i_initial, T i_id): n(i_n), initial(i_initial), id(i_id) {
        tree.resize(4 * n);
    }

    T conquer(T left, T right) {
        // write your conquer function
    }

    T value(I inp) {
        // write your value function
    }

    void build(int v, int l, int r) {
        if (l == r) tree[v] = value(initial[l]);
        else {
            int middle = (l + r) / 2;
            build(2 * v, l, middle);
            build(2 * v + 1, middle + 1, r);
            tree[v] = conquer(tree[2 * v], tree[2 * v + 1]);
        }
    }

    void upd(int v, int l, int r, int i, I x) {
        if (l == r) tree[v] = value(x);
        else {
            int middle = (l + r) / 2;
            if (middle >= i) upd(2 * v, l, middle, i, x);
            else upd(2 * v + 1, middle + 1, r, i, x);
            tree[v] = conquer(tree[2 * v], tree[2 * v + 1]);
        }
    }

    T query(int v, int l, int r, int ql, int qr) {
        if (ql <= l && r <= qr) return tree[v];
        else if (r < ql || qr < l) return id;
        int middle = (l + r) / 2;
        T left = query(2 * v, l, middle, ql, qr);
        T right = query(2 * v + 1, middle + 1, r, ql, qr);
        return conquer(left, right);
    }
};

// vector<int>

int mod = 1e9 + 7;

signed main() {
    improvePerformance;
    //getTest;
    
    //eachTest {
        get(n);
        getList(n, H);
        getList(n, W);
        int ans = 0;
        vector<int> dp(n); // sum of all subarrays ending at the end of the i-th range
        vector<int> pref(n);
        int width = 0;
        stack<pair<int, int>> st;
        forto(n, i) {
            int x = H[i];
            int y = W[i];
            while (!st.empty() && st.top().first > x) {
                st.pop();
            }
            int prev = st.empty()? 0: pref[st.top().second];
            int val = x * (x + 1) / 2 % mod;
            int thisone = (width - prev + mod) % mod * val % mod;
            int orthisone = thisone;
            int before = (st.empty()? 0: dp[st.top().second]);
            thisone = (thisone + before) % mod;
            int thisdp = (y * val + thisone) % mod;
            dp[i] = thisdp;
            ans = (ans + dp[i]) % mod;
            int extra = y * (y - 1) / 2 % mod;
            int extratot = extra * val % mod;
            extratot = (extratot + (y - 1) * orthisone) % mod;
            extratot = (extratot + (y - 1) * before) % mod;
            ans = (ans + extratot) % mod;
            width = (width + y) % mod;
            pref[i] = width;
            st.push({x, i});
        }
        out(ans);
    //}
}

Compilation message

fancyfence.cpp: In function 'int main()':
fancyfence.cpp:10:23: warning: unnecessary parentheses in declaration of 'n' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
fancyfence.cpp:78:9: note: in expansion of macro 'get'
   78 |         get(n);
      |         ^~~
fancyfence.cpp:12:40: warning: unnecessary parentheses in declaration of 'H' [-Wparentheses]
   12 | #define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); }
      |                                        ^
fancyfence.cpp:79:9: note: in expansion of macro 'getList'
   79 |         getList(n, H);
      |         ^~~~~~~
fancyfence.cpp:10:23: warning: unnecessary parentheses in declaration of 'a' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
fancyfence.cpp:12:76: note: in expansion of macro 'get'
   12 | #define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); }
      |                                                                            ^~~
fancyfence.cpp:79:9: note: in expansion of macro 'getList'
   79 |         getList(n, H);
      |         ^~~~~~~
fancyfence.cpp:12:40: warning: unnecessary parentheses in declaration of 'W' [-Wparentheses]
   12 | #define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); }
      |                                        ^
fancyfence.cpp:80:9: note: in expansion of macro 'getList'
   80 |         getList(n, W);
      |         ^~~~~~~
fancyfence.cpp:10:23: warning: unnecessary parentheses in declaration of 'a' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
fancyfence.cpp:12:76: note: in expansion of macro 'get'
   12 | #define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); }
      |                                                                            ^~~
fancyfence.cpp:80:9: note: in expansion of macro 'getList'
   80 |         getList(n, W);
      |         ^~~~~~~
fancyfence.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
fancyfence.cpp:86:9: note: in expansion of macro 'forto'
   86 |         forto(n, i) {
      |         ^~~~~

Subtask #1
0.0 / 0.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

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 0 ms 348 KB Output is correct

Subtask #3
13.0 / 13.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 8 ms 2908 KB Output is correct
4 Correct 23 ms 5980 KB Output is correct
5 Correct 15 ms 5208 KB Output is correct
6 Correct 15 ms 4696 KB Output is correct

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 1112 KB Output is correct
3 Correct 10 ms 3760 KB Output is correct
4 Correct 21 ms 6976 KB Output is correct
5 Correct 20 ms 7256 KB Output is correct
6 Correct 0 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 1 ms 348 KB Output is correct
3 Correct 2 ms 1116 KB Output is correct
4 Correct 10 ms 3680 KB Output is correct
5 Correct 25 ms 7000 KB Output is correct
6 Correct 19 ms 7292 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 3 ms 1116 KB Output is correct
9 Correct 10 ms 3828 KB Output is correct
10 Correct 20 ms 7036 KB Output is correct
11 Correct 31 ms 6988 KB Output is correct
12 Correct 0 ms 348 KB Output is correct

Subtask #6
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 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 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 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 0 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 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 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 8 ms 2952 KB Output is correct
12 Correct 24 ms 5980 KB Output is correct
13 Correct 23 ms 5200 KB Output is correct
14 Correct 16 ms 4700 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 2 ms 1116 KB Output is correct
17 Correct 9 ms 3680 KB Output is correct
18 Correct 21 ms 7176 KB Output is correct
19 Correct 20 ms 7284 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 3 ms 1372 KB Output is correct
22 Correct 10 ms 3744 KB Output is correct
23 Correct 19 ms 6876 KB Output is correct
24 Correct 19 ms 7084 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 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 2 ms 860 KB Output is correct
31 Correct 2 ms 944 KB Output is correct
32 Correct 9 ms 2908 KB Output is correct
33 Correct 10 ms 2912 KB Output is correct
34 Correct 18 ms 5468 KB Output is correct
35 Correct 29 ms 5444 KB Output is correct
36 Correct 19 ms 5460 KB Output is correct
37 Correct 30 ms 5468 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 18 ms 5672 KB Output is correct
40 Correct 28 ms 5644 KB Output is correct
41 Correct 18 ms 5720 KB Output is correct
42 Correct 19 ms 6228 KB Output is correct