oj.uz

답안 #1087059

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1087059 2024-09-12T07:04:30 Z FucKanh Torrent (COI16_torrent) C++14
69 / 100
 245 ms 31936 KB 
#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) {
    vst[u] = 1;
    for (int v : a[u]) {
        if (v == pa[u]) continue;
        if (!vst[v]) {
            pa[v] = u;
            dfs(v);
        }
    }
}

int dp(int u, int cnt) {
    vst[u] = 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;
        if (vst[v] != cnt) {
            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);
    }

    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;
//
//    if (E.size() <= 1000) {
//        for (int mid= 0; mid < E.size(); mid++) {
//
//            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));
//        }
//        cout << ans;
//        return;
//    }

    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

torrent.cpp: In function 'long long int dp(long long int, long long int)':
torrent.cpp:40: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]
   40 |     for (int i = 0; i < vec.size(); i++) {
      |                     ~~^~~~~~~~~~~~
torrent.cpp: In function 'void solve()':
torrent.cpp:81:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   81 |         int mid = l + r >> 1;
      |                   ~~^~~

Subtask #1
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 7512 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
69.0 / 69.0

# 결과 실행 시간 메모리 Grader output
1 Correct 231 ms 25916 KB Output is correct
2 Correct 239 ms 27592 KB Output is correct
3 Correct 237 ms 30216 KB Output is correct
4 Correct 237 ms 28400 KB Output is correct
5 Correct 245 ms 25296 KB Output is correct
6 Correct 216 ms 26212 KB Output is correct
7 Correct 229 ms 31936 KB Output is correct