洛谷P1201[USACO1.1]贪婪的送礼者Greedy Gift Givers
思路:
结构体存名字去判断和map映射都可以。
代码(结构体):
#include<bits/stdc++.h>
#define pii pair<int,int>
#define ll long long
#define cl(x,y) memset(x,y,sizeof(x))
#define ct cerr<<"Time elapsed:"<<1.0*clock()/CLOCKS_PER_SEC<<"s.\n";
const int N=1e6+10;
const int mod=1e7+9;
const int maxn=0x3f3f3f3f;
const int minn=0xc0c0c0c0;
const int inf=99999999;
using namespace std;
struct person
{
char name[20];
int money;
}info[20];
char s[20],t[20];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int n,i;
cin>>n;
for(i=1;i<=n;i++)
cin>>info[i].name;
for(i=1;i<=n;i++)
{
int a,b,j;
cin>>s>>a>>b;
if(b==0)
continue;
else
{
int m=a/b,l=m*b;
for(j=1;j<=n;j++)
if(strcmp(s,info[j].name)==0)
info[j].money=info[j].money-l;
while(b--)
{
cin>>t;
for(j=1;j<=n;j++)
if(strcmp(t,info[j].name)==0)
info[j].money+=m;
}
}
}
for(i=1;i<=n;i++)
cout<<info[i].name<<" "<<info[i].money<<endl;
return 0;
}
代码(map):
#include<bits/stdc++.h>
#define pii pair<int,int>
#define ll long long
#define cl(x,y) memset(x,y,sizeof(x))
#define ct cerr<<"Time elapsed:"<<1.0*clock()/CLOCKS_PER_SEC<<"s.\n";
const int N=1e6+10;
const int mod=1e7+9;
const int maxn=0x3f3f3f3f;
const int minn=0xc0c0c0c0;
const int inf=99999999;
using namespace std;
string name[20];
map<string,int> money;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int n,i;
cin>>n;
for(i=1;i<=n;i++)
cin>>name[i];
for(i=1;i<=n;i++)
{
string s;
int a,b;
cin>>s>>a>>b;
if(b==0)
continue;
int m=a/b,k=m*b;
money[s]-=k;
while(b--)
{
cin>>s;
money[s]+=m;
}
}
for(i=1;i<=n;i++)
cout<<name[i]<<" "<<money[name[i]]<<endl;
return 0;
}