oj.uz

Submission #1003506

# Submission time Handle Problem Language Result Execution time Memory
1003506 2024-06-20T12:03:08 Z vjudge1 Flooding Wall (BOI24_wall) C++17
56 / 100
 2079 ms 1048576 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define all(x) x.begin(), x.end()

const int N = 5e5, N2 = 1e4, mod = 1e9+7;

int n, a[N], b[N], c[N], pre2[N], suf2[N];
vector<int> pre[N2], suf[N2];
vector<pair<int, int>> cp;

int pw(int x, int y) {
  return (!y ? 1 : pw(x*x % mod, y/2) * (y%2 ? x : 1) % mod);
}

signed main() {
  ios::sync_with_stdio(false); cin.tie(nullptr);

  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (int i = 0; i < n; i++) {
    cin >> b[i];
    if (a[i] > b[i]) swap(a[i], b[i]);
  }

    vector<int> u;
    u.push_back(0);
    for (int i = 0; i < n; i++) {
      u.push_back(a[i]);
      u.push_back(b[i]);
    }
    sort(all(u));
    u.erase(unique(all(u)), u.end());

    int sz = u.size();
    for (int i = 0; i < sz; i++) {
      cp.push_back(make_pair(u[i], u[i]));

      if (i+1 < sz && u[i]+1 <= u[i+1]-1) cp.push_back(make_pair(u[i]+1, u[i+1]-1));
    }
    sz = cp.size();

    for (int i = 0; i < n; i++) {
      pre[i].resize(sz);
      suf[i].resize(sz);
    }

    for (int i = 0; i < n; i++) {
      for (int j = 0; j < sz; j++) {
        pre[i][j] = (i ? pre[i-1][j] : 1);
        
        if (b[i] <= cp[j].second) {
          pre[i][j] *= 2;
          pre[i][j] %= mod;
        }
        else if (a[i] > cp[j].second) pre[i][j] = 0;
      }
    }

    for (int i = n-1; i >= 0; i--) {
      for (int j = 0; j < sz; j++) {
        suf[i][j] = (i+1 < n ? suf[i+1][j] : 1);
        
        if (b[i] <= cp[j].second) {
          suf[i][j] *= 2;
          suf[i][j] %= mod;
        }
        else if (a[i] > cp[j].second) suf[i][j] = 0;
      }
    }

    int ans = 0;
    for (int i = 1; i < n-1; i++) {
      for (int j = 1; j < sz; j++) {
        int x = 0;

        x += pw(2, n-1-i) * pre[i-1][j-1] % mod;
        x %= mod;

        x += pw(2, i) * suf[i+1][j-1] % mod;
        x %= mod;

        x = (x - pre[i-1][j-1] * suf[i+1][j-1] % mod + mod) % mod;

        if (a[i] < cp[j].first) {
          ans += (pw(2, n-1) - x + mod) % mod * (cp[j].second-cp[j].first+1) % mod;
          ans %= mod;
        }

        if (b[i] < cp[j].first) {
          ans += (pw(2, n-1) - x + mod) % mod * (cp[j].second-cp[j].first+1) % mod;
          ans %= mod;
        }
      }
    }

    cout << ans << "\n";
  //}
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 1 ms 944 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 0 ms 860 KB Output is correct
6 Correct 0 ms 860 KB Output is correct
7 Correct 0 ms 860 KB Output is correct
8 Correct 0 ms 860 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 1 ms 1112 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 0 ms 860 KB Output is correct
15 Correct 1 ms 856 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 1 ms 860 KB Output is correct
18 Correct 0 ms 860 KB Output is correct
19 Correct 1 ms 860 KB Output is correct
20 Correct 1 ms 860 KB Output is correct
21 Correct 1 ms 860 KB Output is correct
22 Correct 0 ms 860 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1112 KB Output is correct
2 Correct 0 ms 860 KB Output is correct
3 Correct 0 ms 860 KB Output is correct
4 Correct 1 ms 1064 KB Output is correct
5 Correct 0 ms 860 KB Output is correct
6 Correct 0 ms 860 KB Output is correct
7 Correct 0 ms 860 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 0 ms 860 KB Output is correct
10 Correct 0 ms 860 KB Output is correct
11 Correct 1 ms 856 KB Output is correct
12 Correct 1 ms 860 KB Output is correct
13 Correct 0 ms 860 KB Output is correct
14 Correct 0 ms 936 KB Output is correct
15 Correct 3 ms 1500 KB Output is correct
16 Correct 3 ms 1372 KB Output is correct
17 Correct 0 ms 860 KB Output is correct
18 Correct 0 ms 860 KB Output is correct
19 Correct 0 ms 860 KB Output is correct
20 Correct 1 ms 860 KB Output is correct
21 Correct 1 ms 860 KB Output is correct
22 Correct 1 ms 860 KB Output is correct
23 Correct 1 ms 860 KB Output is correct
24 Correct 1 ms 860 KB Output is correct
25 Correct 2 ms 1116 KB Output is correct
26 Correct 1 ms 1116 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1112 KB Output is correct
2 Correct 0 ms 860 KB Output is correct
3 Correct 0 ms 860 KB Output is correct
4 Correct 1 ms 1064 KB Output is correct
5 Correct 0 ms 860 KB Output is correct
6 Correct 0 ms 860 KB Output is correct
7 Correct 0 ms 860 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 0 ms 860 KB Output is correct
10 Correct 0 ms 860 KB Output is correct
11 Correct 1 ms 856 KB Output is correct
12 Correct 1 ms 860 KB Output is correct
13 Correct 0 ms 860 KB Output is correct
14 Correct 0 ms 936 KB Output is correct
15 Correct 3 ms 1500 KB Output is correct
16 Correct 3 ms 1372 KB Output is correct
17 Correct 0 ms 860 KB Output is correct
18 Correct 0 ms 860 KB Output is correct
19 Correct 0 ms 860 KB Output is correct
20 Correct 1 ms 860 KB Output is correct
21 Correct 1 ms 860 KB Output is correct
22 Correct 1 ms 860 KB Output is correct
23 Correct 1 ms 860 KB Output is correct
24 Correct 1 ms 860 KB Output is correct
25 Correct 2 ms 1116 KB Output is correct
26 Correct 1 ms 1116 KB Output is correct
27 Correct 2079 ms 158048 KB Output is correct
28 Correct 2027 ms 157920 KB Output is correct
29 Correct 8 ms 1756 KB Output is correct
30 Correct 6 ms 1760 KB Output is correct
31 Correct 25 ms 3040 KB Output is correct
32 Correct 27 ms 3548 KB Output is correct
33 Correct 43 ms 4064 KB Output is correct
34 Correct 23 ms 3040 KB Output is correct
35 Correct 26 ms 3548 KB Output is correct
36 Correct 42 ms 3976 KB Output is correct
37 Correct 5 ms 1760 KB Output is correct
38 Correct 6 ms 1788 KB Output is correct
39 Correct 22 ms 3040 KB Output is correct
40 Correct 24 ms 3028 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 1 ms 944 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 0 ms 860 KB Output is correct
6 Correct 0 ms 860 KB Output is correct
7 Correct 0 ms 860 KB Output is correct
8 Correct 0 ms 860 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 1 ms 1112 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 0 ms 860 KB Output is correct
15 Correct 1 ms 856 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 1 ms 860 KB Output is correct
18 Correct 0 ms 860 KB Output is correct
19 Correct 1 ms 860 KB Output is correct
20 Correct 1 ms 860 KB Output is correct
21 Correct 1 ms 860 KB Output is correct
22 Correct 0 ms 860 KB Output is correct
23 Correct 0 ms 1112 KB Output is correct
24 Correct 0 ms 860 KB Output is correct
25 Correct 0 ms 860 KB Output is correct
26 Correct 1 ms 1064 KB Output is correct
27 Correct 0 ms 860 KB Output is correct
28 Correct 0 ms 860 KB Output is correct
29 Correct 0 ms 860 KB Output is correct
30 Correct 1 ms 860 KB Output is correct
31 Correct 0 ms 860 KB Output is correct
32 Correct 0 ms 860 KB Output is correct
33 Correct 1 ms 856 KB Output is correct
34 Correct 1 ms 860 KB Output is correct
35 Correct 0 ms 860 KB Output is correct
36 Correct 0 ms 936 KB Output is correct
37 Correct 3 ms 1500 KB Output is correct
38 Correct 3 ms 1372 KB Output is correct
39 Correct 0 ms 860 KB Output is correct
40 Correct 0 ms 860 KB Output is correct
41 Correct 0 ms 860 KB Output is correct
42 Correct 1 ms 860 KB Output is correct
43 Correct 1 ms 860 KB Output is correct
44 Correct 1 ms 860 KB Output is correct
45 Correct 1 ms 860 KB Output is correct
46 Correct 1 ms 860 KB Output is correct
47 Correct 2 ms 1116 KB Output is correct
48 Correct 1 ms 1116 KB Output is correct
49 Correct 2079 ms 158048 KB Output is correct
50 Correct 2027 ms 157920 KB Output is correct
51 Correct 8 ms 1756 KB Output is correct
52 Correct 6 ms 1760 KB Output is correct
53 Correct 25 ms 3040 KB Output is correct
54 Correct 27 ms 3548 KB Output is correct
55 Correct 43 ms 4064 KB Output is correct
56 Correct 23 ms 3040 KB Output is correct
57 Correct 26 ms 3548 KB Output is correct
58 Correct 42 ms 3976 KB Output is correct
59 Correct 5 ms 1760 KB Output is correct
60 Correct 6 ms 1788 KB Output is correct
61 Correct 22 ms 3040 KB Output is correct
62 Correct 24 ms 3028 KB Output is correct
63 Runtime error 369 ms 1048576 KB Execution killed with signal 9
64 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 0 ms 860 KB Output is correct
3 Correct 0 ms 860 KB Output is correct
4 Correct 0 ms 860 KB Output is correct
5 Correct 1 ms 860 KB Output is correct
6 Correct 0 ms 860 KB Output is correct
7 Correct 0 ms 932 KB Output is correct
8 Correct 0 ms 860 KB Output is correct
9 Correct 1 ms 856 KB Output is correct
10 Correct 6 ms 1760 KB Output is correct
11 Correct 6 ms 1760 KB Output is correct
12 Correct 6 ms 1760 KB Output is correct
13 Correct 6 ms 1788 KB Output is correct
14 Correct 349 ms 46000 KB Output is correct
15 Correct 352 ms 46000 KB Output is correct
16 Correct 353 ms 46000 KB Output is correct
17 Correct 344 ms 46004 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 1 ms 944 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 0 ms 860 KB Output is correct
6 Correct 0 ms 860 KB Output is correct
7 Correct 0 ms 860 KB Output is correct
8 Correct 0 ms 860 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 1 ms 1112 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 0 ms 860 KB Output is correct
15 Correct 1 ms 856 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 1 ms 860 KB Output is correct
18 Correct 0 ms 860 KB Output is correct
19 Correct 1 ms 860 KB Output is correct
20 Correct 1 ms 860 KB Output is correct
21 Correct 1 ms 860 KB Output is correct
22 Correct 0 ms 860 KB Output is correct
23 Correct 0 ms 1112 KB Output is correct
24 Correct 0 ms 860 KB Output is correct
25 Correct 0 ms 860 KB Output is correct
26 Correct 1 ms 1064 KB Output is correct
27 Correct 0 ms 860 KB Output is correct
28 Correct 0 ms 860 KB Output is correct
29 Correct 0 ms 860 KB Output is correct
30 Correct 1 ms 860 KB Output is correct
31 Correct 0 ms 860 KB Output is correct
32 Correct 0 ms 860 KB Output is correct
33 Correct 1 ms 856 KB Output is correct
34 Correct 1 ms 860 KB Output is correct
35 Correct 0 ms 860 KB Output is correct
36 Correct 0 ms 936 KB Output is correct
37 Correct 3 ms 1500 KB Output is correct
38 Correct 3 ms 1372 KB Output is correct
39 Correct 0 ms 860 KB Output is correct
40 Correct 0 ms 860 KB Output is correct
41 Correct 0 ms 860 KB Output is correct
42 Correct 1 ms 860 KB Output is correct
43 Correct 1 ms 860 KB Output is correct
44 Correct 1 ms 860 KB Output is correct
45 Correct 1 ms 860 KB Output is correct
46 Correct 1 ms 860 KB Output is correct
47 Correct 2 ms 1116 KB Output is correct
48 Correct 1 ms 1116 KB Output is correct
49 Correct 2079 ms 158048 KB Output is correct
50 Correct 2027 ms 157920 KB Output is correct
51 Correct 8 ms 1756 KB Output is correct
52 Correct 6 ms 1760 KB Output is correct
53 Correct 25 ms 3040 KB Output is correct
54 Correct 27 ms 3548 KB Output is correct
55 Correct 43 ms 4064 KB Output is correct
56 Correct 23 ms 3040 KB Output is correct
57 Correct 26 ms 3548 KB Output is correct
58 Correct 42 ms 3976 KB Output is correct
59 Correct 5 ms 1760 KB Output is correct
60 Correct 6 ms 1788 KB Output is correct
61 Correct 22 ms 3040 KB Output is correct
62 Correct 24 ms 3028 KB Output is correct
63 Runtime error 369 ms 1048576 KB Execution killed with signal 9
64 Halted 0 ms 0 KB -