“战疫杯”大学生程序设计在线邀请赛（5）

1 感染源在哪里

#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;
#define int long long
set<pair<string,string>>S;
map<string,int>mp,sum;
struct node
{
    int c;
    string ss;
}res[1010];
bool cmp(node a,node b)
{
    if(a.c!=b.c)return a.c>b.c;
    return a.ss<b.ss;
}
signed main()
{
	int n;cin>>n;
    for(int i=0;i<n;i++)
    {
        string a,b;
        cin>>a>>b;
        if(S.count({a,b}))continue;
        S.insert({a,b});
        mp[a]++;
    }
    int gcd=0,s=1;
    for(auto [x,c] : mp)gcd=__gcd(gcd,c);
    for(auto [x,c] : mp)s=s*(c/gcd);
    for(auto [a,b] : S)sum[b]+=s/mp[a];
    int idx=0;
    for(auto [x,c] : sum)res[idx++]={c,x};
    sort(res,res+idx,cmp);
    for(int i=0;i<idx;i++)cout<<res[i].ss<<endl;
}

2 病毒序列

#include 
#include 
#include 
#include 
using namespace std;
#define int long long
signed main()
{
	string a,b;
	cin>>a>>b;
	int res=0;
	for(int p=0;p<b.size();p++)
	{
		int s=0;
		for(int i=0,j=p;i<a.size()&&j<b.size();i++,j++)
		{
			if((a[i]=='C'&&b[j]=='G')||(a[i]=='G'&&b[j]=='C'))s+=2;
			if((a[i]=='A'&&b[j]=='U')||(a[i]=='U'&&b[j]=='A'))s+=3;	
		}
		res=max(res,s);
	}
	for(int p=0;p<a.size();p++)
	{
		int s=0;
		for(int i=0,j=p;i<b.size()&&j<a.size();i++,j++)
		{
			if((a[j]=='C'&&b[i]=='G')||(a[j]=='G'&&b[i]=='C'))s+=2;
			if((a[j]=='A'&&b[i]=='U')||(a[j]=='U'&&b[i]=='A'))s+=3;	
		}
		res=max(res,s);
	}
	cout<<res;
}

3 奇奇怪怪的形状

#include 
#include 
using namespace std;
#define int long long
signed main()
{
	int a,b,c,d;
	cin>>a>>b>>c>>d;
    int res=(a+b+c+d)*6;
    res-=2*min(a,b)+2*min(a,c)+2*min(b,d)+2*min(c,d);
    res-=(a-1+b-1+c-1+d-1)*2;
    cout<<res;
}