Submission #1034420

#	Time	Username	Problem	Language	Result	Execution time	Memory
1034420		RecursiveCo	Flooding Wall (BOI24_wall)	C++17	58 / 100	5030 ms	41628 KiB

Main

// 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;
int inv2 = 5e8 + 4;

signed main() {
    improvePerformance;
    //getTest;
    
    //eachTest {
        get(n);
        getList(n, A);
        getList(n, B);
        vector<pair<int, int>> vals;
        forto(n, i) {
            vals.push_back({A[i], i});
            vals.push_back({B[i], i});
        }
        sortl(vals);
        rev(vals);
        vector<int> power;
        power.push_back(1);
        forto(n + 5, i) power.push_back(power.back() * 2 % mod);
        int ans = 0;
        forto(n, i) {
            vector<int> cands;
            cands.push_back(A[i]);
            cands.push_back(B[i]);
            for (int here: cands) {
                vector<int> ways(2 * n + 1, 0); // first one is 1e9 + 5: ways = 0.
                vector<int> good(n, 2);
                int prodleft = power[i];
                int prodright = power[n - i - 1];
                int ptr = 0;
                forto(2 * n + 1, j) {
                    if (j == 0) continue;
                    if (here >= vals[j - 1].first) {
                        ways[j] = power[n - 1];
                    } else {
                        while (ptr < 2 * n && vals[ptr].first >= vals[j - 1].first) {
                            int ind = vals[ptr++].second;
                            if (ind == i) continue;
                            if (ind < i) {
                                if (good[ind] == 2) prodleft = prodleft * inv2 % mod;
                                else prodleft = 0;
                                good[ind]--;
                            } else {
                                if (good[ind] == 2) prodright = prodright * inv2 % mod;
                                else prodright = 0;
                                good[ind]--;
                            }
                        }
                        int left = (power[i] - prodleft + mod) % mod;
                        int right = (power[n - i - 1] - prodright + mod) % mod;
                        ways[j] = left * right % mod;
                    }
                }
                forto(2 * n, j) {
                    int thismax = (ways[j + 1] - ways[j] + mod) % mod;
                    int thismaxsum = here >= vals[j].first? 0: thismax * (vals[j].first - here) % mod;
                    ans = (ans + thismaxsum) % mod;
                }
            }
        }
        out(ans);
    //}
}

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:10:23: warning: unnecessary parentheses in declaration of 'n' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
Main.cpp:79:9: note: in expansion of macro 'get'
   79 |         get(n);
      |         ^~~
Main.cpp:12:40: warning: unnecessary parentheses in declaration of 'A' [-Wparentheses]
   12 | #define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); }
      |                                        ^
Main.cpp:80:9: note: in expansion of macro 'getList'
   80 |         getList(n, A);
      |         ^~~~~~~
Main.cpp:10:23: warning: unnecessary parentheses in declaration of 'a' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
Main.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); }
      |                                                                            ^~~
Main.cpp:80:9: note: in expansion of macro 'getList'
   80 |         getList(n, A);
      |         ^~~~~~~
Main.cpp:12:40: warning: unnecessary parentheses in declaration of 'B' [-Wparentheses]
   12 | #define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); }
      |                                        ^
Main.cpp:81:9: note: in expansion of macro 'getList'
   81 |         getList(n, B);
      |         ^~~~~~~
Main.cpp:10:23: warning: unnecessary parentheses in declaration of 'a' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
Main.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); }
      |                                                                            ^~~
Main.cpp:81:9: note: in expansion of macro 'getList'
   81 |         getList(n, B);
      |         ^~~~~~~
Main.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
Main.cpp:83:9: note: in expansion of macro 'forto'
   83 |         forto(n, i) {
      |         ^~~~~
Main.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
Main.cpp:91:9: note: in expansion of macro 'forto'
   91 |         forto(n + 5, i) power.push_back(power.back() * 2 % mod);
      |         ^~~~~
Main.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
Main.cpp:93:9: note: in expansion of macro 'forto'
   93 |         forto(n, i) {
      |         ^~~~~
Main.cpp:15:35: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
Main.cpp:103:17: note: in expansion of macro 'forto'
  103 |                 forto(2 * n + 1, j) {
      |                 ^~~~~
Main.cpp:15:35: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
Main.cpp:126:17: note: in expansion of macro 'forto'
  126 |                 forto(2 * n, j) {
      |                 ^~~~~

• Subtask 1: 8 / 8
• Subtask 2: 17 / 17
• Subtask 3: 19 / 19
• Subtask 4: 14 / 14
• Subtask 5: 0 / 12
• Subtask 6: 0 / 30