oj.uz

Submission #914008

# Submission time Handle Problem Language Result Execution time Memory
914008 2024-01-20T18:32:52 Z cig32 Railway Trip 2 (JOI22_ho_t4) C++17
79 / 100
 915 ms 73168 KB 
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define double long double
const int MAXN = 2e5 + 10;
const int MOD = 1e9 + 7;
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
int bm(int b, int p) {
  if(p==0) return 1 % MOD;
  int r = bm(b, p >> 1);
  if(p&1) return (((r*r) % MOD) * b) % MOD;
  return (r*r) % MOD;
}
int inv(int b) { 
  return bm(b, MOD-2);
}
int fastlog(int x) {
  return (x == 0 ? -1 : 64 - __builtin_clzll(x) - 1);
}
void printcase(int i) { cout << "Case #" << i << ": "; }
static void run_with_stack_size(void (*func)(void), size_t stsize) {
  char *stack, *send;
  stack = (char *)malloc(stsize);
  send = stack + stsize - 16;
  send = (char *)((uintptr_t)send / 16 * 16);
  asm volatile(
    "mov %%rsp, (%0)\n"
    "mov %0, %%rsp\n"
    :
    : "r"(send));
  func();
  asm volatile("mov (%0), %%rsp\n" : : "r"(send));
  free(stack);
}
struct segtree_basic {
  struct node {
    int lazyval, mi, ma, sum; char lazytag;
    int len; // not changing
  };
  int stok;
  vector<node> st;
  void bu(int l, int r, int idx) {
    st[idx].lazyval = st[idx].mi = st[idx].ma = st[idx].sum = 0;
    st[idx].lazytag = '?';
    st[idx].len = r - l + 1;
    if(l == r) {
      return;
    }
    int mid = (l + r) >> 1;
    bu(l, mid, 2*idx+1);
    bu(mid+1, r, 2*idx+2);
  }
  void push_down(int idx) {
    if(st[idx].lazytag == '?') return;
    if(st[idx].lazytag == ':') {
      st[2*idx+1].lazyval = st[idx].lazyval;
      st[2*idx+1].mi = st[idx].lazyval;
      st[2*idx+1].ma = st[idx].lazyval;
      st[2*idx+1].sum = st[idx].lazyval * st[2*idx+1].len;
      st[2*idx+1].lazytag = ':';
 
      st[2*idx+2].lazyval = st[idx].lazyval;
      st[2*idx+2].mi = st[idx].lazyval;
      st[2*idx+2].ma = st[idx].lazyval;
      st[2*idx+2].sum = st[idx].lazyval * st[2*idx+2].len;
      st[2*idx+2].lazytag = ':';
 
    }
    else {
      st[2*idx+1].lazyval += st[idx].lazyval;
      st[2*idx+1].mi += st[idx].lazyval;
      st[2*idx+1].ma += st[idx].lazyval;
      st[2*idx+1].sum += st[idx].lazyval * st[2*idx+1].len;
      st[2*idx+1].lazytag = (st[2*idx+1].lazytag == ':' ? ':' : '+');
 
      st[2*idx+2].lazyval += st[idx].lazyval;
      st[2*idx+2].mi += st[idx].lazyval;
      st[2*idx+2].ma += st[idx].lazyval;
      st[2*idx+2].sum += st[idx].lazyval * st[2*idx+2].len;
      st[2*idx+2].lazytag = (st[2*idx+2].lazytag == ':' ? ':' : '+');
    }
    st[idx].lazytag = '?';
    st[idx].lazyval = 0;
  }
  void push_up(int idx) {
    st[idx].mi = min(st[2*idx+1].mi, st[2*idx+2].mi);
    st[idx].ma = max(st[2*idx+1].ma, st[2*idx+2].ma);
    st[idx].sum = st[2*idx+1].sum + st[2*idx+2].sum;
  }
  void u1(int l, int r, int constl, int constr, int idx, int val) { // range := v
    if(l <= constl && constr <= r) {
      st[idx].lazyval = val;
      st[idx].mi = val;
      st[idx].ma = val;
      st[idx].sum = val * st[idx].len;
      st[idx].lazytag = ':';
      return;
    }
    int mid = (constl + constr) >> 1;
    push_down(idx);
    if(mid < l || r < constl) u1(l, r, mid+1, constr, 2*idx+2, val);
    else if(constr < l || r < mid + 1) u1(l, r, constl, mid, 2*idx+1, val);
    else {
      u1(l, r, constl, mid, 2*idx+1, val);
      u1(l, r, mid+1, constr, 2*idx+2, val);
    }
    push_up(idx);
  }
 
