提出 #53835829

---

ソースコード 拡げる

// #pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf (ll)1e18
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define fi first
#define se second
#define lll __int128
const int N = 1e6 + 5;

void solve() {
	ll n, m;
	cin >> n >> m;
	vl a(n), b(m), c;
	set<ll> sa, sb;
	for (ll i = 0; i < n; i++)
		cin >> a[i], c.push_back(a[i]), sa.insert(a[i]);
	for (ll i = 0; i < m; i++)
		cin >> b[i], c.push_back(b[i]), sb.insert(b[i]);
	sort(c.begin(), c.end());
	for (ll i = 0; i < n + m - 1; i++) {
		if (sa.count(c[i]) && sa.count(c[i + 1])) {
			cout << "Yes" << endl;
			return;
		}
	}
	cout << "No" << endl;
}

int main() {
	ios::sync_with_stdio(false);
  	cin.tie(0);
  	cout.tie(0);
	solve();
	return 0;
}

提出情報

ジャッジ結果