oj.uz

답안 #965256

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
965256 2024-04-18T08:58:36 Z vjudge1 Jail (JOI22_jail) C++17
0 / 100
 123 ms 896 KB 
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #include <x86intrin.h>

#include <bits/stdc++.h>
#include <chrono>
#include <random>

// @author: Vlapos

namespace operators
{
	template <typename T1, typename T2>
	std::istream &operator>>(std::istream &in, std::pair<T1, T2> &x)
	{
		in >> x.first >> x.second;
		return in;
	}

	template <typename T1, typename T2>
	std::ostream &operator<<(std::ostream &out, std::pair<T1, T2> x)
	{
		out << x.first << " " << x.second;
		return out;
	}

	template <typename T1>
	std::istream &operator>>(std::istream &in, std::vector<T1> &x)
	{
		for (auto &i : x)
			in >> i;
		return in;
	}

	template <typename T1>
	std::ostream &operator<<(std::ostream &out, std::vector<T1> &x)
	{
		for (auto &i : x)
			out << i << " ";
		return out;
	}

	template <typename T1>
	std::ostream &operator<<(std::ostream &out, std::set<T1> &x)
	{
		for (auto &i : x)
			out << i << " ";
		return out;
	}
}

// name spaces
using namespace std;
using namespace operators;
// end of name spaces

// defines
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define f first
#define s second
#define uint unsigned int
#define all(vc) vc.begin(), vc.end()
// end of defines

// usefull stuff

void boost()
{
	ios_base ::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
}

inline int getbit(int &x, int &bt) { return (x >> bt) & 1; }

const int dx4[4] = {-1, 0, 0, 1};
const int dy4[4] = {0, -1, 1, 0};
const int dx8[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
const int dy8[8] = {-1, -0, 1, -1, 1, -1, 0, 1};

const ll INF = (1e18) + 500;
const int BIG = (1e9) * 2 + 100;
const int MAXN = (1e5) + 5;
const int MOD7 = (1e9) + 7;
const int MOD9 = (1e9) + 9;
const uint MODFFT = 998244353;

// #define int ll

struct test
{
	vector<vector<int>> tree, G;
	vector<vector<int>> jump, jumpE, IDS, IDE;
	vector<int> tin, tout, was;
	int CNT = 0;
	int n;

	int timer = 0;

	bool isP(int pr, int v)
	{
		return tin[pr] <= tin[v] and tout[v] <= tout[pr];
	}

	void dfs(int v, int pr = 0)
	{
		tin[v] = ++timer;

		jump[v][0] = pr;
		{
			IDS[v][0] = CNT;
			G[CNT].pb(n + v);
			// G[CNT].pb(n + pr);
			CNT++;

			IDE[v][0] = CNT;
			G[n * 2 + v].pb(CNT);
			G[n * 2 + pr].pb(CNT);
			CNT++;
		}

		for (int k = 1; k < 17; ++k)
		{
			jump[v][k] = jump[jump[v][k - 1]][k - 1];
			{
				IDS[v][k] = CNT;
				G[CNT].pb(IDS[v][k - 1]);
				G[CNT].pb(IDS[jump[v][k - 1]][k - 1]);
				CNT++;

				IDE[v][k] = CNT;
				G[IDE[v][k - 1]].pb(CNT);
				G[IDE[jump[v][k - 1]][k - 1]].pb(CNT);
				CNT++;
			}
		}

		for (auto tov : tree[v])
			if (tov != pr)
				dfs(tov, v);

		tout[v] = ++timer;
	}

	void makeEdges(int v, int tov, int i)
	{
		{
			if (!isP(v, tov))
			{
				int st = jump[v][0];
				for (int k = 16; k >= 0; --k)
					if (!isP(jump[st][k], tov))
					{
						// cout << i << " -> " << st << " " << k << "\n";
						G[i].pb(IDS[st][k]);
						st = jump[st][k];
					}
				// cout << i << " -> " << st << " " << 0 << "\n";
				G[i].pb(IDS[st][0]);
			}
			if (!isP(tov, v))
			{
				int st = tov;
				G[i].pb(n + tov);
				for (int k = 16; k >= 0; --k)
					if (!isP(jump[st][k], v))
					{
						// cout << i << " -> " << st << " " << k << "\n";
						G[i].pb(IDS[st][k]);
						st = jump[st][k];
					}
			}
		}
		{
			if (!isP(v, tov))
			{
				int st = v;
				G[2 * n + v].pb(i);
				for (int k = 16; k >= 0; --k)
					if (!isP(jump[st][k], tov))
					{
						// cout << st << " " << k << " -> " << i << "!\n";
						G[IDE[st][k]].pb(i);
						st = jump[st][k];
					}
			}
			if (!isP(tov, v))
			{
				int st = jump[tov][0];
				for (int k = 16; k >= 0; --k)
					if (!isP(jump[st][k], v))
					{
						// cout << st << " " << k << " -> " << i << "!\n";
						G[IDE[st][k]].pb(i);
						st = jump[st][k];
					}
				// cout << st << " " << 0 << " -> " << i << "!\n";
				G[IDE[st][0]].pb(i);
			}
		}
	}

	bool DFS(int v)
	{
		was[v] = 1;
		for (auto tov : G[v])
			if (was[tov] == 1 or (!was[tov] and DFS(tov)))
				return true;

		was[v] = 2;
		return false;
	}

	void solve(int testcase)
	{
		boost();

		cin >> n;
		CNT = 3 * n;
		G.resize(17 * 2 * n + 3 * n);
		was.resize(17 * 2 * n + 3 * n);
		jump.resize(n, vector<int>(17));
		IDS.resize(n, vector<int>(17));
		IDE.resize(n, vector<int>(17));
		tree.resize(n);
		tin.resize(n);
		tout.resize(n);

		for (int i = 1; i < n; ++i)
		{
			int v, tov;
			cin >> v >> tov;
			--v, --tov;
			tree[v].pb(tov);
			tree[tov].pb(v);
		}

		dfs(0);
		int m;
		cin >> m;
		vector<pii> els;
		for (int i = 0; i < m; ++i)
		{
			int v, tov;
			cin >> v >> tov;
			--v, --tov;

			G[n + v].pb(i);
			G[i].pb(2 * n + tov);
			makeEdges(v, tov, i);
		}

		bool good = true;

		for (int i = 0; i < n; ++i)
			if (!was[i] and DFS(i))
			{
				good = false;
				break;
			}

		if (good)
			cout << "Yes\n";
		else
			cout << "No\n";
	}
};

main()
{
	boost();
	int q = 1;
	cin >> q;
	for (int i = 0; i < q; i++)
	{
		test t;
		t.solve(i);
	}
	return 0;
}
//[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]//
//                                                                                    //
//                               Coded by Der_Vlἀpos                                  //
//                                                                                    //
//[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]//

Compilation message

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

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Incorrect 123 ms 740 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 12 ms 896 KB Output is correct
4 Incorrect 11 ms 896 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 12 ms 896 KB Output is correct
4 Incorrect 11 ms 896 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 12 ms 896 KB Output is correct
4 Incorrect 11 ms 896 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 12 ms 896 KB Output is correct
4 Incorrect 11 ms 896 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 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 1 ms 348 KB Output is correct
5 Incorrect 53 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Incorrect 123 ms 740 KB Output isn't correct
5 Halted 0 ms 0 KB -