oj.uz

Submission #999470

# Submission time Handle Problem Language Result Execution time Memory
999470 2024-06-15T14:33:32 Z AlperenT_ Flooding Wall (BOI24_wall) C++17
100 / 100
 3680 ms 179876 KB 
#include <bits/stdc++.h>
 

#pragma GCC optimize("O3,unroll-loops")
#define pb push_back
#define F first
#define S second 
#define all(a) a.begin(),a.end()
#define pii pair <int,int>
#define PII pair<pii , pii>
#define ld long double 
#define int long long 
#define sz(v) (int)v.size()
#define rep(i , a , b) for(int i=a;i <= b;i++)
#define per(i, a , b) for(int i=a;i >= b;i--)
using namespace std ;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxn = 5e5 + 10  ,  N = 1e5 +1 , lg = 20 , maxq = 202 , sq = 333   , inf = 2e9 +100 , maxk = 2022 , mod = 1e9 + 7 ;
int n , s[28*maxn] , a2   , lz[28*maxn] , a[maxn] , b[maxn] , pr[maxn] , sf[maxn] , ans =0  ;
vector <int> cm ;

int po(int a, int b){
  if(b==0)return 1;
  int v= po(a,b/2);
  v= v*v % mod ;
  if(b&1) v = v*a % mod ;
  return v; 
}

void shi(int p){
  int pl = p<<1 ,pr =p<<1|1;
  s[pl] = s[pl] * lz[p] % mod ;
  s[pr] = s[pr] * lz[p]%mod ;
  lz[pl] = lz[pl] * lz[p] % mod ;
  lz[pr] = lz[pr] * lz[p] % mod ;
  lz[p] = 1; 
}

void bui(int p =1 ,int l = 0 , int r =sz(cm)-2){
  int mid = (l+r)/2 , pl = p<<1 , pr = p<<1|1 ;
  if(l == r){
    s[p] =cm[l+1]-cm[l] ;
    lz[p] =1 ;
    return ;
  }
  bui(pl,l,mid);
  bui(pr,mid+1 , r);
  s[p] = (s[pl] + s[pr])%mod ;
  lz[p] =1 ;
}
void upd(int le ,int ri ,int w ,int p = 1, int l = 0 , int r =sz(cm)-2){
  int mid = (l+r) /2 , pl =p<<1,pr=p<<1|1 ;
  if(le > r || l > ri)return ;
  if(l!=r)shi(p) ;
  if(le <= l && r <= ri){
    s[p] = (s[p] * w)%mod ;
    lz[p] = lz[p] * w % mod ;
    return ;
  }
  upd(le,ri,w,pl,l,mid);
  upd(le,ri,w,pr,mid+1,r) ;
  s[p] = (s[pl] + s[pr])%mod ;
  lz[p] =1 ;
}
int que(int le ,int ri , int p =1 ,int l = 0 , int r =sz(cm)-2){
  int mid = (l+r)/2 , pl = p<<1 ,pr = p<<1|1 ;
  if(le > r || l > ri)return 0 ;
  if(l!=r)shi(p) ;
  if(le <= l &&r <= ri)return s[p] ;
  return (que(le ,ri ,pl,l,mid) + que(le , ri ,pr ,mid+1 , r))%mod ;
}
vector <pair<pii , int> > v1[maxn] , v2[maxn] , v3[maxn] ;

