oj.uz

답안 #631930

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
631930 2022-08-19T07:42:57 Z S2speed Jail (JOI22_jail) C++17
0 / 100
 5000 ms 48520 KB 
#include<bits/stdc++.h>

using namespace std;

#pragma GCC optimize ("Ofast")

#define all(x) x.begin() , x.end()
typedef long long ll;
typedef pair<ll , ll> pll;

const ll maxn = 2e5 + 17 , inf = 2e16;

vector<ll> adj[maxn];
ll jad[maxn][20] , bt[maxn] , ft[maxn] , tme , dis[maxn] , dep = 0;

void jDFS(ll r , ll par){
	bt[r] = tme++;
	dis[r] = dep++;
	jad[r][0] = par;
	for(ll j = 1 ; j < 20 ; j++){
		if(jad[r][j - 1] == -1) break;
		jad[r][j] = jad[jad[r][j - 1]][j - 1];
	}
	for(auto i : adj[r]){
		if(i == par) continue;
		jDFS(i , r);
	}
	ft[r] = tme;
	dep--;
	return;
}

ll find_jad(ll v , ll d){
	d = dis[v] - d;
	for(ll j = 19 ; ~j ; j--){
		if(d & (1 << j)){
			v = jad[v][j];
		}
	}
	return v;
}

bool too_masir(ll v , ll u , ll k){
	bool zv = (bt[v] >= bt[k] && ft[v] <= ft[k]) , zu = (bt[u] >= bt[k] && ft[u] <= ft[k]);
	if(!zv && !zu) return false;
	if(zv ^ zu) return true;
	ll hv = find_jad(v , dis[k] + 1) , hu = find_jad(u , dis[k] + 1);
	return (hv != hu);
}

ll n , m;
ll a[maxn] , b[maxn] , d[maxn];
vector<ll> jda[maxn];
priority_queue<pll , vector<pll> , greater<pll>> pq;
vector<pll> s1;

bool sub1(){
	s1.clear();
	for(ll i = 0 ; i < m ; i++){
		s1.push_back({a[i] , b[i]});
	}
	sort(all(s1));
	for(ll i = 1 ; i < m ; i++){
		if(s1[i].second < s1[i - 1].second) return false;
	}
	return true;
}

void solve(){
	while(!pq.empty()) pq.pop();
	tme = 0;
	cin>>n;
	for(ll i = 0 ; i < n ; i++){
		adj[i].clear(); jda[i].clear(); d[i] = 0;
		for(ll j = 0 ; j < 20 ; j++) jad[i][j] = -1;
	}
	for(ll i = 1 ; i < n ; i++){
		ll v , u;
		cin>>v>>u; v--; u--;
		adj[v].push_back(u); adj[u].push_back(v);
	}
	jDFS(0 , -1);
	cin>>m;
	bool c = true;
	for(ll i = 0 ; i < m ; i++){
		cin>>a[i]>>b[i]; a[i]--; b[i]--;
		c &= (a[i] == i); c &= (b[i] == i + 1);
	}
	if(c){
		cout<<(sub1() ? "Yes\n" : "No\n");
		return;
	}
	for(ll i = 0 ; i < m ; i++){
		for(ll j = 0 ; j < m ; j++){
			if(j == i) continue;
			if(too_masir(a[i] , b[i] , a[j])){
				jda[i].push_back(j); d[j]++;
			}
			if(too_masir(a[i] , b[i] , b[j])){
				jda[j].push_back(i); d[i]++;
			}
		}
	}
	for(ll i = 0 ; i < m ; i++){
		pq.push({d[i] , i});
	}
	while(!pq.empty()){
		pll p = pq.top(); pq.pop();
		ll v = p.second;
		if(d[v] != p.first) continue;
		if(d[v] != 0){
			cout<<"No\n";
			return;
		}
		for(auto i : jda[v]){
			d[i]--;
			pq.push({d[i] , i});
		}
	}
	cout<<"Yes\n";
	return;
}

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

	ll T;
	cin>>T;
	while(T--) solve();
	return 0;
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 13 ms 9788 KB Output is correct
5 Correct 21 ms 9684 KB Output is correct
6 Correct 6 ms 9812 KB Output is correct
7 Correct 7 ms 9812 KB Output is correct
8 Correct 25 ms 10288 KB Output is correct
9 Correct 636 ms 19288 KB Output is correct
10 Correct 107 ms 48520 KB Output is correct
11 Correct 13 ms 9684 KB Output is correct
12 Correct 196 ms 10060 KB Output is correct
13 Execution timed out 5073 ms 45984 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9812 KB Output is correct
4 Incorrect 6 ms 9824 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9812 KB Output is correct
4 Incorrect 6 ms 9824 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9812 KB Output is correct
4 Incorrect 6 ms 9824 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9812 KB Output is correct
4 Incorrect 6 ms 9824 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9716 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 6 ms 9684 KB Output is correct
5 Correct 13 ms 9684 KB Output is correct
6 Correct 7 ms 9788 KB Output is correct
7 Correct 5 ms 9812 KB Output is correct
8 Correct 6 ms 9684 KB Output is correct
9 Correct 6 ms 9732 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 6 ms 9768 KB Output is correct
12 Correct 11 ms 9756 KB Output is correct
13 Correct 55 ms 9908 KB Output is correct
14 Correct 52 ms 9772 KB Output is correct
15 Correct 49 ms 9844 KB Output is correct
16 Correct 1907 ms 37760 KB Output is correct
17 Execution timed out 5093 ms 38668 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 13 ms 9788 KB Output is correct
5 Correct 21 ms 9684 KB Output is correct
6 Correct 6 ms 9812 KB Output is correct
7 Correct 7 ms 9812 KB Output is correct
8 Correct 25 ms 10288 KB Output is correct
9 Correct 636 ms 19288 KB Output is correct
10 Correct 107 ms 48520 KB Output is correct
11 Correct 13 ms 9684 KB Output is correct
12 Correct 196 ms 10060 KB Output is correct
13 Execution timed out 5073 ms 45984 KB Time limit exceeded
14 Halted 0 ms 0 KB -