  void u2(int l, int r, int constl, int constr, int idx, int val) { // range += v
    if(l <= constl && constr <= r) {
      st[idx].lazyval += val;
      st[idx].mi += val;
      st[idx].ma += val;
      st[idx].sum += val * st[idx].len;
      st[idx].lazytag = (st[idx].lazytag == ':' ? ':' : '+');
      return;
    }
    int mid = (constl + constr) >> 1;
    push_down(idx);
    if(mid < l || r < constl) u2(l, r, mid+1, constr, 2*idx+2, val);
    else if(constr < l || r < mid + 1) u2(l, r, constl, mid, 2*idx+1, val);
    else {
      u2(l, r, constl, mid, 2*idx+1, val);
      u2(l, r, mid+1, constr, 2*idx+2, val);
    }
    push_up(idx);
  }
 
  int qu1(int l, int r, int constl, int constr, int idx) { // range min
    if(l <= constl && constr <= r) return st[idx].mi;
    int mid = (constl + constr) >> 1;
    push_down(idx);
    if(mid < l || r < constl) return qu1(l, r, mid+1, constr, 2*idx+2);
    else if(constr < l || r < mid + 1) return qu1(l, r, constl, mid, 2*idx+1);
    else {
      return min(qu1(l, r, constl, mid, 2*idx+1), qu1(l, r, mid+1, constr, 2*idx+2));
    }
  }
 
