Exploration

 Accepts: 190
 Submissions: 976
 Time Limit: 30000/15000 MS (Java/Others)
 Memory Limit: 131072/131072 K (Java/Others)
Problem Description

Miceren likes exploration and he found a huge labyrinth underground!

This labyrinth has NN caves and some tunnels connecting some pairs of caves.

There are two types of tunnel, one type of them can be passed in only one direction and the other can be passed in two directions. Tunnels will collapse immediately after Miceren passing them.

Now, Miceren wants to choose a cave as his start point and visit at least one other cave, finally get back to start point.

As his friend, you must help him to determine whether a start point satisfing his request exists.

Input

The first line contains a single integer TT, indicating the number of test cases.

Each test case begins with three integers N,~M1,~M2N, M1, M2, indicating the number of caves, the number of undirectional tunnels, the number of directional tunnels.

The next M1M1 lines contain the details of the undirectional tunnels. Each line contains two integers u,~vu, v meaning that there is a undirectional tunnel between u,~vu, v. (u~\neq~vu ≠ v)

The next M2M2 lines contain the details of the directional tunnels. Each line contains integers u,~vu, v meaning that there is a directional tunnel from uu to vv. (u~\neq~vu ≠ v)

TT is about 100.

1~\le~N, M1, M2~\le~1000000.1 ≤ N,M1,M2 ≤ 1000000.

There may be some tunnels connect the same pair of caves.

The ratio of test cases with $N~\gt~1000$ is less than 5%.

Output

For each test queries, print the answer. If Miceren can do that, output "YES", otherwise "NO".

Sample Input
2
5 2 1
1 2
1 2
4 5
4 2 2
1 2
2 3
4 3
4 1
Sample Output
YES
NO
Hint

If you need a larger stack size, please use #pragma comment(linker, "/STACK:102400000,102400000") and submit your solution using C++.

思路:并查集+拓扑排序;
先处理无向边,用并查集缩点,然后处理完后,所有的无向边都没了,并且无向边所连的点都缩成一个点,那么剩下的就是有向图了,那么有向图判环用拓扑排序。
  1 #include <stdio.h>
2 #include <stdlib.h>
3 #include<iostream>
4 #include<algorithm>
5 #include<math.h>
6 #include<string.h>
7 #include<map>
8 #include<vector>
9 #include<queue>
10 using namespace std;
11 #pragma comment(linker, "/STACK:102400000,102400000")
12 typedef long long LL;
13 int bin[1000005];
14 int du[1000005];
15 vector<int>vec[1000005];
16 queue<int>que;
17 int id[1000005];
18 bool dfs(int n);
19 int fin(int x);
20 int cnt[1000005];
21 bool t[1000005];
22 int main(void)
23 {
24 int n;
25 scanf("%d",&n);
26 while(n--)
27 {
28 int i,j;
29 memset(cnt,0,sizeof(cnt));
30 memset(t,0,sizeof(t));
31 for(i = 0; i <= 1000000; i++)
32 {
33 bin[i] = i;
34 du[i] = 1;
35 vec[i].clear();
36 }
37 int N,m1,m2;
38 bool flag = false;
39 scanf("%d %d %d",&N,&m1,&m2);
40 while(m1--)
41 {
42 int a,b;
43 scanf("%d %d",&a,&b);
44 int aa = fin(a);
45 int bb = fin(b);
46 if(aa!=bb)
47 {
48 if(du[aa]>du[bb])
49 {
50 du[aa]+=du[bb];
51 bin[bb] = aa;
52 }
53 else
54 {
55 du[bb] += du[aa];
56 bin[aa] = bb;
57 }
58 }
59 else flag = true;
60 }
61 while(m2--)
62 {
63 int a,b;
64 scanf("%d %d",&a,&b);
65 if(!flag)
66 {
67 int aa = fin(a);
68 int bb = fin(b);
69 if(aa == bb)
70 flag = true;
71 else
72 { cnt[bb]++;
73 vec[aa].push_back(bb);
74 }
75 }
76 }
77 if(!flag)
78 {
79 int cn = 0;
80 for(i = 1; i <= N; i++)
81 {
82 int c = fin(i);
83 if(!t[c])
84 {
85 id[cn++] =c;
86 t[c] = true;
87 }
88 }
89 while(!que.empty())que.pop();
90 int ck = 0;
91 for(i = 0;i < cn;i++)
92 {
93 if(!cnt[id[i]])
94 {
95 que.push(id[i]);
96 ck++;
97 }
98 }
99 while(!que.empty())
100 {
101 int ff = que.front();
102 que.pop();
103 for(i = 0;i < vec[ff].size();i++)
104 {
105 int k = vec[ff][i];
106 cnt[k]--;
107 if(cnt[k] == 0)
108 ck++,que.push(k);
109 }
110 }
111 if(cn != ck)
112 flag = true;
113 }
114 if(flag)printf("YES\n");
115 else printf("NO\n");
116 }
117 return 0;
118 }
119 int fin(int x)
120 {
121 int i;
122 for(i = x; bin[i] != i;)
123 i = bin[i];
124 return i;
125 }

