oj.uz

Submission #1114077

# Submission time Handle Problem Language Result Execution time Memory
1114077 2024-11-18T07:31:06 Z thelegendary08 Jail (JOI22_jail) C++17
5 / 100
 82 ms 14656 KB 
#include<bits/stdc++.h>
#define pb push_back
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"Yes"<<'\n';}else{cout<<"No"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	int tt;
	cin>>tt;
	while(tt--){
		in(n);
		vvi adj(n+1);
		f0r(i,n-1){
			in2(a,b);
			adj[a].pb(b);
			adj[b].pb(a);
		}
		in(m);
		vpii v;
		vector<pair<pii,int>>w;
		f0r(i,m){
			in2(a,b);
			v.pb({min(a,b),max(a,b)});
			w.pb({{min(a,b),max(a,b)}, (a > b)});
		}
		sort(all(v));
		sort(all(w));
		int mx = -1;
		bool ok = 1;
		f0r(i,m){
			//out3(w[i].first.first, w[i].first.second, w[i].second);
		}
		f0r(i,m){
			if(v[i].second <= mx){
				ok = 0;
				break;
			}
			else{
				mx = v[i].second;
			}
		}
		mx = -1;
		int mx2 = -1;
		f0r(i, m){
			if(w[i].second){
				if(w[i].first.first < mx)ok = 0;
				else mx2 = w[i].first.second;
			}
			else{
				if(w[i].first.first < mx2)ok = 0;
				else mx = w[i].first.second;
			}
		}
		yn(ok);
	}
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 16 ms 592 KB Output is correct
5 Correct 18 ms 1220 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 3 ms 336 KB Output is correct
9 Correct 22 ms 1960 KB Output is correct
10 Correct 26 ms 8272 KB Output is correct
11 Correct 8 ms 592 KB Output is correct
12 Correct 37 ms 1348 KB Output is correct
13 Correct 47 ms 11156 KB Output is correct
14 Correct 64 ms 10996 KB Output is correct
15 Correct 51 ms 11080 KB Output is correct
16 Correct 82 ms 14656 KB Output is correct
17 Correct 36 ms 11504 KB Output is correct
18 Correct 49 ms 14656 KB Output is correct
19 Correct 39 ms 11588 KB Output is correct
20 Correct 42 ms 11648 KB Output is correct
21 Correct 68 ms 11468 KB Output is correct
22 Correct 42 ms 11508 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 2 ms 336 KB Output is correct
4 Incorrect 3 ms 336 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 2 ms 336 KB Output is correct
4 Incorrect 3 ms 336 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 2 ms 336 KB Output is correct
4 Incorrect 3 ms 336 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 2 ms 336 KB Output is correct
4 Incorrect 3 ms 336 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 5 ms 592 KB Output is correct
6 Incorrect 1 ms 504 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 16 ms 592 KB Output is correct
5 Correct 18 ms 1220 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 3 ms 336 KB Output is correct
9 Correct 22 ms 1960 KB Output is correct
10 Correct 26 ms 8272 KB Output is correct
11 Correct 8 ms 592 KB Output is correct
12 Correct 37 ms 1348 KB Output is correct
13 Correct 47 ms 11156 KB Output is correct
14 Correct 64 ms 10996 KB Output is correct
15 Correct 51 ms 11080 KB Output is correct
16 Correct 82 ms 14656 KB Output is correct
17 Correct 36 ms 11504 KB Output is correct
18 Correct 49 ms 14656 KB Output is correct
19 Correct 39 ms 11588 KB Output is correct
20 Correct 42 ms 11648 KB Output is correct
21 Correct 68 ms 11468 KB Output is correct
22 Correct 42 ms 11508 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 2 ms 336 KB Output is correct
26 Incorrect 3 ms 336 KB Output isn't correct
27 Halted 0 ms 0 KB -