幸福时光小区,50万左右越野车,眼部抽脂减肥的价格
#include<cstdio> #include<cstring> #include<algorithm> #include<stack> #include<vector> #include<queue> #include<iostream> #define Pair pair<int,int> #define F first #define S second using namespace std; const int MAXN=1e6+10; //#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<20,stdin),p1==p2)?EOF:*p1++) char buf[1<<20],*p1=buf,*p2=buf; inline int read() { char c=getchar();int x=0,f=1; while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();} while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();} return x*f; } struct node { int u,v,w,nxt; }edge[MAXN]; int head[MAXN],num=1; int N,M; int vis[MAXN],ans[MAXN]; inline void AddEdge(int x,int y) { edge[num].u=x; edge[num].v=y; edge[num].nxt=head[x]; head[x]=num++; } int dfs(int x) { vis[x]=1; for(int i=head[x];i!=-1;i=edge[i].nxt) if(!vis[edge[i].v]) dfs(edge[i].v); } int check(int x) { memset(vis,0,sizeof(vis)); dfs(x); if(x<=N&&vis[x]&&vis[x+N]) return 0; if(x>N&&vis[x]&&vis[x-N]) return 0; return 1; } int main() { #ifdef WIN32 freopen("a.in","r",stdin); #else #endif memset(head,-1,sizeof(head)); N=read(),M=read(); for(int i=1;i<=M;i++) { int a,b;char x,y; a=read(); while(x!='Y'&&x!='N') x=getchar(); b=read(); while(y!='Y'&&y!='N') y=getchar(); if(x=='Y') if(y=='Y') AddEdge(a+N,b),AddEdge(b+N,a); else AddEdge(a+N,b+N),AddEdge(b,a); else //x==N if(y=='Y') AddEdge(a,b),AddEdge(b+N,a+N); else AddEdge(a,b+N),AddEdge(b,a+N); x='0';y='0'; } for(int i=1;i<=N;i++) { int ans1=check(i); int ans2=check(i+N); if(ans1&&ans2) ans[i]=1;//? else if(ans1) ans[i]=2;//Y else if(ans2) ans[i]=3;//N else {printf("IMPOSSIBLE\n");return 0;} } for(int i=1;i<=N;i++) { if(ans[i]==1) putchar('?'); else if(ans[i]==2) putchar('Y'); else if(ans[i]==3) putchar('N'); } return 0; }
如对本文有疑问,请在下面进行留言讨论,广大热心网友会与你互动!! 点击进行留言回复
如何在没有core文件的情况下用dmesg+addr2line定位段错误
用QT制作3D点云显示器——QtDataVisualization
网友评论