POJ 2492 Knights of the Round Table
来源:互联网 发布:香港免备案域名 编辑:程序博客网 时间:2024/05/24 01:38
Knights of the Round Table
Time Limit: 7000MS Memory Limit: 65536KTotal Submissions: 7643 Accepted: 2377
Description
Being a knight is a very attractive career: searching for the Holy Grail, saving damsels in distress, and drinking with the other knights are fun things to do. Therefore, it is not very surprising that in recent years the kingdom of King Arthur has experienced an unprecedented increase in the number of knights. There are so many knights now, that it is very rare that every Knight of the Round Table can come at the same time to Camelot and sit around the round table; usually only a small group of the knights isthere, while the rest are busy doing heroic deeds around the country.
Knights can easily get over-excited during discussions-especially after a couple of drinks. After some unfortunate accidents, King Arthur asked the famous wizard Merlin to make sure that in the future no fights break out between the knights. After studying the problem carefully, Merlin realized that the fights can only be prevented if the knights are seated according to the following two rules:
Knights can easily get over-excited during discussions-especially after a couple of drinks. After some unfortunate accidents, King Arthur asked the famous wizard Merlin to make sure that in the future no fights break out between the knights. After studying the problem carefully, Merlin realized that the fights can only be prevented if the knights are seated according to the following two rules:
- The knights should be seated such that two knights who hate each other should not be neighbors at the table. (Merlin has a list that says who hates whom.) The knights are sitting around a roundtable, thus every knight has exactly two neighbors.
- An odd number of knights should sit around the table. This ensures that if the knights cannot agree on something, then they can settle the issue by voting. (If the number of knights is even, then itcan happen that ``yes" and ``no" have the same number of votes, and the argument goes on.)
Input
The input contains several blocks of test cases. Each case begins with a line containing two integers 1 ≤ n ≤ 1000 and 1 ≤ m ≤ 1000000 . The number n is the number of knights. The next m lines describe which knight hates which knight. Each of these m lines contains two integers k1 and k2 , which means that knight number k1 and knight number k2 hate each other (the numbers k1 and k2 are between 1 and n ).
The input is terminated by a block with n = m = 0 .
The input is terminated by a block with n = m = 0 .
Output
For each test case you have to output a single integer on a separate line: the number of knights that have to be expelled.
Sample Input
5 51 41 52 53 44 50 0
Sample Output
2
Hint
Huge input file, 'scanf' recommended to avoid TLE.
Source
Central Europe 2005
这题真是把我坑惨了,本来看了解题报告之后思路就很清晰了。结果却是无尽的wa,看和别人的思路一样,怎么会wa呢? 于是从上午找到下午,不断改别人的代码,将别人的代码都马上要改成自己的了,人家的还是能ac,我很奇怪啊,最后我把建图的方式改了改,他们用的邻接表,我用的vector,把他们的改成vector之后,他们的终于wa了。
这才意识到这题用vector建图不行啊,将我的代码不用vector建图而用邻接表后就过了,哎,悲催啊,看网上的说大数据的时候尽量不要用vector。
stl很高端,用起来很方便快捷,但死的时候都不知道是怎么死的
http://blog.csdn.net/lyy289065406/article/details/6756821 他写的非常棒
这题的考察点很综合。
考察点: 点连通分量,奇圈,补图,二分图
/*************************************************************** > File Name: knights.cpp > Author: SDUT_GYX > Mail: 2272902662@qq.com > Created Time: 2013/5/22 10:10:42 **************************************************************/#include <iostream>#include <cstring>#include <algorithm>#include <cstdio>#include <queue>#include <cstdlib>#include <iomanip>#include <string>#include <vector>#include <set>#include <cmath>#include <stack>#define LL long longusing namespace std;struct num{int u,v,next;}a[1000000];int b[11000];stack<int>node;set<int>res,point;int status[1100][1100],color[1100];int low[1100],dnf[1100],cou;int main(){//freopen("data1.in","r",stdin);void Tarjan(int u,int fa);int n,m;while(scanf("%d %d",&n,&m)!=EOF){if(n==0&&m==0){break;}memset(status,0,sizeof(status));while(m--){int x,y;scanf("%d %d",&x,&y);status[x][y]=status[y][x]=1;}memset(b,-1,sizeof(b));int Top=0;for(int i=1;i<=n;i++){for(int j=1;j<=n;j++){ if(!status[i][j]&&i!=j){a[Top].u=i; a[Top].v=j;a[Top].next=b[i];b[i]=Top; Top++;}}}res.clear();memset(dnf,0,sizeof(dnf));memset(low,0,sizeof(low));for(int i=1;i<=n;i++){if(!dnf[i]){ cou=0;while(!node.empty()){node.pop();} Tarjan(i,-1);}}printf("%d\n",n-res.size());}return 0;}int check(int u,int k){color[u]=k;for(int i=b[u];i!=-1;i=a[i].next){int v=a[i].v;if(point.find(v)!=point.end()){if(color[v]==0){return check(v,3-k);}else{if(color[u]==color[v]){return 0;}}}}return 1;}void Tarjan(int u,int fa){node.push(u);low[u]=dnf[u]=++cou;for(int i=b[u]; i!=-1; i=a[i].next){int v=a[i].v;if(!dnf[v]){Tarjan(v,u);low[u]=min(low[v],low[u]);if(low[v]>=dnf[u]){point.clear();int x;do{x=node.top();node.pop();point.insert(x);}while(v!=x);point.insert(u);memset(color,0,sizeof(color));int t=check(u,1);if(t==0){while(point.size()>0){set<int>::iterator it = point.begin();res.insert(*it);point.erase(it);}}}}else if(dnf[v]<dnf[u]&&v!=fa){low[u]=min(low[u],dnf[v]);}}}
- POJ 2492 Knights of the Round Table
- POJ 2942 Knights of the Round Table
- poj 2942 Knights of the Round Table
- POJ 2942 Knights of the Round Table
- POJ 2942: Knights of the Round Table
- poj 2942 Knights of the Round Table
- POJ 2942 Knights of the Round Table
- POJ 2942 Knights of the Round Table
- POJ-2942 Knights of the Round Table
- poj 2942 Knights of the Round Table
- poj 2942 Knights of the Round Table
- POJ 2942 Knights of the Round Table
- POJ 2942 Knights of the Round Table
- Knights of the Round Table POJ
- Knights of the Round Table
- Knights of the Round Table
- Knights of the Round Table
- POJ-2942-The Knights Of The Round Table
- 通过IIS访问webservice不能删除文件,而在本地可以删除
- wxPython利用pytesser模块实现图片文字识别
- (挑战编程_2_1)Jolly Jumpers
- 关于网页皮肤切换
- js传参数到后台乱码
- POJ 2492 Knights of the Round Table
- JDBC 模糊查询 传参问题
- (挑战编程_2_2)
- MVC3 在IIS6的部署 记录
- 安卓升级版本新方法
- 基于S3C6410的U-boot启动代码分析(一)
- IOS,objective_C中用@interface和 @property 方式声明变量的区别
- 表数据生成 insert 语句
- Foxmail文件格式