oj.uz

Submission #1003520

# Submission time Handle Problem Language Result Execution time Memory
1003520 2024-06-20T12:17:03 Z vjudge1 Flooding Wall (BOI24_wall) C++17
56 / 100
 5000 ms 29784 KB 
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math,inline")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,lzcnt,mmx,abm,avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;

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

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

int n, a[N], b[N], pre[N], suf[N], pw[N];
vector<pair<int, int>> cp;

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

  pw[0] = 1;
  for (int i = 1; i < n; i++) {
    pw[i] = pw[i-1] * 2 % mod;
  }

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

    int sz = u.size();
    cp.reserve(sz);
    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();

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

        x += pw[n-1-i] * pre[i-1] % mod;
        x %= mod;

        x += pw[i] * suf[i+1] % mod;
        x %= mod;

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

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

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

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

Subtask #1
8.0 / 8.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 512 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 600 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 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 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 468 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct

Subtask #2
17.0 / 17.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 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 464 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 600 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 456 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct

Subtask #3
19.0 / 19.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 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 464 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 600 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 456 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 185 ms 1116 KB Output is correct
28 Correct 196 ms 1116 KB Output is correct
29 Correct 2 ms 952 KB Output is correct
30 Correct 2 ms 1084 KB Output is correct
31 Correct 4 ms 956 KB Output is correct
32 Correct 5 ms 1116 KB Output is correct
33 Correct 6 ms 956 KB Output is correct
34 Correct 4 ms 952 KB Output is correct
35 Correct 6 ms 1116 KB Output is correct
36 Correct 7 ms 956 KB Output is correct
37 Correct 2 ms 956 KB Output is correct
38 Correct 2 ms 952 KB Output is correct
39 Correct 5 ms 952 KB Output is correct
40 Correct 4 ms 956 KB Output is correct

Subtask #4
0 / 14.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 512 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 600 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 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 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 468 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 464 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 600 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 0 ms 456 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 185 ms 1116 KB Output is correct
50 Correct 196 ms 1116 KB Output is correct
51 Correct 2 ms 952 KB Output is correct
52 Correct 2 ms 1084 KB Output is correct
53 Correct 4 ms 956 KB Output is correct
54 Correct 5 ms 1116 KB Output is correct
55 Correct 6 ms 956 KB Output is correct
56 Correct 4 ms 952 KB Output is correct
57 Correct 6 ms 1116 KB Output is correct
58 Correct 7 ms 956 KB Output is correct
59 Correct 2 ms 956 KB Output is correct
60 Correct 2 ms 952 KB Output is correct
61 Correct 5 ms 952 KB Output is correct
62 Correct 4 ms 956 KB Output is correct
63 Execution timed out 5059 ms 1664 KB Time limit exceeded
64 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.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 0 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 2 ms 968 KB Output is correct
11 Correct 2 ms 952 KB Output is correct
12 Correct 3 ms 952 KB Output is correct
13 Correct 3 ms 956 KB Output is correct
14 Correct 117 ms 29780 KB Output is correct
15 Correct 115 ms 29784 KB Output is correct
16 Correct 119 ms 29780 KB Output is correct
17 Correct 125 ms 29744 KB Output is correct

Subtask #6
0 / 30.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 512 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 600 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 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 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 468 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 464 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 600 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 0 ms 456 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 185 ms 1116 KB Output is correct
50 Correct 196 ms 1116 KB Output is correct
51 Correct 2 ms 952 KB Output is correct
52 Correct 2 ms 1084 KB Output is correct
53 Correct 4 ms 956 KB Output is correct
54 Correct 5 ms 1116 KB Output is correct
55 Correct 6 ms 956 KB Output is correct
56 Correct 4 ms 952 KB Output is correct
57 Correct 6 ms 1116 KB Output is correct
58 Correct 7 ms 956 KB Output is correct
59 Correct 2 ms 956 KB Output is correct
60 Correct 2 ms 952 KB Output is correct
61 Correct 5 ms 952 KB Output is correct
62 Correct 4 ms 956 KB Output is correct
63 Execution timed out 5059 ms 1664 KB Time limit exceeded
64 Halted 0 ms 0 KB -