oj.uz

Submission #914624

# Submission time Handle Problem Language Result Execution time Memory
914624 2024-01-22T12:25:57 Z mychecksedad Fire (JOI20_ho_t5) C++17
1 / 100
 391 ms 111832 KB 
/* Author : Mychecksdead  */
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
const int N = 1e6+100, M = 1e5+10, K = 52, MX = 30;



int n, q, L[N], R[N];
ll a[N], ans[N], T[N], lazy[N], F[N], fazy[N];
vector<array<int, 3>> Q[N];
vector<array<ll, 3>> UPD[N];

void build(int l, int r, int k){
  if(l == r){
    F[k] = T[k] = lazy[k] = fazy[k] = 0;
    return;
  }
  int m = l+r>>1;
  build(l, m, k<<1);
  build(m+1, r, k<<1|1);
  T[k] = F[k] = lazy[k] = fazy[k] = 0;
}

void push(int k, int l, int r, int m){
  T[k<<1] += lazy[k]*(m-l+1);
  T[k<<1|1] += lazy[k]*(r-m);
  lazy[k<<1] += lazy[k];
  lazy[k<<1|1] += lazy[k];
  lazy[k] = 0;
}
void push2(int k, int l, int r, int m){
  F[k<<1] += fazy[k]*(m-l+1);
  F[k<<1|1] += fazy[k]*(r-m);
  fazy[k<<1] += fazy[k];
  fazy[k<<1|1] += fazy[k];
  fazy[k] = 0;
}

void upd(int l, int r, int ql, int qr, int k, ll val){
  if(ql > r || l > qr) return;
  if(ql <= l && r <= qr){
    T[k] += (r-l+1)*val;
    lazy[k] += val;
    return;
  }
  int m = l+r>>1;
  push(k, l, r, m);
  upd(l, m, ql, qr, k<<1, val);
  upd(m+1, r, ql, qr, k<<1|1, val);
  T[k] = T[k<<1] + T[k<<1|1];
}
void upd2(int l, int r, int ql, int qr, int k, ll val){
  if(ql > r || l > qr) return;
  if(ql <= l && r <= qr){
    F[k] += (r-l+1)*val;
    fazy[k] += val;
    return;
  }
  int m = l+r>>1;
  push2(k, l, r, m);
  upd2(l, m, ql, qr, k<<1, val);
  upd2(m+1, r, ql, qr, k<<1|1, val);
  F[k] = F[k<<1] + F[k<<1|1];
}

ll get(int l, int r, int ql, int qr, int k){
  if(ql > r || l > qr) return 0;
  if(ql <= l && r <= qr) return T[k];
  int m = l+r>>1;
  push(k, l, r, m);
  return get(l, m, ql, qr, k<<1) + get(m+1, r, ql, qr, k<<1|1);
}
ll get2(int l, int r, int ql, int qr, int k){
  if(ql > r || l > qr) return 0;
  if(ql <= l && r <= qr) return F[k];
  int m = l+r>>1;
  push2(k, l, r, m);
  return get2(l, m, ql, qr, k<<1) + get2(m+1, r, ql, qr, k<<1|1);
}

void add_triangle(int posd, int posv, ll val){
  upd(1, 2*n, posd, 2*n, 1, val);
  if(posv < n) 
    upd2(1, n, posv + 1, n, 1, -val);
}
void add_parallelogram(int t, int x, int t2, ll val){
  UPD[t].pb({n-t+x, x, val});
  if(t2 >= 0){
    UPD[t2].pb({n-t2+x, x, -val});
    if(t-t2-1 >= 0)
      UPD[t-t2-1].pb({n-t+x, x-t2-1, -val});//
  }
}

void solve(){
  cin >> n >> q;
  for(int i = 1; i <= n; ++i) cin >> a[i];
  vector<int> qq;  
  qq.pb(n);
  L[n] = n + 1;
  for(int i = n-1; i >= 1; --i){
    while(!qq.empty() && a[qq.back()] < a[i]) qq.pop_back();
    if(qq.empty()) L[i] = n + 1;
    else L[i] = qq.back();
    qq.pb(i);
  }
  qq.clear();
  qq.pb(1);
  R[1] = 0;
  for(int i = 2; i <= n; ++i){
    while(!qq.empty() && a[qq.back()] < a[i]) qq.pop_back();
    if(qq.empty()) R[i] = 0;
    else R[i] = qq.back();
    qq.pb(i);
  }

  for(int i = 0; i < q; ++i){
    int t, l, r; cin >> t >> l >> r;
    Q[t].pb({l, r, i});
    ans[i] = 0;
  }
  build(1, 2*n, 1);

  for(int i = 1; i <= n; ++i){
    // cout << L[i] << ' ' << R[i] << '\n';
    if(R[i] > 0){
      int t = L[i]-1-i+i-R[i]-1, x = L[i] - 1;
      UPD[t].pb({n-t+x, x, a[i]}); 
      if(i-R[i]-2 >= 1)
        UPD[i-R[i]-2].pb({n-(i-R[i]-2)+i-1, i-1, -a[i]}); 
      if(L[i]-i-2 >= 1)
        UPD[L[i] - i - 2].pb({n-(L[i] - i - 2)+x, x, -a[i]}); 
    }else{
      upd2(1, n, i, L[i]-1, 1, a[i]);
      if(i < n && L[i]-i-2 >= 1)
        UPD[L[i]-i-2].pb({n-(L[i]-i-2)+L[i]-1, L[i]-1, -a[i]});
      // cout << i+n+1 << '\n';
    }
  }

  for(int i = n; i >= 1; --i){
    for(auto k: UPD[i]){
      add_triangle(k[0], k[1], k[2]);
      // cout << k[0] << ' ' << k[1] << ' ' << k[2] <<"triangle\n";
    }
    // cout << i << "\n";
    for(auto qq: Q[i]){
      // cout << qq[0] << ' ' << qq[1] << ' ' << n-i+qq[0] << ' ' << n-i+qq[1] << '\n';
      ans[qq[2]] = get(1, 2*n, n-i+qq[0], n-i+qq[1], 1) + get2(1, n, qq[0], qq[1], 1);
    }
  }


  for(int i = 0 ; i < q; ++i) cout << ans[i] << '\n';
}



