Submission #602484

#	Time	Username	Problem	Language	Result	Execution time	Memory
602484		Tigryonochekk	Jail (JOI22_jail)	C++17	0 / 100	72 ms	8288 KiB

jail

#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <string>
using namespace std;
#define ll long long
#define pii pair<int, int>
const int N = 1.2e5 + 2;

int n;
vector<int> g[N];
int m;
int b[N], w[N];
pii sb[N], sw[N];


void solve() {
	cin >> n;
	for (int i = 1; i < n; i++) {
		int x, y;
		cin >> x >> y;
		g[x].push_back(y);
		g[y].push_back(x);
	}
	cin >> m;
	for (int i = 1; i <= m; i++) {
		cin >> b[i] >> w[i];
		sb[i] = pii(b[i], i);
		sw[i] = pii(w[i], i);
	}
	sort(sb + 1, sb + m + 1);
	sort(sw + 1, sw + m + 1);
	for (int i = 1; i <= n; i++) {
		if (sb[i].second != sw[i].second) {
			cout << "No" << endl;
			return;
		}
	}
	cout << "Yes" << endl;
}

int main() {
	int t = 1;
	cin >> t;
	while (t--) 
		solve();
	return 0;
}

• Subtask 1: 0 / 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