「Poetize10」能量获取

 1 #include<cstdio>
 2 
 3 #include<cstdlib>
 4 
 5 #include<cmath>
 6 
 7 #include<cstring>
 8 
 9 #include<algorithm>
10 
11 #include<iostream>
12 
13 #include<vector>
14 
15 #include<map>
16 
17 #include<set>
18 
19 #include<queue>
20 
21 #include<string>
22 
23 #define inf 1000000000
24 
25 #define maxn 10000
26 
27 #define maxm 500+100
28 
29 #define eps 1e-10
30 
31 #define ll long long
32 
33 #define pa pair<int,int>
34 
35 #define for0(i,n) for(int i=0;i<=(n);i++)
36 
37 #define for1(i,n) for(int i=1;i<=(n);i++)
38 
39 #define for2(i,x,y) for(int i=(x);i<=(y);i++)
40 
41 #define for3(i,x,y) for(int i=(x);i>=(y);i--)
42 
43 #define mod 1000000007
44 
45 using namespace std;
46 
47 inline int read()
48 
49 {
50 
51     int x=0,f=1;char ch=getchar();
52 
53     while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=getchar();}
54 
55     while(ch>=‘0‘&&ch<=‘9‘){x=10*x+ch-‘0‘;ch=getchar();}
56 
57     return x*f;
58 
59 }
60 int n,ans,fa[maxn],id[maxn],ned[maxn],mx[maxn];
61 inline bool cmp(int x,int y){return ned[x]<ned[y];}
62 
63 int main()
64 
65 {
66 
67     freopen("input.txt","r",stdin);
68 
69     freopen("output.txt","w",stdout);
70 
71     n=read();
72     for1(i,n)
73     {
74         fa[i]=read();ned[i]=read();mx[i]=read();id[i]=i;
75     }
76     sort(id+1,id+n+1,cmp);
77     for1(i,n)
78     {
79         bool flag=0;
80         for(int j=id[i];j;j=fa[j])
81             if(mx[j]<ned[id[i]])flag=1;
82         if(flag)continue;
83         for(int j=id[i];j;j=fa[j])mx[j]-=ned[id[i]];
84         ans++;
85     }
86     printf("%d\n",ans);
87 
88     return 0;
89 
90 }