oj.uz

Submission #725343

# Submission time Handle Problem Language Result Execution time Memory
725343 2023-04-17T10:04:29 Z sunwukong123 Jail (JOI22_jail) C++14
5 / 100
 5000 ms 48900 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long 
#define FOR(i,s,e) for(int i = s; i <= (int)e; ++i)
#define DEC(i,s,e) for(int i = s; i >= (int)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
#define db(x) cerr << #x << "=" << x << "\n"
#define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n"
#define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n"
#define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n"
#define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{"  << ite.f << ',' << ite.s << "} "; cerr << "\n"
#define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n"
#define reach cerr << "LINE: " << __LINE__ << "\n";
#else
#define reach 
#define db(x)
#define db2(x,y)
#define db3(a,b,c)
#define dbv(v)
#define dbvp(v)
#define dba(a,ss,ee)
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define f first 
#define s second
#define g0(x) get<0>(x)
#define g1(x) get<1>(x)
#define g2(x) get<2>(x)
#define g3(x) get<3>(x)
typedef pair <int, int> pi;
typedef tuple<int,int,int> ti3;
typedef tuple<int,int,int,int> ti4;
int rand(int a, int b) { return a + rng() % (b-a+1); }
const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 500;
const long long oo = (long long)1e18 + 500;
template <typename T> void chmax(T& a, const T b) { a=max(a,b); }
template <typename T> void chmin(T& a, const T b) { a=min(a,b); }
const int MAXN = 120005;
int q; 
vector<int> adj[MAXN];
int S[MAXN], T[MAXN];
int dep[MAXN];
int twok[MAXN][20];
int pre[MAXN], post[MAXN];
int cnt;
int lift(int x, int k) {
	FOR(i,0,19){
		if((1<<i)&k)x=twok[x][i];
		if(x==-1)return -1;
	}
	return x;
}
int lca(int x, int y) {
	if(dep[x]>dep[y]) {
		int dd=dep[x]-dep[y];
		x=lift(x,dd);
	} else {
		int dd=dep[y]-dep[x];
		y=lift(y,dd);
	}
	if(x==y)return x;
	DEC(i,19,0){
		if(twok[x][i]!=twok[y][i]){
			x=twok[x][i];
			y=twok[y][i];
		}
	}
	return twok[x][0];
}
void dfs(int x, int p, int lvl) {
	pre[x]=cnt++;
	dep[x]=lvl;
	twok[x][0]=p;
	FOR(i,1,19){
		if(twok[x][i-1] == -1)continue;
		twok[x][i]=twok[twok[x][i-1]][i-1];
	}
	for(auto v:adj[x])if(v!=p) {
		dfs(v,x,lvl+1);
	}
	post[x]=cnt-1;
}
set<int> V[MAXN];
bool ispar(int par, int child) {
	if(pre[par]<=pre[child] && post[par]>=post[child]) return 1;
	else return 0;
}
bool onpath(int x, int y, int node) {
	int par=lca(x,y); 
	if(ispar(par,node) && (ispar(node, x) || ispar(node, y))) return 1;
	else return 0;
}
int vis[MAXN];
bool dfs(int x) {
	bool res=0;
	if(vis[x] == 2) {
		return 1;
	}
	vis[x]=2; // active
	for(auto v:V[x]){ 
		if(vis[v] == 2) return 1;
		if(vis[v] == 1) continue;
		else chmax(res, dfs(v));
	}
	vis[x]=1;
	return res;
}
void solve(){
	int n; cin >> n;
	FOR(i,1,n-1) {
		int a,b; cin >> a >> b;
		adj[a].pb(b);
		adj[b].pb(a);
	}
	dfs(1,-1,0);
	int m; cin >> m;
	FOR(i,1,m) cin >> S[i] >> T[i];
	bool bad=0;
	FOR(i,1,m){
		FOR(j,1,m){
			if(i!=j) {
				// check if there's an edge between i and j
				bool y1=onpath(S[i],T[i],S[j]);
				bool y2=onpath(S[i],T[i],T[j]);
				if(y1&&y2){
					
					bad=1;
					goto done;
				}
				if(y1) { // you must do j before i
					V[j].insert(i);
				} 
				if(y2) { // you must do j after i
					V[i].insert(j);
				}
			}
		}
	}
	FOR(i,1,m) {
		dbv(V[i]);
	}
	
	FOR(i,1,m) {
		if(!vis[i])chmax(bad, dfs(i));
	}
	done:;
	if(bad)cout<<"No\n";
	else cout<<"Yes\n";

	cnt=0;
	FOR(i,1,n)FOR(j,0,19)twok[i][j]=-1;
	FOR(i,1,n)pre[i]=post[i]=0;
	FOR(i,1,n)dep[i]=0;
	FOR(i,1,m)vis[i]=0;
	FOR(i,1,m)V[i].clear();
	FOR(i,1,n)S[i]=T[i]=0;
	FOR(i,1,n)adj[i].clear();
}
int32_t main() 
{
	IAMSPEED
	cin >> q;
	while(q--)solve();

}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8788 KB Output is correct
2 Correct 5 ms 8812 KB Output is correct
3 Correct 5 ms 8800 KB Output is correct
4 Correct 14 ms 9096 KB Output is correct
5 Correct 23 ms 9468 KB Output is correct
6 Correct 6 ms 8832 KB Output is correct
7 Correct 6 ms 8916 KB Output is correct
8 Correct 12 ms 9060 KB Output is correct
9 Correct 212 ms 17560 KB Output is correct
10 Correct 99 ms 48900 KB Output is correct
11 Correct 10 ms 8916 KB Output is correct
12 Correct 50 ms 9724 KB Output is correct
13 Execution timed out 5061 ms 44500 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8788 KB Output is correct
2 Correct 5 ms 8788 KB Output is correct
3 Correct 6 ms 8916 KB Output is correct
4 Correct 5 ms 8924 KB Output is correct
5 Correct 8 ms 8916 KB Output is correct
6 Correct 6 ms 8916 KB Output is correct
7 Correct 6 ms 8916 KB Output is correct
8 Correct 7 ms 8916 KB Output is correct
9 Correct 7 ms 8916 KB Output is correct
10 Correct 7 ms 8916 KB Output is correct
11 Correct 6 ms 8916 KB Output is correct
12 Correct 5 ms 8788 KB Output is correct
13 Correct 5 ms 8788 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8788 KB Output is correct
2 Correct 5 ms 8788 KB Output is correct
3 Correct 6 ms 8916 KB Output is correct
4 Correct 5 ms 8924 KB Output is correct
5 Correct 8 ms 8916 KB Output is correct
6 Correct 6 ms 8916 KB Output is correct
7 Correct 6 ms 8916 KB Output is correct
8 Correct 7 ms 8916 KB Output is correct
9 Correct 7 ms 8916 KB Output is correct
10 Correct 7 ms 8916 KB Output is correct
11 Correct 6 ms 8916 KB Output is correct
12 Correct 5 ms 8788 KB Output is correct
13 Correct 5 ms 8788 KB Output is correct
14 Correct 5 ms 8788 KB Output is correct
15 Correct 5 ms 8788 KB Output is correct
16 Correct 6 ms 8916 KB Output is correct
17 Correct 6 ms 8924 KB Output is correct
18 Correct 6 ms 8916 KB Output is correct
19 Correct 5 ms 8800 KB Output is correct
20 Correct 6 ms 8916 KB Output is correct
21 Correct 6 ms 8924 KB Output is correct
22 Correct 6 ms 8940 KB Output is correct
23 Correct 5 ms 8788 KB Output is correct
24 Incorrect 5 ms 8888 KB Output isn't correct
25 Halted 0 ms 0 KB -

