-
Notifications
You must be signed in to change notification settings - Fork 59
/
Copy pathfazan.cpp
69 lines (66 loc) · 1.37 KB
/
fazan.cpp
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
# include <fstream>
# include <cstring>
# include <vector>
using namespace std;
ifstream f("fazan.in");
ofstream g("fazan.out");
vector <int> v[100];
int i,j,n,m,x,ok,okneg,VV,ok1,q,t;
int ap[100],nr[100];
char s[10005];
void initializare ()
{
ok=1; VV=0;
for (int i=1; i<=50; ++i)
ap[i]=0;
for (int i=1; i<=50; ++i)
{
v[i].clear();
nr[i]=0;
}
}
void DFS (int k)
{
ap[k]=1;
for (int i=0; i<v[k].size(); ++i)
{
if (ap[v[k][i]]==0) DFS(v[k][i]);
}
}
int main ()
{
f>>t;
for (q=1; q<=t; ++q)
{
f>>n; f.get();
initializare ();
for (i=1; i<=n; ++i)
{
f.getline (s,1005);
v[s[0]-'a'+1].push_back(s[strlen(s)-1]-'a'+1);
v[s[strlen(s)-1]-'a'+1].push_back(s[0]-'a'+1);
++nr[s[0]-'a'+1]; --nr[s[strlen(s)-1]-'a'+1];
}
okneg=0; ok1=0;
for (i=1; i<=50; ++i)
{
if (nr[i]==0) continue;
if (nr[i]==-1) {++okneg; continue;}
if (nr[i]==1) {++ok1; continue;}
ok=0;
}
if (okneg>1 || ok1>1) ok=0;
for (i=1; i<=26; ++i)
{
if (v[i].size()!=0 && ap[i]==0)
{
++VV;
DFS(i);
}
}
if (VV>1) ok=0;
if (ok) g<<"1\n";
else g<<"0\n";
}
return 0;
}