제출 #660194

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
660194		Sohsoh84	Jail (JOI22_jail)	C++17	5 / 100	44 ms	5152 KiB

jail

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;

#define all(x)			(x).begin(),(x).end()
#define X			first
#define Y			second
#define sep			' '
#define endl			'\n'
#define debug(x)		cerr << #x << ": " <<  x << endl;

const ll MAXN = 1e6 + 10;

int n, m;

inline int solve() {
	cin >> n;
	for (int i = 1; i < n; i++) {
		int u, v;
		cin >> u >> v;
	}
	
	cin >> m;
	vector<pll> vec;
	for (int i = 1; i <= m; i++) {
		int u, v;
		cin >> u >> v;
		vec.push_back({u, v});
	}

	sort(all(vec));
	for (auto& e : vec)
		swap(e.X, e.Y);

	return cout << (is_sorted(all(vec)) ? "Yes" : "No") << endl, 0;
	return 0;
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int q;
	cin >> q;
	while (q--) solve();
	return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 16
• Subtask 4: 0 / 28
• Subtask 5: 0 / 12
• Subtask 6: 0 / 11
• Subtask 7: 0 / 23