hdu 6165 - 暴力dfs
2017-08-23 18:50
232 查看
题目链接:点击打开链接
题解思路:节点就1000,m就6000直接暴力肯定能过。
代码:
#include <iostream>
#include <cstdio>
#include<set>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
const int mx = 1e3+10;
struct node{
int y,nxt;
}Edge[mx<<3];
int n,m,head[mx],tot;
void AddEdge(int x,int y){
Edge[tot].y = y;
Edge[tot].nxt = head[x];
head[x] = tot++;
}
bool vis[mx][mx],vic[mx];
void dfs(int x,int fa){
for(int i=head[x];i!=-1;i=Edge[i].nxt){
int son = Edge[i].y;
if(vic[son]) continue;
vic[son] = 1;
vis[fa][son] = 1;
dfs(son,fa);
}
}
int main(){
int t;
scanf("%d",&t);
while(t--){
memset(head,-1,sizeof(head));
tot = 0;
scanf("%d%d",&n,&m);
int a,b;
for(int i=1;i<=m;i++){
scanf("%d%d",&a,&b);
AddEdge(a,b);
}
memset(vis,0,sizeof(vis));
for(int i=1;i<=n;i++){
memset(vic,0,sizeof(vic));
vic[i] = 1;
dfs(i,i);
}
int flag = 0;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(j==i) continue;
if(!(vis[i][j]||vis[j][i])) flag = 1;
}
}
puts(flag?"Light my fire!":"I love you my love and our love save us!");
}
return 0;
}
题解思路:节点就1000,m就6000直接暴力肯定能过。
代码:
#include <iostream>
#include <cstdio>
#include<set>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
const int mx = 1e3+10;
struct node{
int y,nxt;
}Edge[mx<<3];
int n,m,head[mx],tot;
void AddEdge(int x,int y){
Edge[tot].y = y;
Edge[tot].nxt = head[x];
head[x] = tot++;
}
bool vis[mx][mx],vic[mx];
void dfs(int x,int fa){
for(int i=head[x];i!=-1;i=Edge[i].nxt){
int son = Edge[i].y;
if(vic[son]) continue;
vic[son] = 1;
vis[fa][son] = 1;
dfs(son,fa);
}
}
int main(){
int t;
scanf("%d",&t);
while(t--){
memset(head,-1,sizeof(head));
tot = 0;
scanf("%d%d",&n,&m);
int a,b;
for(int i=1;i<=m;i++){
scanf("%d%d",&a,&b);
AddEdge(a,b);
}
memset(vis,0,sizeof(vis));
for(int i=1;i<=n;i++){
memset(vic,0,sizeof(vic));
vic[i] = 1;
dfs(i,i);
}
int flag = 0;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(j==i) continue;
if(!(vis[i][j]||vis[j][i])) flag = 1;
}
}
puts(flag?"Light my fire!":"I love you my love and our love save us!");
}
return 0;
}
相关文章推荐
- HDU 6165 - FFF at Valentine DFS暴力 2017 Multi-University Training Contest - Team 9
- HDU 4272LianLianKan 2012长春网络赛F题(思维) 暴力,dfs可以水过,正解是状态压缩dp
- hdu 5311 Hidden String(dp+暴力dfs)
- hdu 4770 Lights Against Dudely(暴力枚举dfs)
- HDU 2212 - DFS (暴力打表)
- HDU_6016_(Bestcoder round #92 1002)_(dfs)(暴力)
- HDU 3368 Reversi (暴力,DFS)
- [2-SAT 字典序最小解 暴力dfs 模板题] HDU 1814 Peaceful Commission
- hdu 4770 Lights Against Dudely(暴力枚举dfs)
- hdu 5024 Wang Xifeng's Little Plot【暴力dfs,剪枝】
- HDU-5937 Equation(暴力DFS+剪枝)
- HDU 4403 A very hard Aoshu problem(DFS+暴力)
- HDU 5167 Fibonacci(DFS暴力搜索)
- hdu 4770 Lights Against Dudely(暴力枚举dfs)
- HDU 4403 A very hard Aoshu problem (DFS暴力)
- HDU 5113 Black And White(暴力dfs+减枝)
- hdu 1010 Tempter of the Bone(dfs暴力)
- 2015多校第6场 HDU 5355 Cake 贪心,暴力DFS
- [HDU 1427]速度计算24点(DFS暴力搜索)
- hdu 5024 Wang Xifeng's Little Plot (dfs+暴力)