oj.uz

Submission #998477

# Submission time Handle Problem Language Result Execution time Memory
998477 2024-06-14T03:50:51 Z steveonalex Flooding Wall (BOI24_wall) C++17
58 / 100
 5000 ms 23800 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }


 
const int MOD = 1e9 + 7;
struct Modular{
    ll x;
    Modular(ll _x = 0){x = _x;}
    Modular& operator += (Modular y){
        x += y.x;
        if (x >= MOD) x -= MOD;
        return *this;
    }
    Modular operator + (Modular y) {
        Modular tmp = *this;
        return tmp += y;
    }
 
    Modular& operator -= (Modular y){
        x -= y.x;
        if (x < 0) x += MOD;
        return *this;
    }
    Modular operator - (Modular y) {
        Modular tmp = *this;
        return tmp -= y;
    }
 
    Modular& operator *= (Modular y){
        x *= y.x;
        if (x >= MOD) x %= MOD;
        return *this;
    }
    Modular operator * (Modular y) {
        Modular tmp = *this;
        return tmp *= y;
    }
 
    // use at your own risk
    bool operator == (Modular y){
        return x == y.x;
    }
    bool operator != (Modular y){
        return x != y.x;
    }
};
ostream& operator << (ostream& out, Modular x){
    out << x.x;
    return out;
}

const int N = 5e5 + 69;
array<int, 2> a[N];
array<Modular, 2> pref[N], suff[N];
Modular p2[N];

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n; cin >> n;
    for(int j = 0; j<=1; ++j)
    for(int i = 0; i<n; ++i) cin >> a[i][j];
    for(int i = 0; i<n; ++i) sort(ALL(a[i]));

    p2[0] = 1;
    for(int i = 1; i<N; ++i) p2[i] = p2[i-1] * 2;

    Modular ans = 0;

    for(int i= 0; i<n; ++i){
        for(int u: a[i]) ans -= p2[n-1] * u;
    }
    for(int iteration = 0; iteration <= 1; ++iteration){
        for(int i = 0; i<n; ++i){
            for(int u: a[i]){
                Modular cu = 1;
                for(int j = 0; j< i; ++j) {
                    int cnt=  0;
                    for(int v: a[j]) if (v < u) cnt++;
                    cu *= cnt;
                    if (cu == 0) break;
                }
                if (cu == 0) continue;
                for(int j = i + 1; j<n; ++j){
                    Modular sum = (Modular) u * (j - i);
                    for(int v: a[j]) if (v > u) ans += sum * cu * p2[n-1-j];
                    
                    int cnt=  0;
                    for(int v: a[j]) if (v <= u) cnt++;
                    cu *= cnt;
                    if (cu == 0) break;
                }
            }
        }
        reverse(a, a + n);
    }

    for(int i =0; i<n; ++i){
        for(int u = 0; u<=1; ++u){
            Modular cur = 1;
            for(int j = 0; j<i; ++j) {
                int cnt = 0;
                for(int v: a[j]) cnt += v < a[i][u];
                cur *= cnt;
            }
            pref[i][u] = cur;


            cur = 1;
            for(int j = i+1; j<n; ++j) {
                int cnt = 0;
                for(int v: a[j]) cnt += v < a[i][u];
                cur *= cnt;
            }
            suff[i][u] = cur;
        }
    }

    for(int i = 0; i<n; ++i) {
        for(int u = 0; u <= 1; ++u) ans += pref[i][u] * suff[i][u] * a[i][u];
    }
    for(int i = 0; i<n; ++i) for(int u = 0; u <= 1; ++u){
        Modular mul = 1;
        for(int j = i + 1; j<n; ++j){
            for(int v = 0; v <= 1; ++v) if (a[i][u] == a[j][v]){
                ans += pref[i][u] * suff[j][v] * mul * a[i][u] * (j - i + 1);
            }

            int cnt= 0;
            for(int v: a[j]) cnt += v <= a[i][u];
            mul *= cnt; 
        }
    }



    cout << ans << "\n";


    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 19804 KB Output is correct
