oj.uz

답안 #925000

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
925000 2024-02-10T12:18:54 Z Whisper Birokracija (COCI18_birokracija) C++17
100 / 100
 83 ms 26968 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
using T = tuple<ll, ll, ll>;

#define int long long
#define Base 41
#define sz(a) (int)a.size()
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define all(x) x.begin() , x.end()
#define pii pair<int , int>
#define fi first
#define se second
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 2e5 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }

int numNode;

vector<int> adj[MAX];
//với mỗi u tính số tổng số lần node u đi qua 1 node v (với mọi v là con của u)

int dp[MAX];
int ans = 0;
int sz[MAX];
void reSubsize(int u, int p = -1){
    sz[u] = 1;
    for (auto&v : adj[u]) if(v ^ p){
        reSubsize(v, u);
        sz[u] += sz[v];
    }
}
void dfs(int u, int p = -1){
    for (auto&v : adj[u]) if(v ^ p){
        dfs(v, u);
    }
    int ans = 1;
    for (auto&v : adj[u]) if(v ^ p){
        ans += dp[v] + sz[v];
    }
    dp[u] = ans;
}
void Whisper(){
    cin >> numNode;
    for (int i = 2; i <= numNode; ++i){
        int par; cin >> par;
        adj[par].push_back(i);
        adj[i].push_back(par);
    }
    reSubsize(1);
    dfs(1);
    FOR(i, 1, numNode) cout << dp[i] << " ";
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9048 KB Output is correct
2 Correct 8 ms 9308 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 11356 KB Output is correct
2 Correct 18 ms 11344 KB Output is correct
3 Correct 18 ms 12380 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 17244 KB Output is correct
2 Correct 51 ms 18432 KB Output is correct
3 Correct 52 ms 26968 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 17136 KB Output is correct
2 Correct 63 ms 17616 KB Output is correct
3 Correct 49 ms 19496 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 16980 KB Output is correct
2 Correct 66 ms 17888 KB Output is correct
3 Correct 60 ms 21108 KB Output is correct