125 - Numbering Paths 解题报告

来源：互联网发布：java滑动验证码源代码编辑：程序博客网时间：2024/05/16 08:42

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=61

floyd的题，稍微有点变化，直接上代码：

#include<iostream>
#include<string.h>

using namespace std;

int main()
{
   int map[35][35];
   int N, m = 0;
   int caseid = 0;
   while(cin>>N)
   {
       m = 0;
       memset(map, 0, sizeof(map));
       int c1, c2;
       for(int i = 0; i < N; ++i)
       {
           cin>>c1>>c2;
           map[c1][c2] = 1;
           m = max(m, c1);
           m = max(m, c2);
       }


       for(int i = 0; i <= m; ++i)
           for(int j = 0; j <= m; ++j)
               for(int k = 0; k <= m; ++k)
               {
                   if(map[j][k] != 0 && map[k][j] != 0)
                       map[j][k] = map[k][j] = -1;
                   else if((map[j][i] == -1 && map[i][k] != 0) || (map[j][i] != 0 && map[i][k] == -1))
                       map[j][k] = -1;
                   else
                       map[j][k] += map[j][i] * map[i][k];
               }
       cout<<"matrix for city "<<caseid<<endl;
       for(int i = 0; i <= m; ++i)
       {
           int j;
           for(j = 0; j <= m-1; ++j)
               cout<<map[i][j]<<" ";
           cout<<map[i][j]<<endl;
       }
       caseid++;
   }
   return 0;
}

测试case：

7 0 1 0 2 0 4 2 4 2 3 3 1 4 35 0 2 0 1 1 5 2 5 2 190 1 0 2 0 30 4 1 4 2 12 03 03 1

输出结果：

matrix for city 00 4 1 3 20 0 0 0 00 2 0 2 10 1 0 0 00 1 0 1 0matrix for city 10 2 1 0 0 30 0 0 0 0 10 1 0 0 0 20 0 0 0 0 00 0 0 0 0 00 0 0 0 0 0matrix for city 2-1 -1 -1 -1 -10 0 0 0 1-1 -1 -1 -1 -1-1 -1 -1 -1 -10 0 0 0 0