Submission #1067751

#	Time	Username	Problem	Language	Result	Execution time	Memory
1067751		sleepntsheep	Torrent (COI16_torrent)	C++17	31 / 100	61 ms	19284 KiB

torrent

#include <cstdio>
#include <numeric>
#include <algorithm>
#include <climits>
#include <vector>

using namespace std;
template <typename T>
using ve = vector<T>;

#define N 300005

int ans = INT_MAX;
int n, a, b, cb[N], dp[N], par[N];
ve<int> g[N], ab;

void dfs(int u, int p) {
	par[u] = p;
	for (auto v : g[u]) if (v != p) dfs(v, u);
}

void efs(int u, int p) {
	dp[u] = 0;

	ve<int> chdp;
	for (auto v : g[u]) if (v != p) {
		efs(v, u);
		chdp.push_back(dp[v]);
	}

	sort(chdp.begin(), chdp.end(), greater<>());

	for (int i = 0; i < (int)chdp.size(); ++i) 
		dp[u] = max(dp[u], chdp[i] + i + 1);

}

void Del(int u, int v) {
	g[u].erase(find(g[u].begin(), g[u].end(), v));
	g[v].erase(find(g[v].begin(), g[v].end(), u));
}
void Ins(int u, int v) {
	g[u].push_back(v), g[v].push_back(u);
}


int Cut_At(int i){
	Del(ab[i], par[ab[i]]);
	efs(a, -1), efs(b, -1);
	int z = max(dp[a], dp[b]);
	Ins(ab[i], par[ab[i]]);
	return z;
}

int main() {
	scanf("%d%d%d", &n, &a, &b);
	for (int u, v, i = 1; i < n; ++i) scanf("%d%d", &u, &v), Ins(u, v);

	dfs(a, -1);

	for (int c = par[b]; c != a; c = par[c]) ab.push_back(c);
	reverse(ab.begin(), ab.end());
	ab.push_back(b);

	if (ab.size() <= 1000) {
		for (int i = 0; i < (int)ab.size(); ++i) ans = min(ans, Cut_At(i));
	} else {
	}

	printf("%d\n", ans);
	return 0;
}

Compilation message (stderr)

torrent.cpp: In function 'int main()':
torrent.cpp:56:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |  scanf("%d%d%d", &n, &a, &b);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
torrent.cpp:57:41: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |  for (int u, v, i = 1; i < n; ++i) scanf("%d%d", &u, &v), Ins(u, v);
      |                                    ~~~~~^~~~~~~~~~~~~~~~

• Subtask 1: 31 / 31
• Subtask 2: 0 / 69