Submission #890964

#	Time	Username	Problem	Language	Result	Execution time	Memory
890964		vjudge1	Jail (JOI22_jail)	C++17	0 / 100	0 ms	348 KiB

jail

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define int long long
#define pb push_back
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define ordered_set tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
#define ordered_multiset tree<type1, null_type, less_equal<type1>, rb_tree_tag, tree_order_statistics_node_update>;

using namespace std;
using namespace __gnu_pbds;

const int mod = 1e9+7;
const double PI = acos(-1.0);
const double epsilon = 1e-6;
const int N = 1.2e5+5;

void solve(){
	int n; cin >> n;
	for(int i = 1; i < n; i++){
		int u,v; cin >> u >> v;
	}
	int m; cin >> m;
	map<int,pair<int,bool> > mp;
	for(int i = 0; i < m; i++){
		int l,r; cin >> l >> r;
		bool ty = 0;
		if(r < l) swap(l,r),ty = 1;
		mp[r] = {l,ty};
	}
	int last = 1e18;
	for(auto it = mp.rbegin(); it != mp.rend(); ++it){
		int r = it->ff,l = it->ss.ff,i = it->ss.ss;
		if(i){
			if(r > last){
				cout << "No\n";
				return;
			}else last = min(last,r);
			continue;
		}
		if(l > last){
			cout << "No\n";
			return;
		} else {
			last = min(last,l);
		}
	}
	cout << "Yes\n";
}

main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int tt = 1;
    cin >> tt;
    while (tt--) {
        solve();
    }
}

Compilation message (stderr)

jail.cpp:55:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   55 | main(){
      | ^~~~

• 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