이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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 <= m; 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;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |