oj.uz

Submission #1017755

# Submission time Handle Problem Language Result Execution time Memory
1017755 2024-07-09T09:58:16 Z Unforgettablepl Jail (JOI22_jail) C++17
5 / 100
 73 ms 50384 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define int long long
 
const int modulo = 1e9+7;
 
void solve(){
	int n;
	cin >> n;
	vector<vector<int>> adj(n+1);
	for(int i=1;i<n;i++){
		int a,b;cin>>a>>b;
		adj[a].emplace_back(b);
		adj[b].emplace_back(a);
	}
	vector<int> depth(n+1);
	vector<vector<int>> p(n+1,vector<int>(17));
	function<void(int,int,int)> dfs = [&](int x,int par,int dep){
		depth[x]=dep;
		p[x][0]=par;
		for(int&i:adj[x])if(i!=par)dfs(i,x,dep+1);
	};
	dfs(1,0,1);
	for(int bit=1;bit<17;bit++){
		for(int i=1;i<=n;i++){
			p[i][bit] = p[p[i][bit-1]][bit-1];
		}
	}
	auto lift = [&](int x,int tar){
		for(int bit=0;bit<17;bit++)if(tar&(1<<bit))x=p[x][bit];
		return x;
	};
	int m;
	cin >> m;
	vector<vector<int>> secadj(m+1);
	vector<int> s(m+1);
	vector<int> t(m+1);
	auto collides = [&](int curr,int v){
		int a = s[curr];
		int b = t[curr];
		if(a==v or b==v)return true;
		bool worksa = false;
		if(depth[a]>=depth[v] and lift(a,depth[a]-depth[v])==v)worksa=true;
		bool worksb = false;
		if(depth[b]>=depth[v] and lift(b,depth[b]-depth[v])==v)worksb=true;
		if(worksa and worksb){
			return lift(a,depth[a]-depth[v]-1)!=lift(b,depth[b]-depth[v]-1);
		} else return worksa or worksb;
	};
	vector<pair<int,int>> ranges;
	vector<int> prefl(n+2);
	vector<int> prefr(n+2);
	for(int i=1;i<=m;i++)cin>>s[i]>>t[i];
	for(int i=1;i<=m;i++){
		if(s[i]<t[i]){
			prefr[s[i]]++;
			prefr[t[i]+1]--;
		} else {
			prefl[t[i]]++;
			prefl[s[i]+1]--;	
		}
	}
	for(int i=1;i<=n;i++)prefr[i]+=prefr[i-1];
	for(int i=1;i<=n;i++)prefl[i]+=prefl[i-1];
	for(int i=1;i<=m;i++)ranges.emplace_back(min(s[i],t[i]),max(s[i],t[i]));
	sort(ranges.begin(),ranges.end());
	int r = 0;
	bool works = true;
	for(auto[a,b]:ranges){
		if(b<=r)works=false;
		r = b;
	}
	for(int i=1;i<=m;i++){
		if(s[i]<t[i]){
			if(prefl[s[i]] or prefl[t[i]])works=false;
		} else {
			if(prefr[t[i]] or prefr[s[i]])works=false;
		}
	}
	if(!works)cout<<"No\n";
	else cout << "Yes\n";
}
 
int32_t main(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	int t;
	cin >> t;
	while(t--)solve();
}

Compilation message

jail.cpp: In function 'void solve()':
jail.cpp:39:7: warning: variable 'collides' set but not used [-Wunused-but-set-variable]
   39 |  auto collides = [&](int curr,int v){
      |       ^~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 10 ms 488 KB Output is correct
5 Correct 22 ms 1240 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 31 ms 3384 KB Output is correct
10 Correct 45 ms 42076 KB Output is correct
11 Correct 5 ms 604 KB Output is correct
12 Correct 28 ms 1200 KB Output is correct
13 Correct 55 ms 45012 KB Output is correct
14 Correct 53 ms 45924 KB Output is correct
15 Correct 58 ms 45780 KB Output is correct
16 Correct 73 ms 50384 KB Output is correct
17 Correct 55 ms 46292 KB Output is correct
18 Correct 61 ms 50384 KB Output is correct
19 Correct 59 ms 46288 KB Output is correct
20 Correct 56 ms 46472 KB Output is correct
21 Correct 56 ms 46324 KB Output is correct
22 Correct 55 ms 46288 KB Output is correct

Subtask #2
0 / 5.0

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

Subtask #3
0 / 16.0

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

Subtask #4
0 / 28.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 11.0

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

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 10 ms 488 KB Output is correct
5 Correct 22 ms 1240 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 31 ms 3384 KB Output is correct
10 Correct 45 ms 42076 KB Output is correct
11 Correct 5 ms 604 KB Output is correct
12 Correct 28 ms 1200 KB Output is correct
13 Correct 55 ms 45012 KB Output is correct
14 Correct 53 ms 45924 KB Output is correct
15 Correct 58 ms 45780 KB Output is correct
16 Correct 73 ms 50384 KB Output is correct
17 Correct 55 ms 46292 KB Output is correct
18 Correct 61 ms 50384 KB Output is correct
19 Correct 59 ms 46288 KB Output is correct
20 Correct 56 ms 46472 KB Output is correct
21 Correct 56 ms 46324 KB Output is correct
22 Correct 55 ms 46288 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Incorrect 1 ms 348 KB Output isn't correct
27 Halted 0 ms 0 KB -