CSES - Datatähti 2023 alku

CSES - Datatähti 2023 alku - Results

Submission details
Task:	Sadonkorjuu
Sender:	zli0122
Submission time:	2022-11-09 08:03:33 +0200
Language:	CPython3
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	TIME LIMIT EXCEEDED	0
#2	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.02 s	1, 2	details
#2	ACCEPTED	0.02 s	1, 2	details
#3	ACCEPTED	0.02 s	1, 2	details
#4	ACCEPTED	0.02 s	1, 2	details
#5	ACCEPTED	0.02 s	1, 2	details
#6	ACCEPTED	0.05 s	1, 2	details
#7	TIME LIMIT EXCEEDED	--	2	details
#8	ACCEPTED	0.03 s	1, 2	details
#9	TIME LIMIT EXCEEDED	--	2	details
#10	ACCEPTED	0.03 s	1, 2	details
#11	TIME LIMIT EXCEEDED	--	2	details
#12	TIME LIMIT EXCEEDED	--	2	details
#13	TIME LIMIT EXCEEDED	--	2	details
#14	TIME LIMIT EXCEEDED	--	2	details
#15	TIME LIMIT EXCEEDED	--	1, 2	details
#16	ACCEPTED	0.03 s	1, 2	details
#17	ACCEPTED	0.03 s	1, 2	details
#18	ACCEPTED	0.04 s	1, 2	details
#19	ACCEPTED	0.03 s	1, 2	details
#20	ACCEPTED	0.03 s	1, 2	details
#21	TIME LIMIT EXCEEDED	--	2	details
#22	TIME LIMIT EXCEEDED	--	2	details
#23	TIME LIMIT EXCEEDED	--	2	details
#24	ACCEPTED	0.04 s	1, 2	details
#25	TIME LIMIT EXCEEDED	--	2	details
#26	ACCEPTED	0.04 s	1, 2	details
#27	TIME LIMIT EXCEEDED	--	2	details
#28	ACCEPTED	0.04 s	1, 2	details
#29	TIME LIMIT EXCEEDED	--	2	details
#30	ACCEPTED	0.04 s	1, 2	details
#31	TIME LIMIT EXCEEDED	--	2	details

Code

class Kaupunki:
    def __init__(self, indeksi, tyyppi):
        self.indeksi = indeksi
        self.tyyppi = tyyppi
        self.naapurit = []
        self.etaisyydet = []
        self.tiet = {}

class Tie:
    def __init__(self):
        self.pituus = 0
        self.paadyt = []

def summaa(lista):
    summa = 0
    for jasen in lista:
        summa = summa + jasen
    return summa

def onkolistassa(lista, listb):
    for jasen in lista:
        if not jasen in listb:
            return False
    return True

def syote():
    global n
    n = int(input())
    tyypit = [int(tyyppi) for tyyppi in input().split(" ")]
    
    tiet = []
    for i in range(n - 1):
        userinput = [int(luku) for luku in input().split(" ")]
        tie = Tie()
        tie.paadyt = [indeksi - 1 for indeksi in userinput[:2]]
        tie.pituus = userinput[2]
        tiet.append(tie)
    return tyypit, tiet

def sievenna(tyypit, tiet):
    global n
    kaupungeittain = [[] for i in range(n)]
    for indeksi in range(n-1):
        kaupungeittain[tiet[indeksi].paadyt[0]].append([tiet[indeksi].paadyt[1], tiet[indeksi].pituus])
        kaupungeittain[tiet[indeksi].paadyt[1]].append([tiet[indeksi].paadyt[0], tiet[indeksi].pituus])

    kaupungit = []

    for indeksi in range(n):
        if tyypit[indeksi] == 0:
            kaupunki = Kaupunki(indeksi, 0)
            kaupunki.naapurit = [luvut[0] for luvut in kaupungeittain[indeksi]]
            kaupunki.etaisyydet = [luvut[1] for luvut in kaupungeittain[indeksi]]
        else:
            kaupunki = Kaupunki(indeksi, 1)
            kaupunki.naapurit = [luvut[0] for luvut in kaupungeittain[indeksi]]
            kaupunki.etaisyydet = [luvut[1] for luvut in kaupungeittain[indeksi]]
        kaupungit.append(kaupunki)
    
    for kaupunki in kaupungit:
        kaupunki.naapurit = [kaupungit[indeksi] for indeksi in kaupunki.naapurit]
        for indeksi in range(len(kaupunki.naapurit)):
            kaupunki.tiet[kaupunki.naapurit[indeksi]] = kaupunki.etaisyydet[indeksi]

    return kaupungit

def loyda(kaupunki, kaupungit, lyhimmat_reitit, selatut = []):
    #print("aloitettu kierros")
    #print("kaupungin indeksi:", kaupunki.indeksi)
    selatut.append(kaupunki)
    #print("selattujen kaupuinkien indeksit:", [kpk.indeksi for kpk in selatut])
    reitit = []
    for naapuri in kaupunki.naapurit:
        matka = kaupunki.tiet[naapuri]
        #print(f"tarkastellaan naapuria {naapuri.indeksi}")
        if naapuri.tyyppi == 0:
            #print(f"naapuri {naapuri.indeksi} on satama.")
            reitit.append(matka)
            continue
        elif naapuri.indeksi in lyhimmat_reitit.keys():
            #print("naapurille on jo löydetty lyhin reitti.")
            reitit.append(matka + lyhimmat_reitit[naapuri.indeksi])
            continue
        elif naapuri in selatut: # jos naapuri on selattu jo, turha jatkaa.
            #print(f"naapuri {naapuri.indeksi} on jo selattu.")
            continue
        elif onkolistassa(naapuri.naapurit, selatut): # jos naapurin kaikki naapurit ovat selattuja, turha jatkaa.
            #print(f"naapurin {naapuri.indeksi} kaikki naapurit on jo selattu.")
            continue
        else:
            lisamatka = loyda(naapuri, kaupungit, lyhimmat_reitit, selatut = selatut)
            if lisamatka != 0:
                matka = matka + lisamatka
                #print("matka:", matka)
                reitit.append(matka)
            
    if reitit == []:
        return 0
    else:
        #print("kaikki reitit:", reitit)
        lyhin = min(reitit)
        if kaupunki.indeksi in lyhimmat_reitit.keys():
            if lyhimmat_reitit[kaupunki.indeksi] > lyhin:
                lyhimmat_reitit[kaupunki.indeksi] = lyhin
        else:
            lyhimmat_reitit[kaupunki.indeksi] = lyhin
        return lyhin

