QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#267287#5112. Where Am I?juampiRE 0ms0kbPython32.4kb2023-11-27 04:41:232023-11-27 04:41:24

Judging History

你现在查看的是最新测评结果

  • [2023-11-27 04:41:24]
  • 评测
  • 测评结果:RE
  • 用时:0ms
  • 内存:0kb
  • [2023-11-27 04:41:23]
  • 提交

answer

from typing import List
from collections import defaultdict

def main():
    while True:
        X, Y = map(int, input().split())
        g = [input().strip() for _ in range(Y)]
        g.reverse()
      
        dist = [[0] * 201 for _ in range(201)]
        x, y, dx, dy, step, stepn, cur = 100, 100, 0, 1, 0, 1, 0

        while y < 201:
            dist[y][x] = cur
            x += dx
            y += dy
            step += 1
            if step == stepn:
                dx, dy = dy, -dx
                step = 0
                if dy:
                    stepn += 1
            cur += 1

        obs = defaultdict(list)

        for y in range(Y):
            for x in range(X):
                if g[y][x] == 'X':
                    i = 0
                    for sy in range(Y):
                        for sx in range(X):
                            obs[dist[y - sy + 100][x - sx + 100]].append(i)
                            i+=1

        comp = [0] * (X * Y)
        compt = [0] * (X * Y)
        compsz = [X * Y]


        t = 0
        while len(compsz) < X * Y:
            if len(obs[t]) !=0:
                v = obs[t]
                v.sort(key=lambda x: comp[x])
                v.reverse()
                i, j = 0, 0
                while i < len(v):
                    j += 1
                    while j < len(v) and comp[v[j]] == comp[v[i]]:
                        j += 1
                    
                    sz = compsz[comp[v[i]]]
                    
                    if j - i != sz: 
                        if j - i == 1:
                            compt[len(compsz)] = t
                        sz -= j - i
                        compsz[comp[v[i]]] = sz
                        if sz == 1:
                            compt[comp[v[i]]] = t
                        for k in range(i, j):
                            comp[v[k]] = len(compsz)
                        compsz.append(j - i)
                        
                    i = j
            t += 1

        
        mx = max(compt)
        tot = sum(compt)

        print(f"{tot / X / Y:.9f}")
        print(mx)

        first = True
        for i in range(X * Y):
            if compt[comp[i]] == mx:
                if not first:
                    print(' ', end='')
                first = False
                print(f"({i % X + 1},{i // X + 1})", end='')

        print()


if __name__ == "__main__":
    main()

详细

Test #1:

score: 0
Dangerous Syscalls

input:

1 1
X

output:

0.000000000
0
(1,1)

result: