HDU5285.wyh2000 and pupil

[code]#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <ctime>
#include <vector>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
#define INF 0x3f3f3f3f
#define inf -0x3f3f3f3f
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define mem0(a) memset(a,0,sizeof(a))
#define mem1(a) memset(a,-1,sizeof(a))
#define mem(a, b) memset(a, b, sizeof(a))
typedef long long ll;
const int maxn=101000;
vector<int>G[maxn];
int vis[maxn];
int col[maxn];
int a,b,ok;

void dfs(int u,int c){
    if(c==0)
        a++;
    else
        b++;
    col[u]=c;
    vis[u]=1;
    int len=G[u].size();
    for(int i=0;i<len;i++){
        int v=G[u][i];
        if(vis[v]==1){
            if(col[v]==c)
                ok=1;
            continue;
        }
        dfs(v,c^1);
    }
}

int main(){
    int n,m;
    int t;
    scanf("%d",&t);
    while(t--){
        scanf("%d%d",&n,&m);
        for(int i=1;i<=n;i++)           //预处理
            G[i].clear();
        mem0(vis);
        mem1(col);
        int x,y;
        if(n<=1){                   //每组至少有一个人
            printf("Poor wyh\n");
            continue;
        }
        for(int i=0;i<m;i++){
            scanf("%d%d",&x,&y);
            G[x].push_back(y);
            G[y].push_back(x);
        }
        ok=0;
        int ans1=0,ans2=0;
        for(int i=1;i<=n;i++){
            a=0,b=0;
            if(ok==1)
                    break;
            if(vis[i]==1)
                continue;
            dfs(i,0);
            if(a<b)
                swap(a,b);
            ans1+=a;
            ans2+=b;
            //printf("%d PPPPPPP %d\n",ans1,ans2);
        }
        if(ok==1){
            printf("Poor wyh\n");
        }
        else{
            if(ans2==0)
                printf("%d %d\n",ans1-1,1);
            else
                printf("%d %d\n",ans1,ans2);
        }
    }
    return 0;
}