Submission #763974

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
763974	2023-06-23T04:18:57 Z	pavement	Torrent (COI16_torrent)	C++17	69 / 100	1287 ms	33304 KB

torrent

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
#define g4(a) get<4>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
using db = double;
using ll = long long;
using ld = long double;
using ii = pair<int, int>;
using iii = tuple<int, int, int>;
using iiii = tuple<int, int, int, int>;
using iiiii = tuple<int, int, int, int, int>;
template<class key, class value = null_type, class cmp = less<key> >
using ordered_set = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;

int n, a, b, ans = LLONG_MAX, u[300005], v[300005];
bool mrk[300005];
vector<int> edges;
vector<ii> adj[300005];

void col(int u, bool c, int x, int e = -1) {
	mrk[u] = c;
	for (auto [v, idx] : adj[u]) if (v != e && idx != x) {
		col(v, c, x, u);
	}
}

int dp(int n, int e = -1) {
	vector<int> vec;
	int ret = 0;
	for (auto [u, _] : adj[n]) if (u != e && mrk[n] == mrk[u]) {
		vec.pb(dp(u, n));
	}
	sort(vec.begin(), vec.end(), greater<int>());
	for (int i = 0; i < (int)vec.size(); i++) {
		ret = max(ret, vec[i] + i + 1);
	}
	return ret;
}

int split(int x) {
	col(a, 0, x);
	col(b, 1, x);
	return max(dp(a), dp(b));
}

bool get_edges(int u, int ed, int e = -1) {
	if (u == ed) return 1;
	for (auto [v, idx] : adj[u]) if (v != e) {
		if (get_edges(v, ed, u)) {
			edges.pb(idx);
			return 1;
		}
	}
	return 0;
}

bool is_bitonic(vector<int> v) {
	vector<bool> tmp;
	for (int i = 1; i < (int)v.size(); i++) {
		if (v[i] < v[i - 1]) {
			tmp.pb(0);
		} else if (v[i] > v[i - 1]) {
			tmp.pb(1);
		}
	}
	return is_sorted(tmp.begin(), tmp.end());
}

main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> a >> b;
	for (int i = 1; i < n; i++) {
		cin >> u[i] >> v[i];
		adj[u[i]].eb(v[i], i);
		adj[v[i]].eb(u[i], i);
	}
	get_edges(a, b);
	int l = 0, r = (int)edges.size() - 1, ans = LLONG_MAX;
	while (r - l >= 3) {
		int m1 = l + (r - l) / 3;
		int m2 = r - (r - l) / 3;
		int f1 = split(edges[m1]);
		int f2 = split(edges[m2]);
		if (f1 > f2) l = m1;
		else r = m2;
	}
	for (int i = l; i <= r; i++) {
		ans = min(ans, split(edges[i]));
	}
	cout << ans << '\n';
}

Compilation message

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

Subtask #1

0 / 31.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	4 ms	7380 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #2

69.0 / 69.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1245 ms	29184 KB	Output is correct
2	Correct	1287 ms	30508 KB	Output is correct
3	Correct	1088 ms	32576 KB	Output is correct
4	Correct	1248 ms	31684 KB	Output is correct
5	Correct	1286 ms	28960 KB	Output is correct
6	Correct	1212 ms	29724 KB	Output is correct
7	Correct	1064 ms	33304 KB	Output is correct