結果

問題 No.2242 Cities and Teleporters
ユーザー stoqstoq
提出日時 2023-03-10 23:00:26
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,512 ms / 3,000 ms
コード長 6,704 bytes
コンパイル時間 6,881 ms
コンパイル使用メモリ 285,520 KB
実行使用メモリ 62,860 KB
最終ジャッジ日時 2023-10-18 08:43:41
合計ジャッジ時間 31,758 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4 ms
4,528 KB
testcase_01 AC 4 ms
4,528 KB
testcase_02 AC 5 ms
4,528 KB
testcase_03 AC 5 ms
4,528 KB
testcase_04 AC 5 ms
4,528 KB
testcase_05 AC 1,231 ms
36,988 KB
testcase_06 AC 1,054 ms
36,988 KB
testcase_07 AC 1,212 ms
36,988 KB
testcase_08 AC 1,390 ms
36,988 KB
testcase_09 AC 876 ms
36,988 KB
testcase_10 AC 698 ms
62,860 KB
testcase_11 AC 927 ms
62,860 KB
testcase_12 AC 918 ms
62,860 KB
testcase_13 AC 1,021 ms
62,860 KB
testcase_14 AC 1,451 ms
62,860 KB
testcase_15 AC 1,113 ms
62,860 KB
testcase_16 AC 1,066 ms
62,860 KB
testcase_17 AC 1,512 ms
62,860 KB
testcase_18 AC 955 ms
62,068 KB
testcase_19 AC 987 ms
61,804 KB
testcase_20 AC 954 ms
60,288 KB
testcase_21 AC 853 ms
60,552 KB
testcase_22 AC 921 ms
60,288 KB
testcase_23 AC 986 ms
62,860 KB
testcase_24 AC 1,006 ms
62,860 KB
testcase_25 AC 989 ms
62,860 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define MOD_TYPE 2

#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
// #include <atcoder/lazysegtree>
// #include <atcoder/modint>
//  #include <atcoder/segtree>
using namespace atcoder;
#if 0
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif
#if 0
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
template <typename T>
using extset =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#endif
#if 1
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#pragma region Macros
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;
#if MOD_TYPE == 1
constexpr ll MOD = ll(1e9 + 7);
#else
#if MOD_TYPE == 2
constexpr ll MOD = 998244353;
#else
constexpr ll MOD = 1000003;
#endif
#endif
using mint = static_modint<MOD>;
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
const double PI = acos(-1.0);
constexpr ld EPS = 1e-10;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};
#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define RREP(i, m, n) for (ll i = n - 1; i >= m; i--)
#define rrep(i, n) RREP(i, 0, n)
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";
#define UNIQUE(v) v.erase(unique(all(v)), v.end())
struct io_init {
  io_init() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << setprecision(30) << setiosflags(ios::fixed);
  };
} io_init;
template <typename T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
inline ll floor(ll a, ll b) {
  if (b < 0) a *= -1, b *= -1;
  if (a >= 0) return a / b;
  return -((-a + b - 1) / b);
}
inline ll ceil(ll a, ll b) { return floor(a + b - 1, b); }
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val) {
  fill((T *)array, (T *)(array + N), val);
}
template <typename T>
vector<T> compress(vector<T> &v) {
  vector<T> val = v;
  sort(all(val)), val.erase(unique(all(val)), val.end());
  for (auto &&vi : v) vi = lower_bound(all(val), vi) - val.begin();
  return val;
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept {
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> p) noexcept {
  os << p.first << " " << p.second;
  return os;
}
ostream &operator<<(ostream &os, mint m) {
  os << m.val();
  return os;
}
ostream &operator<<(ostream &os, modint m) {
  os << m.val();
  return os;
}
template <typename T>
constexpr istream &operator>>(istream &is, vector<T> &v) noexcept {
  for (int i = 0; i < v.size(); i++) is >> v[i];
  return is;
}
template <typename T>
constexpr ostream &operator<<(ostream &os, vector<T> &v) noexcept {
  for (int i = 0; i < v.size(); i++)
    os << v[i] << (i + 1 == v.size() ? "" : " ");
  return os;
}
template <typename T>
constexpr void operator--(vector<T> &v, int) noexcept {
  for (int i = 0; i < v.size(); i++) v[i]--;
}
random_device seed_gen;
mt19937_64 engine(seed_gen());
inline ll randInt(ll l, ll r) { return engine() % (r - l + 1) + l; }
struct BiCoef {
  vector<mint> fact_, inv_, finv_;
  BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
    fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
    for (int i = 2; i < n; i++) {
      fact_[i] = fact_[i - 1] * i;
      inv_[i] = -inv_[MOD % i] * (MOD / i);
      finv_[i] = finv_[i - 1] * inv_[i];
    }
  }
  mint C(ll n, ll k) const noexcept {
    if (n < k || n < 0 || k < 0) return 0;
    return fact_[n] * finv_[k] * finv_[n - k];
  }
  mint P(ll n, ll k) const noexcept { return C(n, k) * fact_[k]; }
  mint H(ll n, ll k) const noexcept { return C(n + k - 1, k); }
  mint Ch1(ll n, ll k) const noexcept {
    if (n < 0 || k < 0) return 0;
    mint res = 0;
    for (int i = 0; i < n; i++)
      res += C(n, i) * mint(n - i).pow(k) * (i & 1 ? -1 : 1);
    return res;
  }
  mint fact(ll n) const noexcept {
    if (n < 0) return 0;
    return fact_[n];
  }
  mint inv(ll n) const noexcept {
    if (n < 0) return 0;
    return inv_[n];
  }
  mint finv(ll n) const noexcept {
    if (n < 0) return 0;
    return finv_[n];
  }
};
BiCoef bc(100010);
#pragma endregion

