B GIO DC V O TO

K THI CHN HC SINH GII QUC GIA

THI CHNH THC

LP 12 THPT NM 2011
Mn: TIN HC
Thi gian: 180 pht (khng k thi gian giao )
Ngy thi th hai: 12/01/2011
( thi c 03 trang, gm 03 bi)

TNG QUAN NGY THI TH HAI

Tn bi

File chng trnh

File d liu vo

File kt qu

Bi 4

Ni im en trng

BWPOINTS.*

BWPOINTS.INP

BWPOINTS.OUT

Bi 5

Tr chi chn l

PARIGAME.*

PARIGAME.INP

PARIGAME.OUT

Bi 6

Nng cp mng

UPGRANET.*

UPGRANET.INP

UPGRANET.OUT

Du * c thay th bi PAS hoc CPP ca ngn ng lp trnh c s dng tng ng l Pascal hoc C++.

Hy lp trnh gii cc bi ton sau:

Bi 4. (6 im) Ni im en trng
Trn trc s thc cho n im en v n im trng hon ton phn bit. Cc im en c to
nguyn a1, a2, ..., an cn cc im trng c to nguyn b1, b2, ..., bn. Ngi ta mun chn ra k
im en v k im trng ni mi mt im en vi mt im trng sao cho k on thng to
c i mt khng c im chung.
Yu cu: Cho to ca n im en a1, a2, ..., an v to ca n im trng b1, b2, ..., bn, hy tm
gi tr k ln nht tho mn yu cu nu trn.
D liu: Vo t file vn bn BWPOINTS.INP:

Dng th nht cha s nguyn dng n (n 105);

Dng th hai cha cc s a1, a2, ..., an (| a i | 109, i = 1, 2, ..., n);

Dng th ba cha cc s b1, b2, ..., bn (| b i | 109, i = 1, 2, ..., n).

Cc s trn cng mt dng c ghi cch nhau t nht mt du cch.

Kt qu: Ghi ra file vn bn BWPOINTS.OUT mt s nguyn duy nht l s k ln nht tm c.
V d:
BWPOINTS.INP

BWPOINTS.OUT

0 3 1
-3 5 -1

Rng buc: 50% s tests ng vi 50% s im ca bi c 1 n 100.

Trang 1/3

Bi 5. (7 im) Tr chi chn l

Tr chi chn l l tr chi hai i th c m t nh sau: Xut pht t bng tr chi l mt bng
vung kch thc n n gm n dng v n ct. Cc dng ca bng c nh s t 1 n n, t trn
xung di. Cc ct ca bng c nh s t 1 n n, t tri qua phi. Trn mi ca bng ghi
mt s nguyn. Hai i th lun phin thc hin nc i. i th n lt chi ca mnh c
php xo dng cui cng nu tng cc s trn dng l s chn hoc l ct cui cng nu tng
cc s trn ct l s chn.
i th thng cuc l ngi xo c cui cng ca bng hoc sau khi thc hin nc i ca
mnh th tng cc s trn dng cui cng v tng cc s trn ct cui cng ca bng u l s l.
Yu cu: Cho bit bng s ca tr chi, hy xc nh xem ngi i trc c cch chi ginh phn
thng hay khng?
D liu: Vo t file vn bn PARIGAME.INP:

Dng th nht cha s nguyn dng k l s lng b d liu;

Tip theo l k nhm dng, mi nhm dng tng ng vi mt b d liu c dng:

o Dng th nht cha s nguyn dng n (n 500).
o Dng th i trong s n dng tip theo cha n s nguyn dng (mi s khng vt
qu 109) l cc s trn dng th i ca bng tr chi, i = 1, 2, ..., n.

Cc s trn cng mt dng c ghi cch nhau t nht mt du cch.

Kt qu: Ghi ra file vn bn PARIGAME.OUT gm k dng, mi dng l kt qu tng ng vi
mt b d liu theo th t xut hin trong file d liu vo: ghi thng bo YES nu ngi i trc
c cch chi ginh phn thng v NO trong trng hp ngc li.
V d:
PARIGAME.INP

PARIGAME.OUT

2
3
1
1
2
4
2
2
2
2

YES
NO
2 2
2 3
3 1
2
2
2
2

2
2
2
2

2
2
2
2

Rng buc: 50% s tests ng vi 50% s im ca bi c n 50.

Bi 6. (7 im) Nng cp mng

