#include<bits/stdc++.h>usingnamespace std;typedeflonglong ll;constint mod =1e9+7;
vector<vector<ll>>mp(100001);
vector<int>st(100001);double ans =0;
ll n ;double tt, r;voiddfs(int x,double cn){//cout<<x<<" "<<cn<<" "<<ans<<endl;if(st[x]) ans += st[x]* cn;for(int k : mp[x]){dfs(k , cn *(1- r/100));}}intmain(){
cin >> n >> tt >> r;for(int i =0; i < n ; i ++){int k ;
cin >> k;if(k ==0){
cin >>st[i];continue;}for(int j =0; j < k ; j ++){int sn;
cin >> sn;
mp[i].push_back(sn);}}dfs(0, tt);printf("%lld",(ll)ans);return0;}
L2-019 悄悄关注 (25 分)
代码
#include<bits/stdc++.h>usingnamespace std;typedeflonglong ll;constint mod =1e9+7;
map<string ,int> mp;intmain(){int n ;
cin >> n;for(int i =0; i < n ; i ++){
string str;
cin >> str;
mp[str]=-1;}
vector<pair<string ,int>> cn;int m ;
cin >> m;int ans =0;for(int i =0; i < m ; i ++){
string str;int k;
cin >> str >> k;
ans += k;if(!mp[str]){
cn.push_back({str,k});}}sort(cn.begin(), cn.end());bool flag =true;for(auto tt : cn){if(tt.second * m > ans){
flag =false;
cout<<tt.first<<endl;}}if(flag) cout<<"Bing Mei You";return0;}