记录编号	119573	评测结果	AAAWWAWWW
题目名称	工程规划	最终得分	44
用户昵称	HouJikan	是否通过	未通过
代码语言	C++	运行时间	0.105 s
提交时间	2014-09-13 09:51:36	内存使用	3.74 MiB

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <algorithm> 
#include <cmath> 
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <list>
#include <vector>
#include <ctime>
#include <iterator>
#include <functional>
#define pritnf printf
#define scafn scanf
#define For(i,j,k) for(int i=(j);i<=(k);(i)++)
using namespace std;
typedef long long LL;
typedef unsigned int Uint; 
const int INF=100000;
//==============struct declaration==============

//==============var declaration=================
const int MAXN=1010;
int n,m;
int dist[MAXN][MAXN];
//==============function declaration============
void spfa();
//==============main code=======================
int main()
{  
  string FileName="work";//程序名 
  string FloderName="COGS";//文件夹名 
  freopen((FileName+".in").c_str(),"r",stdin);
  freopen((FileName+".out").c_str(),"w",stdout);
#ifdef DEBUG  
  system(("cp C:\\Users\\Administrator\\Desktop\\"+FloderName+"\\standard.cpp C:\\Users\\Administrator\\Desktop\\"+FloderName+"\\submit.txt").c_str());
  clock_t Start_Time=clock();
#endif   
  scanf("%d%d",&n,&m);
   For(i,1,n)
     For(j,1,n)
    dist[i][j]=-INF;
  For(i,1,m)
  {
    int s,e,d;
    scanf("%d%d%d",&s,&e,&d);
    dist[s][e]=max(dist[s][e],-d);
  }
  spfa();
#ifdef DEBUG  
  clock_t End_Time=clock();
  pritnf("\n\nTime Used:  %.6lf",double(End_Time-Start_Time)/CLOCKS_PER_SEC);
#endif    
  return 0;
}
//================fuction code====================
void spfa()
{
  int d[MAXN],out[MAXN];
  bool inq[MAXN];
  memset(d,0,sizeof(d));
  memset(out,0,sizeof(out));
  memset(inq,false,sizeof(inq));
  queue <int> Q;
  For(i,2,n)
    d[i]=-INF;
  For(i,1,n)
    Q.push(i);
  while (!Q.empty())
  {
    int now=Q.front();Q.pop();
    inq[now]=false;
    if (out[now]>n)
    {
      pritnf("NO SOLUTION\n");
      return;
    }
    out[now]++;
    For(i,1,n)
      if (d[now]+dist[now][i]>d[i])
      {
        d[i]=d[now]+dist[now][i];
        if (!inq[i])
          Q.push(i);
        inq[i]=true;
      }
  }  
  int minn=INF;
  For(i,1,n)
    minn=min(d[i],minn);
  For(i,1,n)
    pritnf("%d\n",abs(d[i]-minn));
  //For(i,1,n)
   // pritnf("%d\n",d[i]);
}