CSES - Datatähti 2024 alku

CSES - Datatähti 2024 alku - Results

Submission details
Task:	Uolevin kalansaalis
Sender:	d-m-g
Submission time:	2023-11-10 22:21:54 +0200
Language:	Python3 (CPython3)
Status:	READY
Result:	37

Feedback
group	verdict	score
#1	ACCEPTED	37
#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.02 s	1, 2	details
#7	ACCEPTED	0.02 s	1, 2	details
#8	ACCEPTED	0.02 s	1, 2	details
#9	ACCEPTED	0.02 s	1, 2	details
#10	ACCEPTED	0.02 s	1, 2	details
#11	ACCEPTED	0.02 s	1, 2	details
#12	ACCEPTED	0.02 s	1, 2	details
#13	ACCEPTED	0.02 s	1, 2	details
#14	ACCEPTED	0.02 s	1, 2	details
#15	ACCEPTED	0.02 s	1, 2	details
#16	TIME LIMIT EXCEEDED	--	2	details
#17	TIME LIMIT EXCEEDED	--	2	details
#18	TIME LIMIT EXCEEDED	--	2	details
#19	TIME LIMIT EXCEEDED	--	2	details
#20	TIME LIMIT EXCEEDED	--	2	details
#21	TIME LIMIT EXCEEDED	--	2	details
#22	TIME LIMIT EXCEEDED	--	2	details
#23	TIME LIMIT EXCEEDED	--	2	details
#24	TIME LIMIT EXCEEDED	--	2	details

Code


# lines - can address by coord and size
all_lines = {}
# triangles - can address by coord, size, is_down
all_triangles = {}



def get_all_inputs_and_field():
    n, m, k = [int(el) for el in input().split()]

    field = {}
    total_field_value = 0
    for i in range(k):
        x,y,catch = [el for el in input().split()]
        x = int(x)
        y = int(y)
        coins = 0
        if catch == 'K':
            coins = -10
        elif catch == 'H':
            coins = 1    
        field[x, y] = coins
        total_field_value += coins
#     print(n,m,k,field,total_field_value)    
    return n,m,k,field,total_field_value
n,m,k,field,total_field_value = get_all_inputs_and_field()



def calculate_all_valid_lines(size):
    for x in range(1, n+1):
        for y in range(1, m + 2 - size):
            if size==2:
                line_value = field.get((x, y), 0) + field.get((x, y + 1), 0)
                all_lines[(x, y, size)] = line_value
            if size > 2:
                all_lines[(x, y, size)] = all_lines[(x, y, size - 1)] + field.get((x, y + size -1), 0)




def get_line_value(x, y, size):
    if size >= 2:
        return all_lines[(x, y, size)]
    else:
        return field.get((x, y), 0)


def calculate_all_valid_down_triangles(size):
    # generate down triangles
    is_down = 1
    for x in range(1, n+2-size):
        for y in range(1, m + 2 - size):
            curr_triangle_value = get_line_value(x, y, size)
#             if (x ==2 and y==3 and size ==4):
#                     print(curr_triangle_value)
            next_line_size = size - 1
            next_line_x = x + 1
            if x % 2 == 0:
                next_line_y = y + 1
            else:
                next_line_y = y
            while next_line_size > 0:
                curr_triangle_value += get_line_value(next_line_x, next_line_y, next_line_size)
#                 if (x ==2 and y==3 and size == 4):
#                     print(curr_triangle_value)
#                     print(f"{next_line_x}, {next_line_y}, {next_line_size}")
                next_line_size = next_line_size - 1
                if next_line_x % 2 == 0:
                    next_line_y = next_line_y + 1
                next_line_x = next_line_x + 1
            all_triangles[(x, y, size, is_down)] = curr_triangle_value
def calculate_all_valid_up_triangles(size):
    
    is_down = 0
    for x in range(n, size-1, -1):
        for y in range(1, m + 2 - size):
#             print(f"{x}, {y}")
            curr_triangle_value = get_line_value(x, y, size)
#             if (x ==4 and y==3 and size ==4):
#                     print(curr_triangle_value)
            next_line_size = size - 1
            next_line_x = x - 1
            if x % 2 == 0:
                next_line_y = y + 1
            else:
                next_line_y = y
            while next_line_size > 0:
                curr_triangle_value += get_line_value(next_line_x, next_line_y, next_line_size)
#                 if (x ==4 and y==3 and size == 4):
#                     print(curr_triangle_value)
#                     print(f"{next_line_x}, {next_line_y}, {next_line_size}")
                next_line_size = next_line_size - 1
                if next_line_x % 2 == 0:
                    next_line_y = next_line_y + 1
                next_line_x = next_line_x - 1
            all_triangles[(x, y, size, is_down)] = curr_triangle_value            


# In[304]:


def main():
    current_best_triangle = None
    # calculate best result with triangle of size one
    for key,value in field.items():
        if current_best_triangle is None:
#             print("is none found")
            current_best_triangle = value
        if current_best_triangle > value:
            current_best_triangle = value
            if value == -10:
                break
    if current_best_triangle is None:
        # only empty cells presented
        current_best_triangle = 0
    if current_best_triangle > 0 and k != len(field):
        
        # we'd better remove empty triangle
        
        current_best_triangle = 0
#     print(f"current best triangle after checking for size 1 triangles: {current_best_triangle}")
                

    # case with all pikes        