还有拓扑排序部分改成dfs也可以过,数据比较水。

  1 #include <stdio.h>
2 #include <stdlib.h>
3 #include<iostream>
4 #include<algorithm>
5 #include<math.h>
6 #include<string.h>
7 #include<map>
8 #include<vector>
9 using namespace std;
10 #pragma comment(linker, "/STACK:102400000,102400000")
11 typedef long long LL;
12 int bin[1000005];
13 int du[1000005];
14 vector<int>vec[1000005];
15 bool vis[1000005];
16 int id[1000005];
17 bool t[1000005];
18 bool dfs(int n);
19 int fin(int x);
20 int cnt[1000005];
21 int main(void)
22 {
23 int n;
24 scanf("%d",&n);
25 while(n--)
26 {
27 int i,j;
28 memset(vis,0,sizeof(vis));
29 memset(t,0,sizeof(t));
30 memset(cnt,0,sizeof(cnt));
31 for(i = 0; i <= 1000000; i++)
32 {
33 bin[i] = i;
34 du[i] = 1;
35 vec[i].clear();
36 }
37 int N,m1,m2;
38 bool flag = false;
39 scanf("%d %d %d",&N,&m1,&m2);
40 while(m1--)
41 {
42 int a,b;
43 scanf("%d %d",&a,&b);
44 int aa = fin(a);
45 int bb = fin(b);
46 if(aa!=bb)
47 {
48 if(du[aa]>du[bb])
49 {
50 du[aa]+=du[bb];
51 bin[bb] = aa;
52 }
53 else
54 {
55 du[bb] += du[aa];
56 bin[aa] = bb;
57 }
58 }
59 else flag = true;
60 }
61 while(m2--)
62 {
63 int a,b;
64 scanf("%d %d",&a,&b);
65 if(!flag)
66 {
67 int aa = fin(a);
68 int bb = fin(b);
69 if(aa == bb)
70 flag = true;
71 else
72 {
73 vec[aa].push_back(bb);
74 }
75 }
76 }
77 if(!flag)
78 {
79 int cn = 0;
80 for(i = 1; i <= N; i++)
81 {
82 int c = fin(i);
83 if(!t[c])
84 {
85 id[cn++] =c;
86 }
87 }
88 for(i = 0; i <= cn; i++)
89 {
90 if(!vis[id[i]])
91 {
92 flag = dfs(id[i]);
93 if(flag)break;
94 }
95 }
96 }
97 if(flag)printf("YES\n");
98 else printf("NO\n");
99 }
100 return 0;
101 }
102 int fin(int x)
103 {
104 int i;
105 for(i = x; bin[i] != i;)
106 i = bin[i];
107 return i;
108 }
109 bool dfs(int n)
110 {
111 cnt[n] = 1;
112 vis[n] = true;
113 for(int i = 0; i < vec[n].size(); i++)
114 {
115 int c = vec[n][i];
116 if(cnt[c] == 1)
117 {
118 cnt[c] = 0;
119 return true;
120 }
121 else
122 {
123 if(dfs(c))
124 {
125 cnt[c] = 0;
126 return true;
127 }
128 }
129 }
130 cnt[n] = 0;
131 return false;
132 }

