D.Cow Party

oj加题的时候看能不能过

#include<iostream>
#include<string.h>
#include<stdio.h>
#include<queue>
using namespace std;

const int maxn=1005;
const int INF=0xffffff;

int G[maxn][maxn],a[maxn];
int ma[maxn];

queue<int>q;
int vis[maxn];
int n;

int bfs(int x)
{
    for(int i=1;i<=n;i++)
    {
        a[i]=INF;
    }
    while(!q.empty())
        q.pop();
    memset(vis,0,sizeof(vis));
    vis[x]=1;
    a[x]=0;
    q.push(x);

    while(!q.empty())
    {
        int tmp=q.front();
        q.pop();
        for(int i=1;i<=n;i++)
        {
            if(G[tmp][i])
            {
                if(a[tmp]+G[tmp][i]<a[i]){
                a[i]=a[tmp]+G[tmp][i];
                q.push(i);
                }
            }
        }
    }
}

int bfs2(int x)
{
    for(int i=1;i<=n;i++)
    {
        ma[i]=INF;
    }
    while(!q.empty())
        q.pop();
    memset(vis,0,sizeof(vis));
    vis[x]=1;
    ma[x]=0;
    q.push(x);

    while(!q.empty())
    {
        int tmp=q.front();
        q.pop();
        for(int i=1;i<=n;i++)
        {
            if(G[i][tmp])
            {
                if(ma[tmp]+G[i][tmp]<ma[i]){
                ma[i]=ma[tmp]+G[i][tmp];
                q.push(i);
                }
            }
        }
    }
}


int main()
{
    int m,x,aa,bb,t;

    while(cin>>n>>m>>x)
    {
        memset(G,0,sizeof(G));

        while(m--)
        {
            cin>>aa>>bb>>t;
            G[aa][bb]=t;
        }


        int sum=0;
        for(int i=1;i<=n;i++)
        {
            bfs(i);
            bfs2(i);
            cout<<a[x]<<" "<<ma[x]<<endl;
            if(sum<a[x]+ma[x])
            sum=a[x]+ma[x];
        }
        cout<<sum<<endl;
    }
    return 0;
}