void sl(int i , int l ,int r, int w){
  int x = min(pr[i-1] , sf[i+1]) , y = max(pr[i-1] ,sf[i+1] )+1 ;
  ans = (ans + max(0ll , min(x,r)-l+1) * w)%mod ;
  l = max(l , x+1) ;
  if(l > r)return ;
  y = max(y, l);
  if(r >= y){
    cm.pb(y);cm.pb(r+1) ;
    ans = (ans + (r-y+1)*w)%mod ;
    v3[i].pb({{y,r+1},w});
    v2[i].pb({{y,r+1},(-w+mod)%mod}) ;
    v1[i].pb({{y,r+1},(-w+mod)%mod}) ;
  }
  r = min(r,y-1);
  if(l > r)return ;
  cm.pb(l);cm.pb(r+1);
  ans = (ans + (r-l+1)*w)%mod ;
  if(pr[i-1] > sf[i+1]){
    v2[i].pb({{l,r+1},(-w+mod)%mod});
  }else{
    v1[i].pb({{l,r+1},(-w+mod)%mod});
  }
}
int f(int x){
  int y = lower_bound(all(cm) , x) - cm.begin() ;
  return y ;
}
signed main() {
  ios::sync_with_stdio(false); cin.tie(0);   
  a2 = po(2, mod-2) ;
  cin >> n ;
  rep(i , 1,n){
    cin >> a[i] ;
  } 
  rep(i , 1 ,n){
    cin >> b[i] ;
    if(a[i] > b[i])swap(a[i] , b[i]) ;
  }
  pr[0] = -inf ;
  rep(i ,1 ,n){
    pr[i] = max(pr[i-1] , a[i]) ;
  }
  sf[n+1] = -inf ;
  per(i , n ,1 ){
    sf[i] = max(sf[i+1] , a[i]) ; 
    cm.pb(a[i]+1);cm.pb(b[i]+1) ;
  }
  rep(i ,2 , n-1){
    sl(i,a[i] + 1, b[i] , a2) ;
    sl(i,b[i] +1 , 1e9 , 1) ; 
  }
  sort(all(cm)) ;
  cm.resize(unique(all(cm)) - cm.begin()) ;
  bui() ;
  rep(i ,1 , n){
    for(auto [x, w] : v1[i]){
      x.F = f(x.F) ;
      x.S = f(x.S) ; 
      ans = (ans + w * que(x.F,x.S-1))%mod ;
    }
    upd(f(a[i]+1) ,f(b[i]+1)-1 , a2) ; 
  }
  rep(i , 1 , n){
    upd(f(a[i]+1) , f(b[i]+1)-1 , 2) ;
    for(auto [x, w] : v3[i]){
      x.F = f(x.F) ;
      x.S = f(x.S) ;  
      ans = (ans + w * que(x.F,x.S-1))%mod ;
    }
    upd(f(a[i]+1) , f(b[i]+1)-1 , a2) ;
  }
  bui() ;
  per(i , n ,1 ){
    for(auto [x, w] : v2[i]){
      x.F = f(x.F) ;
      x.S = f(x.S) ;  
      ans = (ans + w * que(x.F,x.S-1))%mod ;
    }
    upd(f(a[i]+1) ,f(b[i]+1)-1 , a2) ; 
  }
  cout <<ans*po(2,n)%mod << "\n" ;
}
/*

*/

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 47708 KB Output is correct
2 Correct 7 ms 47708 KB Output is correct
3 Correct 7 ms 47708 KB Output is correct
4 Correct 8 ms 47584 KB Output is correct
5 Correct 7 ms 47708 KB Output is correct
6 Correct 7 ms 47820 KB Output is correct
7 Correct 7 ms 47708 KB Output is correct
8 Correct 7 ms 47808 KB Output is correct
9 Correct 7 ms 47708 KB Output is correct
10 Correct 7 ms 47708 KB Output is correct
11 Correct 7 ms 47708 KB Output is correct
12 Correct 7 ms 47708 KB Output is correct
13 Correct 7 ms 47824 KB Output is correct
14 Correct 7 ms 47704 KB Output is correct
15 Correct 7 ms 47708 KB Output is correct
16 Correct 7 ms 47704 KB Output is correct
17 Correct 7 ms 47708 KB Output is correct
18 Correct 8 ms 47708 KB Output is correct
19 Correct 9 ms 47708 KB Output is correct
20 Correct 7 ms 47708 KB Output is correct
21 Correct 9 ms 47708 KB Output is correct
22 Correct 8 ms 47708 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 47708 KB Output is correct
2 Correct 8 ms 47704 KB Output is correct
3 Correct 7 ms 47776 KB Output is correct
4 Correct 7 ms 47708 KB Output is correct
5 Correct 7 ms 47708 KB Output is correct
6 Correct 7 ms 47820 KB Output is correct
7 Correct 8 ms 47580 KB Output is correct
8 Correct 7 ms 47708 KB Output is correct
9 Correct 7 ms 47708 KB Output is correct
10 Correct 7 ms 47708 KB Output is correct
11 Correct 7 ms 47708 KB Output is correct
12 Correct 7 ms 47808 KB Output is correct
13 Correct 7 ms 47708 KB Output is correct
14 Correct 7 ms 47708 KB Output is correct
15 Correct 7 ms 47832 KB Output is correct
16 Correct 7 ms 47708 KB Output is correct
17 Correct 7 ms 47708 KB Output is correct
18 Correct 7 ms 47708 KB Output is correct
19 Correct 8 ms 47708 KB Output is correct
20 Correct 6 ms 47708 KB Output is correct
21 Correct 7 ms 47832 KB Output is correct
22 Correct 7 ms 47708 KB Output is correct
23 Correct 7 ms 47708 KB Output is correct
24 Correct 7 ms 47756 KB Output is correct
25 Correct 7 ms 47808 KB Output is correct
26 Correct 7 ms 47708 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 47708 KB Output is correct
2 Correct 8 ms 47704 KB Output is correct
3 Correct 7 ms 47776 KB Output is correct
4 Correct 7 ms 47708 KB Output is correct
5 Correct 7 ms 47708 KB Output is correct
6 Correct 7 ms 47820 KB Output is correct
7 Correct 8 ms 47580 KB Output is correct
8 Correct 7 ms 47708 KB Output is correct
9 Correct 7 ms 47708 KB Output is correct
10 Correct 7 ms 47708 KB Output is correct
11 Correct 7 ms 47708 KB Output is correct
12 Correct 7 ms 47808 KB Output is correct
13 Correct 7 ms 47708 KB Output is correct
14 Correct 7 ms 47708 KB Output is correct
15 Correct 7 ms 47832 KB Output is correct
16 Correct 7 ms 47708 KB Output is correct
17 Correct 7 ms 47708 KB Output is correct
18 Correct 7 ms 47708 KB Output is correct
19 Correct 8 ms 47708 KB Output is correct
20 Correct 6 ms 47708 KB Output is correct
21 Correct 7 ms 47832 KB Output is correct
22 Correct 7 ms 47708 KB Output is correct
23 Correct 7 ms 47708 KB Output is correct
24 Correct 7 ms 47756 KB Output is correct
25 Correct 7 ms 47808 KB Output is correct
26 Correct 7 ms 47708 KB Output is correct
27 Correct 37 ms 51420 KB Output is correct
28 Correct 37 ms 51420 KB Output is correct
29 Correct 14 ms 52184 KB Output is correct
30 Correct 14 ms 52188 KB Output is correct
31 Correct 15 ms 51268 KB Output is correct
32 Correct 15 ms 51164 KB Output is correct
33 Correct 17 ms 51420 KB Output is correct
34 Correct 15 ms 51160 KB Output is correct
35 Correct 16 ms 51164 KB Output is correct
36 Correct 16 ms 51516 KB Output is correct
37 Correct 17 ms 52184 KB Output is correct
38 Correct 12 ms 52072 KB Output is correct
39 Correct 16 ms 51208 KB Output is correct
40 Correct 17 ms 51164 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 47708 KB Output is correct
2 Correct 7 ms 47708 KB Output is correct
3 Correct 7 ms 47708 KB Output is correct
4 Correct 8 ms 47584 KB Output is correct
5 Correct 7 ms 47708 KB Output is correct
6 Correct 7 ms 47820 KB Output is correct
7 Correct 7 ms 47708 KB Output is correct
8 Correct 7 ms 47808 KB Output is correct
9 Correct 7 ms 47708 KB Output is correct
10 Correct 7 ms 47708 KB Output is correct
11 Correct 7 ms 47708 KB Output is correct
12 Correct 7 ms 47708 KB Output is correct
13 Correct 7 ms 47824 KB Output is correct
14 Correct 7 ms 47704 KB Output is correct
15 Correct 7 ms 47708 KB Output is correct
16 Correct 7 ms 47704 KB Output is correct
17 Correct 7 ms 47708 KB Output is correct
18 Correct 8 ms 47708 KB Output is correct
19 Correct 9 ms 47708 KB Output is correct
20 Correct 7 ms 47708 KB Output is correct
21 Correct 9 ms 47708 KB Output is correct
22 Correct 8 ms 47708 KB Output is correct
23 Correct 7 ms 47708 KB Output is correct
24 Correct 8 ms 47704 KB Output is correct
25 Correct 7 ms 47776 KB Output is correct
26 Correct 7 ms 47708 KB Output is correct
27 Correct 7 ms 47708 KB Output is correct
28 Correct 7 ms 47820 KB Output is correct
29 Correct 8 ms 47580 KB Output is correct
30 Correct 7 ms 47708 KB Output is correct
31 Correct 7 ms 47708 KB Output is correct
32 Correct 7 ms 47708 KB Output is correct
33 Correct 7 ms 47708 KB Output is correct
34 Correct 7 ms 47808 KB Output is correct
35 Correct 7 ms 47708 KB Output is correct
36 Correct 7 ms 47708 KB Output is correct
37 Correct 7 ms 47832 KB Output is correct
38 Correct 7 ms 47708 KB Output is correct
39 Correct 7 ms 47708 KB Output is correct
40 Correct 7 ms 47708 KB Output is correct
41 Correct 8 ms 47708 KB Output is correct
42 Correct 6 ms 47708 KB Output is correct
43 Correct 7 ms 47832 KB Output is correct
44 Correct 7 ms 47708 KB Output is correct
45 Correct 7 ms 47708 KB Output is correct
46 Correct 7 ms 47756 KB Output is correct
47 Correct 7 ms 47808 KB Output is correct
48 Correct 7 ms 47708 KB Output is correct
49 Correct 37 ms 51420 KB Output is correct
50 Correct 37 ms 51420 KB Output is correct
51 Correct 14 ms 52184 KB Output is correct
52 Correct 14 ms 52188 KB Output is correct
53 Correct 15 ms 51268 KB Output is correct
54 Correct 15 ms 51164 KB Output is correct
55 Correct 17 ms 51420 KB Output is correct
56 Correct 15 ms 51160 KB Output is correct
57 Correct 16 ms 51164 KB Output is correct
58 Correct 16 ms 51516 KB Output is correct
59 Correct 17 ms 52184 KB Output is correct
60 Correct 12 ms 52072 KB Output is correct
61 Correct 16 ms 51208 KB Output is correct
62 Correct 17 ms 51164 KB Output is correct
63 Correct 59 ms 51420 KB Output is correct
64 Correct 60 ms 51420 KB Output is correct
65 Correct 16 ms 50908 KB Output is correct
66 Correct 17 ms 51420 KB Output is correct
67 Correct 16 ms 50908 KB Output is correct
68 Correct 19 ms 51420 KB Output is correct
69 Correct 59 ms 52188 KB Output is correct
70 Correct 64 ms 52188 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 47708 KB Output is correct
2 Correct 9 ms 47572 KB Output is correct
3 Correct 7 ms 47708 KB Output is correct
4 Correct 7 ms 47708 KB Output is correct
5 Correct 8 ms 47708 KB Output is correct
6 Correct 7 ms 47708 KB Output is correct
7 Correct 7 ms 47592 KB Output is correct
8 Correct 8 ms 47708 KB Output is correct
9 Correct 7 ms 47708 KB Output is correct
10 Correct 14 ms 52028 KB Output is correct
11 Correct 16 ms 52120 KB Output is correct
12 Correct 15 ms 52188 KB Output is correct
13 Correct 13 ms 52184 KB Output is correct
14 Correct 289 ms 172116 KB Output is correct
15 Correct 295 ms 171944 KB Output is correct
16 Correct 288 ms 171432 KB Output is correct
17 Correct 340 ms 173080 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 47708 KB Output is correct
2 Correct 7 ms 47708 KB Output is correct
3 Correct 7 ms 47708 KB Output is correct
4 Correct 8 ms 47584 KB Output is correct
5 Correct 7 ms 47708 KB Output is correct
6 Correct 7 ms 47820 KB Output is correct
7 Correct 7 ms 47708 KB Output is correct
8 Correct 7 ms 47808 KB Output is correct
9 Correct 7 ms 47708 KB Output is correct
10 Correct 7 ms 47708 KB Output is correct
11 Correct 7 ms 47708 KB Output is correct
12 Correct 7 ms 47708 KB Output is correct
13 Correct 7 ms 47824 KB Output is correct
14 Correct 7 ms 47704 KB Output is correct
15 Correct 7 ms 47708 KB Output is correct
16 Correct 7 ms 47704 KB Output is correct
17 Correct 7 ms 47708 KB Output is correct
18 Correct 8 ms 47708 KB Output is correct
19 Correct 9 ms 47708 KB Output is correct
20 Correct 7 ms 47708 KB Output is correct
21 Correct 9 ms 47708 KB Output is correct
22 Correct 8 ms 47708 KB Output is correct
23 Correct 7 ms 47708 KB Output is correct
24 Correct 8 ms 47704 KB Output is correct
25 Correct 7 ms 47776 KB Output is correct
26 Correct 7 ms 47708 KB Output is correct
27 Correct 7 ms 47708 KB Output is correct
28 Correct 7 ms 47820 KB Output is correct
29 Correct 8 ms 47580 KB Output is correct
30 Correct 7 ms 47708 KB Output is correct
31 Correct 7 ms 47708 KB Output is correct
32 Correct 7 ms 47708 KB Output is correct
33 Correct 7 ms 47708 KB Output is correct
34 Correct 7 ms 47808 KB Output is correct
35 Correct 7 ms 47708 KB Output is correct
36 Correct 7 ms 47708 KB Output is correct
37 Correct 7 ms 47832 KB Output is correct
38 Correct 7 ms 47708 KB Output is correct
39 Correct 7 ms 47708 KB Output is correct
40 Correct 7 ms 47708 KB Output is correct
41 Correct 8 ms 47708 KB Output is correct
42 Correct 6 ms 47708 KB Output is correct
43 Correct 7 ms 47832 KB Output is correct
44 Correct 7 ms 47708 KB Output is correct
45 Correct 7 ms 47708 KB Output is correct
46 Correct 7 ms 47756 KB Output is correct
47 Correct 7 ms 47808 KB Output is correct
48 Correct 7 ms 47708 KB Output is correct
49 Correct 37 ms 51420 KB Output is correct
50 Correct 37 ms 51420 KB Output is correct
51 Correct 14 ms 52184 KB Output is correct
52 Correct 14 ms 52188 KB Output is correct
53 Correct 15 ms 51268 KB Output is correct
54 Correct 15 ms 51164 KB Output is correct
55 Correct 17 ms 51420 KB Output is correct
56 Correct 15 ms 51160 KB Output is correct
57 Correct 16 ms 51164 KB Output is correct
58 Correct 16 ms 51516 KB Output is correct
59 Correct 17 ms 52184 KB Output is correct
60 Correct 12 ms 52072 KB Output is correct
61 Correct 16 ms 51208 KB Output is correct
62 Correct 17 ms 51164 KB Output is correct
63 Correct 59 ms 51420 KB Output is correct
64 Correct 60 ms 51420 KB Output is correct
65 Correct 16 ms 50908 KB Output is correct
66 Correct 17 ms 51420 KB Output is correct
67 Correct 16 ms 50908 KB Output is correct
68 Correct 19 ms 51420 KB Output is correct
69 Correct 59 ms 52188 KB Output is correct
70 Correct 64 ms 52188 KB Output is correct
71 Correct 8 ms 47708 KB Output is correct
72 Correct 9 ms 47572 KB Output is correct
73 Correct 7 ms 47708 KB Output is correct
74 Correct 7 ms 47708 KB Output is correct
75 Correct 8 ms 47708 KB Output is correct
76 Correct 7 ms 47708 KB Output is correct
77 Correct 7 ms 47592 KB Output is correct
78 Correct 8 ms 47708 KB Output is correct
79 Correct 7 ms 47708 KB Output is correct
80 Correct 14 ms 52028 KB Output is correct
81 Correct 16 ms 52120 KB Output is correct
82 Correct 15 ms 52188 KB Output is correct
83 Correct 13 ms 52184 KB Output is correct
84 Correct 289 ms 172116 KB Output is correct
85 Correct 295 ms 171944 KB Output is correct
86 Correct 288 ms 171432 KB Output is correct
87 Correct 340 ms 173080 KB Output is correct
88 Correct 3680 ms 175020 KB Output is correct
89 Correct 3424 ms 174244 KB Output is correct
90 Correct 423 ms 138924 KB Output is correct
91 Correct 411 ms 116652 KB Output is correct
92 Correct 522 ms 141224 KB Output is correct
93 Correct 417 ms 139956 KB Output is correct
94 Correct 399 ms 116400 KB Output is correct
95 Correct 481 ms 140564 KB Output is correct
96 Correct 3189 ms 179876 KB Output is correct
97 Correct 3300 ms 179876 KB Output is correct