Submission #765173

#	Time	Username	Problem	Language	Result	Execution time	Memory
765173		ymm	Jail (JOI22_jail)	C++17	5 / 100	37 ms	4532 KiB

jail

#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (ll)(r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (ll)(l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;

const int N = 200'010;
tuple<int,int,int> a[N];
int n, m;

void init()
{
	cin >> n;
	Loop (i,1,n) {
		int v, u;
		cin >> v >> u;
	}
	cin >> m;
	Loop (i,0,m) {
		int x, y;
		cin >> x >> y;
		if (x < y)
			a[i] = {x, y, 0};
		else
			a[i] = {y, x, 1};
	}
}

void solve()
{
	init();
	sort(a, a+m);
	int lst = -1, d = 0;
	Loop (i,0,m) {
		auto [x, y, d2] = a[i];
		if (x > lst) {
			lst = y;
			d = d2;
		} else {
			if (y <= lst || d != d2) {
				cout << "No\n";
				return;
			}
			lst = y;
		}
	}
	cout << "Yes\n";
}

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

• 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