oj.uz

답안 #965213

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
965213 2024-04-18T08:19:55 Z vjudge1 Jail (JOI22_jail) C++17
72 / 100
 3551 ms 1048576 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 * 3 + v].pb(CNT);
		// 	G[n * 3 + pr].pb(CNT);
		// 	CNT++;
		// }

		// for (int k = 1; k < 20; ++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 ST, int E)
	{

		if (!isP(ST, E))
		{
			int v = jump[ST][0];
			for (int k = 19; k >= 0; --k)
				if (!isP(jump[v][k], E))
				{
					G[ST].pb(IDS[v][k]);
					v = jump[v][k];
				}
			if (!isP(v, E))
			{
				G[ST].pb(v);
				v = jump[v][0];
			}
			assert(isP(v, E));
			G[ST].pb(v);
		}
		if (!isP(E, ST))
		{
			int v = E;
			for (int k = 19; k >= 0; --k)
				if (!isP(jump[v][k], ST))
				{
					G[ST].pb(IDS[v][k]);
					v = jump[v][k];
				}
			G[ST].pb(v);
		}
	}

	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(n * 25);
		was.resize(n * 25);
		jump.resize(n, vector<int>(20));
		IDS.resize(n, vector<int>(20));
		IDE.resize(n, vector<int>(20));
		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;
			// els.pb({v, tov});
			// makeEdges(v, tov);
			// cout << i << " -> " << n + v << '\n';
			G[n + v].pb(i);
			// cout << 2 * n + tov << " -> " << i << '\n';
			G[i].pb(2 * n + tov);
			{
				if (!isP(v, tov))
				{
					int st = jump[v][0];
					while (!isP(st, tov))
					{
						G[i].pb(n + st);
						// cout << i << " -> " << n + st << '\n';
						st = jump[st][0];
					}
					// cout << i << " -> " << n + st << '\n';
					G[i].pb(n + st);
				}
				if (!isP(tov, v))
				{
					int st = tov;
					while (!isP(st, v))
					{
						// cout << i << " -> " << n + st << '\n';
						G[i].pb(n + st);
						st = jump[st][0];
					}
				}
			}
			{
				if (!isP(v, tov))
				{
					int st = v;
					while (!isP(st, tov))
					{
						G[2 * n + st].pb(i);
						st = jump[st][0];
						// cout << 2 * n + st << " -> " << i << '\n';
					}
				}
				if (!isP(tov, v))
				{
					int st = jump[tov][0];
					while (!isP(st, v))
					{
						// cout << n * 2 + st << " -> " << i << '\n';
						G[n * 2 + st].pb(i);
						st = jump[st][0];
					}
					// cout << n * 2 + st << " -> " << i << '\n';
					G[n * 2 + st].pb(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:299:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  299 | main()
      | ^~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 23 ms 940 KB Output is correct
5 Correct 60 ms 1116 KB Output is correct
6 Correct 4 ms 712 KB Output is correct
7 Correct 3 ms 712 KB Output is correct
8 Correct 5 ms 900 KB Output is correct
9 Correct 249 ms 34180 KB Output is correct
10 Correct 2524 ms 614564 KB Output is correct
11 Correct 15 ms 600 KB Output is correct
12 Correct 79 ms 1616 KB Output is correct
13 Correct 279 ms 213284 KB Output is correct
14 Correct 312 ms 244508 KB Output is correct
15 Runtime error 3551 ms 1048576 KB Execution killed with signal 9
16 Halted 0 ms 0 KB -

Subtask #2
5.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 2 ms 712 KB Output is correct
4 Correct 3 ms 712 KB Output is correct
5 Correct 3 ms 712 KB Output is correct
6 Correct 2 ms 964 KB Output is correct
7 Correct 3 ms 712 KB Output is correct
8 Correct 2 ms 712 KB Output is correct
9 Correct 2 ms 724 KB Output is correct
10 Correct 2 ms 712 KB Output is correct
11 Correct 2 ms 708 KB Output is correct
12 Correct 1 ms 708 KB Output is correct
13 Correct 2 ms 712 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 712 KB Output is correct
4 Correct 3 ms 712 KB Output is correct
5 Correct 3 ms 712 KB Output is correct
6 Correct 2 ms 964 KB Output is correct
7 Correct 3 ms 712 KB Output is correct
8 Correct 2 ms 712 KB Output is correct
9 Correct 2 ms 724 KB Output is correct
10 Correct 2 ms 712 KB Output is correct
11 Correct 2 ms 708 KB Output is correct
12 Correct 1 ms 708 KB Output is correct
13 Correct 2 ms 712 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 804 KB Output is correct
16 Correct 4 ms 712 KB Output is correct
17 Correct 3 ms 712 KB Output is correct
18 Correct 3 ms 712 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 3 ms 712 KB Output is correct
21 Correct 2 ms 708 KB Output is correct
22 Correct 2 ms 708 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 3 ms 712 KB Output is correct
26 Correct 1 ms 712 KB Output is correct
27 Correct 3 ms 712 KB Output is correct
28 Correct 1 ms 348 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 712 KB Output is correct
4 Correct 3 ms 712 KB Output is correct
5 Correct 3 ms 712 KB Output is correct
6 Correct 2 ms 964 KB Output is correct
7 Correct 3 ms 712 KB Output is correct
8 Correct 2 ms 712 KB Output is correct
9 Correct 2 ms 724 KB Output is correct
10 Correct 2 ms 712 KB Output is correct
11 Correct 2 ms 708 KB Output is correct
12 Correct 1 ms 708 KB Output is correct
13 Correct 2 ms 712 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 804 KB Output is correct
16 Correct 4 ms 712 KB Output is correct
17 Correct 3 ms 712 KB Output is correct
18 Correct 3 ms 712 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 3 ms 712 KB Output is correct
21 Correct 2 ms 708 KB Output is correct
22 Correct 2 ms 708 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 3 ms 712 KB Output is correct
26 Correct 1 ms 712 KB Output is correct
27 Correct 3 ms 712 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 5 ms 968 KB Output is correct
30 Correct 4 ms 712 KB Output is correct
31 Correct 4 ms 712 KB Output is correct
32 Correct 4 ms 712 KB Output is correct
33 Correct 2 ms 712 KB Output is correct
34 Correct 3 ms 748 KB Output is correct
35 Correct 4 ms 604 KB Output is correct
36 Correct 2 ms 588 KB Output is correct
37 Correct 2 ms 712 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 712 KB Output is correct
4 Correct 3 ms 712 KB Output is correct
5 Correct 3 ms 712 KB Output is correct
6 Correct 2 ms 964 KB Output is correct
7 Correct 3 ms 712 KB Output is correct
8 Correct 2 ms 712 KB Output is correct
9 Correct 2 ms 724 KB Output is correct
10 Correct 2 ms 712 KB Output is correct
11 Correct 2 ms 708 KB Output is correct
12 Correct 1 ms 708 KB Output is correct
13 Correct 2 ms 712 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 804 KB Output is correct
16 Correct 4 ms 712 KB Output is correct
17 Correct 3 ms 712 KB Output is correct
18 Correct 3 ms 712 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 3 ms 712 KB Output is correct
21 Correct 2 ms 708 KB Output is correct
22 Correct 2 ms 708 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 3 ms 712 KB Output is correct
26 Correct 1 ms 712 KB Output is correct
27 Correct 3 ms 712 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 5 ms 968 KB Output is correct
30 Correct 4 ms 712 KB Output is correct
31 Correct 4 ms 712 KB Output is correct
32 Correct 4 ms 712 KB Output is correct
33 Correct 2 ms 712 KB Output is correct
34 Correct 3 ms 748 KB Output is correct
35 Correct 4 ms 604 KB Output is correct
36 Correct 2 ms 588 KB Output is correct
37 Correct 2 ms 712 KB Output is correct
38 Correct 270 ms 34360 KB Output is correct
39 Correct 2422 ms 614616 KB Output is correct
40 Correct 154 ms 13420 KB Output is correct
41 Correct 60 ms 8348 KB Output is correct
42 Correct 106 ms 14080 KB Output is correct
43 Correct 49 ms 8252 KB Output is correct
44 Correct 14 ms 1808 KB Output is correct
45 Correct 105 ms 134736 KB Output is correct
46 Correct 106 ms 134912 KB Output is correct
47 Correct 557 ms 222916 KB Output is correct
48 Correct 641 ms 225708 KB Output is correct
49 Correct 135 ms 139440 KB Output is correct
50 Correct 142 ms 139348 KB Output is correct
51 Correct 83 ms 134520 KB Output is correct
52 Correct 80 ms 134552 KB Output is correct
53 Correct 18 ms 9612 KB Output is correct
54 Correct 93 ms 133972 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 12 ms 600 KB Output is correct
6 Correct 1 ms 768 KB Output is correct
7 Correct 2 ms 708 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 3 ms 604 KB Output is correct
13 Correct 44 ms 1104 KB Output is correct
14 Correct 67 ms 1360 KB Output is correct
15 Correct 51 ms 1108 KB Output is correct
16 Correct 122 ms 137000 KB Output is correct
17 Correct 256 ms 149424 KB Output is correct
18 Correct 399 ms 165756 KB Output is correct
19 Correct 158 ms 140252 KB Output is correct
20 Correct 154 ms 140368 KB Output is correct
21 Correct 159 ms 140276 KB Output is correct
22 Correct 223 ms 150588 KB Output is correct
23 Correct 226 ms 150128 KB Output is correct
24 Correct 242 ms 151084 KB Output is correct
25 Correct 209 ms 151428 KB Output is correct
26 Correct 214 ms 151348 KB Output is correct
27 Correct 243 ms 152012 KB Output is correct
28 Correct 226 ms 153544 KB Output is correct
29 Correct 213 ms 150344 KB Output is correct
30 Correct 204 ms 145040 KB Output is correct
31 Correct 177 ms 145600 KB Output is correct
32 Correct 187 ms 143056 KB Output is correct
33 Correct 209 ms 143812 KB Output is correct

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 23 ms 940 KB Output is correct
5 Correct 60 ms 1116 KB Output is correct
6 Correct 4 ms 712 KB Output is correct
7 Correct 3 ms 712 KB Output is correct
8 Correct 5 ms 900 KB Output is correct
9 Correct 249 ms 34180 KB Output is correct
10 Correct 2524 ms 614564 KB Output is correct
11 Correct 15 ms 600 KB Output is correct
12 Correct 79 ms 1616 KB Output is correct
13 Correct 279 ms 213284 KB Output is correct
14 Correct 312 ms 244508 KB Output is correct
15 Runtime error 3551 ms 1048576 KB Execution killed with signal 9
16 Halted 0 ms 0 KB -