Submission #64133168

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef double db;

const int mod = 998244353;

int add(int a, int b)
{
	return a + b < mod ? a + b : a + b - mod;
}

int sub(int a, int b)
{
	return a - b >= 0 ? a - b : a - b + mod;
}

int mult(int a, int b)
{
	return (LL)a * b % mod;
}

int binpow(int a, LL n)
{
	int res = 1;
	while (n)
	{
		if (n & 1)
			res = mult(res, a);
		a = mult(a, a);
		n /= 2;
	}
	return res;
}

template<typename T>
void updMin(T& a, T b)
{
	a = min(a, b);
}

template<typename T>
void updMax(T& a, T b)
{
	a = max(a, b);
}

int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);
	int n, m;
	cin >> n >> m;
	VI a(n), b(m);
	for (int& ai : a)
		cin >> ai;
	for (int& bi : b)
		cin >> bi;
	VI vec1, vec2;
	int ptr = 0;
	FOR(i, 0, m)
	{
		while (ptr < n && a[ptr] != b[i])
			ptr++;
		if (ptr == n)
		{
			cout << "No\n";
			return 0;
		}
		vec1.PB(ptr++);
	}
	ptr = n - 1;
	RFOR(i, m, 0)
	{
		while (ptr >= 0 && a[ptr] != b[i])
			ptr--;
		vec2.PB(ptr--);
	}
	reverse(ALL(vec2));
	cout << (vec1 == vec2 ? "No\n" : "Yes\n");
	return 0;
}

Submission Info

Judge Result