結果

問題 No.2242 Cities and Teleporters
ユーザー sten_sansten_san
提出日時 2023-03-11 03:09:10
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 730 ms / 3,000 ms
コード長 4,055 bytes
コンパイル時間 2,253 ms
コンパイル使用メモリ 212,800 KB
実行使用メモリ 30,736 KB
最終ジャッジ日時 2024-09-18 06:08:40
合計ジャッジ時間 16,492 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 3 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 3 ms
5,376 KB
testcase_05 AC 596 ms
30,476 KB
testcase_06 AC 574 ms
30,608 KB
testcase_07 AC 609 ms
30,476 KB
testcase_08 AC 730 ms
30,608 KB
testcase_09 AC 583 ms
30,608 KB
testcase_10 AC 454 ms
30,608 KB
testcase_11 AC 509 ms
30,604 KB
testcase_12 AC 508 ms
30,480 KB
testcase_13 AC 549 ms
30,608 KB
testcase_14 AC 577 ms
30,608 KB
testcase_15 AC 549 ms
30,476 KB
testcase_16 AC 622 ms
30,480 KB
testcase_17 AC 703 ms
30,608 KB
testcase_18 AC 446 ms
30,316 KB
testcase_19 AC 450 ms
30,052 KB
testcase_20 AC 519 ms
29,348 KB
testcase_21 AC 509 ms
29,484 KB
testcase_22 AC 425 ms
29,476 KB
testcase_23 AC 465 ms
30,736 KB
testcase_24 AC 495 ms
30,608 KB
testcase_25 AC 447 ms
30,608 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return vector(arg, init);
    else return vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename Container>
auto distance(const Container &c, decltype(begin(c)) iter) {
    return distance(begin(c), iter);
}

template <typename RIter, typename Compare = less<typename iterator_traits<RIter>::value_type>>
auto isort(RIter first, RIter last, Compare comp = Compare()) {
    vector<int> i(distance(first, last));
    iota(begin(i), end(i), 0);
    sort(begin(i), end(i), [&](auto x, auto y) {
        return comp(*(first + x), *(first + y));
    });
    return i;
}

template <typename, template <typename> typename, typename = void_t<>>
struct detect : false_type {};
template <typename T, template <typename> typename Check>
struct detect<T, Check, void_t<Check<T>>> : true_type {};
template <typename T, template <typename> typename Check>
constexpr inline bool detect_v = detect<T, Check>::value;

template <typename T>
using has_member_sort = decltype(declval<T>().sort());

template <typename Container, typename Compare = less<typename Container::value_type>>
auto sorted(Container c, Compare comp = Compare()) {
    if constexpr (detect_v<Container, has_member_sort>) {
        c.sort(comp);
        return c;
    }
    else {
        sort(begin(c), end(c), comp);
        return c;
    }
}

template <typename Container, typename Compare = equal_to<typename Container::value_type>>
auto uniqued(Container c, Compare comp = Compare()) {
    c.erase(unique(begin(c), end(c), comp), end(c));
    return c;
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

template <typename F>
constexpr auto fix(F &&f) noexcept {
    return [f = std::tuple<F>(std::forward<F>(f))](auto &&...args) mutable {
        return std::get<0>(f)(fix(std::get<0>(f)), std::forward<decltype(args)>(args)...);
    };
}

int main() {
    constexpr auto log2 = 30;

    int n; cin >> n;
    auto h = vec<int>(uns, n);
    auto t = vec<int>(uns, n);
    for (auto &e : h) cin >> e;
    for (auto &e : t) cin >> e;

    auto idx = vec<int>(uns, n);
    iota(begin(idx), end(idx), 0);
    sort(begin(idx), end(idx), [&](int i, int j) {
        return h[i] < h[j];
    });

    [&]() {
        auto _ = h; sort(begin(_), end(_));
        for (auto &e : t) {
            e = distance(_, upper_bound(begin(_), end(_), e));
        }
    }();

    auto dub = [&]() {
        auto dub = vec<int>(uns, log2 + 1, n);

        int max = 0;
        for (int i = 0; i < n; ++i) {
            chmax(max, t[idx[i]] - 1);
            dub[0][i] = max;
        }

        for (int i = 1; i <= log2; ++i) {
            for (int j = 0; j < n; ++j) {
                dub[i][j] = dub[i - 1][dub[i - 1][j]];
            }
        }

        return dub;
    }();

    int q; cin >> q;
    while (q--) {
        int a, b; cin >> a >> b; --a; --b;

        int s = t[a] - 1;

        int p = distance(idx, upper_bound(begin(idx), end(idx), h[b], [&](auto l, auto r) {
            return l < h[r];
        })) - 1;

        if (p <= s) {
            cout << 1 << endl;
            continue;
        }

        if (dub[log2][s] < p) {
            cout << -1 << endl;
            continue;
        }

        int ans = 1;
        for (int i = log2; 0 <= i; --i) {
            if (dub[i][s] < p) {
                ans += (1 << i);
                s = dub[i][s];
            }
        }

        cout << ans + 1 << endl;
    }
}
0