USCAO section 4.1 Fence Loops（最短路，最小环，5级）

关注

原创最新推荐文章于 2025-08-06 08:20:52 发布 939 阅读 AI 写同款· GEO 优化 ›

【USACO题库】4.1.3 Fence Loops篱笆回路题目描述农夫布朗的牧场上的篱笆已经失去控制了。它们分成了1~200英尺长的线段。只有在线段的端点处才能连接两个线段，有时给定的一个端点上会有两个以上的篱笆。结果篱笆形成了一张网分割了布朗的牧场。布朗想将牧场恢复原样，出于这个考虑，他首先得知道牧场上哪一块区域的周长最小。 1 +---------------+ |\ /| 2| \7 / | | \ / | +---+ / |6 阅读详情

Fence Loops

The fences that surround Farmer Brown's collection of pastures have gotten out of control. They are made up of straight segments from 1 through 200 feet long that join together only at their endpoints though sometimes more than two fences join together at a given endpoint. The result is a web of fences enclosing his pastures. Farmer Brown wants to start to straighten things out. In particular, he wants to know which of the pastures has the smallest perimeter.

Farmer Brown has numbered his fence segments from 1 to N (N = the total number of segments). He knows the following about each fence segment:

the length of the segment
the segments which connect to it at one end
the segments which connect to it at the other end.

Happily, no fence connects to itself.

Given a list of fence segments that represents a set of surrounded pastures, write a program to compute the smallest perimeter of any pasture. As an example, consider a pasture arrangement, with fences numbered 1 to 10 that looks like this one (the numbers are fence ID numbers):

           1
   +---------------+
   |\             /|
  2| \7          / |
   |  \         /  |
   +---+       /   |6
   | 8  \     /10  |
  3|     \9  /     |
   |      \ /      |
   +-------+-------+
       4       5

The pasture with the smallest perimeter is the one that is enclosed by fence segments 2, 7, and 8.

PROGRAM NAME: fence6

INPUT FORMAT

Line 1:

N (1 <= N <= 100)

Line 2..3*N+1:

N sets of three line records:

The first line of each record contains four integers: s, the segment number (1 <= s <= N); L_s, the length of the segment (1 <= L_s <= 255); N1_s (1 <= N1_s <= 8) the number of items on the subsequent line; and N2_sthe number of items on the line after that (1 <= N2_s <= 8).
The second line of the record contains N1 integers, each representing a connected line segment on one end of the fence.
The third line of the record contains N2 integers, each representing a connected line segment on the other end of the fence.

SAMPLE INPUT (file fence6.in)

OUTPUT FORMAT

The output file should contain a single line with a single integer that represents the shortest surrounded perimeter.

SAMPLE OUTPUT (file fence6.out)

思路：点边互化，然后用floy判最小环，注意判环要有不同的点元素在。

Executing...
   Test 1: TEST OK [0.000 secs, 3852 KB]
   Test 2: TEST OK [0.000 secs, 3852 KB]
   Test 3: TEST OK [0.000 secs, 3852 KB]
   Test 4: TEST OK [0.000 secs, 3852 KB]
   Test 5: TEST OK [0.000 secs, 3852 KB]
   Test 6: TEST OK [0.000 secs, 3852 KB]
   Test 7: TEST OK [0.000 secs, 3852 KB]
   Test 8: TEST OK [0.011 secs, 3852 KB]
   Test 9: TEST OK [0.011 secs, 3852 KB]

/*
ID:nealgav1
PROG:fence6
LANG:C++
*/
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
const int mm=200+9;
const int oo=1e9;
vector<int>ll[mm],rr[mm];
int g[mm][mm],n,len[mm],dis[mm][mm];
int main()
{ freopen("fence6.in","r",stdin);
  freopen("fence6.out","w",stdout);
  int a,b,c,d;
  while(~scanf("%d",&n))
  {
    for(int i=0;i<n;++i)
    {
      scanf("%d",&a);
      scanf("%d%d%d",&len[a],&b,&c);
      for(int j=0;j<b;++j)
      {
        scanf("%d",&d);ll[a].push_back(d);
      }
      for(int j=0;j<c;++j)
      {
        scanf("%d",&d);rr[a].push_back(d);
      }
    }
    for(int i=0;i<=n;++i)
      for(int j=0;j<=n;++j)
      g[i][j]=oo;
      int z;
    for(int i=1;i<=n;++i)
    { z=ll[i].size();
      for(int j=0;j<z;++j)
        g[i][ll[i][j]]=len[i]+len[ll[i][j]];
      z=rr[i].size();
      for(int j=0;j<z;++j)
        g[i][rr[i][j]]=len[i]+len[rr[i][j]];
    }
    for(int i=0;i<=n;++i)
      for(int j=0;j<=n;++j)
      dis[i][j]=g[i][j];
    int ans=oo,u,v;
    for(int i=1;i<=n;++i)
    {
      for(int j=0;j<ll[i].size();++j)
      {
        u=ll[i][j];
        if(u<i)
        {
          for(int k=0;k<rr[i].size();++k)
          {
            v=rr[i][k];
            if(v<i)
            {
              ans=min(ans,dis[u][v]+g[u][i]+g[v][i]);
            }
          }
        }
      }
      for(int j=1;j<=n;++j)
        for(int k=1;k<=n;++k)
        dis[j][k]=min(dis[j][k],dis[j][i]+dis[i][k]);
    }
    printf("%d\n",ans/2);
  }
  return 0;
}

收录于