Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <sstream>
- #include <bitset>
- #include <cstdio>
- #include <string>
- #include <cstring>
- #include <vector>
- #include <queue>
- #include <stack>
- #include <set>
- #include <map>
- #include <algorithm>
- #include <cmath>
- #include <cstdlib>
- #include <cctype>
- #include <numeric>
- #define FOR(i,A) for(typeof (A).begin() i = (A).begin() ; i != (A).end() ; i++)
- #define mp make_pair
- #define debug( x ) cout << #x << " = " << x << endl
- #define clr(v,x) memset( v, x , sizeof v )
- #define all(x) (x).begin() , (x).end()
- #define rall(x) (x).rbegin() , (x).rend()
- #define TAM 100010
- using namespace std;
- typedef pair<int,int> ii ;
- typedef long long ll ;
- typedef long double ld ;
- typedef pair<int,ii> pii ;
- int n , t ;
- vector<int> g[ TAM ] ;
- void print(){
- for(int i = 0 ; i <= n ; i++){
- printf("%d: " , i ) ;
- for(int j = 0 ; j < g[ i ].size() ; j++) printf("%d " , g[ i ][ j ] ) ;
- printf("\n" ) ;
- }
- printf("\n" ) ;
- }
- void init(){
- for(int i = 0 ; i <= n ; i++) g[ i ].clear() ;
- }
- int dfs( int x ){
- int n = g[ x ].size() ;
- if( n == 0 ) return 1 ;
- // int num = n * t / 100 + !( ( n * t ) % 100 == 0 ) ;
- int num = ( n * t + 99 ) / 100 ;
- int cont = 0 ;
- vector<int> emp( n ) ;
- for(int i = 0 ; i < n ; i++)
- emp[ i ] = dfs( g[ x ][ i ] ) ;
- sort( all( emp ) ) ;
- for(int i = 0 ; i < num ; i++) cont += emp[ i ] ;
- return cont ;
- }
- int main(){
- while( scanf("%d%d" , &n , &t ) == 2 ){
- if( n == t && t == 0 ) break ;
- init() ;
- int a , b ;
- for(int i = 1 ; i <= n ; i++){
- scanf("%d" , &a ) ;
- g[ a ].push_back( i ) ;
- }
- // print() ;
- printf("%d\n" , dfs( 0 ) ) ;
- }
- return 0 ;
- }
Add Comment
Please, Sign In to add comment