2 Correct 9 ms 19964 KB Output is correct
3 Correct 9 ms 19804 KB Output is correct
4 Correct 9 ms 19804 KB Output is correct
5 Correct 9 ms 20036 KB Output is correct
6 Correct 9 ms 19804 KB Output is correct
7 Correct 9 ms 20032 KB Output is correct
8 Correct 10 ms 19804 KB Output is correct
9 Correct 12 ms 19804 KB Output is correct
10 Correct 9 ms 19804 KB Output is correct
11 Correct 10 ms 19804 KB Output is correct
12 Correct 9 ms 19804 KB Output is correct
13 Correct 9 ms 20028 KB Output is correct
14 Correct 10 ms 19804 KB Output is correct
15 Correct 9 ms 19804 KB Output is correct
16 Correct 9 ms 19804 KB Output is correct
17 Correct 9 ms 19804 KB Output is correct
18 Correct 9 ms 19848 KB Output is correct
19 Correct 9 ms 19804 KB Output is correct
20 Correct 10 ms 19804 KB Output is correct
21 Correct 9 ms 19804 KB Output is correct
22 Correct 11 ms 19900 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 19960 KB Output is correct
2 Correct 9 ms 19876 KB Output is correct
3 Correct 8 ms 19804 KB Output is correct
4 Correct 8 ms 19872 KB Output is correct
5 Correct 9 ms 20036 KB Output is correct
6 Correct 10 ms 19804 KB Output is correct
7 Correct 10 ms 19788 KB Output is correct
8 Correct 9 ms 19804 KB Output is correct
9 Correct 9 ms 19800 KB Output is correct
10 Correct 9 ms 19804 KB Output is correct
11 Correct 9 ms 19804 KB Output is correct
12 Correct 9 ms 19804 KB Output is correct
13 Correct 9 ms 20032 KB Output is correct
14 Correct 9 ms 19972 KB Output is correct
15 Correct 9 ms 19804 KB Output is correct
16 Correct 9 ms 19940 KB Output is correct
17 Correct 10 ms 19804 KB Output is correct
18 Correct 9 ms 19804 KB Output is correct
19 Correct 10 ms 19804 KB Output is correct
20 Correct 9 ms 19804 KB Output is correct
21 Correct 9 ms 19848 KB Output is correct
22 Correct 10 ms 20056 KB Output is correct
23 Correct 9 ms 19896 KB Output is correct
24 Correct 9 ms 19804 KB Output is correct
25 Correct 9 ms 20036 KB Output is correct
26 Correct 9 ms 19804 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 19960 KB Output is correct
2 Correct 9 ms 19876 KB Output is correct
3 Correct 8 ms 19804 KB Output is correct
4 Correct 8 ms 19872 KB Output is correct
5 Correct 9 ms 20036 KB Output is correct
6 Correct 10 ms 19804 KB Output is correct
7 Correct 10 ms 19788 KB Output is correct
8 Correct 9 ms 19804 KB Output is correct
9 Correct 9 ms 19800 KB Output is correct
10 Correct 9 ms 19804 KB Output is correct
11 Correct 9 ms 19804 KB Output is correct
12 Correct 9 ms 19804 KB Output is correct
13 Correct 9 ms 20032 KB Output is correct
14 Correct 9 ms 19972 KB Output is correct
15 Correct 9 ms 19804 KB Output is correct
16 Correct 9 ms 19940 KB Output is correct
17 Correct 10 ms 19804 KB Output is correct
18 Correct 9 ms 19804 KB Output is correct
19 Correct 10 ms 19804 KB Output is correct
20 Correct 9 ms 19804 KB Output is correct
21 Correct 9 ms 19848 KB Output is correct
22 Correct 10 ms 20056 KB Output is correct
23 Correct 9 ms 19896 KB Output is correct
24 Correct 9 ms 19804 KB Output is correct
25 Correct 9 ms 20036 KB Output is correct
26 Correct 9 ms 19804 KB Output is correct
27 Correct 472 ms 20100 KB Output is correct
28 Correct 464 ms 20056 KB Output is correct
29 Correct 1645 ms 20060 KB Output is correct
30 Correct 1480 ms 20304 KB Output is correct
31 Correct 954 ms 20060 KB Output is correct
32 Correct 956 ms 20092 KB Output is correct
33 Correct 743 ms 20056 KB Output is correct
34 Correct 959 ms 20060 KB Output is correct
35 Correct 1006 ms 20056 KB Output is correct
36 Correct 760 ms 20060 KB Output is correct
37 Correct 1518 ms 20056 KB Output is correct
38 Correct 1490 ms 20092 KB Output is correct
39 Correct 955 ms 20056 KB Output is correct
40 Correct 1002 ms 20060 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 19804 KB Output is correct
2 Correct 9 ms 19964 KB Output is correct
3 Correct 9 ms 19804 KB Output is correct
4 Correct 9 ms 19804 KB Output is correct
5 Correct 9 ms 20036 KB Output is correct
6 Correct 9 ms 19804 KB Output is correct
7 Correct 9 ms 20032 KB Output is correct
8 Correct 10 ms 19804 KB Output is correct
9 Correct 12 ms 19804 KB Output is correct
10 Correct 9 ms 19804 KB Output is correct
11 Correct 10 ms 19804 KB Output is correct
12 Correct 9 ms 19804 KB Output is correct
13 Correct 9 ms 20028 KB Output is correct
14 Correct 10 ms 19804 KB Output is correct
15 Correct 9 ms 19804 KB Output is correct
16 Correct 9 ms 19804 KB Output is correct
17 Correct 9 ms 19804 KB Output is correct
18 Correct 9 ms 19848 KB Output is correct
19 Correct 9 ms 19804 KB Output is correct
20 Correct 10 ms 19804 KB Output is correct
21 Correct 9 ms 19804 KB Output is correct
22 Correct 11 ms 19900 KB Output is correct
23 Correct 9 ms 19960 KB Output is correct
24 Correct 9 ms 19876 KB Output is correct
25 Correct 8 ms 19804 KB Output is correct
26 Correct 8 ms 19872 KB Output is correct
27 Correct 9 ms 20036 KB Output is correct
28 Correct 10 ms 19804 KB Output is correct
29 Correct 10 ms 19788 KB Output is correct
30 Correct 9 ms 19804 KB Output is correct
31 Correct 9 ms 19800 KB Output is correct
32 Correct 9 ms 19804 KB Output is correct
33 Correct 9 ms 19804 KB Output is correct
34 Correct 9 ms 19804 KB Output is correct
35 Correct 9 ms 20032 KB Output is correct
36 Correct 9 ms 19972 KB Output is correct
37 Correct 9 ms 19804 KB Output is correct
38 Correct 9 ms 19940 KB Output is correct
39 Correct 10 ms 19804 KB Output is correct
40 Correct 9 ms 19804 KB Output is correct
41 Correct 10 ms 19804 KB Output is correct
42 Correct 9 ms 19804 KB Output is correct
43 Correct 9 ms 19848 KB Output is correct
44 Correct 10 ms 20056 KB Output is correct
45 Correct 9 ms 19896 KB Output is correct
46 Correct 9 ms 19804 KB Output is correct
47 Correct 9 ms 20036 KB Output is correct
48 Correct 9 ms 19804 KB Output is correct
49 Correct 472 ms 20100 KB Output is correct
50 Correct 464 ms 20056 KB Output is correct
51 Correct 1645 ms 20060 KB Output is correct
52 Correct 1480 ms 20304 KB Output is correct
53 Correct 954 ms 20060 KB Output is correct
54 Correct 956 ms 20092 KB Output is correct
55 Correct 743 ms 20056 KB Output is correct
56 Correct 959 ms 20060 KB Output is correct
57 Correct 1006 ms 20056 KB Output is correct
58 Correct 760 ms 20060 KB Output is correct
59 Correct 1518 ms 20056 KB Output is correct
60 Correct 1490 ms 20092 KB Output is correct
61 Correct 955 ms 20056 KB Output is correct
62 Correct 1002 ms 20060 KB Output is correct
63 Correct 512 ms 20060 KB Output is correct
64 Correct 457 ms 20092 KB Output is correct
65 Correct 919 ms 20056 KB Output is correct
66 Correct 730 ms 20056 KB Output is correct
67 Correct 978 ms 20056 KB Output is correct
68 Correct 745 ms 20096 KB Output is correct
69 Correct 1372 ms 20060 KB Output is correct
70 Correct 1378 ms 20060 KB Output is correct

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 19804 KB Output is correct
2 Correct 9 ms 19804 KB Output is correct
3 Correct 9 ms 19804 KB Output is correct
4 Correct 9 ms 19804 KB Output is correct
5 Correct 9 ms 20040 KB Output is correct
6 Correct 9 ms 19804 KB Output is correct
7 Correct 10 ms 19804 KB Output is correct
8 Correct 10 ms 19912 KB Output is correct
9 Correct 9 ms 19900 KB Output is correct
10 Correct 1573 ms 20104 KB Output is correct
11 Correct 1612 ms 20056 KB Output is correct
12 Correct 1635 ms 20096 KB Output is correct
13 Correct 1802 ms 20096 KB Output is correct
14 Execution timed out 5088 ms 23800 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 19804 KB Output is correct
2 Correct 9 ms 19964 KB Output is correct
3 Correct 9 ms 19804 KB Output is correct
4 Correct 9 ms 19804 KB Output is correct
5 Correct 9 ms 20036 KB Output is correct
6 Correct 9 ms 19804 KB Output is correct
7 Correct 9 ms 20032 KB Output is correct
8 Correct 10 ms 19804 KB Output is correct
9 Correct 12 ms 19804 KB Output is correct
10 Correct 9 ms 19804 KB Output is correct
11 Correct 10 ms 19804 KB Output is correct
12 Correct 9 ms 19804 KB Output is correct
13 Correct 9 ms 20028 KB Output is correct
14 Correct 10 ms 19804 KB Output is correct
15 Correct 9 ms 19804 KB Output is correct
16 Correct 9 ms 19804 KB Output is correct
17 Correct 9 ms 19804 KB Output is correct
18 Correct 9 ms 19848 KB Output is correct
19 Correct 9 ms 19804 KB Output is correct
20 Correct 10 ms 19804 KB Output is correct
21 Correct 9 ms 19804 KB Output is correct
22 Correct 11 ms 19900 KB Output is correct
23 Correct 9 ms 19960 KB Output is correct
24 Correct 9 ms 19876 KB Output is correct
25 Correct 8 ms 19804 KB Output is correct
26 Correct 8 ms 19872 KB Output is correct
27 Correct 9 ms 20036 KB Output is correct
28 Correct 10 ms 19804 KB Output is correct
29 Correct 10 ms 19788 KB Output is correct
30 Correct 9 ms 19804 KB Output is correct
31 Correct 9 ms 19800 KB Output is correct
32 Correct 9 ms 19804 KB Output is correct
33 Correct 9 ms 19804 KB Output is correct
34 Correct 9 ms 19804 KB Output is correct
35 Correct 9 ms 20032 KB Output is correct
36 Correct 9 ms 19972 KB Output is correct
37 Correct 9 ms 19804 KB Output is correct
38 Correct 9 ms 19940 KB Output is correct
39 Correct 10 ms 19804 KB Output is correct
40 Correct 9 ms 19804 KB Output is correct
41 Correct 10 ms 19804 KB Output is correct
42 Correct 9 ms 19804 KB Output is correct
43 Correct 9 ms 19848 KB Output is correct
44 Correct 10 ms 20056 KB Output is correct
45 Correct 9 ms 19896 KB Output is correct
46 Correct 9 ms 19804 KB Output is correct
47 Correct 9 ms 20036 KB Output is correct
48 Correct 9 ms 19804 KB Output is correct
49 Correct 472 ms 20100 KB Output is correct
50 Correct 464 ms 20056 KB Output is correct
51 Correct 1645 ms 20060 KB Output is correct
52 Correct 1480 ms 20304 KB Output is correct
53 Correct 954 ms 20060 KB Output is correct
54 Correct 956 ms 20092 KB Output is correct
55 Correct 743 ms 20056 KB Output is correct
56 Correct 959 ms 20060 KB Output is correct
57 Correct 1006 ms 20056 KB Output is correct
58 Correct 760 ms 20060 KB Output is correct
59 Correct 1518 ms 20056 KB Output is correct
60 Correct 1490 ms 20092 KB Output is correct
61 Correct 955 ms 20056 KB Output is correct
62 Correct 1002 ms 20060 KB Output is correct
63 Correct 512 ms 20060 KB Output is correct
64 Correct 457 ms 20092 KB Output is correct
65 Correct 919 ms 20056 KB Output is correct
66 Correct 730 ms 20056 KB Output is correct
67 Correct 978 ms 20056 KB Output is correct
68 Correct 745 ms 20096 KB Output is correct
69 Correct 1372 ms 20060 KB Output is correct
70 Correct 1378 ms 20060 KB Output is correct
71 Correct 9 ms 19804 KB Output is correct
72 Correct 9 ms 19804 KB Output is correct
73 Correct 9 ms 19804 KB Output is correct
74 Correct 9 ms 19804 KB Output is correct
75 Correct 9 ms 20040 KB Output is correct
76 Correct 9 ms 19804 KB Output is correct
77 Correct 10 ms 19804 KB Output is correct
78 Correct 10 ms 19912 KB Output is correct
79 Correct 9 ms 19900 KB Output is correct
80 Correct 1573 ms 20104 KB Output is correct
81 Correct 1612 ms 20056 KB Output is correct
82 Correct 1635 ms 20096 KB Output is correct
83 Correct 1802 ms 20096 KB Output is correct
84 Execution timed out 5088 ms 23800 KB Time limit exceeded
85 Halted 0 ms 0 KB -