Subtask #4
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8788 KB Output is correct
2 Correct 5 ms 8788 KB Output is correct
3 Correct 6 ms 8916 KB Output is correct
4 Correct 5 ms 8924 KB Output is correct
5 Correct 8 ms 8916 KB Output is correct
6 Correct 6 ms 8916 KB Output is correct
7 Correct 6 ms 8916 KB Output is correct
8 Correct 7 ms 8916 KB Output is correct
9 Correct 7 ms 8916 KB Output is correct
10 Correct 7 ms 8916 KB Output is correct
11 Correct 6 ms 8916 KB Output is correct
12 Correct 5 ms 8788 KB Output is correct
13 Correct 5 ms 8788 KB Output is correct
14 Correct 5 ms 8788 KB Output is correct
15 Correct 5 ms 8788 KB Output is correct
16 Correct 6 ms 8916 KB Output is correct
17 Correct 6 ms 8924 KB Output is correct
18 Correct 6 ms 8916 KB Output is correct
19 Correct 5 ms 8800 KB Output is correct
20 Correct 6 ms 8916 KB Output is correct
21 Correct 6 ms 8924 KB Output is correct
22 Correct 6 ms 8940 KB Output is correct
23 Correct 5 ms 8788 KB Output is correct
24 Incorrect 5 ms 8888 KB Output isn't correct
25 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8788 KB Output is correct
2 Correct 5 ms 8788 KB Output is correct
3 Correct 6 ms 8916 KB Output is correct
4 Correct 5 ms 8924 KB Output is correct
5 Correct 8 ms 8916 KB Output is correct
6 Correct 6 ms 8916 KB Output is correct
7 Correct 6 ms 8916 KB Output is correct
8 Correct 7 ms 8916 KB Output is correct
9 Correct 7 ms 8916 KB Output is correct
10 Correct 7 ms 8916 KB Output is correct
11 Correct 6 ms 8916 KB Output is correct
12 Correct 5 ms 8788 KB Output is correct
13 Correct 5 ms 8788 KB Output is correct
14 Correct 5 ms 8788 KB Output is correct
15 Correct 5 ms 8788 KB Output is correct
16 Correct 6 ms 8916 KB Output is correct
17 Correct 6 ms 8924 KB Output is correct
18 Correct 6 ms 8916 KB Output is correct
19 Correct 5 ms 8800 KB Output is correct
20 Correct 6 ms 8916 KB Output is correct
21 Correct 6 ms 8924 KB Output is correct
22 Correct 6 ms 8940 KB Output is correct
23 Correct 5 ms 8788 KB Output is correct
24 Incorrect 5 ms 8888 KB Output isn't correct
25 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8788 KB Output is correct
2 Correct 4 ms 8744 KB Output is correct
3 Correct 5 ms 8716 KB Output is correct
4 Correct 7 ms 8800 KB Output is correct
5 Correct 13 ms 9044 KB Output is correct
6 Correct 6 ms 8788 KB Output is correct
7 Correct 5 ms 8812 KB Output is correct
8 Correct 5 ms 8800 KB Output is correct
9 Correct 6 ms 8788 KB Output is correct
10 Incorrect 5 ms 8788 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8788 KB Output is correct
2 Correct 5 ms 8812 KB Output is correct
3 Correct 5 ms 8800 KB Output is correct
4 Correct 14 ms 9096 KB Output is correct
5 Correct 23 ms 9468 KB Output is correct
6 Correct 6 ms 8832 KB Output is correct
7 Correct 6 ms 8916 KB Output is correct
8 Correct 12 ms 9060 KB Output is correct
9 Correct 212 ms 17560 KB Output is correct
10 Correct 99 ms 48900 KB Output is correct
11 Correct 10 ms 8916 KB Output is correct
12 Correct 50 ms 9724 KB Output is correct
13 Execution timed out 5061 ms 44500 KB Time limit exceeded
14 Halted 0 ms 0 KB -