Mt h thng gm n my tnh nh s t 1 ti n c kt ni thnh mt mng bi m on cp
mng nh s t 1 ti m. on cp mng th i c thng lng wi kt ni hai my ui, vi cho php
truyn d liu theo c hai chiu gia hai my ny.
Mt dy cc my x1, x2, ..., xp, trong gia hai my xj v xj+1 (j = 1, 2, ..., p 1) c on cp ni,
c gi l mt ng truyn tin t my x1 ti my xp. Thng lng ca ng truyn tin c
xc nh nh l thng lng nh nht trong s cc thng lng ca cc on cp mng trn ng
Trang 2/3

truyn. Gi thit l mng c kt ni sao cho c ng truyn tin gia hai my bt k v gia hai
my c khng qu mt on cp mng ni chng.
Ngi ta mun nng cp mng bng cch tng thng lng ca mt s on cp ni trong mng.
tng thng lng ca mi on cp mng thm mt lng ( > 0) ta phi tr mt chi ph
ng bng . Vic nng cp mng phi m bo l sau khi hon tt, thng lng ca mi on cp
i u bng thng lng ca ng truyn tin c thng lng ln nht t my ui ti my vi.
Yu cu: Tm phng n nng cp cc on cp mng sao cho tng chi ph nng cp l nh nht.
D liu: Vo t file vn bn UPGRANET.INP

Dng th nht cha hai s nguyn dng n, m (n, m 105);

Dng th i trong s m dng tip theo cha ba s nguyn dng ui, vi, wi (wi 106), i = 1, 2, ..., m.

Cc s trn cng mt dng c ghi cch nhau t nht mt du cch.

Kt qu: Ghi ra file vn bn UPGRANET.OUT mt s nguyn duy nht l tng chi ph nng cp
theo phng n tm c.
V d:
UPGRANET.INP

UPGRANET.OUT

6
1
1
2
3
4
4
5

7
2
3
4
4
5
6
6

6
5
3
9
4
8
7

2
3(+2)

5
3

5
4(+3)

Rng buc: 50% s tests ng vi 50% s im ca bi c n 100.

--------------------------- Ht --------------------------

Th sinh khng c s dng ti liu.

Cn b coi thi khng gii thch g thm.

Trang 3/3

K THI CHN HC SINH GII QUC GIA

LP 12 THPT NM 2011

B GIO DC V O TO

HNG DN CHM THI CHNH THC

Mn: TIN HC
Ngy thi th hai: 12/01/2011
(Gm 01 trang)

TNG QUAN NGY THI TH HAI

Tn bi

File chng trnh

File d liu vo

File kt qu

Bi 4

Ni im en trng

BWPOINTS.*

BWPOINTS.INP

BWPOINTS.OUT

Bi 5

Tr chi chn l

PARIGAME.*

PARIGAME.INP

PARIGAME.OUT

Bi 6

Nng cp mng

UPGRANET.*

UPGRANET.INP UPGRANET.OUT

Bi 4. Ni im en trng (6 im)

C 50% s tests ng vi 50% s im ca bi c 1 n 100.

Thut ton tham lam trc tip vi thi gian tnh O(n2) c th t 50% s im.
Thut ton tham lam vi t chc d liu tt vi thi gian tnh O(n log n) c th t 100% s im.
Gii hn thi gian: 1 giy.

Bi 5. Tr chi chn l (7 im)

C 50% s tests ng vi 50% s im ca bi c 1 n 50.

Thut ton qui hoch ng trc tip vi thi gian tnh O(n3) c th t 50% s im.
Thut ton pht trin da trn qui hoch ng vi tin x l d liu vi thi gian tnh O(n2)
c th t 100% s im.
Gii hn thi gian: 1 giy.

Bi 6. Nng cp mng (7 im)

C 50% s tests ng vi 50% s im ca bi c n 100.

Thut ton pht trin da trn tht ton Floyd tm ng i ngn nht gia mi cp nh vi
thi gian tnh O(|V|3 + |E|) c th t 50% s im.
Thut ton pht trin da trn thut ton Dijkstra vi hng i c u tin tm ng i
ngn nht gia mi cp nh vi thi gian tnh O(|V| (|V| + |E|)log |V| + |E|) c th t 60% s
im.
Thut ton pht trin da trn xy dng cy khung thng lng ln nht nh thut ton
Kruskal ci t vi cu trc d liu cc tp khng giao nhau, kt hp vi t chc d liu tm
kim trn cy vi thi gian tnh O(|E|log |V|) c th t 100% s im.
Gii hn thi gian: 1 giy.

--------------------------- Ht ---------------------------

Trang 1/1