#848133 (C++17(gcc12)) No.2242 Cities and Teleporters

• 問題: No.2242 Cities and Teleporters
• ユーザー: nu50218
• 提出日時: 2023-03-10 23:20:31
• 言語: C++17(gcc12) (gcc 12.3.0 + boost 1.87.0)
• 結果: WA
• 実行時間: -
• コード長: 3,164 bytes
• コンパイル時間: 11,470 ms
• コンパイル使用メモリ: 291,412 KB
• 最終ジャッジ日時: 2025-02-11 09:18:01
• ジャッジサーバーID （参考情報）: judge1 / judge1

ファイルパターン	結果
other	AC * 19 WA * 7

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
#ifdef LOCAL
#include <local.hpp>
#else
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
#define debug(...) (static_cast<void>(0))
#define postprocess() (static_cast<void>(0))
#endif
// #include "atcoder/dsu.hpp"
// #include "atcoder/modint.hpp"
// using mint = atcoder::modint998244353;
// using mint = atcoder::modint1000000007;
using namespace std;
using ll = long long;
using ld = long double;
void solve([[maybe_unused]] int test) {
    int N;
    cin >> N;
    vector<pair<int, int>> _H(N);
    for (int i = 0; i < N; i++) {
        cin >> _H[i].first;
        _H[i].second = i;
    }
    sort(_H.begin(), _H.end());
    vector<int> index(N);
    for (int i = 0; i < N; i++) {
        index[_H[i].second] = i;
    }
    vector<int> H(N);
    for (int i = 0; i < N; i++) {
        H[i] = _H[i].first;
    }
    vector<int> T(N);
    for (int i = 0; i < N; i++) {
        cin >> T[index[i]];
    }
    vector<int> uniqueH;
    for (int i = 0; i < N; i++) {
        if (i == 0 || H[i] != H[i - 1]) {
            uniqueH.push_back(H[i]);
        }
    }
    vector<int> next_idx[20];
    for (int i = 0; i < 20; i++) {
        next_idx[i].resize(uniqueH.size());
        fill(next_idx[i].begin(), next_idx[i].end(), -1);
    }
    for (int i = 0; i < N; i++) {
        auto itr = upper_bound(uniqueH.begin(), uniqueH.end(), T[i]);
        if (itr == uniqueH.begin()) continue;
        itr--;
        int idx = itr - uniqueH.begin();
        int cur = lower_bound(uniqueH.begin(), uniqueH.end(), H[i]) - uniqueH.begin();
        next_idx[0][cur] = idx;
    }
    for (int i = 0; i + 1 < (int)uniqueH.size(); i++) {
        next_idx[0][i + 1] = max(next_idx[0][i + 1], next_idx[0][i]);
    }
    for (int i = 1; i < 20; i++) {
        for (int j = 0; j < (int)uniqueH.size(); j++) {
            if (next_idx[i - 1][j] != -1) {
                next_idx[i][j] = next_idx[i - 1][next_idx[i - 1][j]];
            }
        }
    }
    int Q;
    cin >> Q;
    for (int q = 0; q < Q; q++) {
        int x, y;
        cin >> x >> y;
        x--;
        y--;
        x = index[x];
        y = index[y];
        int from = upper_bound(uniqueH.begin(), uniqueH.end(), T[x]) - uniqueH.begin();
        from--;
        if (from == -1) {
            cout << -1 << endl;
            continue;
        }
        int to = lower_bound(uniqueH.begin(), uniqueH.end(), H[y]) - uniqueH.begin();
        bool ok = false;
        int imin = 0;
        int imax = 1000000;
        while (imax - imin > 1) {
            int imid = (imin + imax) / 2;
            int cur = from;
            for (int i = 0; i < 20; i++) {
                if ((imid - 1) & (1 << i)) {
                    cur = next_idx[i][cur];
                }
            }
            if (cur >= to) {
                ok = true;
                imax = imid;
            } else {
                imin = imid;
            }
        }
        cout << (ok ? imax : -1) << endl;
    }
}
int main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    for (int _t = 1; _t <= t; _t++) solve(_t);
    postprocess();
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX