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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
| #include<algorithm>
#include<iostream>
#include<iomanip>
#include<cstring>
#include<cstdlib>
#include<vector>
#include<cstdio>
#include<cmath>
#include<queue>
using namespace std;
inline const int Get_Int() {
int num=0,bj=1;
char x=getchar();
while(x<'0'||x>'9') {
if(x=='-')bj=-1;
x=getchar();
}
while(x>='0'&&x<='9') {
num=num*10+x-'0';
x=getchar();
}
return num*bj;
}
const int maxn=2005;
int t,n,m,x[maxn],y[maxn],Dfn[maxn],Lowlink[maxn],Stack[maxn],Belong[maxn],step=0,top=0,SCC=0;
vector<int>edges[maxn];
void Clear() {
for(int i=1; i<=2*m; i++)edges[i].clear();
memset(Dfn,0,sizeof(Dfn));
step=top=SCC=0;
memset(Belong,0,sizeof(Belong));
memset(Stack,0,sizeof(Stack));
}
void AddEdge(int x,int y) {
edges[x].push_back(y);
}
void Tarjan(int Now) {
Lowlink[Now]=Dfn[Now]=++step;
Stack[++top]=Now;
for(int i=0; i<edges[Now].size(); i++) {
int Next=edges[Now][i];
if(!Dfn[Next]) {
Tarjan(Next);
Lowlink[Now]=min(Lowlink[Now],Lowlink[Next]);
} else Lowlink[Now]=min(Lowlink[Now],Dfn[Next]);
}
if(Dfn[Now]==Lowlink[Now]) {
SCC++;
int y;
do {
y=Stack[top--];
Belong[y]=SCC;
} while(y!=Now);
}
}
int main() {
t=Get_Int();
while(t--) {
n=Get_Int();
m=Get_Int();
Clear();
for(int i=1; i<=m; i++) {
x[i]=Get_Int();
y[i]=Get_Int();
if(y[i]<x[i])swap(x[i],y[i]);
}
for(int i=1; i<=m; i++)
for(int j=i+1; j<=m; j++) {
int x1=x[i],y1=y[i],x2=x[j],y2=y[j];
bool bj=0;
for(int t=0; t<=1; t++) {
if(x1<x2&&y1<y2&&x2<y1) {
bj=1;
break;
}
swap(x1,x2);
swap(y1,y2);
}
if(!bj)continue;
AddEdge(i,j+m);
AddEdge(j+m,i);
AddEdge(j,i+m);
AddEdge(i+m,j);
}
for(int i=1; i<=2*m; i++)
if(!Dfn[i])Tarjan(i);
bool bj=1;
for(int i=1; i<=m; i++)
if(Belong[i]==Belong[i+m]) {
puts("non");
bj=0;
break;
}
if(bj)puts("sane");
}
return 0;
}
|
