USACO算法系列三十五——race3

最新推荐文章于 2020-02-27 23:12:58 发布

无能所以愤怒

最新推荐文章于 2020-02-27 23:12:58 发布

阅读量483

点赞数

分类专栏： USACO算法系列文章标签：算法 path struct

本文链接：https://blog.csdn.net/zengniao/article/details/6108791

版权

USACO算法系列专栏收录该内容

58 篇文章 2 订阅

订阅专栏

题目：http://www.nocow.cn/index.php/Translate:USACO/race3

寻找从起点s到达终点t的必经路径。和寻找中间点，中间点满足后半段路程不能回到前半段路程。

必经节点，假设节点不存在，如果能从s点走到t，则不是必经路径，否则是。

中间点，前半段走到中间点，所有点标为RED，从中间点走到t点，所有节点标为BLUE，如果出现BLUE覆盖RED，则不是中间点。

采用的都是BFS遍历的方法。

#include <iostream> #include <fstream> #include <string.h> #define SIZE 50 #define RED 1 #define BLUE 2 struct Point { int pos; int deep; }; using namespace std; int map[SIZE][SIZE] = {0}; int n =0; Point path[SIZE]; int pl = 0; bool isuse[SIZE]; int unavoidable[SIZE]; int ul = 0; int separate[SIZE]; int sl = 0; int mark[SIZE] = {0}; //广度遍历整个图 bool BFSMap(int position) { for (int i=0; i < pl; i ++) { Point p = path[i]; for ( int j = 0; j < n; j ++ ) { if (isuse[j] == false && map[p.pos][j] > 0) { if (j != position) { path[pl].pos = j; path[pl].deep = p.deep + 1; pl ++; isuse[j] = true; }//end if j != position if (j == n-1) { return true; } } }//end for j }//end for i return false; } void RedMarkMap(int end) { path[0].pos = 0; path[0].deep = 1; mark[0] = RED; pl = 1; for (int i=0; i < pl; i ++) { Point p = path[i]; for ( int j = 0; j < n; j ++ ) { if (isuse[j] == false && map[p.pos][j] > 0) { if (j!= end) { path[pl].pos = j; path[pl].deep = p.deep + 1; pl ++; isuse[j] = true; mark[j] = RED; }//end if j != end }//end if }//end for j } } bool BlueMarkMap(int start) { pl = 1; path[0].pos = start; path[1].deep = 1; for (int i=0; i < pl; i ++) { Point p = path[i]; for ( int j = 0; j < n; j ++ ) { if (isuse[j] == false && map[p.pos][j] > 0) { if (mark[j] == RED) { return false; } path[pl].pos = j; path[pl].deep = p.deep + 1; pl ++; isuse[j] = true; mark[j] = BLUE; }//end if }//end for j } return true; } //输入输出流 ifstream fin("race3.in"); ofstream fout("race3.out"); int main() { //输入数据 int index = 0; fin >> index; while(index != -1) { if (index == -2) { n++; }//end if index == -2 else { map[n][index] = 1; } fin >> index; } //广度遍历获取所有路径 path[0].pos = 0; path[0].deep = 0; pl ++; //判断缺失点是否可达 for (int i=1; i < n-1; i ++) { memset(isuse, false, sizeof(bool) * SIZE); if (!BFSMap(i)) { unavoidable[ul] = i; ul ++; } pl = 1; } for (int i=0; i < ul; i ++) { memset(isuse, false, sizeof(bool) * SIZE); memset(mark, 0, sizeof(int) * SIZE); RedMarkMap(unavoidable[i]); memset(isuse, false, sizeof(bool) * SIZE); if (BlueMarkMap(unavoidable[i])) { separate[sl] = unavoidable[i]; sl ++; } } fout << ul; for (int i=0; i < ul; i ++) { fout << " " << unavoidable[i]; } fout << endl; fout << sl; for (int i=0; i < sl; i++) { fout <<" "<<separate[i]; } fout <<endl; return 0; }

运行结果：

Executing... Test 1: TEST OK [0.000 secs, 3024 KB] Test 2: TEST OK [0.011 secs, 3024 KB] Test 3: TEST OK [0.000 secs, 3024 KB] Test 4: TEST OK [0.011 secs, 3024 KB] Test 5: TEST OK [0.011 secs, 3024 KB] Test 6: TEST OK [0.032 secs, 3024 KB] Test 7: TEST OK [0.000 secs, 3024 KB] Test 8: TEST OK [0.000 secs, 3024 KB] Test 9: TEST OK [0.011 secs, 3024 KB] Test 10: TEST OK [0.011 secs, 3024 KB] Test 11: TEST OK [0.011 secs, 3024 KB] All tests OK.