#719986 (C++17) No.1768 The frog in the well knows the great ocean.

• 問題: No.1768 The frog in the well knows the great ocean.
• ユーザー: 沙耶花
• 提出日時: 2021-11-26 22:55:25
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 1,289 bytes
• コンパイル時間: 3,849 ms
• コンパイル使用メモリ: 269,524 KB
• 実行使用メモリ: 8,576 KB
• 最終ジャッジ日時: 2024-06-29 18:56:09
• 合計ジャッジ時間: 11,298 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,816 KB
testcase_01	WA	-
testcase_02	WA	-
testcase_03	AC	9 ms; 6,940 KB
testcase_04	WA	-
testcase_05	WA	-
testcase_06	AC	298 ms; 6,944 KB
testcase_07	AC	338 ms; 6,940 KB
testcase_08	AC	285 ms; 6,940 KB
testcase_09	AC	296 ms; 6,940 KB
testcase_10	WA	-
testcase_11	AC	370 ms; 6,944 KB
testcase_12	AC	297 ms; 6,940 KB
testcase_13	AC	263 ms; 6,940 KB
testcase_14	AC	284 ms; 6,940 KB
testcase_15	AC	339 ms; 6,944 KB
testcase_16	AC	426 ms; 8,576 KB
testcase_17	AC	412 ms; 8,448 KB
testcase_18	AC	398 ms; 8,448 KB
testcase_19	AC	325 ms; 8,448 KB
testcase_20	AC	384 ms; 8,576 KB
testcase_21	AC	1 ms; 6,940 KB
testcase_22	AC	2 ms; 6,940 KB
testcase_23	WA	-
testcase_24	WA	-
testcase_25	AC	652 ms; 8,448 KB
testcase_26	AC	383 ms; 8,448 KB
testcase_27	WA	-

ソースコード

#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define Inf 1000000001

int op(int a,int b){
	return max(a,b);
}

int e(){
	return 0;
}
int solve(){
	int n;
	cin>>n;
	vector<int> a(n),b(n);
	vector<pair<int,int>> p(n);
	rep(i,n){
		cin>>a[i];
	}
	rep(i,n){
		cin>>b[i];
		p[i] = make_pair(b[i],i);
	}
	
	segtree<int,op,e> seg(a);
	
	sort(p.begin(),p.end());
	
	rep(i,n){
		int ind = p[i].second;
		//cout<<ind<<endl;
		if(seg.get(ind)>b[ind]){
			cout<<"No"<<endl;
			return 0;
		}
		int ok = ind+1,ng = n+1;
		while(ng-ok>1){
			int mid = (ok+ng)/2;
			if(seg.prod(ind,mid)>b[ind])ng = mid;
			else ok = mid;
		}
		if(seg.prod(ind,ok)==b[ind]){

			seg.set(ind,b[ind]);
			continue;
		}
		ok = ind+1,ng = -1;
		while(ok-ng>1){
			int mid = (ok+ng)/2;
			if(seg.prod(mid,ind+1)>b[ind])ng = mid;
			else ok = mid;
		}
		/*
		cout<<ok<<','<<ind+1<<','<<seg.prod(ok,ind+1)<<endl;
		rep(j,n){
			cout<<seg.get(j)<<',';
		}
		cout<<endl;*/
		if(seg.prod(ok,ind+1)==b[ind]){
			seg.set(ind,b[ind]);
			continue;
		}
		cout<<"No"<<endl;
		return 0;
	}
	
	cout<<"Yes"<<endl;
	return 0;
}

int main(){
	
	int _t;
	cin>>_t;
	rep(_,_t){
		solve();
	}
	
	return 0;
}