2015 Multi-University Training Contest 5 hdu 5348 MZL's endless loop

MZL's endless loop

Time Limit: 3000/1500 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 1853    Accepted Submission(s): 400
Special Judge

Problem Description

As we all kown, MZL hates the endless loop deeply, and he commands you to solve this problem to end the loop.
You are given an undirected graph with n vertexs and m edges. Please direct all the edges so that for every vertex in the graph the inequation |out degree − in degree|≤1 is satisified.
The graph you are given maybe contains self loops or multiple edges.

 

Input

The first line of the input is a single integer T, indicating the number of testcases.
For each test case, the first line contains two integers n and m.
And the next m lines, each line contains two integers ui and vi, which describe an edge of the graph.
T≤100, 1≤n≤105, 1≤m≤3∗105, ∑n≤2∗105, ∑m≤7∗105.

 

Output

For each test case, if there is no solution, print a single line with −1, otherwise output m lines,.
In ith line contains a integer 1 or 0, 1 for direct the ith edge to ui→vi, 0 for ui←vi.

 

Sample Input

2

3 3

1 2

2 3

3 1

7 6

1 2

1 3

1 4

1 5

1 6

1 7

 

Sample Output

1

1

1

0

1

0

1

0

1

 

Source

2015 Multi-University Training Contest 5

 

解题：欧拉回路+欧拉路径，开始还以为是混合图的欧拉回路呢。。。哎。。。注意爆栈。。。

 #pragma comment(linker, "/STACK:102400000,102400000")
 #include <cstdio>
 #include <cstring>
 #include <algorithm>
 using namespace std;
 const int maxn = ;
 struct arc {
     int to,next;
     bool vis;
     arc(int x = ,int y = -) {
         to = x;
         next = y;
         vis = false;
     }
 } e[];
 int head[],d[maxn],tot,n,m;
 void add(int u,int v) {
     e[tot] = arc(v,head[u]);
     head[u] = tot++;
 }
 bool dfs(int u) {
     for(int &i = head[u]; ~i; i = e[i].next) {
         if(e[i].vis || e[i^].vis) continue;
         e[i].vis = true;
         if(d[e[i].to]) {
             d[e[i].to] = ;
             return true;
         }
         if(dfs(e[i].to)) return true;
     }
     return false;
 }
 void cao() {
     for(int i = ; i <= n; ++i)
         if(d[i]) {
             d[i] = ;
             dfs(i);
         }
     for(int i = ; i <= n; ++i)
         while(~head[i]) dfs(i);
 }
 int main() {
     int kase,u,v;
     scanf("%d",&kase);
     while(kase--){
         scanf("%d%d",&n,&m);
         memset(head,-,sizeof head);
         for(int i = tot = ; i < m; ++i){
             scanf("%d%d",&u,&v);
             add(u,v);
             add(v,u);
             d[u] ^= ;
             d[v] ^= ;
         }
         cao();
         for(int i = ; i < tot; i += )
             printf("%d\n",e[i].vis);
     }
     return ;
 }