POJ 1359 Spacecraft Malfunction G++

#include <iostream>
#include <cstdio>
#include <map>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
//英语    看博友好分析     博友程序代码更少
int da[110][2];//存储id
map<int,int> mp;//i->id
map<int,int> pm;//id->i
int n;
int hs[110];
bool check(int x)
{memset(hs,0,sizeof(hs));int flag=0;hs[x]=-1;for(int i=0;i<n;i++){if(i!=x){int a=pm[abs(da[i][0])];int t=1;if(da[i][0]<0){t=-1;}if(hs[a]!=0 && hs[a]!=t){flag=1;}else{hs[a]=t;}int b=pm[abs(da[i][1])];t=1;if(da[i][1]<0){t=-1;}if(hs[b]!=0 && hs[b]!=t){flag=1;}else{hs[b]=t;}if(hs[a]<0 && hs[b]<0)//{flag=1;}            }}int js=0;for(int i=0;i<n;i++){if(hs[i]==-1){js++;}}if(js>1)//{flag=1;}if(flag==0){return true;}else{return false;}
}
int main()
{int T;cin>>T;while(T--){cin>>n;for(int i=0;i<n;i++){int id,a,b;char ca,cb;cin>>id>>a>>ca>>b>>cb;mp[i]=id;pm[id]=i;da[i][0]=a;if(ca=='N'){da[i][0]=-a;}da[i][1]=b;if(cb=='N'){da[i][1]=-b;}}int js=0;int ans=-1;for(int i=0;i<n;i++){if(check(i)){js++;ans=i;}}if(js==1){cout<<mp[ans]<<endl;}else{cout<<"impossible\n";}}return 0;
}

POJ 1359 Spacecraft Malfunction G++相关推荐

POJ 2210 Metric Time G++
#include <iostream> #include <cstdio> using namespace std; int hs[13]={0,31,28,31,30,31, ...
POJ 1318 Word Amalgamation G++
#include <iostream> #include <string> #include <map> #include <vector> #incl ...
POJ 1647 One-move checkmate G++
#include <iostream> #include <cstdio> #include <string> int wqx,wqy,wkx,wky,bkx,bk ...
POJ 2579 Blurred Vision G++
#include <iostream> #include <vector> //感谢博友翻译 using namespace std; int main() {vector&l ...
POJ 2291 Rotten Ropes G++
#include <iostream> #include <vector> #include <algorithm> //谢谢博友分析 using namespac ...
POJ 1300 Door Man G++ 无向图欧拉路判定背
#include <iostream> #include <cstdio> #include <string> #include <cstring> u ...
POJ 1870 Bee Breeding G++ 正六边形矩阵巧妙背
#include <iostream> #include <cstdio> #include <cmath> using namespace std; //英语看 ...
POJ 1126 Simply Syntax G++ dfs未实现巧妙
#include <iostream> #include <cstdio> #include <string> using namespace std; //英语 ...
POJ前面的题目算法思路【转】
1000 A+B Problem 送分题 49% 2005-5-7 1001 Exponentiation 高精度 85% 2005-5-7 1002 487-3279 n/a 90% 2005-5- ...

POJ 1359 Spacecraft Malfunction G++

POJ 1359 Spacecraft Malfunction G++相关推荐

最新文章

热门文章