oj.uz

답안 #998570

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
998570 2024-06-14T08:38:52 Z steveonalex Flooding Wall (BOI24_wall) C++17
58 / 100
 5000 ms 31684 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], c[N];
array<Modular, 2> pref[N], suff[N];
Modular p2[N];

struct FenwickTree{
    int n;
    vector<Modular> a;

    FenwickTree(int _n){
        n = _n;
        a.resize(n + 1, 1);
    }

    void update(int i){
        while(i <= n){
            a[i] *= 2;
            i += LASTBIT(i);
        }
    }

    Modular get(int i){
        Modular ans = 1;
        while(i > 0){
            ans *= a[i];
            i -= LASTBIT(i);
        }
        return ans;
    }

    void reset(){
        a = vector<Modular>(n+1, 1);
    }
};

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;
    }

    vector<int> b;
    for(int i= 0; i<n; ++i)
        for(int j = 0; j<2; ++j) b.push_back(a[i][j]);
    remove_dup(b);

    for(int i = 0; i<n; ++i) for(int j = 0; j<2; ++j) c[i][j] = lower_bound(ALL(b), a[i][j]) - b.begin() + 1;

    FenwickTree bit(b.size());
    int ma = 0;
    for(int i =0; i<n; ++i){
        for(int u = 0; u<=1; ++u){
            if (a[i][u] <= ma) continue;
            pref[i][u] = bit.get(c[i][u]);
        }
        bit.update(c[i][1] + 1);
        maximize(ma, a[i][0]);
    }
    bit.reset();
    ma = 0;
    for(int i = n-1; i>=0; --i) {
        for(int u = 0; u<=1; ++u){
            if (a[i][u] <= ma) continue;
            suff[i][u] = bit.get(c[i][u]);
        }
        bit.update(c[i][1] + 1);
        maximize(ma, a[i][0]);
    }

    for(int iteration = 0; iteration <= 1; ++iteration){
        for(int i = 0; i<n; ++i){
            for(int _u = 0; _u <= 1; ++_u){
                int u = a[i][_u];
                Modular cu = pref[i][_u];
                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);
        reverse(pref, pref + n);
        reverse(suff, suff + n);
        for(int i = 0; i<n; ++i) swap(pref[i], suff[i]);
    }


    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

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19804 KB Output is correct
2 Correct 9 ms 19816 KB Output is correct
3 Correct 10 ms 19804 KB Output is correct
4 Correct 10 ms 19856 KB Output is correct
5 Correct 11 ms 19804 KB Output is correct
6 Correct 9 ms 19804 KB Output is correct
7 Correct 9 ms 19804 KB Output is correct
8 Correct 10 ms 19800 KB Output is correct
9 Correct 9 ms 19804 KB Output is correct
10 Correct 10 ms 19800 KB Output is correct
11 Correct 10 ms 20044 KB Output is correct
12 Correct 12 ms 19800 KB Output is correct
13 Correct 10 ms 19804 KB Output is correct
14 Correct 10 ms 19804 KB Output is correct
15 Correct 10 ms 19804 KB Output is correct
16 Correct 10 ms 19804 KB Output is correct
17 Correct 9 ms 19804 KB Output is correct
18 Correct 9 ms 19836 KB Output is correct
19 Correct 10 ms 19800 KB Output is correct
20 Correct 10 ms 19804 KB Output is correct
21 Correct 10 ms 19948 KB Output is correct
22 Correct 10 ms 19800 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 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 10 ms 19800 KB Output is correct
5 Correct 10 ms 19804 KB Output is correct
6 Correct 10 ms 19804 KB Output is correct
7 Correct 11 ms 19804 KB Output is correct
8 Correct 9 ms 19804 KB Output is correct
9 Correct 10 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 20040 KB Output is correct
13 Correct 10 ms 19804 KB Output is correct
14 Correct 11 ms 19860 KB Output is correct
15 Correct 10 ms 19800 KB Output is correct
16 Correct 10 ms 20020 KB Output is correct
17 Correct 10 ms 19800 KB Output is correct
18 Correct 9 ms 19804 KB Output is correct
19 Correct 10 ms 19932 KB Output is correct
20 Correct 10 ms 19804 KB Output is correct
21 Correct 10 ms 19804 KB Output is correct
22 Correct 10 ms 19804 KB Output is correct
23 Correct 9 ms 19804 KB Output is correct
24 Correct 11 ms 19800 KB Output is correct
25 Correct 10 ms 19804 KB Output is correct
26 Correct 10 ms 19804 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 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 10 ms 19800 KB Output is correct
5 Correct 10 ms 19804 KB Output is correct
6 Correct 10 ms 19804 KB Output is correct
7 Correct 11 ms 19804 KB Output is correct
8 Correct 9 ms 19804 KB Output is correct
9 Correct 10 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 20040 KB Output is correct
13 Correct 10 ms 19804 KB Output is correct
14 Correct 11 ms 19860 KB Output is correct
15 Correct 10 ms 19800 KB Output is correct
16 Correct 10 ms 20020 KB Output is correct
17 Correct 10 ms 19800 KB Output is correct
18 Correct 9 ms 19804 KB Output is correct
19 Correct 10 ms 19932 KB Output is correct
20 Correct 10 ms 19804 KB Output is correct
21 Correct 10 ms 19804 KB Output is correct
22 Correct 10 ms 19804 KB Output is correct
23 Correct 9 ms 19804 KB Output is correct
24 Correct 11 ms 19800 KB Output is correct
25 Correct 10 ms 19804 KB Output is correct
26 Correct 10 ms 19804 KB Output is correct
27 Correct 252 ms 20316 KB Output is correct
28 Correct 232 ms 20312 KB Output is correct
29 Correct 1200 ms 20312 KB Output is correct
30 Correct 1206 ms 20312 KB Output is correct
31 Correct 605 ms 20312 KB Output is correct
32 Correct 611 ms 20312 KB Output is correct
33 Correct 494 ms 20312 KB Output is correct
34 Correct 618 ms 20316 KB Output is correct
35 Correct 631 ms 20404 KB Output is correct
36 Correct 485 ms 20404 KB Output is correct
37 Correct 1203 ms 20316 KB Output is correct
38 Correct 1210 ms 20400 KB Output is correct
39 Correct 620 ms 20312 KB Output is correct
40 Correct 603 ms 20376 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19804 KB Output is correct
2 Correct 9 ms 19816 KB Output is correct
3 Correct 10 ms 19804 KB Output is correct
4 Correct 10 ms 19856 KB Output is correct
5 Correct 11 ms 19804 KB Output is correct
6 Correct 9 ms 19804 KB Output is correct
7 Correct 9 ms 19804 KB Output is correct
8 Correct 10 ms 19800 KB Output is correct
9 Correct 9 ms 19804 KB Output is correct
10 Correct 10 ms 19800 KB Output is correct
11 Correct 10 ms 20044 KB Output is correct
12 Correct 12 ms 19800 KB Output is correct
13 Correct 10 ms 19804 KB Output is correct
14 Correct 10 ms 19804 KB Output is correct
15 Correct 10 ms 19804 KB Output is correct
16 Correct 10 ms 19804 KB Output is correct
17 Correct 9 ms 19804 KB Output is correct
18 Correct 9 ms 19836 KB Output is correct
19 Correct 10 ms 19800 KB Output is correct
20 Correct 10 ms 19804 KB Output is correct
21 Correct 10 ms 19948 KB Output is correct
22 Correct 10 ms 19800 KB Output is correct
23 Correct 10 ms 19804 KB Output is correct
24 Correct 9 ms 19804 KB Output is correct
25 Correct 9 ms 19804 KB Output is correct
26 Correct 10 ms 19800 KB Output is correct
27 Correct 10 ms 19804 KB Output is correct
28 Correct 10 ms 19804 KB Output is correct
29 Correct 11 ms 19804 KB Output is correct
30 Correct 9 ms 19804 KB Output is correct
31 Correct 10 ms 19804 KB Output is correct
32 Correct 9 ms 19804 KB Output is correct
33 Correct 10 ms 19804 KB Output is correct
34 Correct 9 ms 20040 KB Output is correct
35 Correct 10 ms 19804 KB Output is correct
36 Correct 11 ms 19860 KB Output is correct
37 Correct 10 ms 19800 KB Output is correct
38 Correct 10 ms 20020 KB Output is correct
39 Correct 10 ms 19800 KB Output is correct
40 Correct 9 ms 19804 KB Output is correct
41 Correct 10 ms 19932 KB Output is correct
42 Correct 10 ms 19804 KB Output is correct
43 Correct 10 ms 19804 KB Output is correct
44 Correct 10 ms 19804 KB Output is correct
45 Correct 9 ms 19804 KB Output is correct
46 Correct 11 ms 19800 KB Output is correct
47 Correct 10 ms 19804 KB Output is correct
48 Correct 10 ms 19804 KB Output is correct
49 Correct 252 ms 20316 KB Output is correct
50 Correct 232 ms 20312 KB Output is correct
51 Correct 1200 ms 20312 KB Output is correct
52 Correct 1206 ms 20312 KB Output is correct
53 Correct 605 ms 20312 KB Output is correct
54 Correct 611 ms 20312 KB Output is correct
55 Correct 494 ms 20312 KB Output is correct
56 Correct 618 ms 20316 KB Output is correct
57 Correct 631 ms 20404 KB Output is correct
58 Correct 485 ms 20404 KB Output is correct
59 Correct 1203 ms 20316 KB Output is correct
60 Correct 1210 ms 20400 KB Output is correct
61 Correct 620 ms 20312 KB Output is correct
62 Correct 603 ms 20376 KB Output is correct
63 Correct 213 ms 20568 KB Output is correct
64 Correct 207 ms 20572 KB Output is correct
65 Correct 621 ms 20316 KB Output is correct
66 Correct 485 ms 20396 KB Output is correct
67 Correct 613 ms 20312 KB Output is correct
68 Correct 486 ms 20392 KB Output is correct
69 Correct 864 ms 20312 KB Output is correct
70 Correct 888 ms 20312 KB Output is correct

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19804 KB Output is correct
2 Correct 10 ms 19804 KB Output is correct
3 Correct 11 ms 19804 KB Output is correct
4 Correct 9 ms 19800 KB Output is correct
5 Correct 9 ms 19804 KB Output is correct
6 Correct 10 ms 20044 KB Output is correct
7 Correct 10 ms 19804 KB Output is correct
8 Correct 13 ms 19804 KB Output is correct
9 Correct 10 ms 20012 KB Output is correct
10 Correct 1104 ms 20316 KB Output is correct
11 Correct 1123 ms 20396 KB Output is correct
12 Correct 1177 ms 20312 KB Output is correct
13 Correct 1163 ms 20312 KB Output is correct
14 Execution timed out 5032 ms 31684 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19804 KB Output is correct
2 Correct 9 ms 19816 KB Output is correct
3 Correct 10 ms 19804 KB Output is correct
4 Correct 10 ms 19856 KB Output is correct
5 Correct 11 ms 19804 KB Output is correct
6 Correct 9 ms 19804 KB Output is correct
7 Correct 9 ms 19804 KB Output is correct
8 Correct 10 ms 19800 KB Output is correct
9 Correct 9 ms 19804 KB Output is correct
10 Correct 10 ms 19800 KB Output is correct
11 Correct 10 ms 20044 KB Output is correct
12 Correct 12 ms 19800 KB Output is correct
13 Correct 10 ms 19804 KB Output is correct
14 Correct 10 ms 19804 KB Output is correct
15 Correct 10 ms 19804 KB Output is correct
16 Correct 10 ms 19804 KB Output is correct
17 Correct 9 ms 19804 KB Output is correct
18 Correct 9 ms 19836 KB Output is correct
19 Correct 10 ms 19800 KB Output is correct
20 Correct 10 ms 19804 KB Output is correct
21 Correct 10 ms 19948 KB Output is correct
22 Correct 10 ms 19800 KB Output is correct
23 Correct 10 ms 19804 KB Output is correct
24 Correct 9 ms 19804 KB Output is correct
25 Correct 9 ms 19804 KB Output is correct
26 Correct 10 ms 19800 KB Output is correct
27 Correct 10 ms 19804 KB Output is correct
28 Correct 10 ms 19804 KB Output is correct
29 Correct 11 ms 19804 KB Output is correct
30 Correct 9 ms 19804 KB Output is correct
31 Correct 10 ms 19804 KB Output is correct
32 Correct 9 ms 19804 KB Output is correct
33 Correct 10 ms 19804 KB Output is correct
34 Correct 9 ms 20040 KB Output is correct
35 Correct 10 ms 19804 KB Output is correct
36 Correct 11 ms 19860 KB Output is correct
37 Correct 10 ms 19800 KB Output is correct
38 Correct 10 ms 20020 KB Output is correct
39 Correct 10 ms 19800 KB Output is correct
40 Correct 9 ms 19804 KB Output is correct
41 Correct 10 ms 19932 KB Output is correct
42 Correct 10 ms 19804 KB Output is correct
43 Correct 10 ms 19804 KB Output is correct
44 Correct 10 ms 19804 KB Output is correct
45 Correct 9 ms 19804 KB Output is correct
46 Correct 11 ms 19800 KB Output is correct
47 Correct 10 ms 19804 KB Output is correct
48 Correct 10 ms 19804 KB Output is correct
49 Correct 252 ms 20316 KB Output is correct
50 Correct 232 ms 20312 KB Output is correct
51 Correct 1200 ms 20312 KB Output is correct
52 Correct 1206 ms 20312 KB Output is correct
53 Correct 605 ms 20312 KB Output is correct
54 Correct 611 ms 20312 KB Output is correct
55 Correct 494 ms 20312 KB Output is correct
56 Correct 618 ms 20316 KB Output is correct
57 Correct 631 ms 20404 KB Output is correct
58 Correct 485 ms 20404 KB Output is correct
59 Correct 1203 ms 20316 KB Output is correct
60 Correct 1210 ms 20400 KB Output is correct
61 Correct 620 ms 20312 KB Output is correct
62 Correct 603 ms 20376 KB Output is correct
63 Correct 213 ms 20568 KB Output is correct
64 Correct 207 ms 20572 KB Output is correct
65 Correct 621 ms 20316 KB Output is correct
66 Correct 485 ms 20396 KB Output is correct
67 Correct 613 ms 20312 KB Output is correct
68 Correct 486 ms 20392 KB Output is correct
69 Correct 864 ms 20312 KB Output is correct
70 Correct 888 ms 20312 KB Output is correct
71 Correct 10 ms 19804 KB Output is correct
72 Correct 10 ms 19804 KB Output is correct
73 Correct 11 ms 19804 KB Output is correct
74 Correct 9 ms 19800 KB Output is correct
75 Correct 9 ms 19804 KB Output is correct
76 Correct 10 ms 20044 KB Output is correct
77 Correct 10 ms 19804 KB Output is correct
78 Correct 13 ms 19804 KB Output is correct
79 Correct 10 ms 20012 KB Output is correct
80 Correct 1104 ms 20316 KB Output is correct
81 Correct 1123 ms 20396 KB Output is correct
82 Correct 1177 ms 20312 KB Output is correct
83 Correct 1163 ms 20312 KB Output is correct
84 Execution timed out 5032 ms 31684 KB Time limit exceeded
85 Halted 0 ms 0 KB -