def main():
    tyypit, tiet = syote()
    kaupungit = sievenna(tyypit, tiet)
    reitit = []
    lyhimmat_reitit = {}
    for kaupunki in kaupungit:
        #print()
        #print(f"tarkastellaan kaupunkia {kaupunki.indeksi}.")
        #print(f"kaupungin {kaupunki.indeksi} tyyppi on {kaupunki.tyyppi}.")
        #print(f"sen naapureita ovat {[naapuri.indeksi for naapuri in kaupunki.naapurit]}.")
        if kaupunki.tyyppi == 1:
            lyhin = loyda(kaupunki, kaupungit, lyhimmat_reitit,selatut = [])
            #print(f"lyhin reitti kaupungista {kaupunki.indeksi} satamaan on {lyhin}.")
            reitit.append(lyhin)
    #print(lyhimmat_reitit)
    #print(reitit)
    print(summaa(reitit))

if __name__ == "__main__":
    main()

Test details

Test 1

Group: 1, 2

Verdict: ACCEPTED

input
`1 0` view save

correct output
`0` view save

user output
`0` view save

Test 2

Group: 1, 2

Verdict: ACCEPTED

input
`5 0 0 0 0 0 1 2 1 2 3 2 3 4 3 ...` view save

correct output
`0` view save

user output
`0` view save

Test 3

Group: 1, 2

Verdict: ACCEPTED

input
`4 1 0 1 1 1 2 10 2 3 20 2 4 30` view save

correct output
`60` view save

user output
`60` view save

Test 4

Group: 1, 2

Verdict: ACCEPTED

input
`5 0 1 1 1 0 1 2 10 2 3 20 3 4 30 ...` view save

correct output
`80` view save

user output
`80` view save

Test 5

Group: 1, 2

Verdict: ACCEPTED

input
`5 0 1 0 1 1 1 2 1 2 3 5 3 4 3 ...` view save

correct output
`6` view save

user output
`6` view save

Test 6

Group: 1, 2

Verdict: ACCEPTED

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`5506363` view save

user output
`5506363` view save

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`1795118520` view save

user output
(empty)

Test 8

Group: 1, 2

Verdict: ACCEPTED

input
`1000 0 0 1 0 1 1 0 1 0 1 1 0 0 0 1 ...` view save

correct output
`293576` view save

user output
`293576` view save

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`816932444` view save

user output
(empty)

Test 10

Group: 1, 2

Verdict: ACCEPTED

input
`1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`3089` view save

user output
`3089` view save

Test 11

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`40839` view save

user output
(empty)

Test 12

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`5683983203973` view save

user output
(empty)

Test 13

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 0 1 1 1 1 1 1 0 0 0 1 1 0 1 0 ...` view save

correct output
`58572993` view save

user output
(empty)

Test 14

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`32755` view save

user output
(empty)

Test 15

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`126238345` view save

user output
(empty)

Test 16

Group: 1, 2

Verdict: ACCEPTED

input
`1000 0 0 0 1 0 1 1 1 0 0 1 0 1 1 0 ...` view save

correct output
`278678` view save

user output
`278678` view save

Test 17

Group: 1, 2

Verdict: ACCEPTED

input
`1000 1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 ...` view save

correct output
`34929` view save

user output
`34929` view save

Test 18

Group: 1, 2

Verdict: ACCEPTED

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`1543963` view save

user output
`1543963` view save

Test 19

Group: 1, 2

Verdict: ACCEPTED

input
`1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`39606` view save

user output
`39606` view save

Test 20

Group: 1, 2

Verdict: ACCEPTED

input
`1000 1 0 1 0 1 0 0 0 0 1 1 0 0 0 1 ...` view save

correct output
`321598` view save

user output
`321598` view save

Test 21

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`978670626` view save

user output
(empty)

Test 22

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`375218` view save

user output
(empty)

Test 23

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 1 1 1 1 0 0 0 0 0 1 0 1 0 1 1 ...` view save

correct output
`60422556` view save

user output
(empty)

Test 24

Group: 1, 2

Verdict: ACCEPTED

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`291990` view save

user output
`291990` view save

Test 25

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`59607954` view save

user output
(empty)

Test 26

Group: 1, 2

Verdict: ACCEPTED

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`990` view save

user output
`990` view save

Test 27

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`199982` view save

user output
(empty)

Test 28

Group: 1, 2

Verdict: ACCEPTED

input
`1000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`7987` view save

user output
`7987` view save

Test 29

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`3137875` view save

user output
(empty)

Test 30

Group: 1, 2

Verdict: ACCEPTED

input
`1000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`4657693` view save

user output
`4657693` view save

Test 31

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`1652889357` view save

user output
(empty)

Datatähti 2023 alku

Sadonkorjuu

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Tasks

Submissions (zli0122)