제출 #884868

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
884868		MinaRagy06	Jail (JOI22_jail)	C++17	5 / 100	41 ms	6608 KiB

jail

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

int main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	int t;
	cin >> t;
	while (t--) {
		int n;
		cin >> n;
		for (int i = 1, u, v; i < n; i++) {
			cin >> u >> v;
			u--, v--;
		}
		int m;
		cin >> m;
		int st[n]{}, en[n]{}, st2[n]{}, en2[n]{};
		vector<array<int, 2>> v;
		for (int i = 0; i < m; i++) {
			int s, e;
			cin >> s >> e;
			s--, e--;
			v.push_back({min(s, e), max(s, e)});
			if (s < e) {
				st[s]++;
				en[e]++;
			} else {
				st2[s]++;
				en2[e]++;
			}
		}
		bool ok = 1;
		sort(v.begin(), v.end());
		int mn = 1e9;
		for (int i = v.size() - 1; i >= 0; i--) {
			if (mn < v[i][1]) {
				ok = 0;
			}
			mn = min(mn, v[i][1]);
		}
		int cnt[n]{}, c = 0;
		for (int i = 0; i < n; i++) {
			c += st[i];
			if (c) {
				cnt[i]++;
			}
			c -= en[i];
		}
		c = 0;
		for (int i = n - 1; i >= 0; i--) {
			c += st2[i];
			if (c && cnt[i]) {
				ok = 0;
			}
			c -= en2[i];
		}
		cout << (ok? "Yes\n" : "No\n");
	}
	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