HDOJ 5348 MZL's endless loop 乱搞
来源:互联网 发布:汉仪小麦体简 mac 编辑:程序博客网 时间:2024/06/15 20:15
对每个点DFS,根据入度和出度的情况选择标记入边或者出边进行DFS
MZL's endless loop
Time Limit: 3000/1500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1037 Accepted Submission(s): 206
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 withn 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.
You are given an undirected graph with
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 integersn and m .
And the nextm 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 .
For each test case, the first line contains two integers
And the next
Output
For each test case, if there is no solution, print a single line with −1 , otherwise output m lines,.
Ini th line contains a integer 1 or 0 , 1 for direct the i th edge to ui→vi , 0 for ui←vi .
In
Sample Input
23 31 22 33 17 61 21 31 41 51 61 7
Sample Output
111010101
Source
2015 Multi-University Training Contest 5
/* ***********************************************Author :CKbossCreated Time :2015年08月05日 星期三 10时51分53秒File Name :HDOJ5348.cpp************************************************ */#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <string>#include <cmath>#include <cstdlib>#include <vector>#include <queue>#include <set>#include <map>#pragma comment(linker, "/STACK:102400000,102400000")using namespace std;const int maxn=100100;int n,m;struct Edge{ int to,next;}edge[maxn*6];int Adj[maxn],Size;void init(){ memset(Adj,-1,sizeof(Adj)); Size=0;}void Add_Edge(int u,int v){ edge[Size].to=v; edge[Size].next=Adj[u]; Adj[u]=Size++;}bool vis[maxn*6];int ans[maxn*3],in[maxn],out[maxn],num[maxn];void clear(){ init(); memset(ans,0,sizeof(ans)); memset(vis,0,sizeof(vis)); memset(num,0,sizeof(num)); memset(in,0,sizeof(in)); memset(out,0,sizeof(out));}/// u--->vvoid dfs0(int u){ for(int i=Adj[u];~i;i=edge[i].next) { if(vis[i]==true) { Adj[u]=edge[i].next; continue; } int v=edge[i].to; if(v!=u&&in[v]>out[v]) continue; vis[i]=vis[i^1]=true; if(i%2==0) ans[i/2]=0; else ans[i/2]=1; out[u]++; in[v]++; Adj[u]=edge[i].next; dfs0(v); return ; }}/// u<----vvoid dfs1(int u){ for(int i=Adj[u];~i;i=edge[i].next) { if(vis[i]==true) { Adj[u]=edge[i].next; continue; } int v=edge[i].to; if(v!=u&&in[v]<out[v]) continue; vis[i]=vis[i^1]=true; if(i%2==0) ans[i/2]=1; else ans[i/2]=0; out[v]++; in[u]++; Adj[u]=edge[i].next; dfs1(v); return ; }}int main(){ //freopen("in.txt","r",stdin); //freopen("out.txt","w",stdout); int T_T; scanf("%d",&T_T); while(T_T--) { clear(); scanf("%d%d",&n,&m); for(int i=0,u,v;i<m;i++) { scanf("%d%d",&u,&v); /// edgeid Size/2; Add_Edge(u,v); /// Size%2==0 real edge Add_Edge(v,u); num[u]++; num[v]++; } for(int i=1;i<=n;i++) { while(in[i]+out[i]!=num[i]) { if(in[i]>=out[i]) dfs0(i); else dfs1(i); } } for(int i=0;i<m;i++) printf("%d\n",ans[i]); } return 0;}
0 0
- HDOJ 5348 MZL's endless loop 乱搞
- HDOJ 5348 MZL's endless loop
- hdu 5348 MZL's endless loop
- HDU 5348 MZL's endless loop
- *HDU 5348 - MZL's endless loop(搜索)
- hdu 5348 MZL's endless loop
- hdu 5348 MZL's endless loop 暴搜
- hdu 5348 MZL's endless loop dfs
- Hdu 5348 MZL's endless loop (构造)
- hdu 5348 MZL's endless loop(dfs+图论)
- hdu 5348 MZL's endless loop(dfs)
- hdu 5348 MZL's endless loop 欧拉回路
- HDU 5348 MZL's endless loop(DFS+邻接表)
- HDU 5348 MZL's endless loop (dfs+删边)
- HDU5348 MZL's endless loop (搜索)
- 图论 - hdu5348 MZL's endless loop
- hdu 5348 MZL's endless loop(欧拉路径+欧拉环)
- HDU 5348 MZL's endless loop(思想用的是深搜)经典
- KMP算法
- POST与GET的区别及RESTful
- Android SDK NDK API文档等下载地址
- 解剖我的目标月
- MongoDB Sharding实践
- HDOJ 5348 MZL's endless loop 乱搞
- 【CSAPP】《深入理解计算机系统》读书笔记
- VS2010 C#中调用matlab2014a生成的dll的几个问题
- TCP的流量控制与拥塞控制的对比
- vector中erase用法注意事项
- SATA分区基础知识,个人认为必须掌握的要点
- CC2541 设备发送数据给手机
- 5.1声道转化为左右声道
- 安卓获取IP,纯代码,可以直接用。