結果

問題 No.2242 Cities and Teleporters
ユーザー noya2noya2
提出日時 2023-01-14 03:22:23
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 473 ms / 3,000 ms
コード長 5,057 bytes
コンパイル時間 4,880 ms
コンパイル使用メモリ 273,676 KB
実行使用メモリ 26,360 KB
最終ジャッジ日時 2024-09-18 03:24:14
合計ジャッジ時間 14,103 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 3 ms
5,376 KB
testcase_02 AC 3 ms
5,376 KB
testcase_03 AC 3 ms
5,376 KB
testcase_04 AC 3 ms
5,376 KB
testcase_05 AC 349 ms
26,256 KB
testcase_06 AC 312 ms
26,260 KB
testcase_07 AC 343 ms
26,264 KB
testcase_08 AC 473 ms
26,200 KB
testcase_09 AC 299 ms
26,132 KB
testcase_10 AC 177 ms
26,260 KB
testcase_11 AC 242 ms
26,264 KB
testcase_12 AC 243 ms
26,132 KB
testcase_13 AC 262 ms
26,132 KB
testcase_14 AC 308 ms
26,132 KB
testcase_15 AC 244 ms
26,260 KB
testcase_16 AC 309 ms
26,240 KB
testcase_17 AC 389 ms
26,264 KB
testcase_18 AC 237 ms
25,812 KB
testcase_19 AC 396 ms
25,828 KB
testcase_20 AC 232 ms
25,032 KB
testcase_21 AC 234 ms
25,352 KB
testcase_22 AC 384 ms
25,032 KB
testcase_23 AC 356 ms
26,260 KB
testcase_24 AC 255 ms
26,260 KB
testcase_25 AC 212 ms
26,360 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for (int i = 0; i < int(n); ++i)
#define repp(i,n,m) for (int i = m; i < int(n); ++i)
#define reb(i,n) for (int i = int(n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
using namespace std;
using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<int, int>;
using PL = pair<long long, long long>;
using pdd = pair<long double, long double>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
template<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;}
template<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);}
template<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));}
template<typename T>void rev(vector<T> &v){reverse(v.begin(),v.end());}
void revs(string &s) {reverse(s.begin(),s.end());}
template<typename T>void sor(vector<T> &v, int f=0){sort(v.begin(),v.end());if(f!=0) rev(v);}
template<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}
template<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<typename T>void uniq(vector<T> &v){sor(v);v.erase(unique(v.begin(),v.end()),v.end());}
template<typename T1, typename T2>void print(pair<T1,T2> a);
template<typename T>void print(vector<T> v);
template<typename T>void print(vector<vector<T>> v);
void print(){ putchar(' '); }
void print(bool a){ printf("%d", a); }
void print(int a){ printf("%d", a); }
void print(long a){ printf("%ld", a); }
void print(long long a){ printf("%lld", a); }
void print(char a){ printf("%c", a); }
void print(char a[]){ printf("%s", a); }
void print(const char a[]){ printf("%s", a); }
void print(long double a){ printf("%.15Lf", a); }
void print(const string& a){ for(auto&& i : a) print(i); }
void print(unsigned int a){ printf("%u", a); }
void print(unsigned long long a) { printf("%llu", a); }
template<class T> void print(const T& a){ cout << a; }
int out(){ putchar('\n'); return 0; }
template<class T> int out(const T& t){ print(t); putchar('\n'); return 0; }
template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }
template<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);}
template<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}}
template<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}}
void yes(){out("Yes");}
void no (){out("No");}
void yn (bool t){if(t)yes();else no();}
void fast_io(){cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);}
void o(){out("!?");}

namespace noya2{

const int INF = 1001001007;
const long long mod1 = 998244353;
const long long mod2 = 1000000007;
const long long inf = 2e18;
const long double pi = 3.14159265358979323;
const long double eps = 1e-7;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

} // namespace noya2
using namespace noya2;

using mint = modint998244353;
//using mint = modint1000000007;
//using mint = modint;
void out(mint a){out(a.val());}
void out(vector<mint> a){vector<ll> b(a.size()); rep(i,a.size()) b[i] = a[i].val(); out(b);}
void out(vector<vector<mint>> a){for (auto v : a) out(v);}
istream &operator>>(istream &is,vector<mint> &v){for(auto &e:v){ll _x;is>>_x;e=_x;}return is;}


void solve(){
    int n; cin >> n;
    vector<int> a(n), b(n); cin >> a >> b;
    vector<int> ids(n); iota(all(ids),0);
    auto comp = [&](int l,  int r){
        return a[l] < a[r];
    };
    sort(all(ids),comp);
    vector<int> inv(n);
    rep(i,n) inv[ids[i]] = i;
    vector<int> hs(n), ts(n);
    rep(i,n) hs[i] = a[ids[i]], ts[i] = b[ids[i]];
    const int lg = 20;
    vector<int> rs(n);
    rep(i,n) rs[i] = upper_bound(all(hs),ts[i]) - hs.begin();
    vector<vector<int>> dp(lg,vector<int>(n));
    vector<int> rui(n+1,-1), arg(n+1,-1);
    rep(i,n){
        rui[i+1] = rui[i];
        arg[i+1] = arg[i];
        if (chmax(rui[i+1],rs[i])) arg[i+1] = i;
    }
    rep(i,n){
        dp[0][i] = arg[rs[i]];
    }
    rep(l,lg-1){
        rep(i,n){
            dp[l+1][i] = (dp[l][i] == -1 ? -1 : dp[l][dp[l][i]]);
        }
    }
    int q; cin >> q;
    rep(i,q){
        int u, v; cin >> u >> v; u--, v--;
        u = inv[u], v = inv[v]; //out(u,v);
        if (v < rs[u]){
            out(1);
            continue;
        }
        int ans = 0;
        for (int k = lg-1; k >= 0; k--){
            if (dp[k][u] != -1 && v >= rs[dp[k][u]]){
                ans += 1 << k;
                u = dp[k][u];
            }
        }
        u = dp[0][u];
        out(u == -1 ? -1 : v < rs[u] ? ans+2 : -1);
    }
}

int main(){
    fast_io();
    int t = 1; //cin >> t;
    while(t--) solve();
}
0