标签：case air pre asi 测试 should 需要 color void
题目链接：http://www.spoj.com/problems/IM/en/
Time limit:491 ms Memory limit:1572864 kB Code length Limit:50000 B
Jedi knights, Qui-Gon Jinn and his young apprentice Obi-Wan Kenobi, are entrusted by Queen Padmé Amidala to save Naboo from an invasion by the Trade Federation. They must leave Naboo immediately and go to Tatooine to pick up the proof of the Federation’s evil design. They then must proceed on to the Republic’s capital planet Coruscant to produce it in front of the Republic’s Senate. To help them in this endeavor, the queen’s captain provides them with an intergalactic map. This map shows connections between planets not yet blockaded by the Trade Federation. Any pair of planets has at most one connection between them, and all the connections are two-way. To avoid detection by enemy spies, the knights must embark on this adventure without visiting any planet more than once. Can you help them by determining if such a path exists?
Note - In the attached map, the desired path is shown in bold.
The first line of the input is a positive integer t ≤ 20, which is the number of test cases. The descriptions of the test cases follow one after the other. The first line of each test case is a pair of positive integers n, m (separated by a single space). 2 ≤ n ≤ 30011 is the number of planets and m ≤ 50011 is the number of connections between planets. The planets are indexed with integers from 1 to n. The indices of Naboo, Tatooine and Coruscant are 1, 2, 3 respectively. The next m lines contain two integers each, giving pairs of planets that have a connection between them.
The output should contain t lines. The ith line corresponds to the ith test case. The output for each test case should be YES if the required path exists and NO otherwise.
Input
2
3 3
1 2
2 3
1 3
3 1
1 3
Output
YES
NO
就是1到n共n个点，互相之间有m条边连接，主人公呢想从1出发，经过2，到达3，不走重复路也不走重复点，问你可不可行。
怎么说呢，最大流构图题做的多了，就有点感觉了，大概知道怎么个建图方向了。
首先，瞟了一眼[网络流建模汇总][Edelweiss].pdf上的思路，知道了从2出发，往1和3两个汇点做最大流，这样就可以满足题目要求；
然后我们就建立超级源点s，和超级汇点t，点2连到s上去，cap=2；点1、3都连到t上去，cap=1；
然后我们还要想到一件事情，不能走重复边，很简单，所有题目里给的边的cap都设为1；
那不走重复点呢？就需要拆点，说起来有点玄乎，其实就是原本是个点，然后我们两只手拿住他，吧唧那么一拉，诶就变成了一条边，
显然，我们就记这条拆点边为( from = in(i) , to = out(i) , cap = 1)；
这样我们的图就建好了，剩下来的就是dinic了。
1 #include<cstdio> 2 #include<cstdio> 3 #include<cstring> 4 #include<vector> 5 #include<queue> 6 #define INF 0x3f3f3f3f 7 #define MAXN 2*(30011+1000) 8 using namespace std; 9 int n,m; 10 struct Edge{ 11 int u,v,c,f; 12 }; 13 struct Dinic 14 { 15 int s,t; 16 vector<Edge> E; 17 vector<int> G[MAXN]; 18 bool vis[MAXN]; 19 int lev[MAXN]; 20 int cur[MAXN]; 21 void init(int n) 22 { 23 E.clear(); 24 for(int i=0;i<=n;i++) G[i].clear(); 25 } 26 void addedge(int from,int to,int cap) 27 { 28 E.push_back((Edge){from,to,cap,0}); 29 E.push_back((Edge){to,from,0,0}); 30 G[from].push_back(E.size()-2); 31 G[to].push_back(E.size()-1); 32 } 33 bool bfs() 34 { 35 memset(vis,0,sizeof(vis)); 36 queue<int> q; 37 q.push(s); 38 lev[s]=0; 39 vis[s]=1; 40 while(!q.empty()) 41 { 42 int now=q.front(); q.pop(); 43 for(int i=0;i<G[now].size();i++) 44 { 45 Edge edge=E[G[now][i]]; 46 int nex=edge.v; 47 if(!vis[nex] && edge.c>edge.f) 48 { 49 lev[nex]=lev[now]+1; 50 q.push(nex); 51 vis[nex]=1; 52 } 53 } 54 } 55 return vis[t]; 56 } 57 int dfs(int now,int aug) 58 { 59 if(now==t || aug==0) return aug; 60 int flow=0,f; 61 for(int& i=cur[now];i<G[now].size();i++) 62 { 63 Edge& edge=E[G[now][i]]; 64 int nex=edge.v; 65 if(lev[now]+1 == lev[nex] && (f=dfs(nex,min(aug,edge.c-edge.f)))>0) 66 { 67 edge.f+=f; 68 E[G[now][i]^1].f-=f; 69 flow+=f; 70 aug-=f; 71 if(!aug) break; 72 } 73 } 74 return flow; 75 } 76 int maxflow() 77 { 78 int flow=0; 79 while(bfs()) 80 { 81 memset(cur,0,sizeof(cur)); 82 flow+=dfs(s,INF); 83 } 84 return flow; 85 } 86 }dinic; 87 int in(int x){return x;} 88 int out(int x){return x+n;} 89 int main() 90 { 91 int t; 92 scanf("%d",&t); 93 while(t--) 94 { 95 scanf("%d%d",&n,&m);//n个点，m条边 96 dinic.init(2*n+2); 97 for(int i=1;i<=m;i++) 98 { 99 int from,to; 100 scanf("%d%d",&from,&to); 101 if(1<=from && from<=n && 1<=to && to<=n) 102 { 103 dinic.addedge(out(from),in(to),1); 104 dinic.addedge(out(to),in(from),1); 105 } 106 } 107 dinic.s=0, dinic.t=2*n+2; 108 dinic.addedge(dinic.s,in(2),2); 109 dinic.addedge(out(1),dinic.t,1); 110 dinic.addedge(out(3),dinic.t,1); 111 for(int i=1;i<=n;i++) dinic.addedge(in(i),out(i),i==2?2:1); 112 if(dinic.maxflow()==2) printf("YES\n"); 113 else printf("NO\n"); 114 } 115 }
PS.听说测试输入边的时候，还会超出范围？不管是不是真的，反正加个if()语句鲁棒一下，无所谓。
SPOJ IM - Intergalactic Map - [拆点最大流]
标签：case air pre asi 测试 should 需要 color void
原文地址：http://www.cnblogs.com/dilthey/p/7389663.html