Exploration(hdu5222)的更多相关文章

  1. HDU-5222 Exploration(拓扑排序)

    一.题目链接 http://acm.hdu.edu.cn/showproblem.php?pid=5222 二.题意 给一个无向边+有向边的混合图,其中每条边只能使用一次,问图中是否存在环. 三.思路 ...

  2. poj 2594 Treasure Exploration (二分匹配)

    Treasure Exploration Time Limit: 6000MS   Memory Limit: 65536K Total Submissions: 6558   Accepted: 2 ...

  3. RFID Exploration and Spoofer a bipolar transistor, a pair of FETs, and a rectifying full-bridge followed by a loading FET

    RFID Exploration Louis Yi, Mary Ruthven, Kevin O'Toole, & Jay Patterson What did you do? We made ...

  4. POJ2594 Treasure Exploration

    Time Limit: 6000MS   Memory Limit: 65536K Total Submissions: 8193   Accepted: 3358 Description Have ...

  5. 并查集+拓扑排序 赛码 1009 Exploration

    题目传送门 /* 题意:无向图和有向图的混合图判环: 官方题解:首先对于所有的无向边,我们使用并查集将两边的点并起来,若一条边未合并之前, 两端的点已经处于同一个集合了,那么说明必定存在可行的环(因为 ...

  6. poj 2594 Treasure Exploration(最小路径覆盖+闭包传递)

    http://poj.org/problem?id=2594 Treasure Exploration Time Limit: 6000MS   Memory Limit: 65536K Total ...

  7. [UVA] 784 - Maze Exploration

      Maze Exploration  A maze of rectangular rooms is represented on a two dimensional grid as illustra ...

  8. Treasure Exploration(二分最大匹配+floyd)

    Treasure Exploration Time Limit: 6000MS   Memory Limit: 65536K Total Submissions: 7455   Accepted: 3 ...

  9. POJ 2594 Treasure Exploration(最小路径覆盖变形)

    POJ 2594 Treasure Exploration 题目链接 题意:有向无环图,求最少多少条路径能够覆盖整个图,点能够反复走 思路:和普通的最小路径覆盖不同的是,点能够反复走,那么事实上仅仅要 ...

随机推荐

  1. javaSE基础知识(走向编程的门口)— 更新完毕

    前言:玩儿编程最重要的一点:不要怕麻烦,感觉是在浪费时间: 能动手绝不哔哔:只要脑袋不傻,编程都是"一看就会,一练就废",开始学的时候,就算再基础的东西都建议手敲一遍 要有囫囵吞枣 ...

  2. 学习java 7.7

    学习内容: 多态转型:向上转型 Animal a = new Cat(); a.eat(); 向下转型 Cat c = (Cat)a; c.eat(); 抽象方法没有方法体,抽象类中有抽象方法 抽象类 ...

  3. React 16.13.1触发两次render

    一段很普通的代码,出发了两次render import React, { useState, useEffect } from 'react' const MouseTracker: React.FC ...

  4. nodeJs-process对象

    JavaScript 标准参考教程(alpha) 草稿二:Node.js process对象 GitHub TOP process对象 来自<JavaScript 标准参考教程(alpha)&g ...

  5. 移动开发之h5学习大纲

    移动开发学习形式:授课.自学 1.html5 css3 htm5shiv.js response.js 2.流式布局 自适应布局 盒模型 弹性盒模型 响应式布局3.iscroll swiper boo ...

  6. Vue 之keep-alive的使用,实现页面缓存

    什么是keep-alive 有时候我们不希望组件被重新渲染影响使用体验: 或者处于性能考虑,避免多次重复渲染降低性能.而是希望组件可以缓存下来,维持当前的状态.这时候就需要用到keep-alive组件 ...

  7. 【Linux】【Shell】【Basic】一行代码解决常见问题

    1. 查看可用IP for i in `seq 1 255`; do ping -c 1 10.210.55.$i >> /dev/null; if [ $? -eq 1 ]; then ...

  8. JAVA序列化浅析

    java.io.Serializable浅析 Java API中java.io.Serializable接口源码: 1 public interface Serializable { 2 } 类通过实 ...

  9. JDK的简介,卸载和安装过程

    JDK的简介,卸载和安装过程 JDK JRE JVM JDK:Java Development Kit JRE:Java Runtime Environment JVM:Java Virtual Ma ...

  10. 为什么众多软件厂商无法提供APS高级计划排程系统?工厂目前生产计划是怎么排产的?

    一.行业现状如想了解一下目前现状,去考察一下上了ERP的企业,会发现一个有趣的现象该企业无论ERP软件搞得如何如火如荼,似乎都与生产调度人员无关. 车间里或者生产线上的生产作业计划.生产过程的调度和管 ...