oj.uz

답안 #893369

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
893369 2023-12-27T03:33:18 Z vjudge1 Meetings 2 (JOI21_meetings2) C++17
0 / 100
 0 ms 348 KB 
#include <bits/stdc++.h>

using namespace std;

#define all(x) x.begin(), x.end()
#define ar array
#define pb push_back
#define ln '\n'
#define int long long

using i64 = long long;

template <class F, class _S>
bool chmin(F &u, const _S &v){
    bool flag = false;
    if ( u > v ){
        u = v; flag |= true;
    }
    return flag;
}

template <class F, class _S>
bool chmax(F &u, const _S &v){
    bool flag = false;
    if ( u < v ){
        u = v; flag |= true;
    }
    return flag;
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n; cin >> n;
    vector <vector<int>> G(n);
    for ( int i = 1; i < n; i++ ){
        int u, v; cin >> u >> v;
        --u, --v;
        G[u].pb(v), G[v].pb(u);
    }
    vector <vector<int>> s(n, vector <int> (n)), d(n, vector <int> (n));
    for ( int i = 0; i < n; i++ ){
        auto dfs = [&](auto dfs, int u, int p) -> void{
            s[i][u] = 1;
            for ( auto &v: G[u] ){
                if ( v != p ){
                    d[i][v] = d[i][u] + 1;
                    dfs(dfs, v, u);
                    s[i][u] += s[i][v];
                }
            }
        };
        dfs(dfs, i, -1);
    }
    vector <int> sf(n + 1);
    for ( int i = 0; i < n; i++ ){
        for ( int j = i + 1; j < n; j++ ){
            int q = min(s[i][j], s[j][i]) * 2;
            chmax(sf[q], d[i][j] + 1);
        }
    }
    for ( int i = n - 1; i > 0; i-- ){
        chmax(sf[i], sf[i + 1]);
    }
    for ( int i = 1; i <= n; i++ ){
        cout << (i & 1 ? 1LL : sf[i]) << ln;
    }

    cout << '\n';
}

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -