oj.uz

답안 #1113813

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1113813 2024-11-17T13:43:19 Z _callmelucian Torrent (COI16_torrent) C++14
100 / 100
 320 ms 46072 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pl;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tpl;

#define all(a) a.begin(), a.end()
#define filter(a) a.erase(unique(all(a)), a.end())

const int mn = 3e5 + 5;
int up[mn][19];
vector<int> adj[mn];

void preDfs (int u, int p) {
    up[u][0] = p;
    for (int i = 1; i < 19; i++)
        up[u][i] = up[up[u][i - 1]][i - 1];
    for (int v : adj[u])
        if (v != p) preDfs(v, u);
}

int solve (int u, int p, int block) {
    vector<int> line;
    for (int v : adj[u])
        if (v != p && v != block) line.push_back(solve(v, u, block));
    sort(all(line), greater<int>());

    int ans = 0;
    for (int i = 0; i < line.size(); i++) ans = max(ans, line[i] + i + 1);
    return ans;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    int n, u, v; cin >> n >> u >> v;
    for (int i = 1; i < n; i++) {
        int a, b; cin >> a >> b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    preDfs(u, u);

    int ans = max(solve(u, u, v), solve(v, v, up[v][0])), optNode = v;
    for (int i = 18; i >= 0; i--) {
        if (up[optNode][i] == u) continue;
        int tmp = up[optNode][i], calcU = solve(u, u, tmp), calcV = solve(v, v, up[tmp][0]);
        if (calcU >= calcV)
            optNode = tmp, ans = max(calcU, calcV);
    }

    if (up[optNode][0] != u)
        ans = min(ans, max(solve(u, u, up[optNode][0]), solve(v, v, up[optNode][1])));
    cout << ans;

    return 0;
}

Compilation message

torrent.cpp: In function 'int solve(int, int, int)':
torrent.cpp:32:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |     for (int i = 0; i < line.size(); i++) ans = max(ans, line[i] + i + 1);
      |                     ~~^~~~~~~~~~~~~

Subtask #1
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8784 KB Output is correct
2 Correct 3 ms 8960 KB Output is correct
3 Correct 3 ms 8784 KB Output is correct

Subtask #2
69.0 / 69.0

# 결과 실행 시간 메모리 Grader output
1 Correct 273 ms 42020 KB Output is correct
2 Correct 270 ms 43336 KB Output is correct
3 Correct 292 ms 45640 KB Output is correct
4 Correct 320 ms 44152 KB Output is correct
5 Correct 295 ms 41228 KB Output is correct
6 Correct 272 ms 42044 KB Output is correct
7 Correct 264 ms 46072 KB Output is correct