結果

問題 No.1768 The frog in the well knows the great ocean.
ユーザー HIR180HIR180
提出日時 2021-11-26 22:58:48
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 113 ms / 3,000 ms
コード長 6,895 bytes
コンパイル時間 3,056 ms
コンパイル使用メモリ 193,132 KB
実行使用メモリ 22,564 KB
最終ジャッジ日時 2023-09-12 05:50:05
合計ジャッジ時間 6,632 ms
ジャッジサーバーID
(参考情報)
judge13 / judge14
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
7,524 KB
testcase_01 AC 6 ms
7,576 KB
testcase_02 AC 5 ms
7,684 KB
testcase_03 AC 6 ms
7,712 KB
testcase_04 AC 6 ms
7,688 KB
testcase_05 AC 6 ms
7,624 KB
testcase_06 AC 90 ms
12,528 KB
testcase_07 AC 94 ms
14,628 KB
testcase_08 AC 84 ms
13,524 KB
testcase_09 AC 87 ms
11,508 KB
testcase_10 AC 91 ms
14,904 KB
testcase_11 AC 101 ms
15,368 KB
testcase_12 AC 101 ms
15,240 KB
testcase_13 AC 100 ms
15,328 KB
testcase_14 AC 103 ms
15,508 KB
testcase_15 AC 100 ms
15,376 KB
testcase_16 AC 112 ms
22,416 KB
testcase_17 AC 112 ms
22,564 KB
testcase_18 AC 112 ms
22,496 KB
testcase_19 AC 113 ms
22,356 KB
testcase_20 AC 112 ms
22,420 KB
testcase_21 AC 2 ms
7,472 KB
testcase_22 AC 3 ms
7,528 KB
testcase_23 AC 3 ms
7,600 KB
testcase_24 AC 51 ms
7,504 KB
testcase_25 AC 87 ms
22,332 KB
testcase_26 AC 95 ms
22,384 KB
testcase_27 AC 2 ms
7,468 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

//Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cassert>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <cassert>
#include <iomanip>
#include <chrono>
#include <random>
#include <bitset>
#include <complex>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
#define int long long
//#define L __int128
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define a first
#define b second
#define fi first
#define sc second
#define rng(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
#define all(x) x.begin(),x.end()
#define si(x) int(x.size())
 
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif
 
template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}
 
template<class t> using vc=vector<t>;
 
template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.fi<<","<<p.sc<<"}";
}
 
template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}
 
 //https://codeforces.com/blog/entry/62393
struct custom_hash {
	static uint64_t splitmix64(uint64_t x) {
		// http://xorshift.di.unimi.it/splitmix64.c
		x += 0x9e3779b97f4a7c15;
		x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
		x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
		return x ^ (x >> 31);
	}
 
	size_t operator()(uint64_t x) const {
		static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
		return splitmix64(x + FIXED_RANDOM);
	}
	
	size_t operator()(pair<int,int> x)const{
		return operator()(uint64_t(x.first)<<32|x.second);
	}
};
//unordered_set -> dtype, null_type
//unordered_map -> dtype(key), dtype(value)
using namespace __gnu_pbds;
template<class t,class u>
using hash_table=gp_hash_table<t,u,custom_hash>;

