Task: | Tontti |
Sender: | konstikas |
Submission time: | 2015-10-05 00:02:44 +0300 |
Language: | Python3 |
Status: | READY |
Result: | 14 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 14 |
#2 | TIME LIMIT EXCEEDED | 0 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.09 s | 1 | details |
#2 | ACCEPTED | 0.08 s | 1 | details |
#3 | ACCEPTED | 0.08 s | 1 | details |
#4 | ACCEPTED | 0.09 s | 1 | details |
#5 | ACCEPTED | 0.08 s | 1 | details |
#6 | TIME LIMIT EXCEEDED | -- | 2 | details |
#7 | TIME LIMIT EXCEEDED | -- | 2 | details |
#8 | ACCEPTED | 0.71 s | 2 | details |
#9 | ACCEPTED | 0.76 s | 2 | details |
#10 | ACCEPTED | 0.78 s | 2 | details |
#11 | TIME LIMIT EXCEEDED | -- | 3 | details |
#12 | TIME LIMIT EXCEEDED | -- | 3 | details |
#13 | TIME LIMIT EXCEEDED | -- | 3 | details |
#14 | TIME LIMIT EXCEEDED | -- | 3 | details |
#15 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#!/usr/bin/env python3 # miten monella n x m -ruudukon k x k -neliötontilla on p puuta? # esimerkkisyöte: ''' 4 6 3 ..**.. **.... *...*. ..*... ''' n, m, k = map(int, input().split()) def laske(x, y, x2, y2, p, laskettavat, kr, ks): '''laske pisteestä (x, y) alas ja oikealle sijoittuvat sopivat tontit''' maara = 0 haara_x2 = None while p <= k: if p < k: haara_x2 = x2 haara_y2 = y2 haara_p = p elif p == k: maara += 1 if haara_x2 is None: haara_x2 = x2 haara_y2 = y2 haara_p = p if x2 == m or y2 == n: break x2 += 1 y2 += 1 # lisää oikea reuna, myös alakulma p += ks[y2][x2] - ks[y - 1][x2] # lisää alareuna, ei alakulmaa p += kr[y2][x2 - 1] - kr[y2][x - 1] if haara_x2: if x == haara_x2: # 1x1 tontti if y == 1 and x < m: # haaraudu oikealle (vain ylärivistä) haara_x2 = x + 1 p_oik = kr[y][haara_x2] - kr[y][haara_x2 - 1] laskettavat.append((haara_x2, y, haara_x2, y, p_oik)) # haaraudu alas if y < n: haara_y2 = y + 1 p_alas = ks[haara_y2][x] - ks[haara_y2 - 1][x] laskettavat.append((x, haara_y2, x, haara_y2, p_alas)) else: if y == 1: # haaraudu oikealle (vain ylärivistä) # leikkaa puumäärästä vasen ja alarivi pois p_oik = haara_p - ks[haara_y2][x] p_oik -= kr[haara_y2][haara_x2] - kr[haara_y2][x] # ei vas. alakulmaa laskettavat.append((x + 1, y, haara_x2, haara_y2 - 1, p_oik)) # haaraudu alas # leikkaa puumäärästä oikea ja ylärivi pois p_alas = haara_p - (ks[haara_y2][haara_x2] - ks[y][haara_x2]) # ei oik. yläkulmaa p_alas -= kr[y][haara_x2] - kr[y][x - 1] laskettavat.append((x, y + 1, haara_x2 - 1, haara_y2, p_alas)) return maara def sopivia_tontteja(p, kum_riv, kum_sar): maara = 0 laskettavat = [(1, 1, 1, 1, kum_riv[1][1])] while laskettavat: x1, y1, x2, y2, p = laskettavat.pop() maara += laske(x1, y1, x2, y2, p, laskettavat, kum_riv, kum_sar) return maara def lue_ruudukko(n, m): kum_riv = [[0] * (m + 1)] kum_sar = [[0] * (m + 1)] for y in range(n): rivi = [1 if c == '*' else 0 for c in input().rstrip()] kr = [0] ks = [0] for x, v in enumerate(rivi): kr.append(kr[-1] + v) ks.append(kum_sar[-1][x + 1] + v) kum_riv.append(kr) kum_sar.append(ks) return kum_riv, kum_sar def main(): kum_rivit, kum_sarakkeet = lue_ruudukko(n, m) print(sopivia_tontteja(k, kum_rivit, kum_sarakkeet)) if __name__ == '__main__': main()
Test details
Test 1
Group: 1
Verdict: ACCEPTED
input |
---|
10 10 1 ......*... .......*.. *..*....*. *....*.... ... |
correct output |
---|
94 |
user output |
---|
94 |
Test 2
Group: 1
Verdict: ACCEPTED
input |
---|
10 10 5 ********** ********** ********** ********** ... |
correct output |
---|
0 |
user output |
---|
0 |
Test 3
Group: 1
Verdict: ACCEPTED
input |
---|
10 10 10 **...*...* *..*.**.*. ...**.*..* *...**.*.. ... |
correct output |
---|
4 |
user output |
---|
4 |
Test 4
Group: 1
Verdict: ACCEPTED
input |
---|
10 10 5 ****...... *.*.**..** ....*.*..* ...*.***.. ... |
correct output |
---|
16 |
user output |
---|
16 |
Test 5
Group: 1
Verdict: ACCEPTED
input |
---|
10 10 2 **.***..*. ...*.*.... .***.*...* ***.***..* ... |
correct output |
---|
30 |
user output |
---|
30 |
Test 6
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
500 500 1 ................................. |
correct output |
---|
9552040 |
user output |
---|
(empty) |
Test 7
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
500 500 5 ................................. |
correct output |
---|
1536063 |
user output |
---|
(empty) |
Test 8
Group: 2
Verdict: ACCEPTED
input |
---|
500 500 25000 **...*...**..*.*..*.**.*..*.*.... |
correct output |
---|
288 |
user output |
---|
288 |
Test 9
Group: 2
Verdict: ACCEPTED
input |
---|
500 500 12500 **.**.*..*...*.**...*.***........ |
correct output |
---|
786 |
user output |
---|
786 |
Test 10
Group: 2
Verdict: ACCEPTED
input |
---|
500 500 5000 .*.*.**..*.*.**.**..*..**...*.... |
correct output |
---|
1763 |
user output |
---|
1763 |
Test 11
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
2000 2000 1 ................................. |
correct output |
---|
489611392 |
user output |
---|
(empty) |
Test 12
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
2000 2000 5 ................................. |
correct output |
---|
120725884 |
user output |
---|
(empty) |
Test 13
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
2000 2000 400000 ..*..**.**.**.*.***...**.*..**... |
correct output |
---|
1849 |
user output |
---|
(empty) |
Test 14
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
2000 2000 200000 ***.*....*.*..*....**..*..*.*.... |
correct output |
---|
2665 |
user output |
---|
(empty) |
Test 15
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
2000 2000 80000 **.**...*.***.**....**.*....*.... |
correct output |
---|
5587 |
user output |
---|
(empty) |