結果

問題 No.2242 Cities and Teleporters
ユーザー woodywoodywoodywoody
提出日時 2023-03-11 16:35:43
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 5,235 bytes
コンパイル時間 4,328 ms
コンパイル使用メモリ 243,060 KB
実行使用メモリ 56,216 KB
最終ジャッジ日時 2024-09-18 06:32:10
合計ジャッジ時間 21,864 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 3 ms
6,940 KB
testcase_02 AC 4 ms
6,944 KB
testcase_03 AC 3 ms
6,940 KB
testcase_04 AC 3 ms
6,944 KB
testcase_05 AC 810 ms
42,500 KB
testcase_06 AC 445 ms
42,484 KB
testcase_07 AC 652 ms
42,332 KB
testcase_08 AC 729 ms
42,400 KB
testcase_09 AC 748 ms
42,440 KB
testcase_10 AC 1,078 ms
56,036 KB
testcase_11 WA -
testcase_12 AC 692 ms
55,916 KB
testcase_13 AC 712 ms
55,940 KB
testcase_14 AC 783 ms
55,960 KB
testcase_15 AC 708 ms
55,916 KB
testcase_16 AC 749 ms
56,032 KB
testcase_17 AC 869 ms
55,952 KB
testcase_18 WA -
testcase_19 WA -
testcase_20 AC 668 ms
53,944 KB
testcase_21 AC 702 ms
54,136 KB
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 AC 750 ms
56,072 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto i:a)
#define fore1(i,a) for(auto &i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;

using ll = long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define dame { cout << "No" << endl; return;}
#define dame1 { cout << -1 << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) cout << p.fi << " " << p.se << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using tp = tuple<int ,int ,int>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define yesr { cout <<"Yes"<<endl; return;}
#define no {cout <<"No"<<endl;}
#define nor { cout <<"No"<<endl; return;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#define show(x) cerr<<#x<<" = "<<x<<endl
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show2(x,y) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<endl
#define show3(x,y,z) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<endl
#define show4(x,y,z,x2) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<" : "<<#x2<<" = "<<x2<<endl
#define test(x) cout << "test" << x << endl
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
#define showvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) fore(vy , v) cout << vy.val() << "\n";
#else
#define show(x)
#define showp(p)
#define show2(x,y)
#define show3(x,y,z)
#define show4(x,y,z,x2)
#define test(x)
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#endif

pii op(pii a,pii b){
	return max(a,b);
}
pii e(){
	return {0,-1};
}

void solve(){
	int n; cin>>n;
	vi h(n),t(n);
	rep(i,n) cin>>h[i];
	rep(i,n) cin>>t[i];
	map<int,int> mp;
	rep(i,n) mp[h[i]] = 0;
	rep(i,n) mp[t[i]] = 0;
	int m = 0;
	fore1(y , mp) y.se = m++;
	segtree<pii,op,e> sg(m);
	vvi d(n , vi(20,-1));
	rep(i,n){
		pii p = sg.get(mp[h[i]]);
		if (p.fi < t[i]){
			sg.set(mp[h[i]] , {t[i] , i});
		}
	}
	test(2);
	rep(i,n){
		pii p = sg.prod(0,mp[t[i]]+1);
		if (p.se == -1) continue;
		if (t[i] > t[p.se]) continue;
		d[i][0] = p.se;
	}
	rep(i,19){
		rep(j,n){
			if (d[j][i] == -1) continue;
			d[j][i+1] = d[d[j][i]][i];
		}
	}
	int q; cin>>q;
	vi ans(q,-1);
	vi two(20);
	two[0] = 1;
	test(1);
	rep1(i,20) two[i] = two[i-1]*2;
	rep(i,q){
		int a,b; cin>>a>>b;
		a--; b--;
		if (t[a]>=h[b]){
			ans[i] = 1;
			continue;
		}
		if (d[a][0]==-1) continue;
		int x = a;
		ans[i] = 0;
		while(t[x]<h[b]){
			int nx = -1;
			rep(j,20){
				if (t[d[x][j]] >= h[b]){
					if (j == 0) nx = x;
					else{
						nx = d[x][j-1];
						ans[i] += two[j-1];
						break;
					}
				}
			}
			if (nx == -1){
				ans[i] = -1;
				break;
			}else if(nx == x){
				ans[i]++;
				x = nx;
				break;
			}else{
				x = nx;
			}
		}
		if (ans[i] ==-1) break;
		if (x != b) ans[i]++;
	}
	outv;

	return;
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	int t = 1;
	//cin>>t;

	rep(i,t){
		solve();
	}

	return 0;
}
0