template<class T>
void g(T &a){
	cin >> a;
}
template<class T>
void o(const T &a,bool space=false){
	cout << a << (space?' ':'\n');
}
//ios::sync_with_stdio(false);
const ll mod = 998244353;
//const ll mod = 1000000007;
mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());
template<class T>
void add(T&a,T b){
	a+=b;
	if(a >= mod) a-=mod;
}
ll modpow(ll x,ll n){
	ll res=1;
	while(n>0){
		if(n&1) res=res*x%mod;
		x=x*x%mod;
		n>>=1;
	}
	return res;
}
#define _sz 1
ll F[_sz],R[_sz];
void make(){
	F[0] = 1;
	for(int i=1;i<_sz;i++) F[i] = F[i-1]*i%mod;
	R[_sz-1] = modpow(F[_sz-1], mod-2);
	for(int i=_sz-2;i>=0;i--) R[i] = R[i+1] * (i+1) % mod;
}
ll C(int a,int b){
	if(b < 0 || a < b) return 0;
	return F[a]*R[b]%mod*R[a-b]%mod;
}
int le_sm[200005], ri_sm[200005];
int n, a[200005], b[200005];
template<typename F, typename T>
struct segtree{
	int sz;
	vector<T>seg;
	const F f;
	const T e;
	segtree(int n, const F f, const T e): f(f), e(e) {
		sz = 1;
		while(sz < n) sz <<= 1;
		seg.assign(2*sz, e);
	}
	void init(int n){
		sz = 1;
		while(sz < n) sz <<= 1;
		seg.assign(2*sz, e);
	}
	//mrg...apply f or not
	void update(int a, T p, bool mrg){
		a += sz-1;
		if(mrg) seg[a] = f(seg[a], p);
		else seg[a] = p;
		while(a){
			a = (a-1)/2;
			seg[a] = f(seg[a*2+1], seg[a*2+2]);
		}
	}
	void make(vector<T>a){
		rep(i, a.size()) seg[i+sz-1] = a[i];
		for(int i=sz-2;i>=0;i--) seg[i] = f(seg[i*2+1], seg[i*2+2]);
	}
	T query(int a, int b){
		a += sz-1, b += sz-1;
		T L = e, R = e;
		while(a <= b){
			if((a&1) == 0) { L = f(L, seg[a++]); }
			if((b&1) == 1) { R = f(seg[b--], R); }
			if(a > b) break;
			a = (a-1) >> 1;
			b = (b-1) >> 1;
		}
		return f(L, R);
	}
	int find_left(int a, int b, int k, int l, int r, T v){
		if(r < a || b < l) return INF;
		if(a <= l && r <= b){
			if(f(seg[k], v) == seg[k]){
				while(k < sz-1){
					if(f(seg[k*2+1], v) == seg[k*2+1]) k = k*2+1;
					else k = k*2+2;
				}
				return k - (sz-1);
			}
			return INF;
		}
		int ret = find_left(a, b, k*2+1, l, (l+r)/2, v);
		if(ret != INF) return ret;
		return find_left(a, b, k*2+2, 1+(l+r)/2, r, v);
	}
	//NOT VERIFIED
	int find_right(int a, int b, int k, int l, int r, T v){
		if(r < a || b < l) return -INF;
		if(a <= l && r <= b){
			if(f(seg[k], v) == seg[k]){
				while(k < sz-1){
					if(f(seg[k*2+2], v) == seg[k*2+2]) k = k*2+2;
					else k = k*2+1;
				}
				return k - (sz-1);
			}
			return -INF;
		}
		int ret = find_right(a, b, k*2+2, 1+(l+r)/2, r, v);
		if(ret != -INF) return ret;
		return find_right(a, b, k*2+1, l, (l+r)/2, v);
	}
	//[a, b]でf(*, v)=*となる最小の*を返す 無ければINF
	int find_left(int a, int b, T v){
		return find_left(a, b, 0, 0, sz-1, v);
	}
	//NOT VERIFIED
	//[a, b]でf(*, v)=*となる最大の*を返す 無ければ-INF
	int find_right(int a, int b, T v){
		return find_right(a, b, 0, 0, sz-1, v);
	}
	
};
//グローバルにおきたい時は
//f, eを定義して

void solve(){
	cin>>n;
	repn(i,n)cin>>a[i];repn(i,n)cin>>b[i];
	rep(i,n+3){
		le_sm[i]=0; ri_sm[i]=n+1;
	}
	stack<P>S;
	for(int i=n;i>=1;i--){
		while(S.size() && S.top().a > b[i]){
			le_sm[S.top().b] = i;
			S.pop();
		}
		S.push(mp(b[i], i));
	}
	while(S.size()) S.pop();
	repn(i, n){
		while(S.size() && S.top().a > b[i]){
			ri_sm[S.top().b] = i;
			S.pop();
		}
		S.push(mp(b[i], i));
	}
	//repn(i, n) cerr<<le_sm[i]<<" "<<ri_sm[i]<<endl;
	auto f = [](int a, int b){ return max(a, b); };
	int e = -INF;
	segtree<decltype(f), decltype(e)>seg(n+1, f, e);
	repn(i, n) seg.update(i, a[i], true);
	vc<vc<int>>pos(n+1, vc<int>());
	repn(i, n) pos[a[i]].pb(i);
	
	int bad= 0;
	repn(i, n){
		int x = POSL(pos[b[i]], i);
		int ok = 0;
		for(int j=x-2;j<=x+2;j++){
			if(j < 0 or j >= pos[b[i]].size()) continue;
			if(le_sm[i]+1 <= pos[b[i]][j] and pos[b[i]][j] <= ri_sm[i]-1){
				int lb = le_sm[i]+1, rb = ri_sm[i] - 1;
				int lw = i, rw = pos[b[i]][j];
				if(lw > rw) swap(lw, rw);
				chmax(lb, lw);
				chmin(rb, rw);
				if(seg.query(lb, rb) == b[i]) ok = 1;
			}
		}
		if(ok == 0) bad = 1;
	}
	o(bad?"No":"Yes");
}
signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	int t; cin >> t;
	while(t--) solve();
}
0