結果

問題 No.5002 stick xor
ユーザー tookunn_1213tookunn_1213
提出日時 2018-05-26 16:10:01
言語 Python3
(3.12.2 + numpy 1.26.4 + scipy 1.12.0)
結果
AC  
実行時間 649 ms / 1,000 ms
コード長 2,251 bytes
コンパイル時間 20,867 ms
実行使用メモリ 8,368 KB
スコア 31,853
最終ジャッジ日時 2018-05-26 16:10:25
ジャッジサーバーID
（参考情報） 		judge9 /
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 592 ms
8,352 KB
testcase_01 AC 646 ms
8,360 KB
testcase_02 AC 623 ms
8,360 KB
testcase_03 AC 619 ms
8,364 KB
testcase_04 AC 585 ms
8,356 KB
testcase_05 AC 628 ms
8,356 KB
testcase_06 AC 569 ms
8,356 KB
testcase_07 AC 577 ms
8,356 KB
testcase_08 AC 612 ms
8,356 KB
testcase_09 AC 568 ms
8,360 KB
testcase_10 AC 626 ms
8,356 KB
testcase_11 AC 574 ms
8,360 KB
testcase_12 AC 568 ms
8,364 KB
testcase_13 AC 622 ms
8,356 KB
testcase_14 AC 573 ms
8,356 KB
testcase_15 AC 583 ms
8,360 KB
testcase_16 AC 586 ms
8,360 KB
testcase_17 AC 567 ms
8,360 KB
testcase_18 AC 572 ms
8,360 KB
testcase_19 AC 606 ms
8,360 KB
testcase_20 AC 582 ms
8,356 KB
testcase_21 AC 649 ms
8,360 KB
testcase_22 AC 572 ms
8,360 KB
testcase_23 AC 599 ms
8,360 KB
testcase_24 AC 636 ms
8,364 KB
testcase_25 AC 582 ms
8,352 KB
testcase_26 AC 638 ms
8,360 KB
testcase_27 AC 565 ms
8,360 KB
testcase_28 AC 576 ms
8,368 KB
testcase_29 AC 612 ms
8,356 KB
testcase_30 AC 581 ms
8,364 KB
testcase_31 AC 626 ms
8,360 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

# coding: utf-8
# import time
import random
from heapq import heappush,heappop

def evalute(grid):
    return sum([r.count(0) for r in grid])
def operation_grid(op, grid):
    rev_grid = grid
    if op[1] == op[3]:
        length = op[2] - op[0] + 1
        for i in range(length):
            rev_grid[op[0]-1+i][op[1]-1] = (grid[op[0]-1+i][op[1]-1]+1)&1
    if op[0] == op[2]:
        length = op[3] - op[1] + 1
        for i in range(length):
            rev_grid[op[0]-1][op[1]-1+i] = (grid[op[0]-1][op[1]-1+i]+1)&1
    return rev_grid

def count_black_horizon(grid, base_x, base_y, length):
    return grid[base_y][base_x:base_x + length].count(1)
def count_black_vertical(grid, base_x, base_y, length):
    return [grid[i][base_x] for i in range(base_y,base_y + length)].count(1)

# begin = time.time()
N,K = map(int,input().split())
L = list(map(int,input().split()))
A = [list(map(int,list(input()))) for i in range(N)]

operation = []
P = 150
for k in range(K):
    hq = []
    for i in range(P):
        x = random.randint(0, N-L[k])
        y = random.randint(0, N-L[k])
        horizon_cnt = count_black_horizon(A, x, y, L[k])
        vertical_cnt = count_black_vertical(A, x, y, L[k])
        # print(horizon_cnt,end=" ")
        # print(vertical_cnt)
        if horizon_cnt < vertical_cnt:
            heappush(hq, (-vertical_cnt, [y+1, x+1, y+L[k], x+1]))
        else:
            heappush(hq, (-horizon_cnt, [y+1, x+1, y+1, x+L[k]]))
    # for x in range(N-L[k]+1):
    #     for y in range(N-L[k]+1):
    #         horizon_cnt = count_black_horizon(A, x, y, L[k])
    #         vertical_cnt = count_black_vertical(A, x, y, L[k])
    #         # print(horizon_cnt,end=" ")
    #         # print(vertical_cnt)
    #         if horizon_cnt < vertical_cnt:
    #             heappush(hq, (-vertical_cnt, [y+1, x+1, y+L[k], x+1]))
    #         else:
    #             heappush(hq, (-horizon_cnt, [y+1, x+1, y+1, x+L[k]]))
    cnt, op = heappop(hq)
    A = operation_grid(op, A)
    operation.append(op)
best_score = evalute(A)
print('\n'.join([' '.join(list(map(str,op))) for op in operation]))
# print('best_score = ' + str(best_score))
# print('----END----')
# take = time.time() - begin
# print(str(round(int(take * 1000),3)) + " ms")
0