TouchStone
  Please Login
ログイン 登録
距离明年CSP第一轮: ??天 距离CSP第二轮: ??天 距离NOIP还有: ??天
 ホームページ  問題セット  試験一覧  提出状況  掲示板  統計情報
  • ホーム
  • 問題セット
  • P5944
  • 問題
  • P5944[USACO2017 Jan] Promotion Counting
    制限 : 時間制限 : - MS   メモリ制限 : - KB
    審判説明 : 1s,256m
    問題説明

    The cows have once again tried to form a startup company, failing to remember from past experience that cows make terrible managers!The cows, conveniently numbered 1…N1…N (1≤N≤100,000), organize the company as a tree, with cow 1 as the president (the root of the tree). Each cow except the president has a single manager (its "parent" in the tree). Each cow ii has a distinct proficiency rating, p(i), which describes how good she is at her job. If cow ii is an ancestor (e.g., a manager of a manager of a manager) of cow jj, then we say jj is a subordinate of ii. Unfortunately, the cows find that it is often the case that a manager has less proficiency than several of her subordinates, in which case the manager should consider promoting some of her subordinates. Your task is to help the cows figure out when this is happening. For each cow ii in the company, please count the number of subordinates jj where p(j)>p(i).

    n只奶牛构成了一个树形的公司,每个奶牛有一个能力值pi,1号奶牛为树根。

    问对于每个奶牛来说,它的子树中有几个能力值比它大的。

    入力形式

    The first line of input contains N The next N lines of input contain the proficiency ratings p(1)…p(N) for the cows. Each is a distinct integer in the range 1…1,000,000,000 The next N-1 lines describe the manager (parent) for cows 2…N Recall that cow 1 has no manager, being the president. n,表示有几只奶牛 n<=100000

    接下来n行为1-n号奶牛的能力值pi

    接下来n-1行为2-n号奶牛的经理(树中的父亲)

    出力形式

    Please print N lines of output. The ith line of output should tell the number of subordinates of cow ii with higher proficiency than cow i.

    共n行,每行输出奶牛i的下属中有几个能力值比i大

    サンプル入力


    804289384 
    846930887 
    681692778 
    714636916 
    957747794 




    サンプル出力







    ソース  bzoj4756