  int qu2(int l, int r, int constl, int constr, int idx) { // range max
    if(l <= constl && constr <= r) return st[idx].ma;
    int mid = (constl + constr) >> 1;
    push_down(idx);
    if(mid < l || r < constl) return qu2(l, r, mid+1, constr, 2*idx+2); 
    else if(constr < l || r < mid + 1) return qu2(l, r, constl, mid, 2*idx+1);
    else {
      return max(qu2(l, r, constl, mid, 2*idx+1), qu2(l, r, mid+1, constr, 2*idx+2));
    }
  }
  int qu3(int l, int r, int constl, int constr, int idx) { // range sum
    if(l <= constl && constr <= r) return st[idx].sum;
    int mid = (constl + constr) >> 1;
    push_down(idx);
    if(mid < l || r < constl) return qu3(l, r, mid+1, constr, 2*idx+2);
    else if(constr < l || r < mid + 1) return qu3(l, r, constl, mid, 2*idx+1);
    else {
      return qu3(l, r, constl, mid, 2*idx+1) + qu3(l, r, mid+1, constr, 2*idx+2);
    }
  }
  int qu4(int l, int r, int constl, int constr, int idx, int val) { // first at least v
    if(l <= constl && constr <= r) {
      if(st[idx].ma < val) return -1;
      while(constl < constr) {
        int mid = (constl + constr) >> 1;
        push_down(idx);
        if(st[2*idx+1].ma >= val) constr = mid, idx = 2*idx + 1;
        else constl = mid+1, idx = 2*idx + 2;
      }
      return constl;
    }
    int mid = (constl + constr) >> 1;
    push_down(idx);
    if(mid < l || r < constl) return qu4(l, r, mid+1, constr, 2*idx+2, val);
    else if(constr < l || r < mid + 1) return qu4(l, r, constl, mid, 2*idx+1, val);
    else {
      int lchild = qu4(l, r, constl, mid, 2*idx+1, val);
      if(lchild != -1) return lchild;
      return qu4(l, r, mid+1, constr, 2*idx+2, val);
    }
  }
  int qu5(int l, int r, int constl, int constr, int idx, int val) { // first at most v
    if(l <= constl && constr <= r) {
      if(st[idx].mi > val) return -1;
      while(constl < constr) {
        int mid = (constl + constr) >> 1;
        push_down(idx);
        if(st[2*idx+1].mi <= val) constr = mid, idx = 2*idx + 1;
        else constl = mid+1, idx = 2*idx + 2;
      }
      return constl;
    }
    int mid = (constl + constr) >> 1;
    push_down(idx);
    if(mid < l || r < constl) return qu5(l, r, mid+1, constr, 2*idx+2, val);
    else if(constr < l || r < mid + 1) return qu5(l, r, constl, mid, 2*idx+1, val);
    else {
      int lchild = qu5(l, r, constl, mid, 2*idx+1, val);
      if(lchild != -1) return lchild;
      return qu5(l, r, mid+1, constr, 2*idx+2, val);
    }
  }
  int qu6(int l, int r, int constl, int constr, int idx, int val) { // last at least v
    if(l <= constl && constr <= r) {
      if(st[idx].ma < val) return -1;
      while(constl < constr) {
        int mid = (constl + constr) >> 1;
        push_down(idx);
        if(st[2*idx+2].ma >= val) constl = mid+1, idx = 2*idx + 2;
        else constr = mid, idx = 2*idx + 1;
      }
      return constl;
    }
    int mid = (constl + constr) >> 1;
    push_down(idx);
    if(mid < l || r < constl) return qu6(l, r, mid+1, constr, 2*idx+2, val);
    else if(constr < l || r < mid + 1) return qu6(l, r, constl, mid, 2*idx+1, val);
    else {
      int rchild = qu6(l, r, mid+1, constr, 2*idx+2, val);
      if(rchild != -1) return rchild;
      return qu6(l, r, constl, mid, 2*idx+1, val);
    }
  }
  int qu7(int l, int r, int constl, int constr, int idx, int val) { // last at most v
    if(l <= constl && constr <= r) {
      if(st[idx].mi > val) return -1;
      while(constl < constr) {
        int mid = (constl + constr) >> 1;
        push_down(idx);
        if(st[2*idx+2].mi <= val) constl = mid+1, idx = 2*idx + 2;
        else constr = mid, idx = 2*idx + 1;
      }
      return constl;
    }
    int mid = (constl + constr) >> 1;
    push_down(idx);
    if(mid < l || r < constl) return qu7(l, r, mid+1, constr, 2*idx+2, val);
    else if(constr < l || r < mid + 1) return qu7(l, r, constl, mid, 2*idx+1, val);
    else {
      int rchild = qu7(l, r, mid+1, constr, 2*idx+2, val);
      if(rchild != -1) return rchild;
      return qu7(l, r, constl, mid, 2*idx+1, val);
    }
  }
  public:
  void resize(int k) {
    st.resize(4*k + 10);
    stok = k;
    bu(0, k, 0);
  }
  void range_assign(int l, int r, int v) { u1(l, r, 0, stok, 0, v); }
 
  void range_add(int l, int r, int v) { u2(l, r, 0, stok, 0, v); }
 
  int query_min(int l, int r) { return qu1(l, r, 0, stok, 0); }
 
  int query_max(int l, int r) { return qu2(l, r, 0, stok, 0); }
 
  int query_sum(int l, int r) { return qu3(l, r, 0, stok, 0); }
 
  int query_firstAtLeast(int l, int r, int v) { return qu4(l, r, 0, stok, 0, v); }
 
  int query_firstAtMost(int l, int r, int v) { return qu5(l, r, 0, stok, 0, v); }
 
  int query_lastAtLeast(int l, int r, int v) { return qu6(l, r, 0, stok, 0, v); } 
 
