Submission #1087065

#TimeUsernameProblemLanguageResultExecution timeMemory
1087065FucKanhTorrent (COI16_torrent)C++14
100 / 100
255 ms26812 KiB
#include<bits/stdc++.h> #define ll long long #define int ll #define pii pair<int,int> using namespace std; const int maxn = 3e5 + 2; vector<int> a[maxn]; int vst[maxn], pa[maxn]; pii del; vector<pii> E; void dfs (int u) { for (int v : a[u]) { if (v == pa[u]) continue; pa[v] = u; dfs(v); } } int dp(int u, int cnt) { vector<int> vec; // cerr << u << endl; for (int v : a[u]) { if ( make_pair( min(u,v),max(u,v) ) == del) continue; if (pa[u] == v) continue; pa[v] = u; vec.push_back(dp(v,cnt)); } int ma = 0; sort(vec.begin(), vec.end(), greater<int>()); for (int i = 0; i < vec.size(); i++) { ma = max(ma, i + 1 + vec[i]); } return ma; } void solve() { int n,m1,m2; cin >> n >> m1 >> m2; for (int i = 1; i < n; i++) { int x,y; cin >> x >> y; a[x].push_back(y); a[y].push_back(x); } if (n == 2) { cout << 0; return; } dfs(m1); int x = m2; while (x != m1) { E.push_back( { min(x,pa[x]), max(x,pa[x]) } ); x = pa[x]; } int l = 0; int r = E.size() - 1; int cnt = 2; int ans = LLONG_MAX; while (l <= r) { int mid = l + r >> 1; del = E[mid]; pa[m1] = 0; int du = dp(m1,++cnt); pa[m2] = 0; int dv = dp(m2,++cnt); ans = min(ans, max(du,dv)); if (du < dv) r = mid - 1; else l = mid + 1; } cout << ans; } signed main() { cin.tie(0) -> sync_with_stdio(0); solve(); return 0; }

Compilation message (stderr)

torrent.cpp: In function 'long long int dp(long long int, long long int)':
torrent.cpp:34:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |     for (int i = 0; i < vec.size(); i++) {
      |                     ~~^~~~~~~~~~~~
torrent.cpp: In function 'void solve()':
torrent.cpp:66:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   66 |         int mid = l + r >> 1;
      |                   ~~^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...