// -------------------------------

using S = int;
S op(S a, S b) { return max(a, b); }
S e() { return -1; }

vector<int> h, t;

void solve() {
  int n;
  cin >> n;
  vector<array<int, 3>> ht(n);
  map<int, int> mp;
  rep(i, n) {
    cin >> ht[i][0];
    mp[ht[i][0]] = 0;
  }
  rep(i, n) {
    cin >> ht[i][1];
    mp[ht[i][1]] = 0;
  }
  rep(i, n) ht[i][2] = i;
  sort(all(ht));
  int z = 0;
  for (auto &&[k, v] : mp) v = z++;
  vector<int> h(n), t(n), pos(n);
  rep(i, n) {
    h[i] = mp[ht[i][0]];
    t[i] = mp[ht[i][1]];
    pos[ht[i][2]] = i;
  }

  segtree<S, op, e> seg(t);
  // [0,r) からの行き先
  vector<int> to(z + 1);
  repi(r, z + 1) {
    // r 未満の要素の区間
    auto itr = lower_bound(all(h), r);
    int R = itr - h.begin();
    int Max = seg.prod(0, R);
    to[r] = Max + 1;
    chmax(to[r], r);
  }
  vector<int> db[20];
  db[0] = to;
  rep(k, 19) {
    db[k + 1].resize(to.size());
    rep(i, z + 1) { db[k + 1][i] = db[k][db[k][i]]; }
  }

  int q;
  cin >> q;
  rep(_, q) {
    int a, b;
    cin >> a >> b;
    a--, b--;
    a = pos[a];
    b = pos[b];
    int s = t[a] + 1, g = h[b] + 1;

    auto simulate = [&](int cnt) {
      int cur = s;
      rep(k, 20) {
        if (cnt & (1 << k)) {
          cur = db[k][cur];
        }
      }
      return cur >= g;
    };

    int lo = -1, hi = 200010;
    while (hi - lo > 1) {
      int mi = (lo + hi) / 2;
      if (simulate(mi))
        hi = mi;
      else
        lo = mi;
    }

    int ans = (hi == 200010 ? -1 : hi + 1);
    cout << ans << "\n";
  }
}

int main() { solve(); }
0