Submission #57129879

---

Source Code Expand

#include<bits/stdc++.h>
#ifdef xay5421
#define D(...) fprintf(stderr,__VA_ARGS__)
#define DD(...) D(#__VA_ARGS__ "="),debug_helper::debug(__VA_ARGS__),D("\n")
#include"/home/xay5421/debug.hpp"
#else
#define D(...) ((void)0)
#define DD(...) ((void)0)
#endif
#define pb push_back
#define eb emplace_back
#define SZ(x) ((int)(x).size())
#define each(x,v) for(auto&x:v)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
template<class T>void rd(T&x){int f=0,c;while(!isdigit(c=getchar()))f^=!(c^45);x=(c&15);while(isdigit(c=getchar()))x=x*10+(c&15);if(f)x=-x;}
template<class T>void pt(T x,int c=-1){if(x<0)putchar('-'),x=-x;if(x>9)pt(x/10);putchar(x%10+48);if(c!=-1)putchar(c);}
using namespace std;
using LL=long long;
using ULL=unsigned long long;
const int N=250005;
int T;
int n,K,a[N],b[N];
int lst[N];
int main(){
#ifdef xay5421
	freopen("a.in","r",stdin);
#endif
	rd(T);
	while(T--){
		rd(n),rd(K);
		rep(i,1,n)rd(a[i]);
		rep(i,1,n)rd(b[i]);
		if(K==1){
			int pos=1;
			int err=0;
			rep(i,1,n){
				while(pos<=n&&a[pos]!=b[i])++pos;
				if(pos>n)err=1;
			}
			puts(err?"No":"Yes");
		}else{
			int flag=1;
			rep(i,1,n)flag&=a[i]==b[i];
			if(flag){
				puts("Yes");
				continue;
			}
			int good=0;
			rep(i,1,n)lst[i]=0;
			rep(i,1,n){
				if(lst[b[i]]){
					if(i-lst[b[i]]<=K){
						good=1;
					}
				}
				lst[b[i]]=i;
			}
			rep(i,1,n)lst[a[i]]=0;
			int err=0;
			rep(i,1,n)if(lst[i]){err=1;break;}
			puts(err||!good?"No":"Yes");
		}
	}
	return 0;
}

Submission Info

Judge Result