結果

問題 No.1859 ><<<
ユーザー 👑 Kazun
提出日時 2022-03-07 22:24:35
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 307 ms / 2,000 ms
コード長 5,093 bytes
コンパイル時間 720 ms
コンパイル使用メモリ 82,388 KB
実行使用メモリ 146,384 KB
最終ジャッジ日時 2024-07-22 19:20:52
合計ジャッジ時間 14,078 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 41
権限があれば一括ダウンロードができます

ソースコード

diff # 

class Rolling_Hash():
    def __init__(self,S,base,mod):
        self.mod=mod
        self.base=base
        self.string=S
        self.power=power=[1]*(len(S)+1)

        L=len(S)
        self.hash=h=[0]*(L+1)

        v=0
        for i in range(L):
            #h[i+1]=v=(v*base+ord(S[i]))%mod
            h[i+1]=v=(v*base+S[i])%mod

        v=1
        for i in range(L):
            power[i+1]=v=(v*base)%mod

    def __hasher(self, X):
        assert len(X)<=len(self)
        h=0
        for i in range(len(X)):
            h=(h*self.base+X[i])%self.mod
        return h

    def get(self,l,r):
        return (self.hash[r]-self.hash[l]*self.power[r-l])%self.mod

    def count(self,T,start=0):
        alpha=self.__hasher(T)

        K=0
        for i in range(start,len(self)-len(T)+1):
            if alpha==self[i:i+len(T)]:
                K+=1
        return K

    def find(self,T,start=0):
        alpha=self.__hasher(T)

        for i in range(start,len(self)-len(T)+1):
            if alpha==self[i:i+len(T)]:
                return i
        return -1

    def rfind(self,T,start=0):
        alpha=self.__hasher(T)

        for i in range(len(self)-len(T),start-1,-1):
            if alpha==self[i:i+len(T)]:
                return i
        return -1

    def index(self,T,start=0):
        alpha=self.__hasher(T)

        for i in range(start,len(self)-len(T)+1):
            if alpha==self[i:i+len(T)]:
                return i
        raise ValueError("substring not found")

    def __getitem__(self,index):
        if index.__class__==int:
            if index<0:
                index+=len(self.string)
            assert 0<=index<len(self.string)
            return self.get(index,index+1)
        elif index.__class__==slice:
            assert (index.step==None) or (index.step==1)
            L=index.start if index.start else 0
            R=index.stop if index.stop else len(self)
            if L<0:L+=len(self)
            if R<0:R+=len(self)
            return self.get(L,R)

    def __len__(self):
        return len(self.string)

#=================================================
class Multi_Rolling_Hash():
    def __init__(self, S, base, *mod):
        self.string=S
        self.__N=len(mod)
        self.__base=base
        self.__mod=mod
        self.rh=[Rolling_Hash(S,base,m) for m in mod]

    def get(self, l, r):
        return tuple(H[l:r] for H in self.rh)

    def __hasher(self, X):
        assert len(X)<=len(self)
        h=[0]*self.__N
        for i in range(self.__N):
            m=self.__mod[i]
            a=0
            for x in X:
                a=(a*self.__base+x)%m
            h[i]=a
        return tuple(h)

    def __getitem__(self, index):
        if index.__class__==int:
            if index<0:
                index+=len(self.string)
            assert 0<=index<len(self.string)
            return tuple(H[index] for H in self.rh)
        elif index.__class__==slice:
            assert (index.step==None) or (index.step==1)
            L=index.start if index.start else 0
            R=index.stop if index.stop else len(self)
            if L<0:L+=len(self)
            if R<0:R+=len(self)
            return tuple(H[L:R] for H in self.rh)

    def count(self,T,start=0):
        alpha=self.__hasher(T)
        K=0
        T_len=len(T)
        for i in range(start,len(self)-len(T)+1):
            if alpha==self[i:i+T_len]:
                K+=1
        return K

    def find(self,T,start=0):
        alpha=self.__hasher(T)

        for i in range(start,len(self)-len(T)+1):
            if alpha==self[i:i+len(T)]:
                return i
        return -1

    def rfind(self,T,start=0):
        alpha=self.__hasher(T)

        for i in range(len(self)-len(T),start-1,-1):
            if alpha==self[i:i+len(T)]:
                return i
        return -1

    def index(self,T,start=0):
        alpha=self.__hasher(T)

        for i in range(start,len(self)-len(T)+1):
            if alpha==self[i:i+len(T)]:
                return i
        raise ValueError("substring not found")

    def __len__(self):
        return len(self.string)

class Hasher():
    def __init__(self, length, base, mod):
        self.length=length
        self.base=base
        self.mod=mod

        self.power=pw=[1]*length
        for i in range(1,length):
            pw[i]=(base*pw[i-1])%mod

    def __repr__(self):
        return "length: {}\nbase: {}\nmod: {}".format(self.length, self.base, self.mod)

    def encode(self, S):
        code=0; N=len(S)
        for i in range(N):
            #code+=ord(S[i])*self.power[N-1-i]%self.mod
            code+=S[i]*self.power[N-1-i]%self.mod

        return code%self.mod

    def decode(self, S):
        pass

#==================================================
from random import randint as ri

N=int(input())
A=list(map(int,input().split()))
S=input()

Mod1=10**9+7; Mod2=10**9+9
a=ri(2,Mod1-1); b=ri(2,Mod1-1); p=ri(2,Mod1-1)

B=[a if A[i%N]<A[(i+1)%N] else b for i in range(2*N-1)]
T=[a if S[i]=="<" else  b for i in range(N-1)]

H=Multi_Rolling_Hash(B,p,Mod1,Mod2)
print(H.find(T))
0