Code Submission Evaluation System Login

Datatähti 2016 alku

Start:2015-09-28 00:00:00
End:2015-10-12 00:00:00
 

Tasks | Scoreboard | Statistics


CSES - Datatähti 2016 alku - Results
History
2017-09-30 18:22:37100
2015-09-30 23:19:2914
2015-09-30 23:02:1714
Task:Tontti
Sender:Pohjantahti
Submission time:2015-09-30 23:19:29
Language:Python3
Status:READY
Score:14

Feedback

groupverdictscore
#1ACCEPTED14
#2TIME LIMIT EXCEEDED0
#3TIME LIMIT EXCEEDED0

Test results

testverdicttime (s)group
#1ACCEPTED0.08 / 1.001details
#2ACCEPTED0.08 / 1.001details
#3ACCEPTED0.08 / 1.001details
#4ACCEPTED0.09 / 1.001details
#5ACCEPTED0.08 / 1.001details
#6TIME LIMIT EXCEEDED-- / 1.002details
#7TIME LIMIT EXCEEDED-- / 1.002details
#8TIME LIMIT EXCEEDED-- / 1.002details
#9TIME LIMIT EXCEEDED-- / 1.002details
#10TIME LIMIT EXCEEDED-- / 1.002details
#11TIME LIMIT EXCEEDED-- / 1.003details
#12TIME LIMIT EXCEEDED-- / 1.003details
#13TIME LIMIT EXCEEDED-- / 1.003details
#14TIME LIMIT EXCEEDED-- / 1.003details
#15TIME LIMIT EXCEEDED-- / 1.003details

Code

import math

def treesInSq(sum, bX, bY, tX, tY):
    # a = tY
    # b = tX
    # c = bY
    # d = bX
    if tY == 0 and tX == 0:
        return sum[bY][bX]
    if tY == 0:
        return sum[bY][bX] - sum[bY][tX - 1]
    if tX == 0:
        return sum[bY][bX] - sum[tY - 1][bX]
    return sum[bY][bX] - sum[tY - 1][bX] - sum[bY][tX - 1] + sum[tY - 1][tX - 1]

# pisteestä x, y vasemmalle ylös alkavan neliön pienin mahdollinen sivun pituus, jolla neliössä on puita treeCount
def binarySearch(sumArr, treeCount, bX, bY):
    l = 0
    r = min(bX, bY)
    mid = 0
    
    while (l < r):
        mid = math.ceil((l + r) / 2)
        
        if (treesInSq(sumArr, bX, bY, bX - mid, bY - mid) > treeCount):
            r = mid - 1
        else:
            l = mid
            
    if l == r and treesInSq(sumArr, bX, bY, bX - mid, bY - mid):
        return bX - l
    return -1
    
def getLongestSide(sum, treeCount, bX, bY, minSideLength):
    for i in range(min(bX, bY) - minSideLength, -1, -1):
        if (treesInSq(sum, bX, bY, bX - i, bY - i) > treeCount):
            return min(bX, bY) - i
    return minSideLength    
        
    
    
# onko olemassa neliötä, alakulma (x, y), jonka alueella on tasan n puuta
def possibleSquaresFromPoint(sum, bX, bY, n):
    # minSideLength = binarySearch(sum, n, bX, bY)
    # if minSideLength == -1:
    #     return 0
    # maxSideLength = getLongestSide(sum, n, bX, bY, minSideLength)
    # return maxSideLength - minSideLength + 1
    possibilities = 0
    for i in range(0, min(bX, bY) + 1):
        treeCount = treesInSq(sum, bX, bY, bX - i, bY - i)
        
        if (treeCount == n):
            possibilities += 1 
        if (treeCount > n):
            break
    
    return possibilities    
    
# . tyhjä, * puu
height, width, trees = [int(x) for x in input().split(" ")]
# forest = []
treeSum = []

for j in range(0, height):
    forestRow = input()
    treeSum.append([])
    rivi = 0
    for i in range(0, width):
        if forestRow[i] == '*':
            rivi += 1
        treeSum[j].append(rivi)
        if j > 0:
            treeSum[j][i] += treeSum[j - 1][i]

# # summataulukko puiden määrästä vasemmasta yläkulmasta lähtien
# treeSum = [[0 for x in range(width)] for x in range(height)]
# 
# for j in range(0, height):
#     rivi = 0
#     for i in range(0, width):
#         if forest[j][i] == '*':
#             rivi += 1
#         treeSum[j][i] = rivi
#         if j > 0:
#             treeSum[j][i] += treeSum[j - 1][i]
            
ways = 0

for j in range(0, height):
    for i in range(0, width):
        ways += possibleSquaresFromPoint(treeSum, i, j, trees)

print (math.floor(ways))
    

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
10 10 1
......*...
.......*..
*..*....*.
*....*....
...
view   save

correct output
94

view   save

user output
94

view   save

Test 2

Group: 1

Verdict: ACCEPTED

input
10 10 5
**********
**********
**********
**********
...
view   save

correct output
0

view   save

user output
0

view   save

Test 3

Group: 1

Verdict: ACCEPTED

input
10 10 10
**...*...*
*..*.**.*.
...**.*..*
*...**.*..
...
view   save

correct output
4

view   save

user output
4

view   save

Test 4

Group: 1

Verdict: ACCEPTED

input
10 10 5
****......
*.*.**..**
....*.*..*
...*.***..
...
view   save

correct output
16

view   save

user output
16

view   save

Test 5

Group: 1

Verdict: ACCEPTED

input
10 10 2
**.***..*.
...*.*....
.***.*...*
***.***..*
...
view   save

correct output
30

view   save

user output
30

view   save

Test 6

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
500 500 1
.................................
view   save

correct output
9552040

view   save

user output
(empty)

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
500 500 5
.................................
view   save

correct output
1536063

view   save

user output
(empty)

Test 8

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
500 500 25000
**...*...**..*.*..*.**.*..*.*....
view   save

correct output
288

view   save

user output
(empty)

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
500 500 12500
**.**.*..*...*.**...*.***........
view   save

correct output
786

view   save

user output
(empty)

Test 10

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
500 500 5000
.*.*.**..*.*.**.**..*..**...*....
view   save

correct output
1763

view   save

user output
(empty)

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
2000 2000 1
.................................
view   save

correct output
489611392

view   save

user output
(empty)

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
2000 2000 5
.................................
view   save

correct output
120725884

view   save

user output
(empty)

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
2000 2000 400000
..*..**.**.**.*.***...**.*..**...
view   save

correct output
1849

view   save

user output
(empty)

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
2000 2000 200000
***.*....*.*..*....**..*..*.*....
view   save

correct output
2665

view   save

user output
(empty)

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
2000 2000 80000
**.**...*.***.**....**.*....*....
view   save

correct output
5587

view   save

user output
(empty)