547D Mike and Fish

传送门

分析

见正睿10.3笔记

代码

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cctype>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<stack>
using namespace std;
int n,m,col[],cnt,Ans[];
multiset<pair<int,int> >v[];
inline void go(int x){
    while(!v[x].empty()){
      pair<int,int> a=*v[x].begin();
      int to=a.first,id=a.second;
      v[x].erase(v[x].find(make_pair(to,id)));
      v[to].erase(v[to].find(make_pair(x,id)));
      go(to);
      col[++cnt]=id;
    }
}
int main(){
    int i,j,k,x,y;
    scanf("%d",&n);
    m=n;
    for(i=;i<=n;i++){
      scanf("%d%d",&x,&y);
      v[x].insert(make_pair(y+,i));
      v[y+].insert(make_pair(x,i));
    }
    for(i=;i<=;i++)
      if(v[i].size()%){
          if(i<){
            m++;
            v[i].insert(make_pair(,m));
            v[].insert(make_pair(i,m));
        }else {
          m++;
            v[i].insert(make_pair(,m));
            v[].insert(make_pair(i,m));
        }
      }
    for(i=;i<=;i++)go(i);
    for(i=;i<=cnt;i++)Ans[col[i]]=i%;
    for(i=;i<=n;i++){
      if(Ans[i])printf("r");
        else printf("b");
    }
    return ;
}