oj.uz

Submission #880420

# Submission time Handle Problem Language Result Execution time Memory
880420 2023-11-29T11:58:02 Z mychecksedad Railway Trip 2 (JOI22_ho_t4) C++17
62 / 100
 2000 ms 110388 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 = 4e5+100, M = 1e5+10, K = 20;

struct Data{
  int L, R;
};

int n, k, m, q, L[N][K], R[N][K], lazyL[N][K], lazyR[N][K];
Data up[N][K];

void build(int l, int r, int k, int bit){
  lazyL[k][bit] = MOD;
  lazyR[k][bit] = 0;
  if(l == r){
    L[k][bit] = l;
    R[k][bit] = l;
    return;
  }
  int mid = l+r>>1;
  build(l, mid, k<<1, bit);
  build(mid+1, r, k<<1|1, bit);
  L[k][bit] = min(L[k<<1][bit], L[k<<1|1][bit]);
  R[k][bit] = max(R[k<<1][bit], R[k<<1|1][bit]);
}
void build2(int l, int r, int k, int bit){
  lazyL[k][bit] = MOD;
  lazyR[k][bit] = 0;
  if(l == r){
    L[k][bit] = up[l][bit].L;
    R[k][bit] = up[l][bit].R;
    return;
  }
  int mid = l+r>>1;
  build2(l, mid, k<<1, bit);
  build2(mid+1, r, k<<1|1, bit);
  L[k][bit] = min(L[k<<1][bit], L[k<<1|1][bit]);
  R[k][bit] = max(R[k<<1][bit], R[k<<1|1][bit]);
}
void pushL(int k, int bit){
  L[k<<1][bit] = min(L[k<<1][bit], lazyL[k][bit]);
  L[k<<1|1][bit] = min(L[k<<1|1][bit], lazyL[k][bit]);
  lazyL[k<<1][bit] = min(lazyL[k<<1][bit], lazyL[k][bit]);
  lazyL[k<<1|1][bit] = min(lazyL[k<<1|1][bit], lazyL[k][bit]);
  lazyL[k][bit] = MOD;
}
void pushR(int k, int bit){
  R[k<<1][bit] = max(R[k<<1][bit], lazyR[k][bit]);
  R[k<<1|1][bit] = max(R[k<<1|1][bit], lazyR[k][bit]);
  lazyR[k<<1][bit] = max(lazyR[k<<1][bit], lazyR[k][bit]);
  lazyR[k<<1|1][bit] = max(lazyR[k<<1|1][bit], lazyR[k][bit]);
  lazyR[k][bit] = 0;
}

void updateL(int l, int r, int ql, int qr, int k, int bit, int val){
  if(ql > r || l > qr) return;
  if(ql <= l && r <= qr){
    lazyL[k][bit] = min(lazyL[k][bit], val);
    L[k][bit] = min(L[k][bit], val);
    return;
  }
  pushL(k, bit);
  int mid = l+r>>1;
  updateL(l, mid, ql, qr, k<<1, bit, val);
  updateL(mid+1, r, ql, qr, k<<1|1, bit, val);
  L[k][bit] = min(L[k<<1][bit], L[k<<1|1][bit]);
}
void updateR(int l, int r, int ql, int qr, int k, int bit, int val){
  if(ql > r || l > qr) return;
  if(ql <= l && r <= qr){
    lazyR[k][bit] = max(lazyR[k][bit], val);
    R[k][bit] = max(R[k][bit], val);
    return;
  }
  pushR(k, bit);
  int mid = l+r>>1;
  updateR(l, mid, ql, qr, k<<1, bit, val);
  updateR(mid+1, r, ql, qr, k<<1|1, bit, val);
  R[k][bit] = max(R[k<<1][bit], R[k<<1|1][bit]);
}

void updateLL(int l, int r, int p, int k, int bit, int val){
  if(l == r){
    L[k][bit] = min(L[k][bit], val);
    return;
  }
  pushL(k, bit);
  int mid = l+r>>1;
  if(p <= mid)
    updateLL(l, mid, p, k<<1, bit, val);
  else
    updateLL(mid+1, r, p, k<<1|1, bit, val);
  L[k][bit] = min(L[k<<1][bit], L[k<<1|1][bit]);
}
void updateRR(int l, int r, int p, int k, int bit, int val){
  if(l == r){
    R[k][bit] = max(R[k][bit], val);
    return;
  }
  pushR(k, bit);
  int mid = l+r>>1;
  if(p <= mid)
    updateRR(l, mid, p, k<<1, bit, val);
  else
    updateRR(mid+1, r, p, k<<1|1, bit, val);
  R[k][bit] = max(R[k<<1][bit], R[k<<1|1][bit]);
}



