oj.uz

답안 #956760

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
956760 2024-04-02T12:48:00 Z uped Torrent (COI16_torrent) C++14
0 / 100
 172 ms 20596 KB 
#include <bits/stdc++.h>

#define DEBUG(x) cout << #x << ": " << x << '\n';

using namespace std;
using ll = long long;

const int N = 3e5;

int n, a, b;
vector<int> adj[N];
//int sz[N];
stack<int> on_path;
bool is_on_path[N];
vector<int> path;

bool find_path(int n, int p = -1) {
    on_path.push(n);
    if (n == b) return true;

    for (int x : adj[n]) {
        if (x == p) continue;
        if (find_path(x, n)) return true;
    }
    on_path.pop();
    return false;
}

int dp[N];

void dfs(int n, int p = -1) {
    vector<int> cur;
    for (int x : adj[n]) {
        if (x == p || is_on_path[x]) continue;
        dfs(x, n);
        cur.push_back(dp[x]);
    }
    sort(cur.begin(), cur.end(), greater<>());
    for (int i = 0; i < cur.size(); ++i) {
        dp[n] = max(dp[n], cur[i] + i + 1);
    }
}

bool check(int x) {
    int mx_left = -1;
    int cur_t = 0;
    for (int i = 0; i < path.size() - 1; ++i) {
        int diff = x - dp[path[i]] - cur_t;
        if (diff < 0) break; // can't solve
        if (diff == 0) {
            mx_left = i;
            break;
        }
        cur_t += diff;
        mx_left = i;
    } 
    cur_t = 0;
    int mx_right = path.size();
    for (int i = path.size() - 1; i > 0; --i) {
        int diff = x - dp[path[i]] - cur_t;
        if (diff < 0) break; // can't solve
        if (diff == 0) {
            mx_right = i;
            break;
        }
        cur_t += diff;
        mx_right = i;
    }
    return mx_right - mx_left <= 1;
}

int main() {
    cin >> n >> a >> b;
    --a; --b;
    for (int i = 0; i < n - 1; ++i) {
        int x, y;
        cin >> x >> y;
        --x; --y;
        adj[x].push_back(y);
        adj[y].push_back(x);
    }

    find_path(a);
    while(!on_path.empty()) {
        path.push_back(on_path.top());
        on_path.pop();
        is_on_path[path.back()] = true;
    }
    reverse(path.begin(), path.end());
    for (int x : path) {
        dfs(x);
    }
    int l = -1, r = 2 * N;
    while (r > l + 1) {
        int m = (l + r) / 2;
        if (check(m)) {
            r = m;
        } else {
            l = m;
        }
    }
    cout << r;
}

Compilation message

torrent.cpp: In function 'void dfs(int, int)':
torrent.cpp:39:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |     for (int i = 0; i < cur.size(); ++i) {
      |                     ~~^~~~~~~~~~~~
torrent.cpp: In function 'bool check(int)':
torrent.cpp:47:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |     for (int i = 0; i < path.size() - 1; ++i) {
      |                     ~~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 31.0

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

Subtask #2
0 / 69.0

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