oj.uz

Submission #963989

# Submission time Handle Problem Language Result Execution time Memory
963989 2024-04-16T07:13:25 Z vjudge1 Meetings 2 (JOI21_meetings2) C++17
20 / 100
 4000 ms 57548 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;
	vector<int> answers, used;
	int n;

	int dfsC(int v, int szA, int pr = -1)
	{
		for (auto tov : tree[v])
			if (!used[tov] and tov != pr and szA < sz[{tov, v}] * 2)
				return dfsC(tov, szA, v);
		return v;
	}

	map<pii, int> sz;
	vector<vector<pii>> els;
	vector<int> u, MX;

	void dfsAdd(int v, int d, int pr, int RT, int A)
	{
		int P = min(sz[{v, pr}], A);
		answers[P * 2] = max(answers[P * 2], d + 1);
		els[RT].pb({sz[{v, pr}], d});
		for (auto tov : tree[v])
			if (tov != pr and !used[tov])
				dfsAdd(tov, d + 1, v, RT, A);
	}

	void doSz(int v, int pr = -1)
	{
		int cSz = 1;
		for (auto tov : tree[v])
			if (tov != pr)
			{
				doSz(tov, v);
				int toSz = sz[{tov, v}];
				cSz += toSz;
				sz[{v, tov}] = n - toSz;
			}
		if (pr != -1)
			sz[{v, pr}] = cSz;
	}

	void getAns(int v, int A)
	{
		v = dfsC(v, A);
		used[v] = 1;

		priority_queue<pii> cur;
		set<pii> WTF;

		int CNT = 0;
		for (auto tov : tree[v])
			if (!used[tov])
			{
				CNT++;
				dfsAdd(tov, 1, v, tov, n - sz[{tov, v}]);
				sort(all(els[tov]));
				reverse(all(els[tov]));
				cur.push({els[tov][0].f, tov});
				WTF.insert({1, tov});
				MX[tov] = -1;
			}
		if (CNT > 1)
		{
			while (cur.size())
			{
				pii bf = cur.top();
				cur.pop();
				auto [sz, rt] = bf;

				int cMx = WTF.begin()->s == rt ? next(WTF.begin())->f : WTF.begin()->f;
				cMx = -cMx;
				if (cMx != -1 and sz * 2 <= n)
				{
					answers[sz * 2] = max(answers[sz * 2], cMx + 1 + els[rt][u[rt]].s);
				}

				WTF.erase({-MX[rt], rt});
				MX[rt] = max(MX[rt], els[rt][u[rt]].s);
				WTF.insert({-MX[rt], rt});

				u[bf.s]++;
				if (els[bf.s].size() > u[bf.s])
					cur.push({els[bf.s][u[bf.s]].f, bf.s});
			}
		}

		for (auto tov : tree[v])
			if (!used[tov])
			{
				u[tov] = 0;
				els[tov].clear();
				els[tov].shrink_to_fit();
			}
		for (auto tov : tree[v])
			if (!used[tov])
				getAns(tov, A + 1 / 2);
	}

	void solve(int testcase)
	{
		boost();

		cin >> n;

		used.resize(n);
		tree.resize(n);
		answers.resize(n + 1);
		if (2 <= n)
			answers[2] = 2;
		MX.resize(n);
		els.resize(n);
		u.resize(n);
		for (int i = 0; i < n - 1; ++i)
		{
			int v, tov;
			cin >> v >> tov;
			--v, --tov;
			tree[v].pb(tov);
			tree[tov].pb(v);
		}

		doSz(0, -1);
		getAns(0, n);
		for (int i = (n / 2) * 2 - 2; i > 0; i -= 2)
		{
			answers[i] = max(answers[i], answers[i + 2]);
		}

		for (int i = 1; i <= n; ++i)
		{
			int cur = max(1, answers[i]);
			cout << cur << "\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

meetings2.cpp: In member function 'void test::getAns(int, int)':
meetings2.cpp:178:26: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} [-Wsign-compare]
  178 |     if (els[bf.s].size() > u[bf.s])
meetings2.cpp: At global scope:
meetings2.cpp:233:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  233 | main()
      | ^~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 452 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 464 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 452 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 464 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 16 ms 1424 KB Output is correct
23 Correct 18 ms 1624 KB Output is correct
24 Correct 17 ms 1368 KB Output is correct
25 Correct 19 ms 1372 KB Output is correct
26 Correct 17 ms 1372 KB Output is correct
27 Correct 15 ms 1372 KB Output is correct
28 Correct 14 ms 1424 KB Output is correct
29 Correct 14 ms 1372 KB Output is correct
30 Correct 13 ms 1420 KB Output is correct
31 Correct 14 ms 1372 KB Output is correct
32 Correct 583 ms 1864 KB Output is correct
33 Correct 739 ms 2532 KB Output is correct
34 Correct 11 ms 1592 KB Output is correct
35 Correct 7 ms 1628 KB Output is correct
36 Correct 35 ms 1456 KB Output is correct
37 Correct 11 ms 1624 KB Output is correct
38 Correct 158 ms 1904 KB Output is correct

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 452 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 464 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 16 ms 1424 KB Output is correct
23 Correct 18 ms 1624 KB Output is correct
24 Correct 17 ms 1368 KB Output is correct
25 Correct 19 ms 1372 KB Output is correct
26 Correct 17 ms 1372 KB Output is correct
27 Correct 15 ms 1372 KB Output is correct
28 Correct 14 ms 1424 KB Output is correct
29 Correct 14 ms 1372 KB Output is correct
30 Correct 13 ms 1420 KB Output is correct
31 Correct 14 ms 1372 KB Output is correct
32 Correct 583 ms 1864 KB Output is correct
33 Correct 739 ms 2532 KB Output is correct
34 Correct 11 ms 1592 KB Output is correct
35 Correct 7 ms 1628 KB Output is correct
36 Correct 35 ms 1456 KB Output is correct
37 Correct 11 ms 1624 KB Output is correct
38 Correct 158 ms 1904 KB Output is correct
39 Correct 2160 ms 48368 KB Output is correct
40 Correct 2041 ms 47416 KB Output is correct
41 Correct 2028 ms 48072 KB Output is correct
42 Correct 2073 ms 48976 KB Output is correct
43 Correct 2170 ms 49152 KB Output is correct
44 Correct 2104 ms 49112 KB Output is correct
45 Execution timed out 4045 ms 57548 KB Time limit exceeded
46 Halted 0 ms 0 KB -