int getL(int l, int r, int ql, int qr, int k, int bit){
  if(ql > r || l > qr) return MOD;
  if(ql <= l && r <= qr) return L[k][bit];
  int mid = l+r>>1;
  pushL(k, bit);
  return min(getL(l, mid, ql, qr, k<<1, bit), getL(mid+1, r, ql, qr, k<<1|1, bit));
}
int getR(int l, int r, int ql, int qr, int k, int bit){
  if(ql > r || l > qr) return 0;
  if(ql <= l && r <= qr) return R[k][bit];
  int mid = l+r>>1;
  pushR(k, bit);
  return max(getR(l, mid, ql, qr, k<<1, bit), getR(mid+1, r, ql, qr, k<<1|1, bit));
}

void solve(){
  cin >> n >> k >> m;
  build(1, n, 1, 0);
  for(int i = 1; i <= m; ++i){
    int l, r; cin >> l >> r;
    if(l < r){
      int rk = min(r - 1, l + k - 1);
      updateR(1, n, l, rk, 1, 0, r);
      // cout << l << ' ' << rk << '\n';
    }else{
      int rk = max(r + 1, l - k + 1);
      updateL(1, n, rk, l, 1, 0, r);
      // cout << rk << ' ' << l << '\n';
    }
  }
  for(int i = 1; i <= n; ++i) up[i][0] = {getL(1, n, i, i, 1, 0), getR(1, n, i, i, 1, 0)};
  for(int j = 1; j < K; ++j){
    for(int i = 1; i <= n; ++i){
      up[i][j] = {getL(1, n, up[i][j - 1].L, up[i][j - 1].R, 1, j - 1), getR(1, n, up[i][j - 1].L, up[i][j - 1].R, 1, j - 1)};
    }
    build2(1, n, 1, j);
  }
  cin >> q;
  for(int i = 1; i <= q; ++i){
    int l, r; cin >> l >> r;
    Data x = {l, l};
    bool ok = 0;
    int ans = 0;
    for(int j = K - 1; j >= 0; --j){
      Data u = {getL(1, n, x.L, x.R, 1, j), getR(1, n, x.L, x.R, 1, j)};
      if(u.L <= r && u.R >= r){
        ok = 1;
      }else{
        x = u;
        ans += (1<<j);
      }
      // cout << x.L << ' ' << x.R << '\n';
    }
    if(!ok) cout << "-1\n";
    else{
      cout << ans + 1 << '\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

Main.cpp: In function 'void build(int, int, int, int)':
Main.cpp:27:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   27 |   int mid = l+r>>1;
      |             ~^~
Main.cpp: In function 'void build2(int, int, int, int)':
Main.cpp:41:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   41 |   int mid = l+r>>1;
      |             ~^~
Main.cpp: In function 'void updateL(int, int, int, int, int, int, int)':
Main.cpp:70:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   70 |   int mid = l+r>>1;
      |             ~^~
Main.cpp: In function 'void updateR(int, int, int, int, int, int, int)':
Main.cpp:83:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   83 |   int mid = l+r>>1;
      |             ~^~
Main.cpp: In function 'void updateLL(int, int, int, int, int, int)':
Main.cpp:95:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   95 |   int mid = l+r>>1;
      |             ~^~
Main.cpp: In function 'void updateRR(int, int, int, int, int, int)':
Main.cpp:108:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  108 |   int mid = l+r>>1;
      |             ~^~
Main.cpp: In function 'int getL(int, int, int, int, int, int)':
Main.cpp:121:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  121 |   int mid = l+r>>1;
      |             ~^~
Main.cpp: In function 'int getR(int, int, int, int, int, int)':
Main.cpp:128:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  128 |   int mid = l+r>>1;
      |             ~^~
Main.cpp: In function 'int main()':
Main.cpp:181:15: warning: unused variable 'aa' [-Wunused-variable]
  181 |   int tt = 1, aa;
      |               ^~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 10588 KB Output is correct
2 Correct 4 ms 10588 KB Output is correct
3 Correct 2 ms 10588 KB Output is correct
4 Correct 3 ms 10588 KB Output is correct
5 Correct 4 ms 10588 KB Output is correct
6 Correct 3 ms 10588 KB Output is correct
7 Correct 4 ms 10588 KB Output is correct
8 Correct 3 ms 10588 KB Output is correct
9 Correct 3 ms 10720 KB Output is correct
10 Correct 1 ms 8624 KB Output is correct
11 Correct 3 ms 10588 KB Output is correct
12 Correct 4 ms 10584 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 10588 KB Output is correct
2 Correct 4 ms 10588 KB Output is correct
3 Correct 2 ms 10588 KB Output is correct
4 Correct 3 ms 10588 KB Output is correct
5 Correct 4 ms 10588 KB Output is correct
6 Correct 3 ms 10588 KB Output is correct
7 Correct 4 ms 10588 KB Output is correct
8 Correct 3 ms 10588 KB Output is correct
9 Correct 3 ms 10720 KB Output is correct
10 Correct 1 ms 8624 KB Output is correct
11 Correct 3 ms 10588 KB Output is correct
12 Correct 4 ms 10584 KB Output is correct
13 Correct 26 ms 12892 KB Output is correct
14 Correct 21 ms 12948 KB Output is correct
15 Correct 15 ms 12892 KB Output is correct
16 Correct 13 ms 12892 KB Output is correct
17 Correct 23 ms 12952 KB Output is correct
18 Correct 12 ms 12892 KB Output is correct
19 Correct 19 ms 12772 KB Output is correct
20 Correct 13 ms 12888 KB Output is correct
21 Correct 4 ms 12892 KB Output is correct
22 Correct 20 ms 12892 KB Output is correct
23 Correct 21 ms 12892 KB Output is correct
24 Correct 25 ms 12948 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1529 ms 107320 KB Output is correct
2 Correct 1355 ms 108376 KB Output is correct
3 Correct 1533 ms 108500 KB Output is correct
4 Correct 1309 ms 108368 KB Output is correct
5 Correct 468 ms 109652 KB Output is correct
6 Correct 1279 ms 109620 KB Output is correct
7 Correct 343 ms 109128 KB Output is correct
8 Correct 297 ms 108480 KB Output is correct
9 Correct 322 ms 108480 KB Output is correct
10 Correct 1106 ms 109628 KB Output is correct
11 Correct 985 ms 109628 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1449 ms 107876 KB Output is correct
2 Correct 1357 ms 110124 KB Output is correct
3 Execution timed out 2041 ms 109228 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1384 ms 107372 KB Output is correct
2 Correct 1922 ms 107576 KB Output is correct
3 Correct 1952 ms 108968 KB Output is correct
4 Correct 1982 ms 108200 KB Output is correct
5 Correct 1648 ms 108088 KB Output is correct
6 Correct 1857 ms 107832 KB Output is correct
7 Correct 1253 ms 109220 KB Output is correct
8 Correct 4 ms 10588 KB Output is correct
9 Correct 20 ms 12892 KB Output is correct
10 Correct 1119 ms 109792 KB Output is correct
11 Correct 1333 ms 110364 KB Output is correct
12 Correct 1453 ms 110388 KB Output is correct
13 Correct 1335 ms 110160 KB Output is correct
14 Correct 4 ms 10840 KB Output is correct
15 Correct 29 ms 12888 KB Output is correct
16 Correct 1372 ms 109596 KB Output is correct
17 Correct 1852 ms 110360 KB Output is correct
18 Correct 1824 ms 110200 KB Output is correct
19 Correct 1808 ms 110120 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 10588 KB Output is correct
2 Correct 4 ms 10588 KB Output is correct
3 Correct 2 ms 10588 KB Output is correct
4 Correct 3 ms 10588 KB Output is correct
5 Correct 4 ms 10588 KB Output is correct
6 Correct 3 ms 10588 KB Output is correct
7 Correct 4 ms 10588 KB Output is correct
8 Correct 3 ms 10588 KB Output is correct
9 Correct 3 ms 10720 KB Output is correct
10 Correct 1 ms 8624 KB Output is correct
11 Correct 3 ms 10588 KB Output is correct
12 Correct 4 ms 10584 KB Output is correct
13 Correct 26 ms 12892 KB Output is correct
14 Correct 21 ms 12948 KB Output is correct
15 Correct 15 ms 12892 KB Output is correct
16 Correct 13 ms 12892 KB Output is correct
17 Correct 23 ms 12952 KB Output is correct
18 Correct 12 ms 12892 KB Output is correct
19 Correct 19 ms 12772 KB Output is correct
20 Correct 13 ms 12888 KB Output is correct
21 Correct 4 ms 12892 KB Output is correct
22 Correct 20 ms 12892 KB Output is correct
23 Correct 21 ms 12892 KB Output is correct
24 Correct 25 ms 12948 KB Output is correct
25 Correct 1529 ms 107320 KB Output is correct
26 Correct 1355 ms 108376 KB Output is correct
27 Correct 1533 ms 108500 KB Output is correct
28 Correct 1309 ms 108368 KB Output is correct
29 Correct 468 ms 109652 KB Output is correct
30 Correct 1279 ms 109620 KB Output is correct
31 Correct 343 ms 109128 KB Output is correct
32 Correct 297 ms 108480 KB Output is correct
33 Correct 322 ms 108480 KB Output is correct
34 Correct 1106 ms 109628 KB Output is correct
35 Correct 985 ms 109628 KB Output is correct
36 Correct 1449 ms 107876 KB Output is correct
37 Correct 1357 ms 110124 KB Output is correct
38 Execution timed out 2041 ms 109228 KB Time limit exceeded
39 Halted 0 ms 0 KB -