2018.09.21测试

T1

辣鸡大模拟呕，注意一下空行还有读入...

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <queue>
#define maxn 2000
#define LL long long
using namespace std;

int t,len1,len2,match[30];
char ch,s1[maxn],s2[maxn];

int read()
{
	int xx=0,kk=1;char ch=' ';
	while(!isdigit(ch)){ch=getchar();if(ch=='-')kk=-1;}
	while(isdigit(ch)){xx=xx*10+ch-'0';ch=getchar();}
	return kk*xx;
}

int num(char ch)
{
	if(ch>='a'&&ch<='z') return ch-'a'+1;
	return 0;
}

int main()
{
	freopen("copycat.in","r",stdin);
	freopen("copycat.out","w",stdout);
	t=read();
	while(t--)
	{
		len1=len2=0;
		ch=getchar();
		while(ch!='\n'){s1[++len1]=ch;ch=getchar();}
		ch=getchar();
		while(ch!='\n'){s2[++len2]=ch;ch=getchar();}
		if(!len1&&!len2){puts("1");continue;}
		if(len1!=len2){puts("0");continue;}
		for(int i=1;i<=len1;++i)
		{
			int tmp1=num(s1[i]),tmp2=num(s2[i]);
			if((!tmp1&&tmp2)||(tmp1&&!tmp2)){puts("0");break;}
			if(!tmp1&&!tmp2&&(s1[i]!=s2[i])){puts("0");break;}
			if(!match[tmp1]) match[tmp1]=tmp2;
			if(match[tmp1]!=tmp2){puts("0");break;}
			if(i==len1) puts("1");
		}	
		for(int i=1;i<=26;++i) match[i]=0;
	}
	return 0;
}

 

T2

最短路问题，一开始想的是二分+spfa后来发现只用跑两次spfa就好啦，第一次把最小热度的最大值跑出来，然后用温度不大于这个最大值的路径来更新答案就ok啦

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <queue>
#define LL long long
#define maxn 600000
#define maxm 1200000
#define inf 1e18
using namespace std;

LL dis[maxn];
bool vis[maxn];
int n,m,u,v,t,c,s,num;
int fir[maxn],maxi[maxn];

queue<int> q;

struct qwq
{
	int to,nxt,t,c;
}e[maxm<<1];

int read()
{
	int xx=0,kk=1;char ch=' ';
	while(!isdigit(ch)){ch=getchar();if(ch=='-')kk=-1;}
	while(isdigit(ch)){xx=xx*10+ch-'0';ch=getchar();}
	return kk*xx;
}

void addedge(int u,int v,int t,int c)
{
	e[++num].to=v;
	e[num].t=t;
	e[num].c=c;
	e[num].nxt=fir[u];
	fir[u]=num;
}

void spfa()
{
	for(int i=1;i<=n;++i) maxi[i]=1e9;
	maxi[s]=0;q.push(s);vis[s]=true;
	while(!q.empty())
	{
		int sx=q.front();q.pop();
		for(int i=fir[sx];i;i=e[i].nxt)
		{
			int tx=e[i].to;
			if(maxi[tx]>max(maxi[sx],e[i].t))
			{
				maxi[tx]=max(maxi[sx],e[i].t);
				if(!vis[tx])
					q.push(tx),vis[tx]=true;
			}
		}
		vis[sx]=false;
	}
}

void getans()
{
	for(int i=1;i<=n;++i) dis[i]=inf;
	dis[s]=0;q.push(s);vis[s]=true;
	while(!q.empty())
	{
		int sx=q.front();q.pop();
		for(int i=fir[sx];i;i=e[i].nxt)
		{
			int tx=e[i].to;
			if(e[i].t>maxi[t]) continue;
			if(dis[tx]>dis[sx]+e[i].c)
			{
				dis[tx]=dis[sx]+e[i].c;
				if(!vis[tx])
					q.push(tx),vis[tx]=true;
			}
		}
		vis[sx]=false;
	}
}

int main()
{
	freopen("running.in","r",stdin);
	freopen("running.out","w",stdout);
	n=read(),m=read();
	while(m--)
	{
		u=read(),v=read(),t=read(),c=read();
		addedge(u,v,t,t*c);addedge(v,u,t,t*c);
	}
	s=read(),t=read();
	spfa();getans();
	printf("%d %lld",maxi[t],dis[t]);
	return 0;
}