题目就不贴了,看网上这道题的python做法都是80分的,所以分享一下代码
一开始做出来但是内存超限mle了。。。把网上大家的做法融合了一下,但是没有特别大的提升,最后决定每读n/q行数据就进行一次输出,重复利用数组,遂过了,就是代码可读性很弱。
f = input().split()
f = [int(x) for x in f]
m, n = f
f = input().split()
f = [int(x) for x in f]
p, q = f
res = ""
cur = [0, 0, 0]
rescolor = []
def trans(x):
res = ""
for i in x:
s = hex(ord(i))
s = "\\" + s[1] + s[2:].upper()
if len(s) == 3:
s = s[0:2] + "0" + s[-1]
res += s
return res
def hex2decimal(a):
res = 0
for i in range(2):
if ord(a[i]) >= ord("0") and ord(a[i]) <= ord("9"):
res += (or