SDNU_Winter_Practice_最短路,扩展欧几里得

原题都在这里

B题，一个有向图，求所有人都被联系到的最短时间；如果有一个或一个以上的人无论如何不能被联系到就输出“disjoint”，算是裸的最短路吧。这道是由队长抢走做的，用的dijkstla算法。

代码如下：

/*********************
author : MengFanzhuang
*********************/

#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;

void Dij();
int a[105][105],dis[105],N,m,st,en;
bool vis[105]= {0};
bool cmp(int a,int b)
{
    return a>b;
}
int main()
{
    while(scanf("%d",&N)!=EOF&&N)
    {
        memset(a,0x1,sizeof(a));
        memset(vis,0,sizeof(vis));
        memset(dis,0x7f,sizeof(dis));
        for(int j=1; j<=N; ++j)
        {
            int n;
            scanf("%d",&n);
            for(int i=0; i<n; ++i)
            {
                int a1,a2;
                scanf("%d%d",&a1,&a2);
                a[j][a1]=a2;
            }
        }
        int diss=9999,num;
        for(int i=1; i<=N; ++i)
        {
            memset(vis,0,sizeof(vis));
            memset(dis,0x7f,sizeof(dis));
            st=i;
            Dij();
            sort(dis+1,dis+N+1,cmp);

            if(dis[1]<diss)
            {
                diss=dis[1];
                num=i;
            }
        }
        if(diss<9999) cout<<num<<' '<<diss<<endl;
        else cout<<"disjoint"<<endl;
    }
    return 0;
}
void Dij()
{
    for(int i=1; i<=N; ++i)
    {
        dis[i]=a[st][i];
    }
    vis[st]=1;
    dis[st]=0;
    for(int i=1; i<=N; ++i)
    {
        int minn=9999,j=0;
        for(int i1=1; i1<=N; ++i1)
        {
            if(!vis[i1]&&minn>dis[i1])
            {
                j=i1;
                minn=dis[i1];
            }
        }
        vis[j]=1;
        for(int i1=1; i1<=N; ++i1)
        {
            if(!vis[i1]&&dis[i1]>minn+a[j][i1])
                dis[i1]=minn+a[j][i1];
        }
    }
}

D和E：这个有必要反省一下，居然没看出来是最短路……说明对题意模型化的能力有待提高，而且也是对算法不够熟悉的一种表现，羞愧……

题意就是提供汇率，看看能不能空手套钱。

用SPFA判断是否由负环，不过要用乘。

/*********************
author : MengXiangCong
*********************/
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>

#define MAXX(a, b) a > b ? a : b
#define inf (1<<30)
#define eps 1e-6
#define PI acos(-1)
#define SET(a, b)  memset(a, b, sizeof(a))
using namespace std;

typedef long long LL;
#define MAXC 100
#define MAXV 50

double map[MAXV][MAXV];
int n,m;

void Input(){
	char s[MAXV][MAXC],a[MAXC],b[MAXC];
	int i,k,j;
	double c;
	for(i=0;i<=n;i++)
		for(j=0;j<=n;j++)
			if(i==j)
				map[i][j]=1;
			else
				map[i][i]=0;
	for(i=1;i<=n;i++) scanf("%s",s[i]);
	scanf("%d\n",&m);
	for(i=1;i<=m;i++){
		scanf("%s %lf %s",a,&c,b);
		for(j=1;j<=n;j++)
			if(!strcmp(s[j],a)) break;
		for(k=1;k<=n;k++)
			if(!strcmp(s[k],b)) break;
		map[j][k]=c;
	}
}

void floyd(){
	int i,j,k;
	for(k=1;k<=n;k++)
		for(i=1;i<=n;i++)
			for(j=1;j<=n;j++)
				if(map[i][k]*map[k][j]>map[i][j])
					map[i][j]=map[i][k]*map[k][j];
}

int main(){
	int cas=1,i;
	while(scanf("%d\n",&n) && n){
		Input();
		floyd();
		printf("Case %d: ",cas++);
		for(i=1;i<=n;i++)
			if(map[i][i]>1) break;
		if(i>n) printf("No\n");
		else printf("Yes\n");
	}
	return 0;
}

/*********************
author : MengXiangCong
*********************/
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>

#define MAXX(a, b) a > b ? a : b
#define inf (1<<30)
#define eps 1e-6
#define PI acos(-1)
#define SET(a, b)  memset(a, b, sizeof(a))
using namespace std;

typedef long long LL;

const int N = 105;
const int E = 205;
const double MAX = 999999999;

struct Edge
{
    int beg;
    int end;
    double r, c;
};
Edge edge[E];
double mindis[N];
int n, m, e, fn;
double fv;

void addedge(int beg, int end, double r, double c)
{
    edge[e].beg = beg;
    edge[e].end = end;
    edge[e].r = r;
    edge[e].c = c;
    ++e;
}

bool relax(int pe)
{
    double t = (mindis[edge[pe].beg] - edge[pe].c) * edge[pe].r;
    if (t > mindis[edge[pe].end])
    {
        mindis[edge[pe].end] = t;
        return true;
    }
    return false;
}

bool bellman_ford()
{
    bool flag;
    for (int i = 0; i < n; ++i)
        mindis[i] = 0.0;
    mindis[fn] = fv;
    for (int i = 0; i < n - 1; ++i)
    {
        flag = false;
        for (int j = 0; j < e; ++j)
        {
            if (relax(j))
                flag = true;
        }
        if (mindis[fn] > fv)
            return true;
        if (!flag)
            return false;
    }
    for (int i = 0; i < e; ++i)
    {
        if (relax(i))
            return true;
    }
    return false;
}

int main()
{
    int beg, end;
    double r1, r2, c1, c2;
    scanf("%d%d%d%lf", &n, &m, &fn, &fv);
    --fn;
    e = 0;
    for (int i = 0; i < m; ++i)
    {
        scanf("%d%d%lf%lf%lf%lf", &beg, &end, &r1, &c1, &r2, &c2);
        --beg;
        --end;
        addedge(beg, end, r1, c1);
        addedge(end, beg, r2, c2);
    }
    bool ans = bellman_ford();
    if (ans)
        printf("YES\n");
    else
        printf("NO\n");
    return 0;
}

A是扩展欧几里得，师姐的课件有讲，然后就……又去看了一次……

/**************************
author : MengXiangCong
**************************/
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>

#define MAXX(a, b) a > b ? a : b
#define inf (1<<30)
#define eps 1e-6
#define PI acos(-1)
#define SET(a, b)  memset(a, b, sizeof(a))
using namespace std;

typedef long long LL;
LL t, p, c;
void Fun(int a,int b)
{
    if(b == 0)
    {
        t = 1;
        p = 0;
        c = a;
    }
    else
    {
        Fun(b, a % b);
        int temp = t;
        t = p;
        p = temp - a / b * p;
    }
}
int main()
{
    int i, j, ok = 0, d, a, b;
    LL x, y, m, n, l;
    while(scanf("%lld %lld %lld %lld %lld", &x, &y, &m, &n, &l) != EOF)
    {
        if(n == m)
            ok = 1;
        else
        {
            a = n - m;
            d = x - y;
            b = l;
            Fun(a, b);
            if(d % c != 0)
                ok = 1;
        }
        if(ok)
            cout << "Impossible" << endl;
        else
        {
            b = b / c;
            d = d / c;
            LL v = d * t;
            cout << (v % b + b) % b << endl;
        }
    }
    return 0;
}