int main(){
  cin.tie(0); ios::sync_with_stdio(0);
  int tt = 1, aa;
  // freopen("in.txt", "r", stdin);
  // freopen("out.txt", "w", stdout);
  while(tt--){
    solve();
    en;
  }
  cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" seconds\n";
  return 0;
}

Compilation message

ho_t5.cpp: In function 'void build(int, int, int)':
ho_t5.cpp:24:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   24 |   int m = l+r>>1;
      |           ~^~
ho_t5.cpp: In function 'void upd(int, int, int, int, int, long long int)':
ho_t5.cpp:52:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   52 |   int m = l+r>>1;
      |           ~^~
ho_t5.cpp: In function 'void upd2(int, int, int, int, int, long long int)':
ho_t5.cpp:65:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   65 |   int m = l+r>>1;
      |           ~^~
ho_t5.cpp: In function 'long long int get(int, int, int, int, int)':
ho_t5.cpp:75:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   75 |   int m = l+r>>1;
      |           ~^~
ho_t5.cpp: In function 'long long int get2(int, int, int, int, int)':
ho_t5.cpp:82:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   82 |   int m = l+r>>1;
      |           ~^~
ho_t5.cpp: In function 'int main()':
ho_t5.cpp:167:15: warning: unused variable 'aa' [-Wunused-variable]
  167 |   int tt = 1, aa;
      |               ^~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 62044 KB Output is correct
2 Correct 17 ms 62044 KB Output is correct
3 Correct 17 ms 62124 KB Output is correct
4 Correct 17 ms 62044 KB Output is correct
5 Correct 17 ms 62044 KB Output is correct
6 Correct 17 ms 62044 KB Output is correct
7 Correct 18 ms 62196 KB Output is correct
8 Correct 17 ms 62044 KB Output is correct
9 Correct 17 ms 62176 KB Output is correct
10 Correct 18 ms 62044 KB Output is correct
11 Correct 17 ms 62296 KB Output is correct
12 Correct 18 ms 62164 KB Output is correct
13 Correct 18 ms 62300 KB Output is correct
14 Correct 18 ms 62148 KB Output is correct
15 Correct 17 ms 62176 KB Output is correct
16 Correct 18 ms 62044 KB Output is correct
17 Correct 18 ms 62132 KB Output is correct
18 Correct 18 ms 62044 KB Output is correct
19 Correct 17 ms 62188 KB Output is correct
20 Correct 17 ms 62044 KB Output is correct
21 Correct 17 ms 62044 KB Output is correct
22 Correct 18 ms 62188 KB Output is correct
23 Correct 17 ms 62044 KB Output is correct
24 Correct 17 ms 62196 KB Output is correct
25 Correct 18 ms 62044 KB Output is correct
26 Correct 17 ms 62044 KB Output is correct
27 Correct 17 ms 62044 KB Output is correct
28 Correct 17 ms 62044 KB Output is correct
29 Correct 17 ms 62044 KB Output is correct
30 Correct 18 ms 62044 KB Output is correct
31 Correct 19 ms 62300 KB Output is correct
32 Correct 17 ms 62044 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 62044 KB Output is correct
2 Incorrect 384 ms 111696 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 62044 KB Output is correct
2 Incorrect 377 ms 111832 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 391 ms 107184 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 62044 KB Output is correct
2 Correct 17 ms 62044 KB Output is correct
3 Correct 17 ms 62124 KB Output is correct
4 Correct 17 ms 62044 KB Output is correct
5 Correct 17 ms 62044 KB Output is correct
6 Correct 17 ms 62044 KB Output is correct
7 Correct 18 ms 62196 KB Output is correct
8 Correct 17 ms 62044 KB Output is correct
9 Correct 17 ms 62176 KB Output is correct
10 Correct 18 ms 62044 KB Output is correct
11 Correct 17 ms 62296 KB Output is correct
12 Correct 18 ms 62164 KB Output is correct
13 Correct 18 ms 62300 KB Output is correct
14 Correct 18 ms 62148 KB Output is correct
15 Correct 17 ms 62176 KB Output is correct
16 Correct 18 ms 62044 KB Output is correct
17 Correct 18 ms 62132 KB Output is correct
18 Correct 18 ms 62044 KB Output is correct
19 Correct 17 ms 62188 KB Output is correct
20 Correct 17 ms 62044 KB Output is correct
21 Correct 17 ms 62044 KB Output is correct
22 Correct 18 ms 62188 KB Output is correct
23 Correct 17 ms 62044 KB Output is correct
24 Correct 17 ms 62196 KB Output is correct
25 Correct 18 ms 62044 KB Output is correct
26 Correct 17 ms 62044 KB Output is correct
27 Correct 17 ms 62044 KB Output is correct
28 Correct 17 ms 62044 KB Output is correct
29 Correct 17 ms 62044 KB Output is correct
30 Correct 18 ms 62044 KB Output is correct
31 Correct 19 ms 62300 KB Output is correct
32 Correct 17 ms 62044 KB Output is correct
33 Incorrect 384 ms 111696 KB Output isn't correct
34 Halted 0 ms 0 KB -