-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathKANAP312.PAS
150 lines (138 loc) · 2.63 KB
/
KANAP312.PAS
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
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
{ MK 2002 }
{ Mantas Kanaporis }
{ Vilniaus Ïemynos gimnazija }
{ -------------------------- }
{ III metÖ I skyrius }
{ 2 uØdavinys }
{
Taikysime modifikuotÐ paieÕkos Ô plotÔ algoritmÐ. Imsime
virÕ×nÒ ir, jei galima, jÐ Ôtrauksime Ô pirmÐ ar tai antrÐ klasÒ -
masyvÐ.
}
Program KANAP02;
Type
TG = array [1 .. 20, 1 .. 20] of boolean;
Tmas = array [1 .. 20] of integer;
var
viso : Integer;
ok : boolean;
g : TG;
procedure nuskaitymas (var viso : INteger; var G : TG);
var
f : TExt;
v1, v2, ck, kiek : Integer;
begin
fillchar (g, sizeof (g), 0);
assign (f, 'duom.txt');
reset (f);
readln (f, viso, kiek);
for ck := 1 to kiek do
begin
readln (f, v1, v2);
if v1 <> v2 then
begin
g [v1, v2] := true;
g [v2, v1] := true
end
end;
close (f)
end;
function galima (v : Integer; var m1, m2 : Tmas) : boolean;
var
ck : integer;
ok : boolean;
begin
ok := true;
ck := 1;
while (ck <= 20) and (m1 [ck] <> 0) do
begin
if g [m1 [ck], v] then
begin
ok := false;
break
end;
inc (ck)
end;
if ok then
begin
m1 [ck] := v;
galima := true;
exit
end;
ok := true;
ck := 1;
while (ck <= 20) and (m2 [ck] <> 0) do
begin
if g [m2 [ck], v] then
begin
ok := false;
break
end;
inc (ck)
end;
if ok then
begin
m2 [ck] := v;
galima := true;
exit
end;
galima := false
end;
function rask (viso : Integer; var g : Tg) : boolean;
var
m1, m2, eil : Tmas;
ck, gal, uod : Integer;
jau : set of 1 .. 20;
begin
fillchar (m1, sizeof (m1), 0);
fillchar (m2, sizeof (m2), 0);
eil [1] := 1;
gal := 1;
uod := 2;
jau := [1 .. viso];
while jau <> [] do
begin
if gal = uod then
begin
for ck := 1 to viso do
if ck in jau then
begin
eil [gal] := ck;
inc (uod);
break
end
end;
if galima (eil [gal], m1, m2) then
begin
for ck := 1 to viso do
if (ck in jau) and (g [eil [gal], ck]) then
begin
eil [uod] := ck;
inc (uod)
end;
jau := jau - [eil [gal]]
end
else
begin
rask := false;
exit
end;
inc (gal)
end;
rask := true
end;
procedure rasymas (ok : boolean);
var
f : Text;
begin
assign (f, 'rez.txt');
rewrite (f);
if ok then writeln (f, 'GALIMA')
else writeln (f, 'NEGALIMA');
close (f)
end;
begin
nuskaitymas (viso, g);
ok := Rask (viso, g);
rasymas (ok)
end.