USACO: 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

SAMPLE INPUT (file fence6.in)

10
1 16 2 2
2 7
10 6
2 3 2 2
1 7
8 3
3 3 2 1
8 2
4
4 8 1 3
3
9 10 5
5 8 3 1
9 10 4
6
6 6 1 2 
5 
1 10
7 5 2 2 
1 2
8 9
8 4 2 2
2 3
7 9
9 5 2 3
7 8
4 5 10
10 10 2 3
1 6
4 9 5

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)

12

解题思路：

这是一道比较典型的深搜题，同样使用状态修改还原的方法来减少空间占用和传入参数，为了防止中间出现循环路，加了个added[]的bool数组

个人觉得我这个side数组还是加得比较独到的，不知道别人能不能看懂我的意思，这个东西加上异或运算就可以省去选择端点的麻烦

最后，简单地分析一下就可以知道其实DFS应该还是有一些重复查找的（就是added数组剪掉的枝 = =|||），不过我交上去一看已经几乎全部0s秒杀了，怎么再把这些废枝利用起来我又暂时没想好，那就这样好了。。。

代码：

/* ID: geterns1 PROG: fence6 LANG: C++ */ #include <iostream> #include <fstream> #include <cstdio> #include <cmath> #include <cstdlib> #include <cstring> #include <algorithm> using namespace std; const int INF = 1000000; const int MAX = 100 + 1; //side is defined as 0/1, i connect j on j's "side[i][j]" side int num, len[MAX], cnt[MAX][2], adj[MAX][2][8], side[MAX][MAX]; bool added[MAX]; int tar, res, sum; void DFS(int cur, int sid){ added[cur] = true; sum += len[cur]; for (int i = 0; i < cnt[cur][sid]; i ++){ //finish a loop if (adj[cur][sid][i] == tar){ if (sum < res) res = sum; break; } //prune if (sum + len[adj[cur][sid][i]] >= res || added[adj[cur][sid][i]]) continue; //deeper search DFS(adj[cur][sid][i], side[cur][adj[cur][sid][i]] ^ 1); } added[cur] = false; sum -= len[cur]; } int main(){ freopen("fence6.in", "r", stdin); freopen("fence6.out", "w", stdout); // int s; memset(len, 0, sizeof(len)); scanf("%d", &num); for (int i = 0; i < num; i ++){ scanf("%d", &s); scanf("%d %d %d", len + s, &cnt[s][0], &cnt[s][1]); for (int j = 0; j < cnt[s][0]; j ++){ scanf("%d", &adj[s][0][j]); side[adj[s][0][j]][s] = 0; } for (int j = 0; j < cnt[s][1]; j ++){ scanf("%d", &adj[s][1][j]); side[adj[s][1][j]][s] = 1; } } // int min = INF; for (tar = 1; tar < MAX; tar ++){ if (len[tar]){ memset(added, 0, sizeof(added)); res = INF; sum = 0; DFS(tar, 0); if (res < min) min = res; } } // printf("%d/n", min); fclose(stdin); fclose(stdout); return 0; }