Py。大佬快来。这道题我感觉已经走到尽头。还能怎么优化。超时了呜。

P4924 [1007] 魔法少女小Scarlet

```python def hanshu(a,b,c,d): global ls a-=1+c b-=1+c c=c*2+1 n=[] if d==0: for i in range(c): di=[] for j in range(c): di.append(ls[a+c-j-1][b+i]) n.append(di) else: for i in range(c): di=[] for j in range(c): di.append(ls[a+j][b+c-i-1]) n.append(di) for i in range(c): for j in range(c): ls[a+i][b+j]=n[i][j] n,m=map(int,input().strip().split()) ls=[] for i in range(n): ls.append([i for i in range(n*i+1,n*i+n+1)]) for i in range(m): a,b,c,d=map(int,input().strip().split()) hanshu(a,b,c,d) for i in ls: for j in i: print(j,end=" ") print("") ``` 最终优化。感觉Py的确过不了。
by s_a_b_e_ryyds @ 2022-04-25 23:25:39


|