#     if k == len(field) and current_best_triangle is None:
#         current_best_triangle = 1
#         print("Best result with size 1: " + total_field_value - current_best_triangle)
#         return
#     else:
    max_size_triangle = min(n, m)
    for size in range(2, max_size_triangle + 1):
        calculate_all_valid_lines(size)
    for size in range(2, max_size_triangle + 1):
        calculate_all_valid_down_triangles(size)
    for size in range(2, max_size_triangle + 1):
        calculate_all_valid_up_triangles(size)    
        
    for key, value in all_triangles.items():

        if current_best_triangle > value:
            current_best_triangle = value
#    print(f"current best triangle: {current_best_triangle}")
#    print(f"total_field_value {total_field_value}")
    best_result = total_field_value - current_best_triangle
    print(best_result)
    
    
        


# In[305]:


main()

Test details

Test 1

Group: 1, 2

Verdict: ACCEPTED

input
`5 6 13 1 1 K 5 1 K 2 2 H 4 2 H ...` view save

correct output
`-16` view save

user output
`-16` view save

Test 2

Group: 1, 2

Verdict: ACCEPTED

input
`5 6 7 1 5 K 4 6 K 2 4 H 2 5 H ...` view save

correct output
`0` view save

user output
`0` view save

Test 3

Group: 1, 2

Verdict: ACCEPTED

input
`5 6 7 5 5 K 2 6 K 2 4 H 2 5 H ...` view save

correct output
`0` view save

user output
`0` view save

Test 4

Group: 1, 2

Verdict: ACCEPTED

input
`10 10 51 3 3 H 6 3 H 9 5 H 5 10 H ...` view save

correct output
`50` view save

user output
`50` view save

Test 5

Group: 1, 2

Verdict: ACCEPTED

input
`10 10 52 3 5 H 3 1 H 9 6 H 2 8 H ...` view save

correct output
`40` view save

user output
`40` view save

Test 6

Group: 1, 2

Verdict: ACCEPTED

input
`10 10 60 6 10 H 2 8 H 5 8 H 8 10 H ...` view save

correct output
`-15` view save

user output
`-15` view save

Test 7

Group: 1, 2

Verdict: ACCEPTED

input
`10 10 60 4 7 H 7 4 H 4 10 H 3 6 H ...` view save

correct output
`60` view save

user output
`60` view save

Test 8

Group: 1, 2

Verdict: ACCEPTED

input
`10 10 40 9 9 H 5 10 H 5 6 H 4 9 H ...` view save

correct output
`2` view save

user output
`2` view save

Test 9

Group: 1, 2

Verdict: ACCEPTED

input
`1 1 0` view save

correct output
`0` view save

user output
`0` view save

Test 10

Group: 1, 2

Verdict: ACCEPTED

input
`1 1 1 1 1 K` view save

correct output
`0` view save

user output
`0` view save

Test 11

Group: 1, 2

Verdict: ACCEPTED

input
`1 1 1 1 1 H` view save

correct output
`0` view save

user output
`0` view save

Test 12

Group: 1, 2

Verdict: ACCEPTED

input
`10 5 32 10 3 H 4 4 H 3 3 H 5 4 H ...` view save

correct output
`20` view save

user output
`20` view save

Test 13

Group: 1, 2

Verdict: ACCEPTED

input
`5 10 32 5 9 H 2 4 H 2 9 H 2 5 H ...` view save

correct output
`28` view save

user output
`28` view save

Test 14

Group: 1, 2

Verdict: ACCEPTED

input
`10 10 100 2 9 H 5 4 H 5 9 K 6 1 K ...` view save

correct output
`-439` view save

user output
`-439` view save

Test 15

Group: 1, 2

Verdict: ACCEPTED

input
`10 10 100 8 9 H 5 10 H 5 4 H 3 9 H ...` view save

correct output
`88` view save

user output
`88` view save

Test 16

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`500 500 125000 125 261 K 84 78 K 11 200 K 481 246 K ...` view save

correct output
`-624270` view save

user output
(empty)

Test 17

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`500 500 125100 16 61 H 37 62 H 459 125 H 318 476 H ...` view save

correct output
`124020` view save

user output
(empty)

Test 18

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`500 500 249999 22 214 H 356 145 H 341 29 H 393 262 H ...` view save

correct output
`249999` view save

user output
(empty)

Test 19

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`500 500 32000 30 81 H 315 34 H 78 112 H 367 166 H ...` view save

correct output
`10126` view save

user output
(empty)

Test 20

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`500 500 126745 164 390 H 126 331 H 164 126 H 55 92 H ...` view save

correct output
`-104692` view save

user output
(empty)

Test 21

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`500 500 71200 106 191 H 314 189 H 482 485 H 344 401 H ...` view save

correct output
`-335853` view save

user output
(empty)

Test 22

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`500 500 67772 421 277 H 428 470 H 169 142 H 256 345 H ...` view save

correct output
`-208567` view save

user output
(empty)

Test 23

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`500 500 27434 366 481 H 38 22 H 126 107 H 135 169 H ...` view save

correct output
`-57100` view save

user output
(empty)

Test 24

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`500 500 93982 183 13 H 463 230 H 264 351 H 399 290 H ...` view save

correct output
`-52800` view save

user output
(empty)

Datatähti 2024 alku

Uolevin kalansaalis

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

Tasks

Submissions (d-m-g)