FFF at Valentine

Posted on | In , ,

题目链接

Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#ifndef ONLINE_JUDGE
#define dbg(x...) do{cout << "\033[33;1m" << #x << "->" ; err(x);} while (0)
void err(){cout << "\033[39;0m" << endl;}
template<template<typename...> class T, typename t, typename... A>
void err(T<t> a, A... x){for (auto v: a) cout << v << ' '; err(x...);}
template<typename T, typename... A>
void err(T a, A... x){cout << a << ' '; err(x...);}
#else
#define dbg(...)
#endif
#define inf 1ll << 50
const int maxn=1010;
const int maxm=6010;
vector<int> vec[maxn];
int vis[maxn];
int graph[maxn][maxn];
void dfs(int u){
	vis[u]=1;
	for(int i=0;i<vec[u].size();i++){
		int v=vec[u][i];
		if(vis[v]) continue;
		dfs(v);
	}
}
int main(){
	int t;
	scanf("%d",&t);
	while(t--){
		int n,m;
		scanf("%d%d",&n,&m);
		for(int i=1;i<=n;i++){
			vec[i].clear();
		}
		for(int i=1;i<=n;i++){
			for(int j=1;j<=n;j++){
				graph[i][j]=0;
			}
		}
		bool flag=true;
		for(int i=1;i<=m;i++){
			int u,v;
			scanf("%d%d",&u,&v);
			vec[u].push_back(v);
		}
		for(int i=1;i<=n;i++){
			for(int j=1;j<=n;j++){
				vis[j]=0;
			}
			dfs(i);
			for(int j=1;j<=n;j++){
				if(vis[j]) graph[i][j]=1;
			}
		}
		for(int i=1;i<=n;i++){
			for(int j=i+1;j<=n;j++){
				if(i==j) continue;
				//cout<<graph[i][j]<<" "<<i<< " "<<j<<" "<<graph[j][i]<<endl;
				if(graph[i][j]==1 || graph[j][i]==1)continue;
				flag=false;
					break;
			}
		}
		if(flag) printf("I love you my love and our love save us!\n");
		else printf("Light my fire!\n");
	}
	return 0;
}
0%