  int query_lastAtMost(int l, int r, int v) { return qu7(l, r, 0, stok, 0, v); }
};
bool cmp(pair<int, int> x, pair<int, int> y) {
  return x.second < y.second;
}
void solve(int tc) {
  int n, k, m;
  cin >> n >> k >> m;
  if(n <= 300 && m <= 300) {
    int dist[n+1][n+1];
  for(int i=1; i<=n; i++) {
    for(int j=1; j<=n; j++) {
      dist[i][j] = (i == j ? 0 : 1e9);
    }
  }
  for(int i=1; i<=m; i++) {
    int a, b;
    cin >> a >> b;
    if(a < b) {
      for(int j=a; j<a+k; j++) {
        for(int l=j+1; l<=b; l++) {
          dist[j][l] = 1;
        }
      }
    }
    else {
      for(int j=a; j>a-k; j--) {
        for(int l=j-1; l>=b; l--) {
          dist[j][l] = 1;
        }
      }
    }
  }
  for(int l=1; l<=n; l++) {
    for(int i=1; i<=n; i++) {
      for(int j=1; j<=n; j++) {
        dist[i][j] = min(dist[i][j], dist[i][l]+dist[l][j]);
      }
    }
  }
  int q;
  cin >> q;
  while(q--) {
    int s, t;
    cin >> s >> t;
    cout << (dist[s][t] >= 1e7 ? -1 : dist[s][t]) << '\n';
  }
    return;
  }
  segtree_basic M, P;
  M.resize(n);
  P.resize(n);
  for(int i=1; i<=n; i++) {
    M.range_add(i, i, i);
    P.range_add(i, i, i);
  }
  vector<pair<int, int>> updates;
  for(int i=1; i<=m; i++) {
    int a, b;
    cin >> a >> b;
    updates.push_back({a, b});
  }
  sort(updates.begin(), updates.end(), cmp);
  for(pair<int, int> x: updates) {
    int a = x.first, b = x.second;
    if(a > b) continue;
    int l = a, r = min(b, a + k - 1);
    M.range_assign(l, r, b);
  }
  reverse(updates.begin(), updates.end());
  for(pair<int, int> x: updates) {
    int a = x.first, b = x.second;
    if(a < b) continue;
    int l = max(b, a - k + 1), r = a;
    P.range_assign(l, r, b);
  }
  pair<int, int> st[18][n+1];
  for(int i=1; i<=n; i++) {
    int v = M.query_sum(i, i);
    int mx = M.query_max(i, v);
    int idx = M.query_lastAtLeast(i, v, mx);
    st[0][i].second = idx;
    v = P.query_sum(i, i);
    int mn = P.query_min(v, i);
    idx = P.query_firstAtMost(v, i, mn);
    st[0][i].first = idx;
  }
  for(int i=1; i<18; i++) {
    for(int j=1; j<=n; j++) {
      pair<int, int> bruh = st[i-1][j];
      int id1 = bruh.first;
      int id2 = bruh.second;
      int l = min(st[i-1][id1].first, st[i-1][id2].first);
      int r = max(st[i-1][id1].second, st[i-1][id2].second);
      st[i][j] = {l, r};
    }
  }
  int q;
  cin >> q;
  while(q--) {
    int s, t;
    cin >> s >> t;
    if((M.query_max(s, s) >= t && s < t) || (P.query_min(s, s) <= t && s > t)) {
      cout << "1\n"; continue;
    }
    int l = s, r = s, S = 0;
    for(int i=17; i>=0; i--) {
      int getl = P.query_min(min(st[i][l].first, st[i][r].first), max(st[i][l].second, st[i][r].second));
      int getr = M.query_max(min(st[i][l].first, st[i][r].first), max(st[i][l].second, st[i][r].second));
      if((s < t && getr < t) || (s > t && getl > t)) {
        S += (1 << i);
        int m1 = min(st[i][l].first, st[i][r].first);
        int m2 = max(st[i][l].second, st[i][r].second);
        l = m1;
        r = m2;
      }
    }
    S++;
    int m1 = min(st[0][l].first, st[0][r].first);
    int m2 = max(st[0][l].second, st[0][r].second);
    l = m1;
    r = m2;
    int getr = M.query_max(l, r);
    int getl = P.query_min(l, r);
    if((s < t && getr < t) || (s > t && getl > t)) S = 1e9;
    cout << (S >= 1e7 ? -1 : S + 1) << '\n';
  }
}
void uwu() {
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
}
int32_t main() {
  #ifdef ONLINE_JUDGE
  uwu();
  #endif
  #ifndef ONLINE_JUDGE
  run_with_stack_size(uwu, 1024 * 1024 * 1024); // run with a 1 GiB stack
  #endif
}
/*
g++ A.cpp -std=c++17 -O2 -o A
./A < input.txt
*/

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 3164 KB Output is correct
2 Correct 22 ms 1116 KB Output is correct
3 Correct 22 ms 2392 KB Output is correct
4 Correct 23 ms 1116 KB Output is correct
5 Correct 25 ms 1112 KB Output is correct
6 Correct 26 ms 1116 KB Output is correct
7 Correct 25 ms 1112 KB Output is correct
8 Correct 23 ms 1116 KB Output is correct
9 Correct 25 ms 1112 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 22 ms 1116 KB Output is correct
12 Correct 22 ms 1116 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 3164 KB Output is correct
2 Correct 22 ms 1116 KB Output is correct
3 Correct 22 ms 2392 KB Output is correct
4 Correct 23 ms 1116 KB Output is correct
5 Correct 25 ms 1112 KB Output is correct
6 Correct 26 ms 1116 KB Output is correct
7 Correct 25 ms 1112 KB Output is correct
8 Correct 23 ms 1116 KB Output is correct
9 Correct 25 ms 1112 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 22 ms 1116 KB Output is correct
12 Correct 22 ms 1116 KB Output is correct
13 Incorrect 12 ms 1880 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 149 ms 68044 KB Output is correct
2 Correct 148 ms 68352 KB Output is correct
3 Correct 161 ms 68812 KB Output is correct
4 Correct 165 ms 69576 KB Output is correct
5 Correct 290 ms 72536 KB Output is correct
6 Correct 191 ms 72504 KB Output is correct
7 Correct 295 ms 72640 KB Output is correct
8 Correct 210 ms 68552 KB Output is correct
9 Correct 204 ms 70324 KB Output is correct
10 Correct 211 ms 72476 KB Output is correct
11 Correct 208 ms 72660 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 434 ms 67948 KB Output is correct
2 Correct 596 ms 71924 KB Output is correct
3 Correct 824 ms 70364 KB Output is correct
4 Correct 260 ms 71756 KB Output is correct
5 Correct 286 ms 72204 KB Output is correct
6 Correct 287 ms 71704 KB Output is correct
7 Correct 594 ms 73168 KB Output is correct
8 Correct 717 ms 71884 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 533 ms 71560 KB Output is correct
2 Correct 915 ms 68256 KB Output is correct
3 Correct 881 ms 70416 KB Output is correct
4 Correct 749 ms 67784 KB Output is correct
5 Correct 632 ms 67156 KB Output is correct
6 Correct 556 ms 67840 KB Output is correct
7 Correct 212 ms 69060 KB Output is correct
8 Correct 23 ms 2652 KB Output is correct
9 Correct 6 ms 1848 KB Output is correct
10 Correct 262 ms 71360 KB Output is correct
11 Correct 306 ms 71232 KB Output is correct
12 Correct 283 ms 72124 KB Output is correct
13 Correct 287 ms 71292 KB Output is correct
14 Correct 25 ms 1116 KB Output is correct
15 Correct 12 ms 1884 KB Output is correct
16 Correct 203 ms 71188 KB Output is correct
17 Correct 850 ms 72036 KB Output is correct
18 Correct 713 ms 72972 KB Output is correct
19 Correct 668 ms 73092 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 3164 KB Output is correct
2 Correct 22 ms 1116 KB Output is correct
3 Correct 22 ms 2392 KB Output is correct
4 Correct 23 ms 1116 KB Output is correct
5 Correct 25 ms 1112 KB Output is correct
6 Correct 26 ms 1116 KB Output is correct
7 Correct 25 ms 1112 KB Output is correct
8 Correct 23 ms 1116 KB Output is correct
9 Correct 25 ms 1112 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 22 ms 1116 KB Output is correct
12 Correct 22 ms 1116 KB Output is correct
13 Incorrect 12 ms 1880 KB Output isn't correct
14 Halted 0 ms 0 KB -