結果

問題 No.3032 ホモトピー入門
ユーザー lif4635
提出日時 2025-02-21 23:17:16
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 4,913 bytes
コンパイル時間 332 ms
コンパイル使用メモリ 82,216 KB
実行使用メモリ 68,724 KB
最終ジャッジ日時 2025-02-21 23:17:21
合計ジャッジ時間 4,679 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 2 WA * 1 TLE * 1 -- * 33
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

# input
import sys
input = sys.stdin.readline
II = lambda : int(input())
MI = lambda : map(int, input().split())
LI = lambda : [int(a) for a in input().split()]
SI = lambda : input().rstrip()
LLI = lambda n : [[int(a) for a in input().split()] for _ in range(n)]
LSI = lambda n : [input().rstrip() for _ in range(n)]
MI_1 = lambda : map(lambda x:int(x)-1, input().split())
LI_1 = lambda : [int(a)-1 for a in input().split()]
def graph(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[int]]:
    edge = [set() for i in range(n+1+index)]
    for _ in range(m):
        a,b = map(int, input().split())
        a += index
        b += index
        edge[a].add(b)
        if not dir:
            edge[b].add(a)
    return edge
def graph_w(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[tuple]]:
    edge = [set() for i in range(n+1+index)]
    for _ in range(m):
        a,b,c = map(int, input().split())
        a += index
        b += index
        edge[a].add((b,c))
        if not dir:
            edge[b].add((a,c))
    return edge
mod = 998244353
inf = 1001001001001001001
ordalp = lambda s : ord(s)-65 if s.isupper() else ord(s)-97
ordallalp = lambda s : ord(s)-39 if s.isupper() else ord(s)-97
yes = lambda : print("Yes")
no = lambda : print("No")
yn = lambda flag : print("Yes" if flag else "No")
def acc(a:list[int]):
    sa = [0]*(len(a)+1)
    for i in range(len(a)):
        sa[i+1] = a[i] + sa[i]
    return sa
prinf = lambda ans : print(ans if ans < 1000001001001001001 else -1)
alplow = "abcdefghijklmnopqrstuvwxyz"
alpup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
alpall = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
URDL = {'U':(0,1), 'R':(1,0), 'D':(0,-1), 'L':(-1,0)}
DIR_4 = [[-1,0],[0,1],[1,0],[0,-1]]
DIR_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]]
DIR_BISHOP = [[-1,1],[1,1],[1,-1],[-1,-1]]
prime60 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59]
sys.set_int_max_str_digits(0)
sys.setrecursionlimit(10**6)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
from collections import defaultdict
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
DD = defaultdict
BSL = bisect_left
BSR = bisect_right
n,m = MI()
def calc(ps):
    # 1/2,1/2
    # -1/2,1/2
    l = len(ps)
    res = [0,0]
    s = 0
    for i in range(l-1):
        sx,sy = ps[i]
        tx,ty = ps[i+1]
        s += (sx*ty - sy*tx)
        
        if sx == 1 and tx == 0: #上から
            if sy >= 1:
                res[0] += 1
        if sx == 0 and tx == 1:
            if sy >= 1:
                res[0] -= 1
        
        if sx == 0 and tx == -1: #上から
            if sy >= 1:
                res[1] += 1
        if sx == -1 and tx == 0:
            if sy >= 1:
                res[1] -= 1
    
    
    # print(s, res)
    # if s < 0: #正方向のとき
    #     res[0] = -res[0]
    #     res[1] = -res[1]
    #     if res[0] == 0: res[0] = -1
    #     if res[1] == 0: res[1] = -1
    # else:
    #     if res[0] == 0: res[0] = 1
    #     if res[1] == 0: res[1] = 1
    # print(res)
    assert -1 <= res[0] <= 1
    assert -1 <= res[1] <= 1
    return res
        
        
def solve(c):
    # たかだか線形オーダー
    que = [(0,0)]
    rot = []
    x,y = 0,0
    use = set()
    use.add((0,0))
    for i in c:
        dx,dy = URDL[i]
        nx,ny = x+dx,y+dy
        if (nx,ny) in use:
            ps = [(nx,ny)]
            p = (inf,inf)
            while p != (nx,ny):
                p = que.pop()
                use.discard(p)
                ps.append(p)
            
            if len(ps) >= 4:
                s,t = calc(ps)
                flag = True
                while rot and flag:
                    flag = False
                    if s == 0 and t == 0: break
                    # ともに削除
                    if rot[-1][0] == -s and rot[-1][0] == -t:
                        rot.pop()
                        break
                    
                    if s != 0 or t != 0:
                        if rot[-1][0] == -s:
                            rot.pop()
                            s = 0
                        elif rot[-1][1] == -t:
                            rot.pop()
                            t = 0
                        flag = True
                    elif s != 0:
                        if rot[-1][0] == -s:
                            rot[-1][0] += s
                            break
                    elif t != 0:
                        if rot[-1][1] == -t:
                            rot[-1][1] += t
                            break
                else:
                    if s != 0 or t != 0:
                        rot.append([s,t])
        
        que.append((nx,ny))
        use.add((nx,ny))
        x,y = nx,ny
    
    # print(rot)
    lr = len(rot)
    return lr == 0
ans = 0
for i in range(n):
    c = SI()
    ans += solve(c)
print(ans)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0