id stringlengths 24 27 | content stringlengths 37 384k | max_stars_repo_path stringlengths 51 51 |
|---|---|---|
condefects-python_data_1401 | N, M = map(int, input().split())
p = [int(i) for i in input().split()]
memo = [-1] * (N + 1)
for i in range(M):
x, y = map(int, input().split())
memo[x] = y
for j in range(2, N + 1):
memo[j] = max(memo[j], memo[p[j - 2]] - 1)
ans = 0
for i in range(N + 1):
ans += memo[i] >= 0
print(ans)
N, M = map(int, input().split())
p = [int(i) for i in input().split()]
memo = [-1] * (N + 1)
for i in range(M):
x, y = map(int, input().split())
memo[x] = max(memo[x], y)
for j in range(2, N + 1):
memo[j] = max(memo[j], memo[p[j - 2]] - 1)
ans = 0
for i in range(N + 1):
ans += memo[i] >= 0
print(ans)
| ConDefects/ConDefects/Code/abc309_e/Python/46044734 |
condefects-python_data_1402 | import sys
input = sys.stdin.buffer.readline
sr = lambda: input().rstrip().decode('ascii') # 文字列の読み込み
ir = lambda: int(input()) # 数字の読み込み
lr = lambda: list(map(int, input().split())) # 数字の配列の読み込み
N, M = lr()
p = lr()
tree = [set() for _ in range(N)]
for i in range(1, N):
tree[p[i-1]-1].add(i)
ins = [-1]*N
for i in range(M):
x, y = lr()
ins[x-1] = max(ins[x-1], y)
q = [(0, ins[0])]
visit = [0]*N
cnt = 1 if ins[0] else 0
while len(q):
s, i = q.pop()
for v in tree[s]:
if not visit[v]:
visit[v] = 1
ni = max(ins[v], i-1)
if ni >= 0:
cnt += 1
q.append((v, ni))
print(cnt)
import sys
input = sys.stdin.buffer.readline
sr = lambda: input().rstrip().decode('ascii') # 文字列の読み込み
ir = lambda: int(input()) # 数字の読み込み
lr = lambda: list(map(int, input().split())) # 数字の配列の読み込み
N, M = lr()
p = lr()
tree = [set() for _ in range(N)]
for i in range(1, N):
tree[p[i-1]-1].add(i)
ins = [-1]*N
for i in range(M):
x, y = lr()
ins[x-1] = max(ins[x-1], y)
q = [(0, ins[0])]
visit = [0]*N
cnt = 1 if ins[0] >= 0 else 0
while len(q):
s, i = q.pop()
for v in tree[s]:
if not visit[v]:
visit[v] = 1
ni = max(ins[v], i-1)
if ni >= 0:
cnt += 1
q.append((v, ni))
print(cnt) | ConDefects/ConDefects/Code/abc309_e/Python/46214263 |
condefects-python_data_1403 | class Input_kyopro:
def II(self): return int(input())
def MI(self): return map( int,input().split())
def MS(self): return map(str,input().split())
def LMI(self): return list(self.MI())
def LMS(self): return list(self.MS())
def LLI(self,N): return [self.LMI() for _ in range(N)]
def LLS(self,N): return [self.LMS() for _ in range(N)]
def LS(self,N): return [input() for _ in range(N)]
def LSL(self,N): return [list(input()) for _ in range(N)]
def LI(self,N): return [self.II() for _ in range(N)]
I=Input_kyopro()
#入力
from collections import defaultdict
import sys
sys.setrecursionlimit(10**8)
N,M=I.MI()
p=I.LMI()
xy=I.LLI(M)
dic=defaultdict(lambda : -1)
for x,y in xy:
dic[x-1]=max(dic[x-1],y)
G=[[] for _ in range(N)]
for i in range(N-1):
G[p[i]-1].append(i+1)
count=0
def dfs(i,hp):
global count
if hp<dic[i]:
hp=dic[i]
if hp>=0:
count+=1
for nex in G[i]:
dfs(nex,hp-1)
dfs(0,0)
print(count)
class Input_kyopro:
def II(self): return int(input())
def MI(self): return map( int,input().split())
def MS(self): return map(str,input().split())
def LMI(self): return list(self.MI())
def LMS(self): return list(self.MS())
def LLI(self,N): return [self.LMI() for _ in range(N)]
def LLS(self,N): return [self.LMS() for _ in range(N)]
def LS(self,N): return [input() for _ in range(N)]
def LSL(self,N): return [list(input()) for _ in range(N)]
def LI(self,N): return [self.II() for _ in range(N)]
I=Input_kyopro()
#入力
from collections import defaultdict
import sys
sys.setrecursionlimit(10**8)
N,M=I.MI()
p=I.LMI()
xy=I.LLI(M)
dic=defaultdict(lambda : -1)
for x,y in xy:
dic[x-1]=max(dic[x-1],y)
G=[[] for _ in range(N)]
for i in range(N-1):
G[p[i]-1].append(i+1)
count=0
def dfs(i,hp):
global count
if hp<dic[i]:
hp=dic[i]
if hp>=0:
count+=1
for nex in G[i]:
dfs(nex,hp-1)
dfs(0,-1)
print(count) | ConDefects/ConDefects/Code/abc309_e/Python/45971969 |
condefects-python_data_1404 | import sys
input = lambda: sys.stdin.readline().rstrip()
from collections import Counter, defaultdict, deque
from typing import DefaultDict, List
N, M = map(int, input().split())
P = list(map(int, input().split()))
G: DefaultDict[int, List[int]] = defaultdict(list)
for i, p in enumerate(P, 2):
G[p].append(i)
ins = [0] * (N + 1)
for _ in range(M):
x, y = map(int, input().split())
ins[x] = y + 1
q = deque()
q.append(1)
while q:
node = q.popleft()
for nxt in G[node]:
ins[nxt] = max(ins[nxt], ins[node] - 1)
q.append(nxt)
print(N + 1 - ins.count(0))
import sys
input = lambda: sys.stdin.readline().rstrip()
from collections import Counter, defaultdict, deque
from typing import DefaultDict, List
N, M = map(int, input().split())
P = list(map(int, input().split()))
G: DefaultDict[int, List[int]] = defaultdict(list)
for i, p in enumerate(P, 2):
G[p].append(i)
ins = [0] * (N + 1)
for _ in range(M):
x, y = map(int, input().split())
ins[x] = max(ins[x], y + 1)
q = deque()
q.append(1)
while q:
node = q.popleft()
for nxt in G[node]:
ins[nxt] = max(ins[nxt], ins[node] - 1)
q.append(nxt)
print(N + 1 - ins.count(0))
| ConDefects/ConDefects/Code/abc309_e/Python/45761344 |
condefects-python_data_1405 | from collections import deque
N = int(input())
G = [[] for _ in range(N)]
dist = [0 for _ in range(N)]
for _ in range(N):
u, v = map(int, input().split())
u -= 1
v -= 1
G[u].append(v)
G[v].append(u)
dist[u] += 1
dist[v] += 1
que = deque([])
for i in range(N):
if dist[i] == 1:
que.append(i)
seen = [False for _ in range(N)]
while len(que):
v = que.popleft()
dist[v] = 0
if seen[v]:
continue
seen[v] = True
for nv in G[v]:
if not seen[nv]:
dist[nv] -= 1
if dist[nv] == 1:
que.append(nv)
K = [-1 for _ in range(N)]
for i in range(N):
if dist[i] != 0:
que = deque([])
que.append(i)
flag = False
while len(que):
vi = que.popleft()
for ni in G[vi]:
if dist[ni] == 0 and K[ni] == -1:
K[ni] = i
flag = True
que.append(ni)
if flag:
K[i] = i
Q = int(input())
for _ in range(Q):
u, v = map(int,input().split())
u -= 1
v -= 1
if K[u] == K[v]:
print("Yes")
else:
print("No")
from collections import deque
N = int(input())
G = [[] for _ in range(N)]
dist = [0 for _ in range(N)]
for _ in range(N):
u, v = map(int, input().split())
u -= 1
v -= 1
G[u].append(v)
G[v].append(u)
dist[u] += 1
dist[v] += 1
que = deque([])
for i in range(N):
if dist[i] == 1:
que.append(i)
seen = [False for _ in range(N)]
while len(que):
v = que.popleft()
dist[v] = 0
if seen[v]:
continue
seen[v] = True
for nv in G[v]:
if not seen[nv]:
dist[nv] -= 1
if dist[nv] == 1:
que.append(nv)
K = [-1 for _ in range(N)]
for i in range(N):
if dist[i] != 0:
que = deque([])
que.append(i)
flag = False
while len(que):
vi = que.popleft()
for ni in G[vi]:
if dist[ni] == 0 and K[ni] == -1:
K[ni] = i
flag = True
que.append(ni)
if flag:
K[i] = i
Q = int(input())
for _ in range(Q):
u, v = map(int,input().split())
u -= 1
v -= 1
if K[u] == K[v] and K[u] != -1:
print("Yes")
else:
print("No") | ConDefects/ConDefects/Code/abc266_f/Python/50709042 |
condefects-python_data_1406 | n=int(input())
a=list(map(int,input().split()))
st=set()
for i in a:
st.add(i)
ans=0
while n>=0:
if ans+1 in st:
n-=1
ans+=1
else:
if n>1:
n-=2
ans+=1
else:
print(ans)
exit()
print(ans)
n=int(input())
a=list(map(int,input().split()))
st=set()
for i in a:
st.add(i)
ans=0
while n>0:
if ans+1 in st:
n-=1
ans+=1
else:
if n>1:
n-=2
ans+=1
else:
print(ans)
exit()
print(ans)
| ConDefects/ConDefects/Code/abc271_c/Python/45062381 |
condefects-python_data_1407 | from collections import deque
N = int(input())
A = [int(x) for x in input().split()]
A.sort()
deq = deque()
se = set()
non_need = deque()
for a in A:
if a not in se:
se.add(a)
deq.append(a)
else:
non_need.append(a)
deq = deq + non_need
for i in range(N):
ni = i + 1
if deq and deq[0] == ni:
deq.popleft()
elif len(deq) >= 2:
deq.pop()
deq.pop()
else:
print(i)
break
from collections import deque
N = int(input())
A = [int(x) for x in input().split()]
A.sort()
deq = deque()
se = set()
non_need = deque()
for a in A:
if a not in se:
se.add(a)
deq.append(a)
else:
non_need.append(a)
deq = deq + non_need
for i in range(N):
ni = i + 1
if deq and deq[0] == ni:
deq.popleft()
elif len(deq) >= 2:
deq.pop()
deq.pop()
else:
print(i)
break
if ni == N:
print(ni)
| ConDefects/ConDefects/Code/abc271_c/Python/45004566 |
condefects-python_data_1408 | N = int(input())
a = list(map(int, input().split()))
st = set()
for i in range(N):
st.add(a[i])
ans = 0
s = 0
for i in range(1, N):
if i in st:
s += 1
else:
s += 2
if s > N:
break
ans = i
print(ans)
N = int(input())
a = list(map(int, input().split()))
st = set()
for i in range(N):
st.add(a[i])
ans = 0
s = 0
for i in range(1, N + 1):
if i in st:
s += 1
else:
s += 2
if s > N:
break
ans = i
print(ans) | ConDefects/ConDefects/Code/abc271_c/Python/45808178 |
condefects-python_data_1409 | A,B = map(int,input().split())
print(A//B+1)
A,B = map(int,input().split())
print((A-1)//B+1) | ConDefects/ConDefects/Code/abc302_a/Python/46001200 |
condefects-python_data_1410 | A, B = map(int, input().split())
print(1 + A // B)
A, B = map(int, input().split())
print((A + B - 1) // B) | ConDefects/ConDefects/Code/abc302_a/Python/45467003 |
condefects-python_data_1411 | x, y = map(int, input().split())
print(int(x/y)+1)
x, y = map(int, input().split())
print((x+y-1)//y) | ConDefects/ConDefects/Code/abc302_a/Python/45902614 |
condefects-python_data_1412 | A,B = map(int,input().split())
if A%B == 0:
print(int(A/B))
else:
print(int(A//B)+1)
A,B = map(int,input().split())
if A%B == 0:
print(int((A+B-1)//B))
else:
print(int(A//B)+1) | ConDefects/ConDefects/Code/abc302_a/Python/45783782 |
condefects-python_data_1413 | a=int(input())
x=0
y=0
lot=[]
deli=[]
for i in range(a):
x,y=map(int,input().split())
lot.append(x)
deli.append(y)
x=lot[deli.index(max(deli))]
y=deli.index(max(deli))
maxx=max(deli)
lot.pop(y)
deli.pop(y)
num=[]
for i in range(len(deli)):
if lot[i]==x:
num.append(deli[i]/2)
else:
num.append(deli[i])
print(maxx+max(num))
a=int(input())
x=0
y=0
lot=[]
deli=[]
for i in range(a):
x,y=map(int,input().split())
lot.append(x)
deli.append(y)
x=lot[deli.index(max(deli))]
y=deli.index(max(deli))
maxx=max(deli)
lot.pop(y)
deli.pop(y)
num=[]
for i in range(len(deli)):
if lot[i]==x:
num.append(deli[i]/2)
else:
num.append(deli[i])
print(int(maxx+max(num))) | ConDefects/ConDefects/Code/abc315_c/Python/46161967 |
condefects-python_data_1414 | result="Yse"
N=int(input())
lis=list(map(int,input().split(' ')))
for i in range(len(lis)-1):
if lis[i]!=lis[i+1]:
result="No"
print(result)
result="Yes"
N=int(input())
lis=list(map(int,input().split(' ')))
for i in range(len(lis)-1):
if lis[i]!=lis[i+1]:
result="No"
print(result) | ConDefects/ConDefects/Code/abc324_a/Python/54513764 |
condefects-python_data_1415 | N=int(input())
A = set(map(int, input().split()))
print('Yes' if len(A) else 'No')
N=int(input())
A = set(map(int, input().split()))
print('Yes' if len(A)==1 else 'No') | ConDefects/ConDefects/Code/abc324_a/Python/54455002 |
condefects-python_data_1416 | G = [[1, 2], [2, 3], [4, 5], [5, 6], [7, 8], [8, 9], [1, 4], [4, 7], [2, 5], [5, 8], [3, 6], [6, 9]]
R = list(map(int, input().split()))
flag = False
for g in G:
if R[0] == g[0] and R[1] == g[1]:
flag = True
if flag:
print("Yes")
else:
print("No")
G = [[1, 2], [2, 3], [4, 5], [5, 6], [7, 8], [8, 9]]
R = list(map(int, input().split()))
flag = False
for g in G:
if R[0] == g[0] and R[1] == g[1]:
flag = True
if flag:
print("Yes")
else:
print("No")
| ConDefects/ConDefects/Code/abc309_a/Python/45974546 |
condefects-python_data_1417 | a, b = map(int, input().split())
if b-a != 1:
print("No")
cnt = 0
def judge(s):
if s in (1,3,4,6,7,9):
return 1
else:
return 2
if judge(a) + judge(b) == 2:
print("No")
else:
print("Yes")
a, b = map(int, input().split())
if b-a != 1:
print("No")
exit()
def judge(s):
if s in (1,3,4,6,7,9):
return 1
else:
return 2
if judge(a) + judge(b) == 2:
print("No")
else:
print("Yes")
| ConDefects/ConDefects/Code/abc309_a/Python/45963671 |
condefects-python_data_1418 | A,B = map(int,input().split())
if (A,B) ==(1,2):
print("Yes")
elif (A,B) ==(2,3):
print("Yes")
elif (A,B) ==(4,5):
print("Yes")
elif (A,B) == (5,6):
print("Yes")
elif (A,B) ==(7,8):
print("Yes")
elif (A,B) ==(8,9):
print("Yes")
A,B = map(int,input().split())
if (A,B) ==(1,2):
print("Yes")
elif (A,B) ==(2,3):
print("Yes")
elif (A,B) ==(4,5):
print("Yes")
elif (A,B) == (5,6):
print("Yes")
elif (A,B) ==(7,8):
print("Yes")
elif (A,B) ==(8,9):
print("Yes")
else:
print("No") | ConDefects/ConDefects/Code/abc309_a/Python/45775765 |
condefects-python_data_1419 | A,B=map(int, input().split())
if A%3==0 and B==A+1:
print('No')
elif A==B-1 or A==B-3:
print('Yes')
else:
print('No')
A,B=map(int, input().split())
if A%3==0 and B==A+1:
print('No')
elif A==B-1:
print('Yes')
else:
print('No') | ConDefects/ConDefects/Code/abc309_a/Python/46161633 |
condefects-python_data_1420 | a,b=map(int,input().split())
if set([a,b]) not in [{3,4},{6,7}] and abs(a-b) in [1,3]:
print("Yes")
else:
print("No")
a,b=map(int,input().split())
if set([a,b]) not in [{3,4},{6,7}] and abs(a-b)==1:
print("Yes")
else:
print("No") | ConDefects/ConDefects/Code/abc309_a/Python/45763717 |
condefects-python_data_1421 | import sys
import string
import numpy as np
from collections import defaultdict, deque
from math import dist
import itertools
import operator
INF = -1000000000000000000
A, B = map(int, input().split())
ax = (A - 1) // 3
ay = (A - 1) % 3
bx = (B - 1) // 3
by = (B - 1) % 3
print("Yes" if ax == ay and by - ay == 1 else "No")
import sys
import string
import numpy as np
from collections import defaultdict, deque
from math import dist
import itertools
import operator
INF = -1000000000000000000
A, B = map(int, input().split())
ax = (A - 1) // 3
ay = (A - 1) % 3
bx = (B - 1) // 3
by = (B - 1) % 3
print("Yes" if ax == bx and abs(ay - by) == 1 else "No")
| ConDefects/ConDefects/Code/abc309_a/Python/46003315 |
condefects-python_data_1422 | #a = int(input());
list_A_B = list(map(int, input().split()));
A = list_A_B[0]
B = list_A_B[1]
#x = int(input());
if A%3 == 1 and B == A+1:
print('Yes')
elif A%3 == 2 and B == A+1:
print('YES')
else:
print('No')
#a = int(input());
list_A_B = list(map(int, input().split()));
A = list_A_B[0]
B = list_A_B[1]
#x = int(input());
if A%3 == 1 and B == A+1:
print('Yes')
elif A%3 == 2 and B == A+1:
print('Yes')
else:
print('No') | ConDefects/ConDefects/Code/abc309_a/Python/46005581 |
condefects-python_data_1423 |
p = {1:(2, 4), 2:(1, 5, 3), 3:(2, 6), 4:(1, 5, 7), 5:(2, 4, 6, 8), 6:(3, 5, 9), 7:(4, 8), 8:(5, 7, 9), 9:(6, 8)}
A, B = map(int, input().split())
if B in p[A]:
print("Yes")
else:
print("No")
p = {1:(2,), 2:(1, 3), 3:(2,), 4:(5,), 5:(6, 8), 6:(5,), 7:(8,), 8:(7, 9), 9:(8,)}
A, B = map(int, input().split())
if B in p[A]:
print("Yes")
else:
print("No") | ConDefects/ConDefects/Code/abc309_a/Python/45782370 |
condefects-python_data_1424 | a,b=map(int,input().split())
if b==a+1:
if a%3!=0:
print('Yes')
else:
print('No')
a,b=map(int,input().split())
if b==a+1:
if a%3!=0:
print('Yes')
else:
print('No')
else:
print('No') | ConDefects/ConDefects/Code/abc309_a/Python/45740476 |
condefects-python_data_1425 | grid = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]
a = list(map(int, input().split()))
for i in range(3):
for j in range(2):
for k in range(2):
if (a[k%2] == grid[i][j] and a[(k+1)%2] == grid[i][j+1]) or (a[k%2] == grid[j][i] and a[(k+1)%2] == grid[j+1][i]):
exit(print("Yes"))
print("No")
grid = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]
a = list(map(int, input().split()))
for i in range(3):
for j in range(2):
for k in range(2):
if a[k%2] == grid[i][j] and a[(k+1)%2] == grid[i][j+1]:
exit(print("Yes"))
print("No") | ConDefects/ConDefects/Code/abc309_a/Python/45980846 |
condefects-python_data_1426 | from collections import defaultdict
from string import ascii_letters, ascii_lowercase, ascii_uppercase
from collections import deque
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**9)
INF = 10**18
numChar = 26
numChar2 = numChar*numChar
N = int(input())
scores = defaultdict(int)
for _ in range(N):
Ts, P = input().split()
P = int(P)
scores[Ts] = -P
adjL = [[] for _ in range(numChar2)]
for ix in range(numChar):
x = ascii_lowercase[ix]
for iy in range(numChar):
y = ascii_lowercase[iy]
Ss = x+y
v = ix*numChar + iy
adjLNow = []
for iz in range(numChar):
z = ascii_lowercase[iz]
S2s = y+z
v2 = iy*numChar + iz
wt = scores[z] + scores[S2s] + scores[Ss+z]
adjLNow.append((v2, wt))
adjL[v] = adjLNow
def BellmanFord(adjList, INF):
numV = len(adjList)
negINF = -INF
costs = [INF] * numV
for ix in range(numChar):
x = ascii_lowercase[ix]
for iy in range(numChar):
y = ascii_lowercase[iy]
Ss = x+y
v = ix*numChar + iy
costs[v] = scores[x] + scores[y] + scores[Ss]
prevs = [-1] * numV
vNegINFs = set()
for tm in range(numV):
isChanged = False
for vNow in range(numV):
cNow = costs[vNow]
if cNow == INF: continue
for v2, wt in adjList[vNow]:
c2 = cNow + wt
if c2 < costs[v2]:
if tm == numV-1:
costs[v2] = negINF
vNegINFs.add(v2)
else:
costs[v2] = c2
prevs[v2] = vNow
isChanged = True
if not isChanged:
return (costs, prevs)
QQQ = deque(vNegINFs)
while QQQ:
vNow = QQQ.popleft()
for v2, wt in adjList[vNow]:
if costs[v2] == negINF: continue
costs[v2] = negINF
QQQ.append(v2)
return (costs, prevs)
costs, prevs = BellmanFord(adjL, INF)
ans = INF
for x in ascii_lowercase:
s = scores[x]
if s < ans:
ans = wt
#print('# ans:', ans)
minC = min(costs)
#print('# costs:', costs, '/ minC:', minC)
if minC < ans:
ans = minC
ans = -ans
if ans == INF:
print('Infinity')
else:
print(ans)
from collections import defaultdict
from string import ascii_letters, ascii_lowercase, ascii_uppercase
from collections import deque
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**9)
INF = 10**18
numChar = 26
numChar2 = numChar*numChar
N = int(input())
scores = defaultdict(int)
for _ in range(N):
Ts, P = input().split()
P = int(P)
scores[Ts] = -P
adjL = [[] for _ in range(numChar2)]
for ix in range(numChar):
x = ascii_lowercase[ix]
for iy in range(numChar):
y = ascii_lowercase[iy]
Ss = x+y
v = ix*numChar + iy
adjLNow = []
for iz in range(numChar):
z = ascii_lowercase[iz]
S2s = y+z
v2 = iy*numChar + iz
wt = scores[z] + scores[S2s] + scores[Ss+z]
adjLNow.append((v2, wt))
adjL[v] = adjLNow
def BellmanFord(adjList, INF):
numV = len(adjList)
negINF = -INF
costs = [INF] * numV
for ix in range(numChar):
x = ascii_lowercase[ix]
for iy in range(numChar):
y = ascii_lowercase[iy]
Ss = x+y
v = ix*numChar + iy
costs[v] = scores[x] + scores[y] + scores[Ss]
prevs = [-1] * numV
vNegINFs = set()
for tm in range(numV):
isChanged = False
for vNow in range(numV):
cNow = costs[vNow]
if cNow == INF: continue
for v2, wt in adjList[vNow]:
c2 = cNow + wt
if c2 < costs[v2]:
if tm == numV-1:
costs[v2] = negINF
vNegINFs.add(v2)
else:
costs[v2] = c2
prevs[v2] = vNow
isChanged = True
if not isChanged:
return (costs, prevs)
QQQ = deque(vNegINFs)
while QQQ:
vNow = QQQ.popleft()
for v2, wt in adjList[vNow]:
if costs[v2] == negINF: continue
costs[v2] = negINF
QQQ.append(v2)
return (costs, prevs)
costs, prevs = BellmanFord(adjL, INF)
ans = INF
for x in ascii_lowercase:
s = scores[x]
if s < ans:
ans = s
#print('# ans:', ans)
minC = min(costs)
#print('# costs:', costs, '/ minC:', minC)
if minC < ans:
ans = minC
ans = -ans
if ans == INF:
print('Infinity')
else:
print(ans)
| ConDefects/ConDefects/Code/abc264_g/Python/42294250 |
condefects-python_data_1427 | def SPFA(g, start):#g: グラフ, start: 始点
from collections import deque
n = len(g)
relax_max = [n]*n #緩和回数
is_inQ = [False]*n #キューに入っているか
dist = [float("inf")]*n
dist[start] = 0
q = deque([start])
while q:
v = q.popleft()
is_inQ[v] = False
for to,cost in g[v]:
if dist[to] <= dist[v] + cost: continue
dist[to] = dist[v] + cost
if is_inQ[to]: continue
q.append(to)
is_inQ[to] = True
relax_max[v] -= 1
if relax_max[v] < 0: return None, False #負回路
return dist, True
import sys
readline = sys.stdin.readline
#n = int(readline())
#*a, = map(int,readline().split())
#uv = [list(map(int,readline().split())) for _ in range(m)]
INF = 1<<60
tot = offset = 27**3
midpt = 27**2
d1 = [0]*tot
d2 = [0]*tot
d3 = [0]*tot
D = [d1,d1,d2,d3]
def s2n(s):
r = 0
for i in s:
r *= 27
r += ord(i) - 96
return r
n = int(readline())
for _ in range(n):
t,p = readline().split()
D[len(t)][s2n(t)] = int(p)
"""
?: 0, a: 1, ..., z: 26
"""
dist = []
for i in range(offset):
dist.append([(offset + i%midpt,0)])
for j in range(midpt):
r = []
j0 = j%27*27
for k in range(1,27):
v = 0
v += d1[k]
v += d2[j0+k]
v += d3[j*27+k]
r.append((j*27 + k,-v))
dist.append(r)
D, tf = SPFA(dist,0)
print(-min(D[1:offset]) if tf else "infinity")
def SPFA(g, start):#g: グラフ, start: 始点
from collections import deque
n = len(g)
relax_max = [n]*n #緩和回数
is_inQ = [False]*n #キューに入っているか
dist = [float("inf")]*n
dist[start] = 0
q = deque([start])
while q:
v = q.popleft()
is_inQ[v] = False
for to,cost in g[v]:
if dist[to] <= dist[v] + cost: continue
dist[to] = dist[v] + cost
if is_inQ[to]: continue
q.append(to)
is_inQ[to] = True
relax_max[v] -= 1
if relax_max[v] < 0: return None, False #負回路
return dist, True
import sys
readline = sys.stdin.readline
#n = int(readline())
#*a, = map(int,readline().split())
#uv = [list(map(int,readline().split())) for _ in range(m)]
INF = 1<<60
tot = offset = 27**3
midpt = 27**2
d1 = [0]*tot
d2 = [0]*tot
d3 = [0]*tot
D = [d1,d1,d2,d3]
def s2n(s):
r = 0
for i in s:
r *= 27
r += ord(i) - 96
return r
n = int(readline())
for _ in range(n):
t,p = readline().split()
D[len(t)][s2n(t)] = int(p)
"""
?: 0, a: 1, ..., z: 26
"""
dist = []
for i in range(offset):
dist.append([(offset + i%midpt,0)])
for j in range(midpt):
r = []
j0 = j%27*27
for k in range(1,27):
v = 0
v += d1[k]
v += d2[j0+k]
v += d3[j*27+k]
r.append((j*27 + k,-v))
dist.append(r)
D, tf = SPFA(dist,0)
print(-min(D[1:offset]) if tf else "Infinity")
| ConDefects/ConDefects/Code/abc264_g/Python/34022331 |
condefects-python_data_1428 | from functools import lru_cache
@lru_cache(maxsize=1000)
def f(a):
return chr(a+97)
Q=int(input())
C=dict()
for _ in range(Q):
T,P=input().split()
P=int(P)
C[T]=P
d=dict()
G=list()
M=26**3+26**2+1
L=[0]*M
N=26**3
for i in range(26):
for j in range(26):
for s in range(26):
S=f(i)+f(j)+f(s)
L[676*i+26*j+s]=S
d[S]=676*i+26*j+s
for i in range(26):
for j in range(26):
S=f(i)+f(j)
L[N+i*26+j]=S
d[S]=N+i*26+j
cost=0
if f(i) in C:
cost+=C[f(i)]
if f(j) in C:
cost+=C[f(j)]
if S in C:
cost+=C[S]
G.append([M-1,N+i*26+j,-cost])
for i in range(N):
s=L[i]
a=d[s[1:]]
b=d[s[:2]]
cost=0
if s in C:
cost+=C[s]
if s[1:] in C:
cost+=C[s[1:]]
if s[2] in C:
cost+=C[s[2]]
G.append([i,a,0])
G.append([b,i,-cost])
inf=10**16
def bellman_ford(s=M-1):
dd = [inf]*len(L) # 各頂点への最小コスト
dd[s] = 0 # 自身への距離は0
roop=N//26+10
for i in range(roop):
update = False # 更新が行われたか
for x, y, z in G:
if dd[y] > dd[x] + z:
dd[y] = dd[x] + z
update = True
if not update:
break
# 負閉路が存在
if i == roop - 1:
print("Infinity")
exit()
return min(dd[:-1])
ans=-bellman_ford()
for i in range(26):
if f(i) in C:
ans=max(ans,C[f(i)])
print(ans)
from functools import lru_cache
@lru_cache(maxsize=1000)
def f(a):
return chr(a+97)
Q=int(input())
C=dict()
for _ in range(Q):
T,P=input().split()
P=int(P)
C[T]=P
d=dict()
G=list()
M=26**3+26**2+1
L=[0]*M
N=26**3
for i in range(26):
for j in range(26):
for s in range(26):
S=f(i)+f(j)+f(s)
L[676*i+26*j+s]=S
d[S]=676*i+26*j+s
for i in range(26):
for j in range(26):
S=f(i)+f(j)
L[N+i*26+j]=S
d[S]=N+i*26+j
cost=0
if f(i) in C:
cost+=C[f(i)]
if f(j) in C:
cost+=C[f(j)]
if S in C:
cost+=C[S]
G.append([M-1,N+i*26+j,-cost])
for i in range(N):
s=L[i]
a=d[s[1:]]
b=d[s[:2]]
cost=0
if s in C:
cost+=C[s]
if s[1:] in C:
cost+=C[s[1:]]
if s[2] in C:
cost+=C[s[2]]
G.append([i,a,0])
G.append([b,i,-cost])
inf=10**16
def bellman_ford(s=M-1):
dd = [inf]*len(L) # 各頂点への最小コスト
dd[s] = 0 # 自身への距離は0
roop=N//26+1000
for i in range(roop):
update = False # 更新が行われたか
for x, y, z in G:
if dd[y] > dd[x] + z:
dd[y] = dd[x] + z
update = True
if not update:
break
# 負閉路が存在
if i == roop - 1:
print("Infinity")
exit()
return min(dd[:-1])
ans=-bellman_ford()
for i in range(26):
if f(i) in C:
ans=max(ans,C[f(i)])
print(ans) | ConDefects/ConDefects/Code/abc264_g/Python/34040426 |
condefects-python_data_1429 | import copy
h1,w1=map(int,input().split())
A=[list(input()) for i in range(h1)]
h2,w2=map(int,input().split())
B=[list(input()) for i in range(h2)]
h3,w3=map(int,input().split())
X=[list(input()) for i in range(h3)]
def left_up(A,L,h,w):
h1,h2,w1,w2=L[0],L[1],L[2],L[3]
B=[["." for i in range(w)] for j in range(h)]
for i in range(h1,h2):
for j in range(w1,w2):
B[i-h1][j-w1]=A[i][j]
return B
def parametor(A,h,w):
h1,h2,w1,w2=11,-1,11,-1
for i in range(h):
for j in range(w):
if A[i][j]=="#":
h1=min(h1,i)
h2=max(h2,i+1)
w1=min(w1,j)
w2=max(w2,j+1)
l=[h1,h2,w1,w2]
return l
def new_para(L):
L[1],L[3]=L[1]-L[0],L[3]-L[2]
return [L[1],L[3]]
def make(A,h,w):
L=parametor(A,h,w)
A=left_up(A,L,h,w)
L=new_para(L)
return A,L
def renew(X):
L=[]
for i in range(X[1][0]):
l=[]
for j in range(X[1][1]):
l.append(X[0][i][j])
if j==X[1][1]-1:
L.append(l)
return L
A=make(A,h1,w1)
B=make(B,h2,w2)
X=make(X,h3,w3)
new_A=renew(A)
PA=A[1]
new_B=renew(B)
PB=B[1]
new_X=renew(X)
PX=X[1]
ans="No"
if PA[0]>PX[0] or PA[1]>PX[1] or PB[0]>PX[0] or PB[1]>PX[0]:
pass
else:
h1,w1,h2,w2,h3,w3=PA[0],PA[1],PB[0],PB[1],PX[0],PX[1]
for H1 in range(h3-h1+1):
for W1 in range(w3-w1+1):
K1=[["." for i in range(w3)] for j in range(h3)]
for H11 in range(h1):
for W11 in range(w1):
if K1[H1+H11][W1+W11]!="#":
K1[H1+H11][W1+W11]=new_A[H11][W11]
for H2 in range(h3-h2+1):
for W2 in range(w3-w2+1):
K2=copy.deepcopy(K1)
for H22 in range(h2):
for W22 in range(w2):
if K2[H2+H22][W2+W22]!="#":
K2[H2+H22][W2+W22]=new_B[H22][W22]
if K2==new_X:
ans="Yes"
print(ans)
import copy
h1,w1=map(int,input().split())
A=[list(input()) for i in range(h1)]
h2,w2=map(int,input().split())
B=[list(input()) for i in range(h2)]
h3,w3=map(int,input().split())
X=[list(input()) for i in range(h3)]
def left_up(A,L,h,w):
h1,h2,w1,w2=L[0],L[1],L[2],L[3]
B=[["." for i in range(w)] for j in range(h)]
for i in range(h1,h2):
for j in range(w1,w2):
B[i-h1][j-w1]=A[i][j]
return B
def parametor(A,h,w):
h1,h2,w1,w2=11,-1,11,-1
for i in range(h):
for j in range(w):
if A[i][j]=="#":
h1=min(h1,i)
h2=max(h2,i+1)
w1=min(w1,j)
w2=max(w2,j+1)
l=[h1,h2,w1,w2]
return l
def new_para(L):
L[1],L[3]=L[1]-L[0],L[3]-L[2]
return [L[1],L[3]]
def make(A,h,w):
L=parametor(A,h,w)
A=left_up(A,L,h,w)
L=new_para(L)
return A,L
def renew(X):
L=[]
for i in range(X[1][0]):
l=[]
for j in range(X[1][1]):
l.append(X[0][i][j])
if j==X[1][1]-1:
L.append(l)
return L
A=make(A,h1,w1)
B=make(B,h2,w2)
X=make(X,h3,w3)
new_A=renew(A)
PA=A[1]
new_B=renew(B)
PB=B[1]
new_X=renew(X)
PX=X[1]
ans="No"
if PA[0]>PX[0] or PA[1]>PX[1] or PB[0]>PX[0] or PB[1]>PX[1]:
pass
else:
h1,w1,h2,w2,h3,w3=PA[0],PA[1],PB[0],PB[1],PX[0],PX[1]
for H1 in range(h3-h1+1):
for W1 in range(w3-w1+1):
K1=[["." for i in range(w3)] for j in range(h3)]
for H11 in range(h1):
for W11 in range(w1):
if K1[H1+H11][W1+W11]!="#":
K1[H1+H11][W1+W11]=new_A[H11][W11]
for H2 in range(h3-h2+1):
for W2 in range(w3-w2+1):
K2=copy.deepcopy(K1)
for H22 in range(h2):
for W22 in range(w2):
if K2[H2+H22][W2+W22]!="#":
K2[H2+H22][W2+W22]=new_B[H22][W22]
if K2==new_X:
ans="Yes"
print(ans) | ConDefects/ConDefects/Code/abc307_c/Python/46162555 |
condefects-python_data_1430 | N, M = map(int, input().split())
raw_path = [list(map(lambda i: int(i) - 1, input().split())) for _ in range(M)]
class UnionFind:
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x]) # 経路圧縮
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]: # ランクによる軽量化
x, y = y, x
self.parents[x] += self.parents[y] # 負の数が大きくなるほど、ノードの数が多いということ
self.parents[y] = x
unionFind = UnionFind(N)
result_flag = True
counter = [0] * N
for p in raw_path:
counter[p[0]] += 1
counter[p[1]] += 1
if unionFind.find(p[0]) == unionFind.find(p[1]):
result_flag = False
break
unionFind.union(p[0], p[1])
count_parent = 0
for i in unionFind.parents:
if i < 0:
count_parent += 1
if count_parent == 1 and result_flag and (N == 1 or set(counter) == set([1, 2])):
print("Yes")
else:
print("No")
N, M = map(int, input().split())
raw_path = [list(map(lambda i: int(i) - 1, input().split())) for _ in range(M)]
class UnionFind:
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x]) # 経路圧縮
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]: # ランクによる軽量化
x, y = y, x
self.parents[x] += self.parents[y] # 負の数が大きくなるほど、ノードの数が多いということ
self.parents[y] = x
unionFind = UnionFind(N)
result_flag = True
counter = [0] * N
for p in raw_path:
counter[p[0]] += 1
counter[p[1]] += 1
if unionFind.find(p[0]) == unionFind.find(p[1]):
result_flag = False
break
unionFind.union(p[0], p[1])
count_parent = 0
for i in unionFind.parents:
if i < 0:
count_parent += 1
if count_parent == 1 and result_flag and (N == 2 or set(counter) == set([1, 2])):
print("Yes")
else:
print("No")
| ConDefects/ConDefects/Code/abc287_c/Python/46180932 |
condefects-python_data_1431 | def ip():return int(input())
def mp():return map(int, input().split())
def lmp():return list(map(int, input().split()))
# ABC287 C 466 - Path Graph?
# N 頂点 M 辺の単純無向グラフが与えられます。
# 頂点には 1,2,…,N の番号が、辺には 1,2,…,M の番号が付けられています。
# 辺 i(i=1,2,…,M) は頂点 ui, vi を結んでいます。
# このグラフがパスグラフであるか判定してください。
# 頂点に 1,2,…,N の番号が付けられた N 頂点のグラフがパスグラフであるとは、(1,2,…,N) を並べ変えて得られる数列 (v1,v2,…,vN) であって、以下の条件を満たすものが存在することをいいます。
# ・全ての i=1,2,…,N-1 に対して、頂点 vi,v_{i+1} を結ぶ辺が存在する
# ・整数 i, j が 1 ≤ i, j ≤ N, |i-j| ≥ 2 を満たすならば、頂点 vi, vj を結ぶ辺は存在しない
# ・2 ≤ N ≤ 2×10^5
# ・0 ≤ M ≤ 2×10^5
N, M = mp()
p = [-1] * (N+1)
def root(x):
if p[x] < 0: return x
p[x] = root(p[x])
return p[x]
def unite(x, y):
x = root(x)
y = root(y)
if x == y:return
p[x] += p[y]
p[y] = x
def same(x, y):
return root(x) == root(y)
def size(x):
return -p[round(x)]
deg = [0] * N
for _ in range(M):
u, v = mp()
u -= 1
v -= 1
deg[v] += 1
deg[u] += 1
unite(u, v)
if deg.count(1) == 2 and deg.count(2) == N-2 and size(0) == N:
print('Yes')
else:
print('No')
def ip():return int(input())
def mp():return map(int, input().split())
def lmp():return list(map(int, input().split()))
# ABC287 C 466 - Path Graph?
# N 頂点 M 辺の単純無向グラフが与えられます。
# 頂点には 1,2,…,N の番号が、辺には 1,2,…,M の番号が付けられています。
# 辺 i(i=1,2,…,M) は頂点 ui, vi を結んでいます。
# このグラフがパスグラフであるか判定してください。
# 頂点に 1,2,…,N の番号が付けられた N 頂点のグラフがパスグラフであるとは、(1,2,…,N) を並べ変えて得られる数列 (v1,v2,…,vN) であって、以下の条件を満たすものが存在することをいいます。
# ・全ての i=1,2,…,N-1 に対して、頂点 vi,v_{i+1} を結ぶ辺が存在する
# ・整数 i, j が 1 ≤ i, j ≤ N, |i-j| ≥ 2 を満たすならば、頂点 vi, vj を結ぶ辺は存在しない
# ・2 ≤ N ≤ 2×10^5
# ・0 ≤ M ≤ 2×10^5
N, M = mp()
p = [-1] * (N+1)
def root(x):
if p[x] < 0: return x
p[x] = root(p[x])
return p[x]
def unite(x, y):
x = root(x)
y = root(y)
if x == y:return
p[x] += p[y]
p[y] = x
def same(x, y):
return root(x) == root(y)
def size(x):
return -p[root(x)]
deg = [0] * N
for _ in range(M):
u, v = mp()
u -= 1
v -= 1
deg[v] += 1
deg[u] += 1
unite(u, v)
if deg.count(1) == 2 and deg.count(2) == N-2 and size(0) == N:
print('Yes')
else:
print('No') | ConDefects/ConDefects/Code/abc287_c/Python/45520506 |
condefects-python_data_1432 | import numpy as np
import sys
from functools import lru_cache
import math
sys.setrecursionlimit(int(1e7))
from collections import *
from fractions import Fraction
import heapq
import bisect
import itertools
class UnionFind:
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x): # 多用すると重い
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
group_members = defaultdict(list)
for member in range(self.n):
group_members[self.find(member)].append(member)
return group_members
def __str__(self):
return "\n".join(f"{r}: {m}" for r, m in self.all_group_members().items())
# https://raw.githubusercontent.com/shakayami/ACL-for-python/master/segtree.py
class segtree:
n = 1
size = 1
log = 2
d = [0]
op = None
e = 10**15
def __init__(self, V, OP, E):
self.n = len(V)
self.op = OP
self.e = E
self.log = (self.n - 1).bit_length()
self.size = 1 << self.log
self.d = [E for i in range(2 * self.size)]
for i in range(self.n):
self.d[self.size + i] = V[i]
for i in range(self.size - 1, 0, -1):
self.update(i)
def set(self, p, x):
assert 0 <= p and p < self.n
p += self.size
self.d[p] = x
for i in range(1, self.log + 1):
self.update(p >> i)
def get(self, p):
assert 0 <= p and p < self.n
return self.d[p + self.size]
def prod(self, l, r):
assert 0 <= l and l <= r and r <= self.n
sml = self.e
smr = self.e
l += self.size
r += self.size
while l < r:
if l & 1:
sml = self.op(sml, self.d[l])
l += 1
if r & 1:
smr = self.op(self.d[r - 1], smr)
r -= 1
l >>= 1
r >>= 1
return self.op(sml, smr)
def all_prod(self):
return self.d[1]
def max_right(self, l, f):
assert 0 <= l and l <= self.n
assert f(self.e)
if l == self.n:
return self.n
l += self.size
sm = self.e
while 1:
while l % 2 == 0:
l >>= 1
if not (f(self.op(sm, self.d[l]))):
while l < self.size:
l = 2 * l
if f(self.op(sm, self.d[l])):
sm = self.op(sm, self.d[l])
l += 1
return l - self.size
sm = self.op(sm, self.d[l])
l += 1
if (l & -l) == l:
break
return self.n
def min_left(self, r, f):
assert 0 <= r and r <= self.n
assert f(self.e)
if r == 0:
return 0
r += self.size
sm = self.e
while 1:
r -= 1
while r > 1 and (r % 2):
r >>= 1
if not (f(self.op(self.d[r], sm))):
while r < self.size:
r = 2 * r + 1
if f(self.op(self.d[r], sm)):
sm = self.op(self.d[r], sm)
r -= 1
return r + 1 - self.size
sm = self.op(self.d[r], sm)
if (r & -r) == r:
break
return 0
def update(self, k):
self.d[k] = self.op(self.d[2 * k], self.d[2 * k + 1])
def __str__(self):
return str([self.get(i) for i in range(self.n)])
def get_list(self):
return [self.get(i) for i in range(self.n)] # オリジナルで追加
# RMQのとき
# def op(x, y):
# return x if x < y else y
# seg = segtree([10**9] * N, op, 10**9) # Vの要素とEの値は同じにする #10**9 -> INF
# seg.prod(l, r) # op(a[l],...a[r-1])を返す
class BIT:
def __init__(self, n):
self.n = len(n) if isinstance(n, list) else n
self.size = 1 << (self.n - 1).bit_length()
if isinstance(n, list): # nは1-indexedなリスト
a = [0]
for p in n:
a.append(p + a[-1])
a += [a[-1]] * (self.size - self.n)
self.d = [a[p] - a[p - (p & -p)] for p in range(self.size + 1)]
else: # nは大きさ
self.d = [0] * (self.size + 1)
def __repr__(self):
p = self.size
res = []
while p > 0:
res2 = []
for r in range(p, self.size + 1, p * 2):
l = r - (r & -r) + 1
res2.append(f"[{l}, {r}]:{self.d[r]}")
res.append(" ".join(res2))
p >>= 1
res.append(f"{[self.sum(p + 1) - self.sum(p) for p in range(self.size)]}")
return "\n".join(res)
def add(self, p, x): # O(log(n)), 点pにxを加算
assert p > 0
while p <= self.size:
self.d[p] += x
p += p & -p
def get(self, p, default=None): # O(log(n))
assert p > 0
return (
self.sum(p) - self.sum(p - 1)
if 1 <= p <= self.n or default is None
else default
)
def sum(self, p): # O(log(n)), 閉区間[1, p]の累積和
assert p >= 0
res = 0
while p > 0:
res += self.d[p]
p -= p & -p
return res
def lower_bound(self, x): # O(log(n)), x <= 閉区間[1, p]の累積和 となる最小のp
if x <= 0:
return 0
p, r = 0, self.size
while r > 0:
if p + r <= self.n and self.d[p + r] < x:
x -= self.d[p + r]
p += r
r >>= 1
return p + 1
class MultiSet:
# n: サイズ、compress: 座圧対象list-likeを指定(nは無効)
# multi: マルチセットか通常のOrderedSetか
def __init__(self, n=0, *, compress=[], multi=True):
self.multi = multi
self.inv_compress = (
sorted(set(compress)) if len(compress) > 0 else [i for i in range(n)]
)
self.compress = {k: v for v, k in enumerate(self.inv_compress)}
self.counter_all = 0
self.counter = [0] * len(self.inv_compress)
self.bit = BIT(len(self.inv_compress))
def add(self, x, n=1): # O(log n)
if not self.multi and n != 1:
raise KeyError(n)
x = self.compress[x]
count = self.counter[x]
if count == 0 or self.multi: # multiなら複数カウントできる
self.bit.add(x + 1, n)
self.counter_all += n
self.counter[x] += n
def remove(self, x, n=1): # O(log n)
if not self.multi and n != 1:
raise KeyError(n)
x = self.compress[x]
count = self.bit.get(x + 1)
if count < n:
raise KeyError(x)
self.bit.add(x + 1, -n)
self.counter_all -= n
self.counter[x] -= n
def __repr__(self):
return f'MultiSet {{{(", ".join(map(str, list(self))))}}}'
def __len__(self): # oprator len: O(1)
return self.counter_all
def count(self, x): # O(1)
return self.counter[self.compress[x]] if x in self.compress else 0
def __getitem__(self, i): # operator []: O(log n)
if i < 0:
i += len(self)
x = self.bit.lower_bound(i + 1)
if x > self.bit.n:
raise IndexError("list index out of range")
return self.inv_compress[x - 1]
def __contains__(self, x): # operator in: O(1)
return self.count(x) > 0
def bisect_left(self, x): # O(log n)
return self.bit.sum(bisect.bisect_left(self.inv_compress, x))
def bisect_right(self, x): # O(log n)
return self.bit.sum(bisect.bisect_right(self.inv_compress, x))
# 宣言方法
# MultiSet(compress=X,multi=False)
# MultiSet(N+1,multi=True)
# リストを渡すと座標圧縮して返してくれる
def compress(arr):
(*XS,) = set(arr)
XS.sort()
return {cmp_e: cmp_i for cmp_i, cmp_e in enumerate(XS)}
def ctov(c):
return ord(c) - ord("a")
def CTOV(c):
return ord(c) - ord("A")
def make_divisors(n):
lower_divisors, upper_divisors = [], []
i = 1
while i * i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n // i)
i += 1
return lower_divisors + upper_divisors[::-1]
dxdy1 = ((0, 1), (0, -1), (1, 0), (-1, 0))
dxdy2 = ((0, 1), (0, -1), (1, 0), (-1, 0), (1, 1), (-1, -1), (1, -1), (-1, 1))
dxdy3 = ((0, 1), (1, 0))
dxdy4 = ((1, 1), (1, -1), (-1, 1), (-1, -1))
INF = float("inf")
MOD = 998244353
mod = 998244353
# memo : len([a,b,...,z])==26
# https://atcoder.jp/contests/abc167/submissions/40815296
N, Q, X = map(int, input().split())
W = list(map(int, input().split()))
dp = [[-1] * N for _ in range(60)] # dp[i][j]: j番目の要素から2^i回遷移したときの到達地点
S = sum(W)
C = [X // S] * N
nokori = X - S * (X // S)
acc = [0]
for w in W:
acc.append(acc[-1] + w)
for w in W:
acc.append(acc[-1] + w)
for i in range(N):
point = bisect.bisect_left(acc, acc[i] + nokori)
C[i] += point - i
# print(i, point, point - i)
# print(acc, acc[i] + nokori)
for j in range(N):
dp[0][j] = (j + C[j]) % N
for i in range(1, 60):
for j in range(N):
dp[i][j] = dp[i - 1][dp[i - 1][j]]
for _ in range(Q):
K = int(input())
K -= 1
i = 0
now = 0
while K > 0:
if (K & 1) == 1:
now = dp[i][now]
i += 1
K >>= 1
print(C[now])
import numpy as np
import sys
from functools import lru_cache
import math
sys.setrecursionlimit(int(1e7))
from collections import *
from fractions import Fraction
import heapq
import bisect
import itertools
class UnionFind:
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x): # 多用すると重い
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
group_members = defaultdict(list)
for member in range(self.n):
group_members[self.find(member)].append(member)
return group_members
def __str__(self):
return "\n".join(f"{r}: {m}" for r, m in self.all_group_members().items())
# https://raw.githubusercontent.com/shakayami/ACL-for-python/master/segtree.py
class segtree:
n = 1
size = 1
log = 2
d = [0]
op = None
e = 10**15
def __init__(self, V, OP, E):
self.n = len(V)
self.op = OP
self.e = E
self.log = (self.n - 1).bit_length()
self.size = 1 << self.log
self.d = [E for i in range(2 * self.size)]
for i in range(self.n):
self.d[self.size + i] = V[i]
for i in range(self.size - 1, 0, -1):
self.update(i)
def set(self, p, x):
assert 0 <= p and p < self.n
p += self.size
self.d[p] = x
for i in range(1, self.log + 1):
self.update(p >> i)
def get(self, p):
assert 0 <= p and p < self.n
return self.d[p + self.size]
def prod(self, l, r):
assert 0 <= l and l <= r and r <= self.n
sml = self.e
smr = self.e
l += self.size
r += self.size
while l < r:
if l & 1:
sml = self.op(sml, self.d[l])
l += 1
if r & 1:
smr = self.op(self.d[r - 1], smr)
r -= 1
l >>= 1
r >>= 1
return self.op(sml, smr)
def all_prod(self):
return self.d[1]
def max_right(self, l, f):
assert 0 <= l and l <= self.n
assert f(self.e)
if l == self.n:
return self.n
l += self.size
sm = self.e
while 1:
while l % 2 == 0:
l >>= 1
if not (f(self.op(sm, self.d[l]))):
while l < self.size:
l = 2 * l
if f(self.op(sm, self.d[l])):
sm = self.op(sm, self.d[l])
l += 1
return l - self.size
sm = self.op(sm, self.d[l])
l += 1
if (l & -l) == l:
break
return self.n
def min_left(self, r, f):
assert 0 <= r and r <= self.n
assert f(self.e)
if r == 0:
return 0
r += self.size
sm = self.e
while 1:
r -= 1
while r > 1 and (r % 2):
r >>= 1
if not (f(self.op(self.d[r], sm))):
while r < self.size:
r = 2 * r + 1
if f(self.op(self.d[r], sm)):
sm = self.op(self.d[r], sm)
r -= 1
return r + 1 - self.size
sm = self.op(self.d[r], sm)
if (r & -r) == r:
break
return 0
def update(self, k):
self.d[k] = self.op(self.d[2 * k], self.d[2 * k + 1])
def __str__(self):
return str([self.get(i) for i in range(self.n)])
def get_list(self):
return [self.get(i) for i in range(self.n)] # オリジナルで追加
# RMQのとき
# def op(x, y):
# return x if x < y else y
# seg = segtree([10**9] * N, op, 10**9) # Vの要素とEの値は同じにする #10**9 -> INF
# seg.prod(l, r) # op(a[l],...a[r-1])を返す
class BIT:
def __init__(self, n):
self.n = len(n) if isinstance(n, list) else n
self.size = 1 << (self.n - 1).bit_length()
if isinstance(n, list): # nは1-indexedなリスト
a = [0]
for p in n:
a.append(p + a[-1])
a += [a[-1]] * (self.size - self.n)
self.d = [a[p] - a[p - (p & -p)] for p in range(self.size + 1)]
else: # nは大きさ
self.d = [0] * (self.size + 1)
def __repr__(self):
p = self.size
res = []
while p > 0:
res2 = []
for r in range(p, self.size + 1, p * 2):
l = r - (r & -r) + 1
res2.append(f"[{l}, {r}]:{self.d[r]}")
res.append(" ".join(res2))
p >>= 1
res.append(f"{[self.sum(p + 1) - self.sum(p) for p in range(self.size)]}")
return "\n".join(res)
def add(self, p, x): # O(log(n)), 点pにxを加算
assert p > 0
while p <= self.size:
self.d[p] += x
p += p & -p
def get(self, p, default=None): # O(log(n))
assert p > 0
return (
self.sum(p) - self.sum(p - 1)
if 1 <= p <= self.n or default is None
else default
)
def sum(self, p): # O(log(n)), 閉区間[1, p]の累積和
assert p >= 0
res = 0
while p > 0:
res += self.d[p]
p -= p & -p
return res
def lower_bound(self, x): # O(log(n)), x <= 閉区間[1, p]の累積和 となる最小のp
if x <= 0:
return 0
p, r = 0, self.size
while r > 0:
if p + r <= self.n and self.d[p + r] < x:
x -= self.d[p + r]
p += r
r >>= 1
return p + 1
class MultiSet:
# n: サイズ、compress: 座圧対象list-likeを指定(nは無効)
# multi: マルチセットか通常のOrderedSetか
def __init__(self, n=0, *, compress=[], multi=True):
self.multi = multi
self.inv_compress = (
sorted(set(compress)) if len(compress) > 0 else [i for i in range(n)]
)
self.compress = {k: v for v, k in enumerate(self.inv_compress)}
self.counter_all = 0
self.counter = [0] * len(self.inv_compress)
self.bit = BIT(len(self.inv_compress))
def add(self, x, n=1): # O(log n)
if not self.multi and n != 1:
raise KeyError(n)
x = self.compress[x]
count = self.counter[x]
if count == 0 or self.multi: # multiなら複数カウントできる
self.bit.add(x + 1, n)
self.counter_all += n
self.counter[x] += n
def remove(self, x, n=1): # O(log n)
if not self.multi and n != 1:
raise KeyError(n)
x = self.compress[x]
count = self.bit.get(x + 1)
if count < n:
raise KeyError(x)
self.bit.add(x + 1, -n)
self.counter_all -= n
self.counter[x] -= n
def __repr__(self):
return f'MultiSet {{{(", ".join(map(str, list(self))))}}}'
def __len__(self): # oprator len: O(1)
return self.counter_all
def count(self, x): # O(1)
return self.counter[self.compress[x]] if x in self.compress else 0
def __getitem__(self, i): # operator []: O(log n)
if i < 0:
i += len(self)
x = self.bit.lower_bound(i + 1)
if x > self.bit.n:
raise IndexError("list index out of range")
return self.inv_compress[x - 1]
def __contains__(self, x): # operator in: O(1)
return self.count(x) > 0
def bisect_left(self, x): # O(log n)
return self.bit.sum(bisect.bisect_left(self.inv_compress, x))
def bisect_right(self, x): # O(log n)
return self.bit.sum(bisect.bisect_right(self.inv_compress, x))
# 宣言方法
# MultiSet(compress=X,multi=False)
# MultiSet(N+1,multi=True)
# リストを渡すと座標圧縮して返してくれる
def compress(arr):
(*XS,) = set(arr)
XS.sort()
return {cmp_e: cmp_i for cmp_i, cmp_e in enumerate(XS)}
def ctov(c):
return ord(c) - ord("a")
def CTOV(c):
return ord(c) - ord("A")
def make_divisors(n):
lower_divisors, upper_divisors = [], []
i = 1
while i * i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n // i)
i += 1
return lower_divisors + upper_divisors[::-1]
dxdy1 = ((0, 1), (0, -1), (1, 0), (-1, 0))
dxdy2 = ((0, 1), (0, -1), (1, 0), (-1, 0), (1, 1), (-1, -1), (1, -1), (-1, 1))
dxdy3 = ((0, 1), (1, 0))
dxdy4 = ((1, 1), (1, -1), (-1, 1), (-1, -1))
INF = float("inf")
MOD = 998244353
mod = 998244353
# memo : len([a,b,...,z])==26
# https://atcoder.jp/contests/abc167/submissions/40815296
N, Q, X = map(int, input().split())
W = list(map(int, input().split()))
dp = [[-1] * N for _ in range(60)] # dp[i][j]: j番目の要素から2^i回遷移したときの到達地点
S = sum(W)
C = [(X // S) * N] * N
nokori = X - S * (X // S)
acc = [0]
for w in W:
acc.append(acc[-1] + w)
for w in W:
acc.append(acc[-1] + w)
for i in range(N):
point = bisect.bisect_left(acc, acc[i] + nokori)
C[i] += point - i
# print(i, point, point - i)
# print(acc, acc[i] + nokori)
for j in range(N):
dp[0][j] = (j + C[j]) % N
for i in range(1, 60):
for j in range(N):
dp[i][j] = dp[i - 1][dp[i - 1][j]]
for _ in range(Q):
K = int(input())
K -= 1
i = 0
now = 0
while K > 0:
if (K & 1) == 1:
now = dp[i][now]
i += 1
K >>= 1
print(C[now]) | ConDefects/ConDefects/Code/abc258_e/Python/45738993 |
condefects-python_data_1433 | import itertools
import bisect
N, Q, X = map(int, input().split())
W = list(map(int, input().split()))
u = sum(W)
R = list(itertools.accumulate([0] + W + W))
B = []
n = X // u
b = (X // u) * u
need = X - b
X = []
for i in range(1, N+1):
add = n
ok = R[i-1] + need
idx = bisect.bisect_left(R, ok)
add += idx - (i-1)
B.append(add)
X.append(idx % N)
dp = [X]
now = X
for _ in range(40):
nex = []
for i in range(N):
nex.append(now[now[i]])
now = nex
dp.append(now)
for _ in range(Q):
K = int(input())
K -= 1
now = 0
for r in range(41):
if (K>>r) & 1:
now = dp[r][now]
print(B[now])
import itertools
import bisect
N, Q, X = map(int, input().split())
W = list(map(int, input().split()))
u = sum(W)
R = list(itertools.accumulate([0] + W + W))
B = []
n = X // u
b = (X // u) * u
need = X - b
X = []
for i in range(1, N+1):
add = n * N
ok = R[i-1] + need
idx = bisect.bisect_left(R, ok)
add += idx - (i-1)
B.append(add)
X.append(idx % N)
dp = [X]
now = X
for _ in range(40):
nex = []
for i in range(N):
nex.append(now[now[i]])
now = nex
dp.append(now)
for _ in range(Q):
K = int(input())
K -= 1
now = 0
for r in range(41):
if (K>>r) & 1:
now = dp[r][now]
print(B[now]) | ConDefects/ConDefects/Code/abc258_e/Python/45310559 |
condefects-python_data_1434 | from collections import deque
N, Q, X = map(int, input().split())
W = list(map(int, input().split()))
right = [0] * N
SUM = sum(W)
A = X // SUM
B = X % SUM
count = [N * A] * N
deq = deque([])
r = 0
tmp = 0
# while tmp < B:
# deq.append(W[r])
# tmp += W[r]
# r += 1
# r %= N
# right[0] = r
# count[0] += r
# if r == 0:
# count[0] = N
for l in range(N):
if deq:
l_w = deq.popleft()
tmp -= l_w
while tmp < B:
deq.append(W[r])
tmp += W[r]
r += 1
r %= N
right[l] = r
count[l] += (r - l) % N
if r == l:
count[l] += N
M = 41
dp = [ [0] * N for _ in range(M)]
for i in range(N):
dp[0][i] = right[i]
for i in range(1, M):
for j in range(N):
dp[i][j] = dp[i - 1][dp[i - 1][j]]
def query(k : int):
p = 0
for i in range(M):
if k >> i & 1:
p = dp[i][p]
return count[p]
for _ in range(Q):
k = int(input()) - 1
ans = query(k)
print(ans)
from collections import deque
N, Q, X = map(int, input().split())
W = list(map(int, input().split()))
right = [0] * N
SUM = sum(W)
A = X // SUM
B = X % SUM
count = [N * A] * N
deq = deque([])
r = 0
tmp = 0
# while tmp < B:
# deq.append(W[r])
# tmp += W[r]
# r += 1
# r %= N
# right[0] = r
# count[0] += r
# if r == 0:
# count[0] = N
for l in range(N):
if deq:
l_w = deq.popleft()
tmp -= l_w
while tmp < B:
deq.append(W[r])
tmp += W[r]
r += 1
r %= N
right[l] = r
count[l] += (r - l) % N
if r == l and B > 0:
count[l] += N
M = 41
dp = [ [0] * N for _ in range(M)]
for i in range(N):
dp[0][i] = right[i]
for i in range(1, M):
for j in range(N):
dp[i][j] = dp[i - 1][dp[i - 1][j]]
def query(k : int):
p = 0
for i in range(M):
if k >> i & 1:
p = dp[i][p]
return count[p]
for _ in range(Q):
k = int(input()) - 1
ans = query(k)
print(ans) | ConDefects/ConDefects/Code/abc258_e/Python/44667415 |
condefects-python_data_1435 | def ip():return int(input())
def mp():return map(int, input().split())
def lmp():return list(map(int, input().split()))
# ABC258 E 1545 - Packing Potatoes PyPyで提出
# ベルトコンベアに載って 10^100 個のじゃがいもが 1 個ずつ流れてきます。
# 流れてくるじゃがいもの重さは長さ N の数列 W = (W0,…,W_{N-1}) で表され、i (1≤i≤10^100) 番目に流れてくるじゃがいもの重さは W_{(i-1) mod N} です。
# 高橋君は、まず空の箱を用意し、次のルールに従ってじゃがいもを順番に箱に詰めていきます。
# じゃがいもを箱に入れる。箱に入っているじゃがいもの重さの総和が X 以上になったら、その箱には蓋をし、新たに空の箱を用意する。
# Q 個のクエリが与えられます。
# i (1≤i≤Q) 番目のクエリでは、正整数 Ki が与えられるので、Ki 番目に蓋をされた箱に入っているじゃがいもの個数を求めてください。
# 問題の制約下で、蓋をされた箱が Ki 個以上存在することが証明できます。
# ・1 ≤ N, Q ≤ 2×10^5
# ・1 ≤ X ≤ 10^9
# ・1 ≤ Wi ≤ 10^9 (0 ≤ i ≤ N-1)
# ・1 ≤ Ki ≤ 10^12 (1 ≤ i ≤Q)
# 周期性
N, Q, X = mp()
W = lmp()
M = 60
dp = [[0] * N for _ in range(M)]
# dp[k][i]: i の 2^k 個後の箱に何個のジャガイモが詰められるか
j = 0
tmp = 0
allsum = sum(W)
q = X // allsum
X %= allsum
for i in range(N):
while tmp < X:
tmp += W[j % N]
j += 1
dp[0][i] = j-i
tmp -= W[i]
for k in range(M-1):
for i in range(N):
j = dp[k][i]
dp[k+1][i] = j + dp[k][(i+j) % N]
for _ in range(Q):
K = ip()
i = 0
for k in range(M):
if K > (1<<k):
i = (i + dp[k][i]) % N
K -= 1<<k
print(dp[0][i] + q*N)
def ip():return int(input())
def mp():return map(int, input().split())
def lmp():return list(map(int, input().split()))
# ABC258 E 1545 - Packing Potatoes PyPyで提出
# ベルトコンベアに載って 10^100 個のじゃがいもが 1 個ずつ流れてきます。
# 流れてくるじゃがいもの重さは長さ N の数列 W = (W0,…,W_{N-1}) で表され、i (1≤i≤10^100) 番目に流れてくるじゃがいもの重さは W_{(i-1) mod N} です。
# 高橋君は、まず空の箱を用意し、次のルールに従ってじゃがいもを順番に箱に詰めていきます。
# じゃがいもを箱に入れる。箱に入っているじゃがいもの重さの総和が X 以上になったら、その箱には蓋をし、新たに空の箱を用意する。
# Q 個のクエリが与えられます。
# i (1≤i≤Q) 番目のクエリでは、正整数 Ki が与えられるので、Ki 番目に蓋をされた箱に入っているじゃがいもの個数を求めてください。
# 問題の制約下で、蓋をされた箱が Ki 個以上存在することが証明できます。
# ・1 ≤ N, Q ≤ 2×10^5
# ・1 ≤ X ≤ 10^9
# ・1 ≤ Wi ≤ 10^9 (0 ≤ i ≤ N-1)
# ・1 ≤ Ki ≤ 10^12 (1 ≤ i ≤Q)
# 周期性
N, Q, X = mp()
W = lmp()
M = 60
dp = [[0] * N for _ in range(M)]
# dp[k][i]: i の 2^k 個後の箱に何個のジャガイモが詰められるか
j = 0
tmp = 0
allsum = sum(W)
q = X // allsum
X %= allsum
for i in range(N):
while tmp < X:
tmp += W[j % N]
j += 1
dp[0][i] = j-i
tmp -= W[i]
for k in range(M-1):
for i in range(N):
j = dp[k][i]
dp[k+1][i] = j + dp[k][(i+j) % N]
for _ in range(Q):
K = ip()
i = 0
for k in range(M)[::-1]:
if K > (1<<k):
i = (i + dp[k][i]) % N
K -= 1<<k
print(dp[0][i] + q*N) | ConDefects/ConDefects/Code/abc258_e/Python/46182612 |
condefects-python_data_1436 | h1,w1=map(int,input().split())
a=[]
for i in range(h1):
tmp=list(map(int,input().split()))
a.append(tmp)
h2,w2=map(int,input().split())
b=[]
for i in range(h2):
tmp=list(map(int,input().split()))
b.append(tmp)
for bit_r in range(1<<h1):
for bit_c in range(1<<w1):
after=[]
for shift_r in range(h1):
if bit_r>>shift_r &1==0:
after_row=[]
for shift_c in range(w1):
if bit_c>>shift_c &1==0:
after_row.append(a[shift_r][shift_c])
after.append(after_row)
if after==b:
print("Yes")
exit()
print("No")
h1,w1=map(int,input().split())
a=[]
for i in range(h1):
tmp=list(map(int,input().split()))
a.append(tmp)
h2,w2=map(int,input().split())
b=[]
for i in range(h2):
tmp=list(map(int,input().split()))
b.append(tmp)
for bit_r in range(1<<h1):
for bit_c in range(1<<w1):
after=[]
for shift_r in range(h1):
if bit_r>>shift_r &1==0:
after_row=[]
for shift_c in range(w1):
if bit_c>>shift_c &1==0:
after_row.append(a[shift_r][shift_c])
after.append(after_row)
if after==b:
print("Yes")
exit()
print("No") | ConDefects/ConDefects/Code/abc264_c/Python/44997229 |
condefects-python_data_1437 | h1,w1=map(int,input().split())
a=[]
for i in range(h1):
tmp=list(map(int,input().split()))
a.append(tmp)
h2,w2=map(int,input().split())
b=[]
for i in range(h2):
tmp=list(map(int,input().split()))
b.append(tmp)
for bit_r in range(1<<h1):
for bit_c in range(1<<w1):
after=[]
for shift_r in range(h1):
if bit_r>>shift_r &1==0:
after_row=[]
for shift_c in range(w1):
if bit_c>>shift_c &1==0:
after_row.append(a[shift_r][shift_c])
after.append(after_row)
if after==b:
print("Yes")
exit()
print("No")
h1,w1=map(int,input().split())
a=[]
for i in range(h1):
tmp=list(map(int,input().split()))
a.append(tmp)
h2,w2=map(int,input().split())
b=[]
for i in range(h2):
tmp=list(map(int,input().split()))
b.append(tmp)
for bit_r in range(1<<h1):
for bit_c in range(1<<w1):
after=[]
for shift_r in range(h1):
if bit_r>>shift_r &1==0:
after_row=[]
for shift_c in range(w1):
if bit_c>>shift_c &1==0:
after_row.append(a[shift_r][shift_c])
after.append(after_row)
if after==b:
print("Yes")
exit()
print("No") | ConDefects/ConDefects/Code/abc264_c/Python/45221303 |
condefects-python_data_1438 | ctypedef long long ll
from libcpp.vector cimport vector
cdef:
ll N,D,S,i,j,k,w,b,now
double mean
vector[double] pre
vector[ll] bi
vector[vector[double]] dp
N,D=map(int,input().split())
W=list(map(int,input().split()))
mean=sum(W)/D
#print(mean)
for S in range(1<<N):
w=0
j=0
for i in range(N):
if S&(1<<i):
w+=W[i]
j+=1
pre.push_back(((w-mean)**2)/D)
bi.push_back(j)
dp.resize(1<<N)
for S in range(1<<N):
dp[S].resize(D+1,10**20)
b=bi[S]
for k in range(1,min(D+1,b)):
if k==1:
dp[S][k]=pre[S]
else:
now=(S-1)&S
while now>0:
dp[S][k]=min(dp[S][k],dp[now][k-1]+pre[S^now])
now=(now-1)&S
print(dp[(1<<N)-1][D])
ctypedef long long ll
from libcpp.vector cimport vector
cdef:
ll N,D,S,i,j,k,w,b,now
double mean
vector[double] pre
vector[ll] bi
vector[vector[double]] dp
N,D=map(int,input().split())
W=list(map(int,input().split()))
mean=sum(W)/D
#print(mean)
for S in range(1<<N):
w=0
j=0
for i in range(N):
if S&(1<<i):
w+=W[i]
j+=1
pre.push_back(((w-mean)**2)/D)
bi.push_back(j)
dp.resize(1<<N)
for S in range(1<<N):
dp[S].resize(D+1,10**20)
b=bi[S]
for k in range(1,min(D+1,b+1)):
if k==1:
dp[S][k]=pre[S]
else:
now=(S-1)&S
while now>0:
dp[S][k]=min(dp[S][k],dp[now][k-1]+pre[S^now])
now=(now-1)&S
print(dp[(1<<N)-1][D]) | ConDefects/ConDefects/Code/abc332_e/Python/52500433 |
condefects-python_data_1439 | mod = 998244353
g = 3
ginv = 332748118
W = [pow(g, (mod-1)>>i, mod) for i in range(24)]
Winv = [pow(ginv, (mod-1)>>i, mod) for i in range(24)]
def fft(k,f):
for l in range(k,0,-1):
d = 1 << l - 1
U = [1]
for i in range(d):
U.append(U[-1]*W[l]%mod)
for i in range(1<<k - l):
for j in range(d):
s = i*2*d + j
f[s],f[s+d] = (f[s]+f[s+d])%mod, U[j]*(f[s]-f[s+d])%mod
def fftinv(k,f):
for l in range(1,k+1):
d = 1 << l - 1
for i in range(1<<k - l):
u = 1
for j in range(i*2*d, (i*2+1)*d):
f[j+d] *= u
f[j],f[j+d] = (f[j]+f[j+d])%mod, (f[j]-f[j+d])%mod
u *= Winv[l]
u %= mod
def convolution(a,b):
le = len(a)+len(b)-1
k = le.bit_length()
n = 1 << k
a = a + [0]*(n-len(a))
b = b + [0]*(n-len(b))
fft(k,a)
fft(k,b)
for i in range(n):
a[i] *= b[i]
a[i] %= mod
fftinv(k,a)
ninv = pow(n,mod-2,mod)
for i in range(le):
a[i] *= ninv
a[i] %= mod
return a[:le]
import random
dic = {}
use = set()
x = [chr(ord("a")+i) for i in range(26)] + [chr(ord("A")+i) for i in range(26)] + ["."]
for s in x:
while True:
r = random.randint(1,600)
if r in use:
continue
dic[s] = r
break
dic["_"] = 0
l,w = map(int,input().split())
S = input()
P = input()
base = S
S += "." * (w-1)
need = l+w-1 + w-1
dif = need - len(S)
if dif >= l:
S += base
dif -= l
else:
S += base[:dif]
dif = 0
S += "."*dif
S = [dic[s] for s in S]
P = [dic[s] for s in P]
P = P[::-1]
size = len(S)+len(P)-1
cand = [0]*size
for sp,pp,f in [[3,1,1],[2,2,-2],[1,3,1]]:
nS = [s**sp for s in S]
nP = [p**pp for p in P]
conv = convolution(nS,nP)
for i in range(size):
cand[i] += conv[i]*f
ans = 0
for i in range(w-1,need):
if cand[i] == 0:
ans += 1
print(ans)
mod = 998244353
g = 3
ginv = 332748118
W = [pow(g, (mod-1)>>i, mod) for i in range(24)]
Winv = [pow(ginv, (mod-1)>>i, mod) for i in range(24)]
def fft(k,f):
for l in range(k,0,-1):
d = 1 << l - 1
U = [1]
for i in range(d):
U.append(U[-1]*W[l]%mod)
for i in range(1<<k - l):
for j in range(d):
s = i*2*d + j
f[s],f[s+d] = (f[s]+f[s+d])%mod, U[j]*(f[s]-f[s+d])%mod
def fftinv(k,f):
for l in range(1,k+1):
d = 1 << l - 1
for i in range(1<<k - l):
u = 1
for j in range(i*2*d, (i*2+1)*d):
f[j+d] *= u
f[j],f[j+d] = (f[j]+f[j+d])%mod, (f[j]-f[j+d])%mod
u *= Winv[l]
u %= mod
def convolution(a,b):
le = len(a)+len(b)-1
k = le.bit_length()
n = 1 << k
a = a + [0]*(n-len(a))
b = b + [0]*(n-len(b))
fft(k,a)
fft(k,b)
for i in range(n):
a[i] *= b[i]
a[i] %= mod
fftinv(k,a)
ninv = pow(n,mod-2,mod)
for i in range(le):
a[i] *= ninv
a[i] %= mod
return a[:le]
import random
dic = {}
use = set()
x = [chr(ord("a")+i) for i in range(26)] + [chr(ord("A")+i) for i in range(26)] + ["."]
for s in x:
while True:
r = random.randint(1,500)
if r in use:
continue
dic[s] = r
break
dic["_"] = 0
l,w = map(int,input().split())
S = input()
P = input()
base = S
S += "." * (w-1)
need = l+w-1 + w-1
dif = need - len(S)
if dif >= l:
S += base
dif -= l
else:
S += base[:dif]
dif = 0
S += "."*dif
S = [dic[s] for s in S]
P = [dic[s] for s in P]
P = P[::-1]
size = len(S)+len(P)-1
cand = [0]*size
for sp,pp,f in [[3,1,1],[2,2,-2],[1,3,1]]:
nS = [s**sp for s in S]
nP = [p**pp for p in P]
conv = convolution(nS,nP)
for i in range(size):
cand[i] += conv[i]*f
ans = 0
for i in range(w-1,need):
if cand[i] == 0:
ans += 1
print(ans)
| ConDefects/ConDefects/Code/abc307_h/Python/43030329 |
condefects-python_data_1440 | mod=998244353
mod_syou=119
mod_log=23
mod_kon=3
root=pow(mod_kon,mod_syou,mod)
rootinv=pow(root,mod-2,mod)
bbeki=[0]*(mod_log+1)
bbeki2=[0]*(mod_log+1)
beki_dic=dict()
this=1
for i in range(mod_log+1):
beki_dic[this]=i
this*=2
def beki_mae():
x=root
beki=1
for i in range(mod_log,-1,-1):
bbeki[i]=x
x=x**2
x%=mod
x=rootinv
beki=1
for i in range(mod_log,-1,-1):
bbeki2[i]=x
x=x**2
x%=mod
beki_mae()
def rev(i,k):
ans=0
s=bin(i)[2:]
for i in range(len(s)):
if s[len(s)-1-i]=="1":
ans+=2**(k-1-i)
return ans
def NTT_len(a):#a<=2^Nを満たす最小のNを返す
k=1
b=0
for i in range(100):
if k>=a:
break
else:
k*=2
b+=1
return b
def NTT_change0(A,k):#長さ2^kにする
N=len(A)
A=A+[0]*(2**k-N)
NTT_change(A)
return A
def NTT_change(A):#Aをstart<=k<finまでNTT変換,f(x^i)(i=0~N-1)を求める
N=len(A)
le=N
while le>1:
x=bbeki[beki_dic[le]]
for st in range(N//le):
this=1
for i in range(le//2):
l=A[st*le+i]
r=A[st*le+i+le//2]
A[st*le+i]=(l+r)%mod
A[st*le+i+le//2]=((l-r)*this)%mod
this*=x
this%=mod
le//=2
def NTT_invchange0(A,k):#長さ2^kにする
N=len(A)
A=A+[0]*(2**k-N)
NTT_invchange(A)
return A
def NTT_invchange(A):#Aをstart<=k<finまでNTT変換,f(x^i)(i=0~N-1)を求める
N=len(A)
le=2
while le<=N:
x=bbeki2[beki_dic[le]]
for st in range(N//le):
this=1
for i in range(le//2):
l=A[st*le+i]
r=A[st*le+i+le//2]*this
r%=mod
A[st*le+i]=(l+r)%mod
A[st*le+i+(le//2)]=(l-r)%mod
this*=x
this%=mod
le*=2
invN=pow(N,mod-2,mod)
for i in range(N):
A[i]*=invN
A[i]%=mod
def NTT_time(A,B):#A,Bの畳み込み
n=len(A)
m=len(B)
k=NTT_len(n+m-1)
A=NTT_change0(A,k)
B=NTT_change0(B,k)
c=list()
for i in range(len(A)):
c.append(A[i]*B[i]%mod)
c=NTT_invchange0(c,k)
return c[:n+m-1]
def NTTinv(f):
"""
1/f=gをreturn
"""
le=len(f)
this_roop=NTT_len(len(f))
c=pow(int(f[0]),mod-2,mod)
g=[c]
a=1
for i in range(this_roop):
a*=2
S=NTT_time(g,f)[:a]
S=[-i%mod for i in S]
S[0]+=2
g=NTT_time(g,S)[:a]
return g[:le]
#f[0]==0の時バグりそう。
#f[0]==0の時バグりそう。
N,K=map(int,input().split())
c=list(map(int,input().split()))
mod=998244353
d=dict()
for i in c:
if i in d:
d[i]+=1
else:
d[i]=1
X=list()
for i in d:
if d[i]==1:
continue
else:
X.append(d[i])
X.sort()
T=[1]
#(1+x)...(1+(d[i]-1)x)を全体にかける
#print(X)
from collections import deque
T=deque()
for i in X:
for j in range(1,i):
T.append([1,j])
#a
if len(T)==0:
if K%2==1:
print(1)
else:
print(0)
exit()
while len(T)>1:
a=T.popleft()
b=T.popleft()
T.append(NTT_time(a,b))
#print(T)
ans=0
for i in range(len(T[0])):
if i%2==K%2 and i<=K:
ans+=T[0][i]
ans%=mod
print(ans)
mod=998244353
mod_syou=119
mod_log=23
mod_kon=3
root=pow(mod_kon,mod_syou,mod)
rootinv=pow(root,mod-2,mod)
bbeki=[0]*(mod_log+1)
bbeki2=[0]*(mod_log+1)
beki_dic=dict()
this=1
for i in range(mod_log+1):
beki_dic[this]=i
this*=2
def beki_mae():
x=root
beki=1
for i in range(mod_log,-1,-1):
bbeki[i]=x
x=x**2
x%=mod
x=rootinv
beki=1
for i in range(mod_log,-1,-1):
bbeki2[i]=x
x=x**2
x%=mod
beki_mae()
def rev(i,k):
ans=0
s=bin(i)[2:]
for i in range(len(s)):
if s[len(s)-1-i]=="1":
ans+=2**(k-1-i)
return ans
def NTT_len(a):#a<=2^Nを満たす最小のNを返す
k=1
b=0
for i in range(100):
if k>=a:
break
else:
k*=2
b+=1
return b
def NTT_change0(A,k):#長さ2^kにする
N=len(A)
A=A+[0]*(2**k-N)
NTT_change(A)
return A
def NTT_change(A):#Aをstart<=k<finまでNTT変換,f(x^i)(i=0~N-1)を求める
N=len(A)
le=N
while le>1:
x=bbeki[beki_dic[le]]
for st in range(N//le):
this=1
for i in range(le//2):
l=A[st*le+i]
r=A[st*le+i+le//2]
A[st*le+i]=(l+r)%mod
A[st*le+i+le//2]=((l-r)*this)%mod
this*=x
this%=mod
le//=2
def NTT_invchange0(A,k):#長さ2^kにする
N=len(A)
A=A+[0]*(2**k-N)
NTT_invchange(A)
return A
def NTT_invchange(A):#Aをstart<=k<finまでNTT変換,f(x^i)(i=0~N-1)を求める
N=len(A)
le=2
while le<=N:
x=bbeki2[beki_dic[le]]
for st in range(N//le):
this=1
for i in range(le//2):
l=A[st*le+i]
r=A[st*le+i+le//2]*this
r%=mod
A[st*le+i]=(l+r)%mod
A[st*le+i+(le//2)]=(l-r)%mod
this*=x
this%=mod
le*=2
invN=pow(N,mod-2,mod)
for i in range(N):
A[i]*=invN
A[i]%=mod
def NTT_time(A,B):#A,Bの畳み込み
n=len(A)
m=len(B)
k=NTT_len(n+m-1)
A=NTT_change0(A,k)
B=NTT_change0(B,k)
c=list()
for i in range(len(A)):
c.append(A[i]*B[i]%mod)
c=NTT_invchange0(c,k)
return c[:n+m-1]
def NTTinv(f):
"""
1/f=gをreturn
"""
le=len(f)
this_roop=NTT_len(len(f))
c=pow(int(f[0]),mod-2,mod)
g=[c]
a=1
for i in range(this_roop):
a*=2
S=NTT_time(g,f)[:a]
S=[-i%mod for i in S]
S[0]+=2
g=NTT_time(g,S)[:a]
return g[:le]
#f[0]==0の時バグりそう。
#f[0]==0の時バグりそう。
N,K=map(int,input().split())
c=list(map(int,input().split()))
mod=998244353
d=dict()
for i in c:
if i in d:
d[i]+=1
else:
d[i]=1
X=list()
for i in d:
if d[i]==1:
continue
else:
X.append(d[i])
X.sort()
T=[1]
#(1+x)...(1+(d[i]-1)x)を全体にかける
#print(X)
from collections import deque
T=deque()
for i in X:
for j in range(1,i):
T.append([1,j])
#a
if len(T)==0:
if K%2==0:
print(1)
else:
print(0)
exit()
while len(T)>1:
a=T.popleft()
b=T.popleft()
T.append(NTT_time(a,b))
#print(T)
ans=0
for i in range(len(T[0])):
if i%2==K%2 and i<=K:
ans+=T[0][i]
ans%=mod
print(ans) | ConDefects/ConDefects/Code/abc247_h/Python/30891102 |
condefects-python_data_1441 | SIZE=10**4+1; MOD=998244353 #ここを変更する
inv = [0]*SIZE # inv[j] = j^{-1} mod MOD
fac = [0]*SIZE # fac[j] = j! mod MOD
finv = [0]*SIZE # finv[j] = (j!)^{-1} mod MOD
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
for i in range(2,SIZE):
fac[i] = fac[i-1]*i%MOD
finv[-1] = pow(fac[-1],MOD-2,MOD)
for i in range(SIZE-1,0,-1):
finv[i-1] = finv[i]*i%MOD
inv[i] = finv[i]*fac[i-1]%MOD
def choose(n,r): # nCk mod MOD の計算
if 0 <= r <= n:
return (fac[n]*finv[r]%MOD)*finv[n-r]%MOD
else:
return 0
import sys
readline = sys.stdin.readline
#n = int(readline())
#*a, = map(int,readline().split())
# b = [list(map(int,readline().split())) for _ in range()]
n = int(readline())
*a, = map(int,readline().split())
a.sort(reverse=1)
"""
dp[i][j][k] = i 個以上の数のみを j 個使い、計 k マス埋めた
"""
L = 0
#dp = [[0]*(n+2) for _ in range(n+1)]
dp = [[0]*(n+1) for _ in range(n+1)]
dp[0][0] = 1
for i in range(1,n+1)[::-1]:
while L < n and i <= a[L]:
L += 1
# 置けるマス、置ける数は合計 L 個
for j in range(n+1)[::-1]:
for k in range(j,n+1)[::-1]:
if dp[j][k] == 0: break
# i 個を l セット置く
r = finv[i]
for l in range(1,n+1):
if j+l > L: break
if k+i*l > L: break
ratio = choose(L-k,i*l)*choose(L-j,l)%MOD*fac[i*l]%MOD*r%MOD
dp[j+l][k+i*l] += dp[j][k]*ratio
dp[j+l][k+i*l] %= MOD
r = r*finv[i]%MOD
ans = 0
for j in range(n+1):
ans += dp[j][n]
print(ans%MOD)
SIZE=10**4+1; MOD=998244353 #ここを変更する
inv = [0]*SIZE # inv[j] = j^{-1} mod MOD
fac = [0]*SIZE # fac[j] = j! mod MOD
finv = [0]*SIZE # finv[j] = (j!)^{-1} mod MOD
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
for i in range(2,SIZE):
fac[i] = fac[i-1]*i%MOD
finv[-1] = pow(fac[-1],MOD-2,MOD)
for i in range(SIZE-1,0,-1):
finv[i-1] = finv[i]*i%MOD
inv[i] = finv[i]*fac[i-1]%MOD
def choose(n,r): # nCk mod MOD の計算
if 0 <= r <= n:
return (fac[n]*finv[r]%MOD)*finv[n-r]%MOD
else:
return 0
import sys
readline = sys.stdin.readline
#n = int(readline())
#*a, = map(int,readline().split())
# b = [list(map(int,readline().split())) for _ in range()]
n = int(readline())
*a, = map(int,readline().split())
a.sort(reverse=1)
"""
dp[i][j][k] = i 個以上の数のみを j 個使い、計 k マス埋めた
"""
L = 0
#dp = [[0]*(n+2) for _ in range(n+1)]
dp = [[0]*(n+1) for _ in range(n+1)]
dp[0][0] = 1
for i in range(1,n+1)[::-1]:
while L < n and i <= a[L]:
L += 1
# 置けるマス、置ける数は合計 L 個
for j in range(n+1)[::-1]:
for k in range(j,n+1)[::-1]:
if dp[j][k] == 0: continue
# i 個を l セット置く
r = finv[i]
for l in range(1,n+1):
if j+l > L: break
if k+i*l > L: break
ratio = choose(L-k,i*l)*choose(L-j,l)%MOD*fac[i*l]%MOD*r%MOD
dp[j+l][k+i*l] += dp[j][k]*ratio
dp[j+l][k+i*l] %= MOD
r = r*finv[i]%MOD
ans = 0
for j in range(n+1):
ans += dp[j][n]
print(ans%MOD) | ConDefects/ConDefects/Code/arc162_e/Python/43020372 |
condefects-python_data_1442 | s=input()
n=int(input())
ts=[input() for i in range(n)]
e1=[[-1]*26]
p=[0]
v=1
d=[""]
for i in range(n):
t=ts[i]
y=0
for j in range(len(t)):
u=ord(t[j])-ord("a")
if e1[y][u]==-1:
e1+=[[-1]*26]
e1[y][u]=v
p+=[y]
d+=[t[j]]
v+=1
y=e1[y][u]
x=[0]*v
for i in range(n):
t=ts[i]
y=0
for j in range(len(t)):
u=ord(t[j])-ord("a")
y=e1[y][u]
if j==len(t)-1:
x[y]=1
e2=[0]*v
q=[0]
for i in q:
if p[i]!=0:
y=e2[p[i]]
u=ord(d[i][-1])-ord("a")
while y!=0 and e1[y][u]==-1:
y=e2[y]
if e1[y][u]!=-1:
e2[i]=e1[y][u]
x[i]|=x[e2[i]]
for j in e1[i]:
if j!=-1:
q+=[j]
g=0
y=0
i=-1
while i+1<len(s):
c=s[i+1]
i+=1
u=ord(c)-ord("a")
if e1[y][u]!=-1:
y=e1[y][u]
else:
y=e2[y]
if e1[y][u]!=-1:
y=e1[y][u]
if x[y]:
g+=1
y=0
print(g)
s=input()
n=int(input())
ts=[input() for i in range(n)]
e1=[[-1]*26]
p=[0]
v=1
d=[""]
for i in range(n):
t=ts[i]
y=0
for j in range(len(t)):
u=ord(t[j])-ord("a")
if e1[y][u]==-1:
e1+=[[-1]*26]
e1[y][u]=v
p+=[y]
d+=[t[j]]
v+=1
y=e1[y][u]
x=[0]*v
for i in range(n):
t=ts[i]
y=0
for j in range(len(t)):
u=ord(t[j])-ord("a")
y=e1[y][u]
if j==len(t)-1:
x[y]=1
e2=[0]*v
q=[0]
for i in q:
if p[i]!=0:
y=e2[p[i]]
u=ord(d[i][-1])-ord("a")
while y!=0 and e1[y][u]==-1:
y=e2[y]
if e1[y][u]!=-1:
e2[i]=e1[y][u]
x[i]|=x[e2[i]]
for j in e1[i]:
if j!=-1:
q+=[j]
g=0
y=0
i=-1
while i+1<len(s):
c=s[i+1]
i+=1
u=ord(c)-ord("a")
if e1[y][u]!=-1:
y=e1[y][u]
else:
y=e2[y]
while y!=0 and e1[y][u]==-1:
y=e2[y]
if e1[y][u]!=-1:
y=e1[y][u]
if x[y]:
g+=1
y=0
print(g) | ConDefects/ConDefects/Code/abc268_h/Python/49647495 |
condefects-python_data_1443 | from collections import deque
class Trie_with_Aho_Corasick():
def __init__(self, keywords, sigma = 26):
self.keywords = keywords
self.sigma = sigma
self.tree = [[-1] * (sigma + 2) for _ in range(sum(len(_str) for _str in keywords) + 1)]
self.depth = [0] * len(self.tree)
self.num = 1
### _build_trie ###
for i, word in enumerate(keywords):
self._register(i, word)
self.init_failure()
def _register(self, i, word):
pos = 0
for c in word:
c = ord(c) - ord_a
if self.tree[pos][c] == -1:
self.tree[pos][c] = self.num
self.depth[self.num] = self.depth[pos] + 1
self.num += 1
pos = self.tree[pos][c]
self.tree[pos][-1] = i
def init_failure(self):
self.tree[0][-2] = 0
que = deque([0])
while que:
v = que.popleft()
f = self.tree[v][-2]
if self.tree[v][-1] == -1:
self.tree[v][-1] = self.tree[f][-1]
for i in range(self.sigma):
if self.tree[v][i] == -1:
f = self.tree[v][-2]
if self.tree[f][i] == -1:
self.tree[v][i] = 0
else:
self.tree[v][i] = self.tree[f][i]
else:
c = self.tree[v][i]
f = self.tree[v][-2]
if self.tree[f][i] == c:
self.tree[c][-2] = 0
else:
self.tree[c][-2] = self.tree[f][i]
que.append(c)
def match(self, s):
res = [0] * len(s)
pos = 0
for i in range(len(s)):
c = ord(s[i]) - ord_a
res[i] = pos = self.tree[pos][c]
return res
s = str(input())
n = int(input())
t = [str(input()) for _ in range(n)]
ord_a = ord('a')
aho = Trie_with_Aho_Corasick(t)
ans = 0
m = [aho.tree[i][-1] for i in aho.match(s)]
l = -1
for i in range(len(s)):
if m[i] == -1:
continue
x = len(t[m[i]])
if l < i - x + 1:
l = i
ans += 1
print(ans)
from collections import deque
class Trie_with_Aho_Corasick():
def __init__(self, keywords, sigma = 26):
self.keywords = keywords
self.sigma = sigma
self.tree = [[-1] * (sigma + 2) for _ in range(sum(len(_str) for _str in keywords) + 1)]
self.depth = [0] * len(self.tree)
self.num = 1
### _build_trie ###
for i, word in enumerate(keywords):
self._register(i, word)
self.init_failure()
def _register(self, i, word):
pos = 0
for c in word:
c = ord(c) - ord_a
if self.tree[pos][c] == -1:
self.tree[pos][c] = self.num
self.depth[self.num] = self.depth[pos] + 1
self.num += 1
pos = self.tree[pos][c]
self.tree[pos][-1] = i
def init_failure(self):
self.tree[0][-2] = 0
que = deque([0])
while que:
v = que.popleft()
f = self.tree[v][-2]
if self.tree[f][-1] != -1:
self.tree[v][-1] = self.tree[f][-1]
for i in range(self.sigma):
if self.tree[v][i] == -1:
f = self.tree[v][-2]
if self.tree[f][i] == -1:
self.tree[v][i] = 0
else:
self.tree[v][i] = self.tree[f][i]
else:
c = self.tree[v][i]
f = self.tree[v][-2]
if self.tree[f][i] == c:
self.tree[c][-2] = 0
else:
self.tree[c][-2] = self.tree[f][i]
que.append(c)
def match(self, s):
res = [0] * len(s)
pos = 0
for i in range(len(s)):
c = ord(s[i]) - ord_a
res[i] = pos = self.tree[pos][c]
return res
s = str(input())
n = int(input())
t = [str(input()) for _ in range(n)]
ord_a = ord('a')
aho = Trie_with_Aho_Corasick(t)
ans = 0
m = [aho.tree[i][-1] for i in aho.match(s)]
l = -1
for i in range(len(s)):
if m[i] == -1:
continue
x = len(t[m[i]])
if l < i - x + 1:
l = i
ans += 1
print(ans)
| ConDefects/ConDefects/Code/abc268_h/Python/49241806 |
condefects-python_data_1444 | import bisect
import sys
readline=sys.stdin.readline
def Compress(lst):
decomp=sorted(list(set(lst)))
comp={x:i for i,x in enumerate(decomp)}
return comp,decomp
def SA_IS(lst,compressed=False):
N=len(lst)
if not compressed:
decomp=sorted(list(set(lst)))
comp={x:i for i,x in enumerate(decomp)}
lst=[comp[s]+1 for s in lst]+[0]
else:
lst=[s+1 for s in lst]+[0]
def induced_sort(N,lst,type,LMS,bucket_count,sorted_LMS_index=None):
buckets_left=[[] for b in range(bucket_count)]
buckets_right=[[] for b in range(bucket_count)]
if sorted_LMS_index==None:
for i in LMS:
buckets_right[lst[i]].append(i)
else:
for i in sorted_LMS_index[::-1]:
buckets_right[lst[LMS[i]]].append(LMS[i])
for b in range(bucket_count):
for i in buckets_left[b]:
if i and type[i-1]=="L":
buckets_left[lst[i-1]].append(i-1)
for i in buckets_right[b][::-1]:
if i and type[i-1]=="L":
buckets_left[lst[i-1]].append(i-1)
buckets_right[b]=[]
for b in range(bucket_count-1,-1,-1):
for i in buckets_right[b]:
if i and type[i-1]=="S":
buckets_right[lst[i-1]].append(i-1)
for i in buckets_left[b][::-1]:
if i and type[i-1]=="S":
buckets_right[lst[i-1]].append(i-1)
suffix_array=[N]
for b in range(1,bucket_count):
suffix_array+=buckets_left[b]+buckets_right[b][::-1]
return suffix_array
stack=[]
while N>=1:
type=[None]*(N+1)
type[N]="S"
for i in range(N-1,-1,-1):
if lst[i]<lst[i+1]:
type[i]="S"
elif lst[i]>lst[i+1]:
type[i]="L"
else:
type[i]=type[i+1]
LMS=[i for i in range(1,N) if type[i-1]=="L" and type[i]=="S"]+[N]
bucket_count=max(lst)+1
stack.append((N,lst,type,LMS,bucket_count))
suffix_array=induced_sort(N,lst,type,LMS,bucket_count)
LMS_substring=[None]*(N+1)
for i in range(len(LMS)-1):
LMS_substring[LMS[i]]=lst[LMS[i]:LMS[i+1]]
LMS_substring[N]=lst[N:N+1]
num=0
prev=[0]
for i in suffix_array:
if LMS_substring[i]!=None:
if prev!=LMS_substring[i]:
prev=LMS_substring[i]
num+=1
LMS_substring[i]=num
lst=[LMS_substring[i] for i in LMS]
N=len(lst)-1
sorted_LMS_index=[0]
for N,lst,type,LMS,bucket_count in stack[::-1]:
suffix_array=induced_sort(N,lst,type,LMS,bucket_count,sorted_LMS_index)
sorted_LMS_index=suffix_array
suffix_array=suffix_array[1:]
return suffix_array
def LCP(lst,suffix_array):
N=len(lst)
idx=[None]*N
for i in range(N):
idx[suffix_array[i]]=i
lcp=[None]*(N-1)
r=0
for l in range(N):
if idx[l]==N-1:
continue
ll=suffix_array[idx[l]+1]
while r<l or r<N and ll+r-l<N and lst[r]==lst[ll+r-l]:
r+=1
lcp[idx[l]]=r-l
return lcp
class Segment_Tree:
def __init__(self,N,f,e,lst=None,dynamic=False):
self.f=f
self.e=e
self.N=N
if dynamic:
self.segment_tree=defaultdict(lambda:self.e)
else:
if lst==None:
self.segment_tree=[self.e]*2*self.N
else:
assert len(lst)<=self.N
self.segment_tree=[self.e]*self.N+[x for x in lst]+[self.e]*(N-len(lst))
for i in range(self.N-1,0,-1):
self.segment_tree[i]=self.f(self.segment_tree[i<<1],self.segment_tree[i<<1|1])
def __getitem__(self,i):
if type(i)==int:
if -self.N<=i<0:
return self.segment_tree[i+self.N*2]
elif 0<=i<self.N:
return self.segment_tree[i+self.N]
else:
raise IndexError("list index out of range")
else:
a,b,c=i.start,i.stop,i.step
if a==None:
a=self.N
else:
a+=self.N
if b==None:
b=self.N*2
else:
b+=self.N
return self.segment_tree[slice(a,b,c)]
def __setitem__(self,i,x):
if -self.N<=i<0:
i+=self.N*2
elif 0<=i<self.N:
i+=self.N
else:
raise IndexError("list index out of range")
self.segment_tree[i]=x
while i>1:
i>>= 1
self.segment_tree[i]=self.f(self.segment_tree[i<<1],self.segment_tree[i<<1|1])
def Build(self,lst):
for i,x in enumerate(lst,self.N):
self.segment_tree[i]=x
for i in range(self.N-1,0,-1):
self.segment_tree[i]=self.f(self.segment_tree[i<<1],self.segment_tree[i<<1|1])
def Fold(self,L=None,R=None):
if L==None:
L=self.N
else:
L+=self.N
if R==None:
R=self.N*2
else:
R+=self.N
vL=self.e
vR=self.e
while L<R:
if L&1:
vL=self.f(vL,self.segment_tree[L])
L+=1
if R&1:
R-=1
vR=self.f(self.segment_tree[R],vR)
L>>=1
R>>=1
return self.f(vL,vR)
def Fold_Index(self,L=None,R=None):
if L==None:
L=self.N
else:
L+=self.N
if R==None:
R=self.N*2
else:
R+=self.N
if L==R:
return None
x=self.Fold(L-self.N,R-self.N)
while L<R:
if L&1:
if self.segment_tree[L]==x:
i=L
break
L+=1
if R&1:
R-=1
if self.segment_tree[R]==x:
i=R
break
L>>=1
R>>=1
while i<self.N:
if self.segment_tree[i]==self.segment_tree[i<<1]:
i<<=1
else:
i<<=1
i|=1
i-=self.N
return i
def Bisect_Right(self,L=None,f=None):
if L==self.N:
return self.N
if L==None:
L=0
L+=self.N
vl=self.e
vr=self.e
l,r=L,self.N*2
while l<r:
if l&1:
vl=self.f(vl,self.segment_tree[l])
l+=1
if r&1:
r-=1
vr=self.f(self.segment_tree[r],vr)
l>>=1
r>>=1
if f(self.f(vl,vr)):
return self.N
v=self.e
while True:
while L%2==0:
L>>=1
vv=self.f(v,self.segment_tree[L])
if f(vv):
v=vv
L+=1
else:
while L<self.N:
L<<=1
vv=self.f(v,self.segment_tree[L])
if f(vv):
v=vv
L+=1
return L-self.N
def Bisect_Left(self,R=None,f=None):
if R==0:
return 0
if R==None:
R=self.N
R+=self.N
vl=self.e
vr=self.e
l,r=self.N,R
while l<r:
if l&1:
vl=self.f(vl,self.segment_tree[l])
l+=1
if r&1:
r-=1
vr=self.f(self.segment_tree[r],vr)
l>>=1
r>>=1
if f(self.f(vl,vr)):
return 0
v=self.e
while True:
R-=1
while R>1 and R%2:
R>>=1
vv=self.f(self.segment_tree[R],v)
if f(vv):
v=vv
else:
while R<self.N:
R=2*R+1
vv=self.f(self.segment_tree[R],v)
if f(vv):
v=vv
R-=1
return R+1-self.N
def __str__(self):
return "["+", ".join(map(str,self.segment_tree[self.N:]))+"]"
def Multiple_String_Search(S,T,substring=False,minimize=False):
N=len(S)
M=len(T)
comp,decomp=Compress([s for s in S]+[t for m in range(M) for t in T[m]])
lst=[]
for s in S:
lst.append(comp[s]+1)
T_position=[None]*M
lst.append(len(comp)+1)
for m in range(M):
T_position[m]=len(lst)
for t in T[m]:
lst.append(comp[t]+1)
lst.append(0)
T_position_idx={T_position[m]:m for m in range(M)}
SA=SA_IS(lst,compressed=True)
SA_idx=[None]*len(SA)
for i in range(len(SA)):
SA_idx[SA[i]]=i
if minimize:
LA=LCP(lst,suffix_array=SA)
seen=[False]*len(lst)
retu=[None]*N
for m in sorted([m for m in range(M)],key=lambda m:len(T[m])):
i=SA_idx[T_position[m]]
lcp=len(lst)
while i+1<len(lst) and not seen[i+1]:
lcp=min(lcp,LA[i])
if lcp<len(T[m]):
break
i+=1
seen[i]=True
if SA[i]<N:
retu[SA[i]]=(len(T[m]),m)
else:
LA=Segment_Tree(len(lst)-1,min,len(lst),LCP(lst,suffix_array=SA))
S_SA_idx=[SA_idx[i] for i in range(N)]
T_SA_idx=[SA_idx[i] for i in T_position]
sorted_T_SA_idx=sorted(T_SA_idx)
retu=[(0,None)]*N
for i in range(N):
l=bisect.bisect_left(sorted_T_SA_idx,S_SA_idx[i])
if l:
ma=LA.Fold(sorted_T_SA_idx[l-1],S_SA_idx[i])
if substring:
if retu[i][0]<ma:
retu[i]=(ma,T_position_idx[SA[sorted_T_SA_idx[l-1]]])
else:
if len(T[T_position_idx[SA[sorted_T_SA_idx[l-1]]]])==ma:
if retu[i][0]<ma:
retu[i]=(ma,T_position_idx[SA[sorted_T_SA_idx[l-1]]])
r=bisect.bisect_right(sorted_T_SA_idx,S_SA_idx[i])
if r<len(sorted_T_SA_idx):
if substring:
ma=LA.Fold(S_SA_idx[i],sorted_T_SA_idx[r])
if retu[i][0]<ma:
retu[i]=(ma,T_position_idx[SA[sorted_T_SA_idx[l-1]]])
return retu
S=readline().rstrip()
le=len(S)
N=int(readline())
T=[readline().rstrip() for n in range(N)]
MSS=Multiple_String_Search(S,T,substring=True)
queue=[]
for l in range(le-1,-1,-1):
if MSS[l]!=None and (not queue or l+MSS[l][0]<=queue[-1]):
queue.append(l)
ans=len(queue)
print(ans)
import bisect
import sys
readline=sys.stdin.readline
def Compress(lst):
decomp=sorted(list(set(lst)))
comp={x:i for i,x in enumerate(decomp)}
return comp,decomp
def SA_IS(lst,compressed=False):
N=len(lst)
if not compressed:
decomp=sorted(list(set(lst)))
comp={x:i for i,x in enumerate(decomp)}
lst=[comp[s]+1 for s in lst]+[0]
else:
lst=[s+1 for s in lst]+[0]
def induced_sort(N,lst,type,LMS,bucket_count,sorted_LMS_index=None):
buckets_left=[[] for b in range(bucket_count)]
buckets_right=[[] for b in range(bucket_count)]
if sorted_LMS_index==None:
for i in LMS:
buckets_right[lst[i]].append(i)
else:
for i in sorted_LMS_index[::-1]:
buckets_right[lst[LMS[i]]].append(LMS[i])
for b in range(bucket_count):
for i in buckets_left[b]:
if i and type[i-1]=="L":
buckets_left[lst[i-1]].append(i-1)
for i in buckets_right[b][::-1]:
if i and type[i-1]=="L":
buckets_left[lst[i-1]].append(i-1)
buckets_right[b]=[]
for b in range(bucket_count-1,-1,-1):
for i in buckets_right[b]:
if i and type[i-1]=="S":
buckets_right[lst[i-1]].append(i-1)
for i in buckets_left[b][::-1]:
if i and type[i-1]=="S":
buckets_right[lst[i-1]].append(i-1)
suffix_array=[N]
for b in range(1,bucket_count):
suffix_array+=buckets_left[b]+buckets_right[b][::-1]
return suffix_array
stack=[]
while N>=1:
type=[None]*(N+1)
type[N]="S"
for i in range(N-1,-1,-1):
if lst[i]<lst[i+1]:
type[i]="S"
elif lst[i]>lst[i+1]:
type[i]="L"
else:
type[i]=type[i+1]
LMS=[i for i in range(1,N) if type[i-1]=="L" and type[i]=="S"]+[N]
bucket_count=max(lst)+1
stack.append((N,lst,type,LMS,bucket_count))
suffix_array=induced_sort(N,lst,type,LMS,bucket_count)
LMS_substring=[None]*(N+1)
for i in range(len(LMS)-1):
LMS_substring[LMS[i]]=lst[LMS[i]:LMS[i+1]]
LMS_substring[N]=lst[N:N+1]
num=0
prev=[0]
for i in suffix_array:
if LMS_substring[i]!=None:
if prev!=LMS_substring[i]:
prev=LMS_substring[i]
num+=1
LMS_substring[i]=num
lst=[LMS_substring[i] for i in LMS]
N=len(lst)-1
sorted_LMS_index=[0]
for N,lst,type,LMS,bucket_count in stack[::-1]:
suffix_array=induced_sort(N,lst,type,LMS,bucket_count,sorted_LMS_index)
sorted_LMS_index=suffix_array
suffix_array=suffix_array[1:]
return suffix_array
def LCP(lst,suffix_array):
N=len(lst)
idx=[None]*N
for i in range(N):
idx[suffix_array[i]]=i
lcp=[None]*(N-1)
r=0
for l in range(N):
if idx[l]==N-1:
continue
ll=suffix_array[idx[l]+1]
while r<l or r<N and ll+r-l<N and lst[r]==lst[ll+r-l]:
r+=1
lcp[idx[l]]=r-l
return lcp
class Segment_Tree:
def __init__(self,N,f,e,lst=None,dynamic=False):
self.f=f
self.e=e
self.N=N
if dynamic:
self.segment_tree=defaultdict(lambda:self.e)
else:
if lst==None:
self.segment_tree=[self.e]*2*self.N
else:
assert len(lst)<=self.N
self.segment_tree=[self.e]*self.N+[x for x in lst]+[self.e]*(N-len(lst))
for i in range(self.N-1,0,-1):
self.segment_tree[i]=self.f(self.segment_tree[i<<1],self.segment_tree[i<<1|1])
def __getitem__(self,i):
if type(i)==int:
if -self.N<=i<0:
return self.segment_tree[i+self.N*2]
elif 0<=i<self.N:
return self.segment_tree[i+self.N]
else:
raise IndexError("list index out of range")
else:
a,b,c=i.start,i.stop,i.step
if a==None:
a=self.N
else:
a+=self.N
if b==None:
b=self.N*2
else:
b+=self.N
return self.segment_tree[slice(a,b,c)]
def __setitem__(self,i,x):
if -self.N<=i<0:
i+=self.N*2
elif 0<=i<self.N:
i+=self.N
else:
raise IndexError("list index out of range")
self.segment_tree[i]=x
while i>1:
i>>= 1
self.segment_tree[i]=self.f(self.segment_tree[i<<1],self.segment_tree[i<<1|1])
def Build(self,lst):
for i,x in enumerate(lst,self.N):
self.segment_tree[i]=x
for i in range(self.N-1,0,-1):
self.segment_tree[i]=self.f(self.segment_tree[i<<1],self.segment_tree[i<<1|1])
def Fold(self,L=None,R=None):
if L==None:
L=self.N
else:
L+=self.N
if R==None:
R=self.N*2
else:
R+=self.N
vL=self.e
vR=self.e
while L<R:
if L&1:
vL=self.f(vL,self.segment_tree[L])
L+=1
if R&1:
R-=1
vR=self.f(self.segment_tree[R],vR)
L>>=1
R>>=1
return self.f(vL,vR)
def Fold_Index(self,L=None,R=None):
if L==None:
L=self.N
else:
L+=self.N
if R==None:
R=self.N*2
else:
R+=self.N
if L==R:
return None
x=self.Fold(L-self.N,R-self.N)
while L<R:
if L&1:
if self.segment_tree[L]==x:
i=L
break
L+=1
if R&1:
R-=1
if self.segment_tree[R]==x:
i=R
break
L>>=1
R>>=1
while i<self.N:
if self.segment_tree[i]==self.segment_tree[i<<1]:
i<<=1
else:
i<<=1
i|=1
i-=self.N
return i
def Bisect_Right(self,L=None,f=None):
if L==self.N:
return self.N
if L==None:
L=0
L+=self.N
vl=self.e
vr=self.e
l,r=L,self.N*2
while l<r:
if l&1:
vl=self.f(vl,self.segment_tree[l])
l+=1
if r&1:
r-=1
vr=self.f(self.segment_tree[r],vr)
l>>=1
r>>=1
if f(self.f(vl,vr)):
return self.N
v=self.e
while True:
while L%2==0:
L>>=1
vv=self.f(v,self.segment_tree[L])
if f(vv):
v=vv
L+=1
else:
while L<self.N:
L<<=1
vv=self.f(v,self.segment_tree[L])
if f(vv):
v=vv
L+=1
return L-self.N
def Bisect_Left(self,R=None,f=None):
if R==0:
return 0
if R==None:
R=self.N
R+=self.N
vl=self.e
vr=self.e
l,r=self.N,R
while l<r:
if l&1:
vl=self.f(vl,self.segment_tree[l])
l+=1
if r&1:
r-=1
vr=self.f(self.segment_tree[r],vr)
l>>=1
r>>=1
if f(self.f(vl,vr)):
return 0
v=self.e
while True:
R-=1
while R>1 and R%2:
R>>=1
vv=self.f(self.segment_tree[R],v)
if f(vv):
v=vv
else:
while R<self.N:
R=2*R+1
vv=self.f(self.segment_tree[R],v)
if f(vv):
v=vv
R-=1
return R+1-self.N
def __str__(self):
return "["+", ".join(map(str,self.segment_tree[self.N:]))+"]"
def Multiple_String_Search(S,T,substring=False,minimize=False):
N=len(S)
M=len(T)
comp,decomp=Compress([s for s in S]+[t for m in range(M) for t in T[m]])
lst=[]
for s in S:
lst.append(comp[s]+1)
T_position=[None]*M
lst.append(len(comp)+1)
for m in range(M):
T_position[m]=len(lst)
for t in T[m]:
lst.append(comp[t]+1)
lst.append(0)
T_position_idx={T_position[m]:m for m in range(M)}
SA=SA_IS(lst,compressed=True)
SA_idx=[None]*len(SA)
for i in range(len(SA)):
SA_idx[SA[i]]=i
if minimize:
LA=LCP(lst,suffix_array=SA)
seen=[False]*len(lst)
retu=[None]*N
for m in sorted([m for m in range(M)],key=lambda m:len(T[m])):
i=SA_idx[T_position[m]]
lcp=len(lst)
while i+1<len(lst) and not seen[i+1]:
lcp=min(lcp,LA[i])
if lcp<len(T[m]):
break
i+=1
seen[i]=True
if SA[i]<N:
retu[SA[i]]=(len(T[m]),m)
else:
LA=Segment_Tree(len(lst)-1,min,len(lst),LCP(lst,suffix_array=SA))
S_SA_idx=[SA_idx[i] for i in range(N)]
T_SA_idx=[SA_idx[i] for i in T_position]
sorted_T_SA_idx=sorted(T_SA_idx)
retu=[(0,None)]*N
for i in range(N):
l=bisect.bisect_left(sorted_T_SA_idx,S_SA_idx[i])
if l:
ma=LA.Fold(sorted_T_SA_idx[l-1],S_SA_idx[i])
if substring:
if retu[i][0]<ma:
retu[i]=(ma,T_position_idx[SA[sorted_T_SA_idx[l-1]]])
else:
if len(T[T_position_idx[SA[sorted_T_SA_idx[l-1]]]])==ma:
if retu[i][0]<ma:
retu[i]=(ma,T_position_idx[SA[sorted_T_SA_idx[l-1]]])
r=bisect.bisect_right(sorted_T_SA_idx,S_SA_idx[i])
if r<len(sorted_T_SA_idx):
if substring:
ma=LA.Fold(S_SA_idx[i],sorted_T_SA_idx[r])
if retu[i][0]<ma:
retu[i]=(ma,T_position_idx[SA[sorted_T_SA_idx[l-1]]])
return retu
S=readline().rstrip()
le=len(S)
N=int(readline())
T=[readline().rstrip() for n in range(N)]
MSS=Multiple_String_Search(S,T,minimize=True)
queue=[]
for l in range(le-1,-1,-1):
if MSS[l]!=None and (not queue or l+MSS[l][0]<=queue[-1]):
queue.append(l)
ans=len(queue)
print(ans) | ConDefects/ConDefects/Code/abc268_h/Python/44447952 |
condefects-python_data_1445 | # Accepted. From the official editorial.
K = int(input())
Sx, Sy = [int(x) for x in input().split()]
Tx, Ty = [int(x) for x in input().split()]
# Kずつ右上にずらしておく。
Sx += K
Sy += K
Tx += K
Ty += K
# 上界を入れておく。
dist = max(Tx, Sx) - min(Tx, Sx) + max(Ty, Sy) - min(Ty, Sy)
# 1 < Kのとき、大タイルを経由する移動を考える。
if 1 < K:
large_start = [] # はじめに到達する大タイルの候補。
if ((Sx // K) ^ (Sy // K)) & 1: # 開始位置が大タイルなら。
large_start.append((Sx // K, Sy // K, 0)) # その大タイル。
else: # そうでなければ、四方向いずれかで最も近い大タイルが候補。
large_start.append((Sx // K - 1, Sy // K, 1 + Sx % K)) # 左。
large_start.append((Sx // K + 1, Sy // K, K - Sx % K)) # 右。
large_start.append((Sx // K, Sy // K - 1, 1 + Sy % K)) # 下。
large_start.append((Sx // K, Sy // K + 1, K - Sy % K)) # 上。
large_goal = [] # 最後に到達する大タイルの候補。
if ((Tx // K) ^ (Ty // K)) & 1: # 終了位置が大タイルなら。
large_goal.append((Tx // K, Ty // K, 0)) # その大タイル。
else: # そうでなければ、四方向いずれかで最も近い大タイルが候補。
large_goal.append((Tx // K - 1, Ty // K, 1 + Tx % K)) # 左。
large_goal.append((Tx // K + 1, Ty // K, K - Tx % K)) # 右。
large_goal.append((Tx // K, Ty // K - 1, 1 + Ty % K)) # 下。
large_goal.append((Tx // K, Ty // K + 1, K - Ty % K)) # 上。
# K = 2かどうかで場合分け。
if K == 2:
for x, y, d1 in large_start:
for z, w, d2 in large_goal:
x_diff = max(x, z) - min(x, z)
y_diff = max(y, w) - min(y, w)
dist = min(dist, d1 + d2 + x_diff + y_diff + (max(x_diff, y_diff) - min(x_diff, y_diff)) / 2)
else:
for x, y, d1 in large_start:
for z, w, d2 in large_goal:
dist = min(dist, d1 + d2 + max(x + y, z + w) - min(x + y, z + w) + max(x + w, z + y) - min(x + w, z + y))
print(dist)
# Accepted. From the official editorial.
K = int(input())
Sx, Sy = [int(x) for x in input().split()]
Tx, Ty = [int(x) for x in input().split()]
# Kずつ右上にずらしておく。
Sx += K
Sy += K
Tx += K
Ty += K
# 上界を入れておく。
dist = max(Tx, Sx) - min(Tx, Sx) + max(Ty, Sy) - min(Ty, Sy)
# 1 < Kのとき、大タイルを経由する移動を考える。
if 1 < K:
large_start = [] # はじめに到達する大タイルの候補。
if ((Sx // K) ^ (Sy // K)) & 1: # 開始位置が大タイルなら。
large_start.append((Sx // K, Sy // K, 0)) # その大タイル。
else: # そうでなければ、四方向いずれかで最も近い大タイルが候補。
large_start.append((Sx // K - 1, Sy // K, 1 + Sx % K)) # 左。
large_start.append((Sx // K + 1, Sy // K, K - Sx % K)) # 右。
large_start.append((Sx // K, Sy // K - 1, 1 + Sy % K)) # 下。
large_start.append((Sx // K, Sy // K + 1, K - Sy % K)) # 上。
large_goal = [] # 最後に到達する大タイルの候補。
if ((Tx // K) ^ (Ty // K)) & 1: # 終了位置が大タイルなら。
large_goal.append((Tx // K, Ty // K, 0)) # その大タイル。
else: # そうでなければ、四方向いずれかで最も近い大タイルが候補。
large_goal.append((Tx // K - 1, Ty // K, 1 + Tx % K)) # 左。
large_goal.append((Tx // K + 1, Ty // K, K - Tx % K)) # 右。
large_goal.append((Tx // K, Ty // K - 1, 1 + Ty % K)) # 下。
large_goal.append((Tx // K, Ty // K + 1, K - Ty % K)) # 上。
# K = 2かどうかで場合分け。
if K == 2:
for x, y, d1 in large_start:
for z, w, d2 in large_goal:
x_diff = max(x, z) - min(x, z)
y_diff = max(y, w) - min(y, w)
dist = min(dist, d1 + d2 + x_diff + y_diff + (max(x_diff, y_diff) - min(x_diff, y_diff)) // 2)
else:
for x, y, d1 in large_start:
for z, w, d2 in large_goal:
dist = min(dist, d1 + d2 + max(x + y, z + w) - min(x + y, z + w) + max(x + w, z + y) - min(x + w, z + y))
print(dist) | ConDefects/ConDefects/Code/abc353_f/Python/54723688 |
condefects-python_data_1446 | K = int(input())
S = list(map(int, input().split()))
T = list(map(int, input().split()))
def dist_big(S, T):
global K
if K <= 2:
D = [abs(S[i] - T[i]) for i in range(2)]
ret = min(D) * 2
ret += (max(D) - min(D)) * (K + 1)
return ret
else:
return abs((S[0] + S[1]) - (T[0] + T[1])) + abs((S[0] - S[1]) - (T[0] - T[1]))
def dist(S, T):
global K
SB = [(s // K) for s in S]
TB = [(t // K) for t in T]
if SB == TB and sum(SB) % 2 == 1:
return 0
if sum(SB) % 2 == 0:
Sn = 4
Sout = [-(S[0]+1)%K + 1, S[0]%K + 1, -(S[1]+1)%K + 1, S[1]%K + 1]
SB = [list(SB) for _ in range(Sn)]
SB[0][0] += 1
SB[1][0] -= 1
SB[2][1] += 1
SB[3][1] -= 1
else:
SB = [SB]
Sout = [0]
Sn = 1
if sum(TB) % 2 == 0:
Tn = 4
Tout = [-(T[0]+1)%K + 1, T[0]%K + 1, -(T[1]+1)%K + 1, T[1]%K + 1]
TB = [list(TB) for _ in range(Tn)]
TB[0][0] += 1
TB[1][0] -= 1
TB[2][1] += 1
TB[3][1] -= 1
else:
TB = [TB]
Tout = [0]
Tn = 1
D = [[dist_big(SB[si], TB[ti]) + Sout[si] + Tout[ti] for si in range(Sn)] for ti in range(Tn)]
ret = min(min(D[ti]) for ti in range(Tn))
if ret > abs(S[0] - T[0]) + abs(S[1] - T[1]): ret = abs(S[0] - T[0]) + abs(S[1] - T[1])
return ret
print(dist(S, T))
K = int(input())
S = list(map(int, input().split()))
T = list(map(int, input().split()))
def dist_big(S, T):
global K
if K <= 2:
D = [abs(S[i] - T[i]) for i in range(2)]
ret = min(D) * 2
ret += (max(D) - min(D)) * (K + 1) // 2
return ret
else:
return abs((S[0] + S[1]) - (T[0] + T[1])) + abs((S[0] - S[1]) - (T[0] - T[1]))
def dist(S, T):
global K
SB = [(s // K) for s in S]
TB = [(t // K) for t in T]
if SB == TB and sum(SB) % 2 == 1:
return 0
if sum(SB) % 2 == 0:
Sn = 4
Sout = [-(S[0]+1)%K + 1, S[0]%K + 1, -(S[1]+1)%K + 1, S[1]%K + 1]
SB = [list(SB) for _ in range(Sn)]
SB[0][0] += 1
SB[1][0] -= 1
SB[2][1] += 1
SB[3][1] -= 1
else:
SB = [SB]
Sout = [0]
Sn = 1
if sum(TB) % 2 == 0:
Tn = 4
Tout = [-(T[0]+1)%K + 1, T[0]%K + 1, -(T[1]+1)%K + 1, T[1]%K + 1]
TB = [list(TB) for _ in range(Tn)]
TB[0][0] += 1
TB[1][0] -= 1
TB[2][1] += 1
TB[3][1] -= 1
else:
TB = [TB]
Tout = [0]
Tn = 1
D = [[dist_big(SB[si], TB[ti]) + Sout[si] + Tout[ti] for si in range(Sn)] for ti in range(Tn)]
ret = min(min(D[ti]) for ti in range(Tn))
if ret > abs(S[0] - T[0]) + abs(S[1] - T[1]): ret = abs(S[0] - T[0]) + abs(S[1] - T[1])
return ret
print(dist(S, T))
| ConDefects/ConDefects/Code/abc353_f/Python/53483883 |
condefects-python_data_1447 | import sys
# sys.setrecursionlimit(1000005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)
# md = 10**9+7
md = 998244353
def tobig(x,y):
i,j=x//k,y//k
x%=k
y%=k
if i&1==j&1:
res=[]
res.append((i-1,j,x+1))
res.append((i, j-1, y+1))
res.append((i+1,j,k-x))
res.append((i,j+1,k-y))
return res
return [(i,j,0)]
k=II()
sx,sy=LI()
tx,ty=LI()
ss=tobig(sx,sy)
tt=tobig(tx,ty)
ans=abs(sx-tx)+abs(sy-ty)
for a,b,d in ss:
for i,j,e in tt:
x,y=abs(a-i),abs(b-j)
if x>y:x,y=y,x
ans=min(ans,y*2+d+e)
ans=min(ans,x*2+(y-x)*(k+1)+d+e)
print(ans)
import sys
# sys.setrecursionlimit(1000005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)
# md = 10**9+7
md = 998244353
def tobig(x,y):
i,j=x//k,y//k
x%=k
y%=k
if i&1==j&1:
res=[]
res.append((i-1,j,x+1))
res.append((i, j-1, y+1))
res.append((i+1,j,k-x))
res.append((i,j+1,k-y))
return res
return [(i,j,0)]
k=II()
sx,sy=LI()
tx,ty=LI()
ss=tobig(sx,sy)
tt=tobig(tx,ty)
ans=abs(sx-tx)+abs(sy-ty)
for a,b,d in ss:
for i,j,e in tt:
x,y=abs(a-i),abs(b-j)
if x>y:x,y=y,x
ans=min(ans,y*2+d+e)
ans=min(ans,x*2+(y-x)//2*(k+1)+d+e)
print(ans)
| ConDefects/ConDefects/Code/abc353_f/Python/53517874 |
condefects-python_data_1448 | K=int(input())
S=list(map(int,input().split()))
T=list(map(int,input().split()))
S[0]+=2*K
S[1]+=2*K
T[0]+=2*K
T[1]+=2*K
distX = T[0] - S[0]
distY = T[1] - S[1]
bigM = max(distX,-distX) + max(distY,-distY)
if K == 1:
print(bigM)
exit()
if (S[0]//K + S[1]//K) %2 == 0:
tileS = "small"
else:
tileS = "large"
if (T[0]//K + T[1]//K) %2 == 0:
tileT = "small"
else:
tileT = "large"
lstS=[]
lstT=[]
if tileS == "large":
lstS.append([S,0])
else:
lstS.append([[S[0] - K,S[1]],S[0] - K* (S[0]//K) +1 ])
lstS.append([[S[0] + K,S[1]], K * (S[0]//K + 1) - S[0]])
lstS.append([[S[0],S[1] - K], S[1] - K* (S[1]//K) +1])
lstS.append([[S[0],S[1] + K], K*(S[1]//K+1) - S[1]])
if tileT == "large":
lstT.append([T,0])
else:
lstT.append([[T[0] - K,T[1]],T[0] - K* (T[0]//K) +1])
lstT.append([[T[0] + K,T[1]], K * (T[0]//K + 1) - T[0]])
lstT.append([[T[0],T[1] - K], T[1] - K* (T[1]//K) +1 ])
lstT.append([[T[0],T[1] + K], K*(T[1]//K+1) - T[1]])
res = bigM
#print(lstS,lstT)
for ss in lstS:
s,dist0 = ss
if dist0 < 0:
dist0 *= -1
blS = [ K * (s[0]//K), K * (s[1]//K)]
for tt in lstT:
t,dist1 = tt
if dist1 < 0:
dist1 *= -1
dist1
blT = [K*(t[0]//K),K*(t[1]//K)]
blockX = (blT[0] - blS[0]) // K
blockY = (blT[1] - blS[1]) // K
dist = 2 * max(blockX,blockY, -blockX, -blockY) + dist0 + dist1
if dist < res:
#print("#",dist0,dist1,blockX,blockY,blS,blT,s,t)
res = dist
if K == 2:
blockX = max(blockX,-blockX)
blockY = max(blockY,-blockY)
if blockX > blockY:
blockX,blockY = blockY, blockX
dist = 2 * blockX + 3 * (blockY - blockX) + dist0 + dist1
if dist < res:
res = dist
print(res)
K=int(input())
S=list(map(int,input().split()))
T=list(map(int,input().split()))
S[0]+=2*K
S[1]+=2*K
T[0]+=2*K
T[1]+=2*K
distX = T[0] - S[0]
distY = T[1] - S[1]
bigM = max(distX,-distX) + max(distY,-distY)
if K == 1:
print(bigM)
exit()
if (S[0]//K + S[1]//K) %2 == 0:
tileS = "small"
else:
tileS = "large"
if (T[0]//K + T[1]//K) %2 == 0:
tileT = "small"
else:
tileT = "large"
lstS=[]
lstT=[]
if tileS == "large":
lstS.append([S,0])
else:
lstS.append([[S[0] - K,S[1]],S[0] - K* (S[0]//K) +1 ])
lstS.append([[S[0] + K,S[1]], K * (S[0]//K + 1) - S[0]])
lstS.append([[S[0],S[1] - K], S[1] - K* (S[1]//K) +1])
lstS.append([[S[0],S[1] + K], K*(S[1]//K+1) - S[1]])
if tileT == "large":
lstT.append([T,0])
else:
lstT.append([[T[0] - K,T[1]],T[0] - K* (T[0]//K) +1])
lstT.append([[T[0] + K,T[1]], K * (T[0]//K + 1) - T[0]])
lstT.append([[T[0],T[1] - K], T[1] - K* (T[1]//K) +1 ])
lstT.append([[T[0],T[1] + K], K*(T[1]//K+1) - T[1]])
res = bigM
#print(lstS,lstT)
for ss in lstS:
s,dist0 = ss
if dist0 < 0:
dist0 *= -1
blS = [ K * (s[0]//K), K * (s[1]//K)]
for tt in lstT:
t,dist1 = tt
if dist1 < 0:
dist1 *= -1
dist1
blT = [K*(t[0]//K),K*(t[1]//K)]
blockX = (blT[0] - blS[0]) // K
blockY = (blT[1] - blS[1]) // K
dist = 2 * max(blockX,blockY, -blockX, -blockY) + dist0 + dist1
if dist < res:
#print("#",dist0,dist1,blockX,blockY,blS,blT,s,t)
res = dist
if K == 2:
blockX = max(blockX,-blockX)
blockY = max(blockY,-blockY)
if blockX > blockY:
blockX,blockY = blockY, blockX
dist = 2 * blockX + 3 * (blockY - blockX)//2 + dist0 + dist1
if dist < res:
res = dist
print(res)
| ConDefects/ConDefects/Code/abc353_f/Python/53505050 |
condefects-python_data_1449 | from sys import stdin, setrecursionlimit
from collections import deque, defaultdict, Counter
setrecursionlimit(10 ** 9 + 7)
input = stdin.readline
INF = 1 << 61
# DX = (0, 1, 0, -1)
# DY = (-1, 0, 1, 0)
# DX = (0, 1, 1, 1, 0, -1, -1, -1)
# DY = (-1, -1, 0, 1, 1, 1, 0, -1)
class P:
def __init__(self, x, y):
self.x = x
self.y = y
def to_big(p, k):
bp = P(p.x // k, p.y // k)
sp = P(p.x % k, p.y % k)
ret = []
if (bp.x + bp.y) % 2 == 0:
ret.append([P(bp.x, bp.y + 1), k - sp.y])
ret.append([P(bp.x, bp.y - 1), sp.y + 1])
ret.append([P(bp.x + 1, bp.y), k - sp.x])
ret.append([P(bp.x - 1, bp.y), sp.y + 1])
else:
ret.append([bp, 0])
return ret
def main():
k = int(input())
s = P(*map(int, input().split()))
t = P(*map(int, input().split()))
sl = to_big(s, k)
tl = to_big(t, k)
ans = abs(s.x - t.x) + abs(s.y - t.y)
if k == 1:
print(ans)
exit()
for si, ic in sl:
for tj, jc in tl:
d = P(abs(si.x - tj.x), abs(si.y - tj.y))
if d.x < d.y: d.x, d.y = d.y, d.x
dist = ic + jc
if k == 2:
dist += d.y * 2
dist += (d.x - d.y) * 3 // 2
else:
dist += d.x * 2
if ans > dist:
ans = dist
print(ans)
if __name__ == '__main__':
main()
from sys import stdin, setrecursionlimit
from collections import deque, defaultdict, Counter
setrecursionlimit(10 ** 9 + 7)
input = stdin.readline
INF = 1 << 61
# DX = (0, 1, 0, -1)
# DY = (-1, 0, 1, 0)
# DX = (0, 1, 1, 1, 0, -1, -1, -1)
# DY = (-1, -1, 0, 1, 1, 1, 0, -1)
class P:
def __init__(self, x, y):
self.x = x
self.y = y
def to_big(p, k):
bp = P(p.x // k, p.y // k)
sp = P(p.x % k, p.y % k)
ret = []
if (bp.x + bp.y) % 2 == 0:
ret.append([P(bp.x, bp.y + 1), k - sp.y])
ret.append([P(bp.x, bp.y - 1), sp.y + 1])
ret.append([P(bp.x + 1, bp.y), k - sp.x])
ret.append([P(bp.x - 1, bp.y), sp.x + 1])
else:
ret.append([bp, 0])
return ret
def main():
k = int(input())
s = P(*map(int, input().split()))
t = P(*map(int, input().split()))
sl = to_big(s, k)
tl = to_big(t, k)
ans = abs(s.x - t.x) + abs(s.y - t.y)
if k == 1:
print(ans)
exit()
for si, ic in sl:
for tj, jc in tl:
d = P(abs(si.x - tj.x), abs(si.y - tj.y))
if d.x < d.y: d.x, d.y = d.y, d.x
dist = ic + jc
if k == 2:
dist += d.y * 2
dist += (d.x - d.y) * 3 // 2
else:
dist += d.x * 2
if ans > dist:
ans = dist
print(ans)
if __name__ == '__main__':
main()
| ConDefects/ConDefects/Code/abc353_f/Python/53655550 |
condefects-python_data_1450 | import sys
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
INF = 2 ** 63 - 1
mod = 998244353
n = ii()
a = li()
a1 = a[:n]
a2 = a[n:]
p = min(a1)
t =[]
ind = -1
for i in range(n):
if a1[i] == p:
t.append((a1[i], a2[i]))
ind = i
if sorted(t)[0][1] <= p:
print(*sorted(t)[0])
else:
ans1 = []
ans2 = []
for v1, v2 in t:
ans1.append(v1)
ans2.append(v2)
p = []
for i in range(ind + 1, n):
if a1[i] < ans2[0]:
p.append((a1[i], i))
p.sort()
nowi = ind
for v, i in p:
if nowi < i:
ans1.append(a1[i])
ans2.append(a2[i])
ans = ans1 + ans2
ans1 = []
ans2 = []
for v1, v2 in t:
ans1.append(v1)
ans2.append(v2)
p = []
for i in range(ind + 1, n):
if a1[i] <= ans2[0]:
p.append((a1[i], i))
p.sort()
nowi = ind
for v, i in p:
if nowi < i:
ans1.append(a1[i])
ans2.append(a2[i])
ans = min(ans, ans1 + ans2)
print(*ans)
import sys
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
INF = 2 ** 63 - 1
mod = 998244353
n = ii()
a = li()
a1 = a[:n]
a2 = a[n:]
p = min(a1)
t =[]
ind = -1
for i in range(n):
if a1[i] == p:
t.append((a1[i], a2[i]))
ind = i
if sorted(t)[0][1] <= p:
print(*sorted(t)[0])
else:
ans1 = []
ans2 = []
for v1, v2 in t:
ans1.append(v1)
ans2.append(v2)
p = []
for i in range(ind + 1, n):
if a1[i] < ans2[0]:
p.append((a1[i], i))
p.sort()
nowi = ind
for v, i in p:
if nowi < i:
ans1.append(a1[i])
ans2.append(a2[i])
nowi = i
ans = ans1 + ans2
ans1 = []
ans2 = []
for v1, v2 in t:
ans1.append(v1)
ans2.append(v2)
p = []
for i in range(ind + 1, n):
if a1[i] <= ans2[0]:
p.append((a1[i], i))
p.sort()
nowi = ind
for v, i in p:
if nowi < i:
ans1.append(a1[i])
ans2.append(a2[i])
nowi = i
ans = min(ans, ans1 + ans2)
print(*ans)
| ConDefects/ConDefects/Code/arc134_d/Python/33208299 |
condefects-python_data_1451 | N = int(input())
A = list(map(int, input().split()))
mna1 = min(A[:N])
B = [(a, i) for i, a in enumerate(A[:N])]
B.sort()
x = 10**10
li = 0
for i in range(N):
if A[i] == mna1:
x = min(A[i+N], x)
li = i
if x < mna1:
print(mna1, x)
exit()
ans1 = []
ans2 = []
f = True
f2 = False
for i in range(li+1):
if A[i] == mna1:
ans1.append(A[i])
ans2.append(A[i+N])
if f and len(ans2) >= 2:
if ans2[-2] < ans2[-1]:
f2 = True
f = False
for b, i in B:
if i <= li or b > ans2[0]:
continue
elif b == ans2[0]:
if f2:
ans1.append(b)
ans2.append(A[i+N])
li = i
else:
ans1.append(b)
ans2.append(A[i+N])
li = i
print(*ans1, *ans2)
N = int(input())
A = list(map(int, input().split()))
mna1 = min(A[:N])
B = [(a, i) for i, a in enumerate(A[:N])]
B.sort()
x = 10**10
li = 0
for i in range(N):
if A[i] == mna1:
x = min(A[i+N], x)
li = i
if x < mna1:
print(mna1, x)
exit()
ans1 = []
ans2 = []
f = True
f2 = False
for i in range(li+1):
if A[i] == mna1:
ans1.append(A[i])
ans2.append(A[i+N])
if f and len(ans2) >= 2:
if ans2[-2] < ans2[-1]:
f2 = True
f = False
if ans2[-2] > ans2[-1]:
f = False
for b, i in B:
if i <= li or b > ans2[0]:
continue
elif b == ans2[0]:
if f2:
ans1.append(b)
ans2.append(A[i+N])
li = i
else:
ans1.append(b)
ans2.append(A[i+N])
li = i
print(*ans1, *ans2) | ConDefects/ConDefects/Code/arc134_d/Python/39521763 |
condefects-python_data_1452 | from collections import defaultdict
n = int(input())
a = list(map(int,input().split()))
mae = a[:n]
koho = defaultdict(list)
num = sorted(list(set(mae)))
for i in range(n):
koho[a[i]].append(i)
mn = float("inf")
for k in koho[num[0]]:
pair = a[k+n]
mn = min(pair, mn)
if mn <= num[0]:
print(num[0], pair)
exit()
import bisect
use = []
last = -1
border = float("inf")
for nn in num:
if nn < border:
for k in koho[nn]:
if k > last:
use.append(k)
last = k
if border == float("inf"):
border = a[koho[nn][0]+n]
flg = 0
for i in use[1:]:
if a[i+n] == border: continue
elif a[i+n] < border: break
else:
flg = 1
if flg == 1:
for nn in koho[border]:
if nn > last:
use.append(nn)
ansm = []
ansu = []
for i in use:
ansm.append(a[i])
ansu.append(a[i+n])
print(*(ansm+ansu))
from collections import defaultdict
n = int(input())
a = list(map(int,input().split()))
mae = a[:n]
koho = defaultdict(list)
num = sorted(list(set(mae)))
for i in range(n):
koho[a[i]].append(i)
mn = float("inf")
for k in koho[num[0]]:
pair = a[k+n]
mn = min(pair, mn)
if mn <= num[0]:
print(num[0], mn)
exit()
import bisect
use = []
last = -1
border = float("inf")
for nn in num:
if nn < border:
for k in koho[nn]:
if k > last:
use.append(k)
last = k
if border == float("inf"):
border = a[koho[nn][0]+n]
flg = 0
for i in use[1:]:
if a[i+n] == border: continue
elif a[i+n] < border: break
else:
flg = 1
if flg == 1:
for nn in koho[border]:
if nn > last:
use.append(nn)
ansm = []
ansu = []
for i in use:
ansm.append(a[i])
ansu.append(a[i+n])
print(*(ansm+ansu))
| ConDefects/ConDefects/Code/arc134_d/Python/36030496 |
condefects-python_data_1453 | import sys
input = sys.stdin.readline
def ii(): return int(input())
def fi(): return float(input())
def si(): return input().rstrip()
def mii(): return map(int, input().split())
def fii(): return map(float, input().split())
def mii1(): return map(lambda x: int(x)-1, input().split())
def lii(): return list(map(int, input().split()))
def lii1(): return list(map(lambda x: int(x)-1, input().split()))
def lfi(): return list(map(float, input().split()))
def lsi(): return list(input().rstrip())
def lmsi(): return list(map(str, input().split()))
def iir(n): return [int(input()) for _ in range(n)]
def fir(n): return [float(input()) for _ in range(n)]
def sir(n): return [input().rstrip() for _ in range(n)]
def liir(n): return [list(map(int, input().split())) for _ in range(n)]
def lii1r(n): return [list(map(lambda x: int(x)-1, input().split())) for _ in range(n)]
def lfir(n): return [list(map(float, input().split())) for _ in range(n)]
def lsir(n): return [list(input().rstrip()) for _ in range(n)]
def lii_alp(): return list(map(lambda x: ord(x)-97, input().rstrip()))
def lii_ALP(): return list(map(lambda x: ord(x)-65, input().rstrip()))
around_4 = [[-1,0],[0,1],[1,0],[0,-1]]
# module
from collections import defaultdict, deque, Counter
from bisect import bisect_left, bisect_right
from heapq import heapify, heappop, heappush
from math import ceil, floor
sys.setrecursionlimit(10**7)
# your code
N = ii()
A = lii()
d = defaultdict(list)
for i,v in enumerate(A[:N]):
d[v].append(i)
mind = min(d)
b = mind+1
ind = 0
for i in d[mind]:
if b > A[i+N]:
b = min(b, A[i+N])
ind = i
if b != mind+1:
print(A[ind], A[ind+N])
else:
now = d[mind][0]
ans = [now]
bottom = A[now+N]
ok = 0
for v in sorted(d.keys()):
for i in d[v]:
if ans[-1] < i:
if A[i] < bottom or (A[i] == bottom and ok == 1):
ans.append(i)
if ok == 0:
if A[ans[-1]+N] < A[i+N]:
ok = 1
elif A[ans[-1]+N] > A[i+N]:
ok = -1
for i in ans:
print(A[i],end = " ")
for i in ans:
print(A[i+N],end = " ")
import sys
input = sys.stdin.readline
def ii(): return int(input())
def fi(): return float(input())
def si(): return input().rstrip()
def mii(): return map(int, input().split())
def fii(): return map(float, input().split())
def mii1(): return map(lambda x: int(x)-1, input().split())
def lii(): return list(map(int, input().split()))
def lii1(): return list(map(lambda x: int(x)-1, input().split()))
def lfi(): return list(map(float, input().split()))
def lsi(): return list(input().rstrip())
def lmsi(): return list(map(str, input().split()))
def iir(n): return [int(input()) for _ in range(n)]
def fir(n): return [float(input()) for _ in range(n)]
def sir(n): return [input().rstrip() for _ in range(n)]
def liir(n): return [list(map(int, input().split())) for _ in range(n)]
def lii1r(n): return [list(map(lambda x: int(x)-1, input().split())) for _ in range(n)]
def lfir(n): return [list(map(float, input().split())) for _ in range(n)]
def lsir(n): return [list(input().rstrip()) for _ in range(n)]
def lii_alp(): return list(map(lambda x: ord(x)-97, input().rstrip()))
def lii_ALP(): return list(map(lambda x: ord(x)-65, input().rstrip()))
around_4 = [[-1,0],[0,1],[1,0],[0,-1]]
# module
from collections import defaultdict, deque, Counter
from bisect import bisect_left, bisect_right
from heapq import heapify, heappop, heappush
from math import ceil, floor
sys.setrecursionlimit(10**7)
# your code
N = ii()
A = lii()
d = defaultdict(list)
for i,v in enumerate(A[:N]):
d[v].append(i)
mind = min(d)
b = mind+1
ind = 0
for i in d[mind]:
if b > A[i+N]:
b = min(b, A[i+N])
ind = i
if b != mind+1:
print(A[ind], A[ind+N])
else:
now = d[mind][0]
ans = [now]
bottom = A[now+N]
ok = 0
for v in sorted(d.keys()):
for i in d[v]:
if ans[-1] < i:
if A[i] < bottom or (A[i] == bottom and ok == 1):
if ok == 0:
if A[ans[-1]+N] < A[i+N]:
ok = 1
elif A[ans[-1]+N] > A[i+N]:
ok = -1
ans.append(i)
for i in ans:
print(A[i],end = " ")
for i in ans:
print(A[i+N],end = " ") | ConDefects/ConDefects/Code/arc134_d/Python/32125806 |
condefects-python_data_1454 | import sys
from math import ceil, floor
from fractions import Fraction
from itertools import permutations
input = sys.stdin.readline
inf = 10**18
def read(dtype=int):
return list(map(dtype, input().split()))
r, = read(float)
x, = read()
# ceil
ans = (Fraction(r) - Fraction("1e-100")
).limit_denominator(x).as_integer_ratio()
print(*ans)
import sys
from math import ceil, floor
from fractions import Fraction
from itertools import permutations
input = sys.stdin.readline
inf = 10**18
def read(dtype=int):
return list(map(dtype, input().split()))
r, = read(str)
x, = read()
# ceil
ans = (Fraction(r) - Fraction("1e-100")
).limit_denominator(x).as_integer_ratio()
print(*ans)
| ConDefects/ConDefects/Code/abc333_g/Python/49970736 |
condefects-python_data_1455 | from math import gcd
def cfraction(a, b):
ans = [b//a]
while a != 1:
a,b=b%a,a
ans.append(b//a)
return ans
def fromfrac(frac):
num = frac[-1]
den = 1
for i in range(len(frac)-2, -1,-1):
num,den=den,num
num += den * frac[i]
return den,num
def closer(a,b, n1,d1, n2,d2):
na = abs(a*d1 - n1*b)
da = b*d1
nb = abs(a*d2 - n2*b)
db = b*d2
if na*db < nb * da:
return n1,d1
return n2,d2
r = input()
n = int(input())
p10 = len(r)-2
den = 1
while p10 != 0:
den *= 10
p10 -= 1
num=0
for i in range(2,len(r)):
num=(ord(r[i])-ord('0')) + num*10
d=gcd(num,den)
num //= d
den //= d
frac = cfraction(num,den)
orig_num = num
orig_den = den
best_num=-1
best_den=-1
for i in range(len(frac)):
cur = frac[0:i+1]
l = cur[-1]//2
r = cur[-1]
while r >= l:
cur[-1] = (l+r)//2
num,den = fromfrac(cur)
d = gcd(num,den)
num //= d
den //= d
if den <= n:
best_num,best_den=closer(orig_num,orig_den, best_num,best_den,num,den)
l = cur[-1]+1
else: r = cur[-1]-1
if best_num == -1:
if orig_num * 2 == orig_den:
best_num=0
best_den=1
elif n * orig_num > orig_den:
best_num=1
best_den=n
else:
best_num=0
best_den=1
if best_num * orig_den > orig_num * best_den:
snd_num = 2*orig_num*best_den-orig_den*best_num
snd_den=orig_den*best_den
d = gcd(snd_num,snd_den)
snd_num //= d
snd_den //= d
if snd_den <= n:
best_num,best_den=snd_num,snd_den
print(f"{best_num} {best_den}")
from math import gcd
def cfraction(a, b):
ans = [b//a]
while a != 1:
a,b=b%a,a
ans.append(b//a)
return ans
def fromfrac(frac):
num = frac[-1]
den = 1
for i in range(len(frac)-2, -1,-1):
num,den=den,num
num += den * frac[i]
return den,num
def closer(a,b, n1,d1, n2,d2):
na = abs(a*d1 - n1*b)
da = b*d1
nb = abs(a*d2 - n2*b)
db = b*d2
if na*db < nb * da:
return n1,d1
return n2,d2
r = input()
n = int(input())
p10 = len(r)-2
den = 1
while p10 != 0:
den *= 10
p10 -= 1
num=0
for i in range(2,len(r)):
num=(ord(r[i])-ord('0')) + num*10
d=gcd(num,den)
num //= d
den //= d
frac = cfraction(num,den)
orig_num = num
orig_den = den
best_num=-1
best_den=-1
for i in range(len(frac)):
cur = frac[0:i+1]
l = cur[-1]//2
r = cur[-1]
while r >= l:
cur[-1] = (l+r)//2
num,den = fromfrac(cur)
d = gcd(num,den)
num //= d
den //= d
if den <= n:
best_num,best_den=closer(orig_num,orig_den, best_num,best_den,num,den)
l = cur[-1]+1
else: r = cur[-1]-1
if best_num == -1:
if orig_num * 2 == orig_den:
best_num=0
best_den=1
elif n * orig_num > orig_den:
best_num=1
best_den=n
else:
best_num=0
best_den=1
best_num,best_den=closer(orig_num,orig_den, best_num,best_den,0,1)
best_num,best_den=closer(orig_num,orig_den, best_num,best_den,1,n)
if best_num * orig_den > orig_num * best_den:
snd_num = 2*orig_num*best_den-orig_den*best_num
snd_den=orig_den*best_den
d = gcd(snd_num,snd_den)
snd_num //= d
snd_den //= d
if snd_den <= n:
best_num,best_den=snd_num,snd_den
print(f"{best_num} {best_den}")
| ConDefects/ConDefects/Code/abc333_g/Python/50750395 |
condefects-python_data_1456 | def solve(n, l, r):
"""
2^i*jと2^i*(j+1)に辺を張ったグラフ問題として考える
BFSで頂点r+1から頂点lへの最短経路を割り出す
頂点が増える方向なら加算、減る方向なら減算として、最終的な解を求める
"""
ub = 1<<n
# 2^i*jと2^i*(j+1)に対して辺を張る
E = [[] for _ in range(ub+1)]
for i in range(n):
j = 0
while (2**i) * (j+1) <= ub:
x = (2**i) * j
y = (2**i) * (j+1)
E[x].append(y) # 足す処理
E[y].append(x) # 引く処理
j += 1
# BFSで頂点r+1から各頂点への最短経路を割り出す
parent = [None] * (ub+1)
parent[r+1] = -1
que = [r+1]
for v in que:
for u in E[v]:
if parent[u] is None:
parent[u] = v
que.append(u)
# 頂点lから頂点r+1への経路を求める
res = [] # (i, j, -1 | +1)
x = l
while parent[x] != -1:
y = parent[x]
sign = 1
if x > y:
sign = -1
x, y = y, x
i = (y - x).bit_length() - 1 # y - x == 2**i
j = x // (2**i)
res.append((i, j, sign))
if sign == 1:
x = y
return res
n, l, r = map(int, input().split())
ans = 0
for i, j, sign in solve(n, l, r):
print(f"? {i} {j}", flush=True)
t = int(input())
ans += t * sign
print(f"! {ans % 100}")
def solve(n, l, r):
"""
2^i*jと2^i*(j+1)に辺を張ったグラフ問題として考える
BFSで頂点r+1から頂点lへの最短経路を割り出す
頂点が増える方向なら加算、減る方向なら減算として、最終的な解を求める
"""
ub = 1<<n
# 2^i*jと2^i*(j+1)に対して辺を張る
E = [[] for _ in range(ub+1)]
for i in range(n+1):
j = 0
while (2**i) * (j+1) <= ub:
x = (2**i) * j
y = (2**i) * (j+1)
E[x].append(y) # 足す処理
E[y].append(x) # 引く処理
j += 1
# BFSで頂点r+1から各頂点への最短経路を割り出す
parent = [None] * (ub+1)
parent[r+1] = -1
que = [r+1]
for v in que:
for u in E[v]:
if parent[u] is None:
parent[u] = v
que.append(u)
# 頂点lから頂点r+1への経路を求める
res = [] # (i, j, -1 | +1)
x = l
while parent[x] != -1:
y = parent[x]
sign = 1
if x > y:
sign = -1
x, y = y, x
i = (y - x).bit_length() - 1 # y - x == 2**i
j = x // (2**i)
res.append((i, j, sign))
if sign == 1:
x = y
return res
n, l, r = map(int, input().split())
ans = 0
for i, j, sign in solve(n, l, r):
print(f"? {i} {j}", flush=True)
t = int(input())
ans += t * sign
print(f"! {ans % 100}")
| ConDefects/ConDefects/Code/abc355_e/Python/54238089 |
condefects-python_data_1457 | from sys import stdout
import sys
input = sys.stdin.readline
inf = 10**18
def read(dtype=int):
return list(map(dtype, input().split()))
n, l, r = read()
def cout(*args, **kwargs):
print(*args, **kwargs)
stdout.flush()
def ask(x, y):
cout("?", x, y)
return read()[0]
N = 1 << n
p = [-1] * (N+1)
d = [-1] * (N+1)
g = [[] for _ in range(N+1)]
p[l] = l
d[l] = 0
que = [l]
for u in range(N):
for j in range(n):
if u % (1 << j) == 0:
v = u + (1 << j)
if v <= N:
g[u].append(v)
g[v].append(u)
ans = 0
for u in que:
if u == r + 1:
while u != l:
v = p[u]
diff = abs(u-v)
k = diff.bit_length() - 1
x = ask(k, min(u, v) // diff)
if v < u:
ans += x
else:
ans -= x
u = v
break
for v in g[u]:
if d[v] == -1:
d[v] = d[u] + 1
p[v] = u
que.append(v)
cout("!", ans % 100)
from sys import stdout
import sys
input = sys.stdin.readline
inf = 10**18
def read(dtype=int):
return list(map(dtype, input().split()))
n, l, r = read()
def cout(*args, **kwargs):
print(*args, **kwargs)
stdout.flush()
def ask(x, y):
cout("?", x, y)
return read()[0]
N = 1 << n
p = [-1] * (N+1)
d = [-1] * (N+1)
g = [[] for _ in range(N+1)]
p[l] = l
d[l] = 0
que = [l]
for u in range(N):
for j in range(n+1):
if u % (1 << j) == 0:
v = u + (1 << j)
if v <= N:
g[u].append(v)
g[v].append(u)
ans = 0
for u in que:
if u == r + 1:
while u != l:
v = p[u]
diff = abs(u-v)
k = diff.bit_length() - 1
x = ask(k, min(u, v) // diff)
if v < u:
ans += x
else:
ans -= x
u = v
break
for v in g[u]:
if d[v] == -1:
d[v] = d[u] + 1
p[v] = u
que.append(v)
cout("!", ans % 100)
| ConDefects/ConDefects/Code/abc355_e/Python/54789032 |
condefects-python_data_1458 | import math
import re
import functools
import random
import sys
import os
import typing
from math import gcd, comb, sqrt,isqrt,lcm
from collections import Counter, defaultdict, deque
from functools import lru_cache, reduce
from itertools import accumulate, combinations, permutations
from heapq import nsmallest, nlargest, heappushpop, heapify, heappop, heappush
from io import BytesIO, IOBase
from copy import deepcopy
import threading
from typing import *
from bisect import bisect_left, bisect_right
from types import GeneratorType
# from sortedcontainers import SortedList
from operator import add
BUFSIZE = 8192
def I():
return input()
def II():
return int(input())
def MII():
return map(int, input().split())
def LI():
return list(input().split())
def LII():
return list(map(int, input().split()))
def GMI():
return map(lambda x: int(x) - 1, input().split())
def LGMI():
return list(map(lambda x: int(x) - 1, input().split()))
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# 1000000000000002493
mod = 998244353
inf = 10 ** 15
def solve():
sn,l,r=MII()
n=2**sn
r+=1
d=[-1]*(n+1)
d[l]=0
dist=[-1]*(n+1)
q=deque([l])
while d[r]==-1:
x=q.popleft()
if x==0:
my=sn+1
else:
my=x.bit_length()
for ny in range(my):
y=2**ny
if x + y <= n and d[x + y] == -1:
d[x + y] = d[x] + 1
dist[x + y] = x
q.append(x + y)
if x - y >= 0 and d[x - y] == -1:
d[x - y] = d[x] + 1
dist[x - y] = x
q.append(x - y)
A=[r]
pos=r
while pos!=l:
A.append(dist[pos])
pos=A[-1]
A.pop()
pos=l
ans=0
for p in A[::-1]:
if p>pos:
d=p-pos
print("?",d.bit_length()-1,pos//d,flush=True)
y=II()
ans=(ans+y)%100
else:
d=pos-p
print("?", d.bit_length() - 1, p//d, flush=True)
y = II()
ans = (ans - y) % 100
pos=p
print('!',ans,flush=True)
return
for _ in range(1):
solve()
import math
import re
import functools
import random
import sys
import os
import typing
from math import gcd, comb, sqrt,isqrt,lcm
from collections import Counter, defaultdict, deque
from functools import lru_cache, reduce
from itertools import accumulate, combinations, permutations
from heapq import nsmallest, nlargest, heappushpop, heapify, heappop, heappush
from io import BytesIO, IOBase
from copy import deepcopy
import threading
from typing import *
from bisect import bisect_left, bisect_right
from types import GeneratorType
# from sortedcontainers import SortedList
from operator import add
BUFSIZE = 8192
def I():
return input()
def II():
return int(input())
def MII():
return map(int, input().split())
def LI():
return list(input().split())
def LII():
return list(map(int, input().split()))
def GMI():
return map(lambda x: int(x) - 1, input().split())
def LGMI():
return list(map(lambda x: int(x) - 1, input().split()))
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# 1000000000000002493
mod = 998244353
inf = 10 ** 15
def solve():
sn,l,r=MII()
n=2**sn
r+=1
d=[-1]*(n+1)
d[l]=0
dist=[-1]*(n+1)
q=deque([l])
while d[r]==-1:
x=q.popleft()
if x==0:
my=sn+1
else:
my=(x&(-x)).bit_length()
for ny in range(my):
y=2**ny
if x + y <= n and d[x + y] == -1:
d[x + y] = d[x] + 1
dist[x + y] = x
q.append(x + y)
if x - y >= 0 and d[x - y] == -1:
d[x - y] = d[x] + 1
dist[x - y] = x
q.append(x - y)
A=[r]
pos=r
while pos!=l:
A.append(dist[pos])
pos=A[-1]
A.pop()
pos=l
ans=0
for p in A[::-1]:
if p>pos:
d=p-pos
print("?",d.bit_length()-1,pos//d,flush=True)
y=II()
ans=(ans+y)%100
else:
d=pos-p
print("?", d.bit_length() - 1, p//d, flush=True)
y = II()
ans = (ans - y) % 100
pos=p
print('!',ans,flush=True)
return
for _ in range(1):
solve() | ConDefects/ConDefects/Code/abc355_e/Python/54311444 |
condefects-python_data_1459 | from collections import defaultdict
import sys
#input = sys.stdin.readline
sys.setrecursionlimit(10**9)
INF = 10**9
N, L000, R000 = map(int, input().split())
R000 += 1
numss = [defaultdict(lambda: INF) for d in range(N+2)]
numss[0][(L000, R000)] = 0
prevss = [defaultdict(lambda: (-1, -1)) for d in range(N+2)]
for d in range(N+1):
nums = numss[d]
# print('\n##### d:', d, '/ nums:', nums)
for (L, R), num in nums.items():
L2s, R2s = [], []
if L >= R:
L2s.append((L, 0))
R2s.append((R, 0))
else:
if (L>>d)&1:
L2s.append((L + (1<<d), 1))
L2s.append((L - (1<<d), 1))
else:
L2s.append((L, 0))
if (R>>d)&1:
R2s.append((R + (1<<d), 1))
R2s.append((R - (1<<d), 1))
else:
R2s.append((R, 0))
for L2, kL in L2s:
for R2, kR in R2s:
num2 = num + kL + kR
# if L2 >= R2:
# L2, R2 = 0, 0
if num2 < numss[d+1][(L2, R2)]:
numss[d+1][(L2, R2)] = num2
prevss[d+1][(L2, R2)] = (L, R)
#print('# numss[N+1]:', numss[N+1])
minNum = INF
Lmin, Rmin = -1, -1
for (L, R), num in numss[N+1].items():
if num < minNum:
minNum = num
Lmin, Rmin = L, R
#print('# minNum:', minNum, '/ (Lmin, Rmin):', (Lmin, Rmin))
LRSs = []
L, R = Lmin, Rmin
for d in reversed(range(1, N+2)):
L0, R0 = prevss[d][(L, R)]
# print('# d:', d, '/ (L, R):', (L, R), '/ (L0, R0):', (L0, R0))
if L0 < L:
LRSs.append((L0, L, 1))
elif L0 > L:
LRSs.append((L, L0, -1))
if R0 < R:
LRSs.append((R0, R, -1))
elif R0 > R:
LRSs.append((R, R0, 1))
L, R = L0, R0
#print('# LRSs:', LRSs)
ans = 0
for L, R, S in LRSs:
# R += 1
d = abs(R-L)
i = d.bit_length() - 1
j = L//d
print('?', i, j)
T = int(input())
if T == -1:
sys.exit()
ans += T*S
ans %= 100
print('!', ans)
from collections import defaultdict
import sys
#input = sys.stdin.readline
sys.setrecursionlimit(10**9)
INF = 10**9
N, L000, R000 = map(int, input().split())
R000 += 1
numss = [defaultdict(lambda: INF) for d in range(N+2)]
numss[0][(L000, R000)] = 0
prevss = [defaultdict(lambda: (-1, -1)) for d in range(N+2)]
for d in range(N+1):
nums = numss[d]
# print('\n##### d:', d, '/ nums:', nums)
for (L, R), num in nums.items():
L2s, R2s = [], []
if L >= R:
L2s.append((L, 0))
R2s.append((R, 0))
else:
if (L>>d)&1:
L2s.append((L + (1<<d), 1))
L2s.append((L - (1<<d), 1))
else:
L2s.append((L, 0))
if (R>>d)&1:
R2s.append((R + (1<<d), 1))
R2s.append((R - (1<<d), 1))
else:
R2s.append((R, 0))
for L2, kL in L2s:
for R2, kR in R2s:
num2 = num + kL + kR
# if L2 >= R2:
# L2, R2 = 0, 0
if num2 < numss[d+1][(L2, R2)]:
numss[d+1][(L2, R2)] = num2
prevss[d+1][(L2, R2)] = (L, R)
#print('# numss[N+1]:', numss[N+1])
minNum = INF
Lmin, Rmin = -1, -1
for (L, R), num in numss[N+1].items():
if L == R and num < minNum:
minNum = num
Lmin, Rmin = L, R
#print('# minNum:', minNum, '/ (Lmin, Rmin):', (Lmin, Rmin))
LRSs = []
L, R = Lmin, Rmin
for d in reversed(range(1, N+2)):
L0, R0 = prevss[d][(L, R)]
# print('# d:', d, '/ (L, R):', (L, R), '/ (L0, R0):', (L0, R0))
if L0 < L:
LRSs.append((L0, L, 1))
elif L0 > L:
LRSs.append((L, L0, -1))
if R0 < R:
LRSs.append((R0, R, -1))
elif R0 > R:
LRSs.append((R, R0, 1))
L, R = L0, R0
#print('# LRSs:', LRSs)
ans = 0
for L, R, S in LRSs:
# R += 1
d = abs(R-L)
i = d.bit_length() - 1
j = L//d
print('?', i, j)
T = int(input())
if T == -1:
sys.exit()
ans += T*S
ans %= 100
print('!', ans)
| ConDefects/ConDefects/Code/abc355_e/Python/54431130 |
condefects-python_data_1460 | import sys
from collections import deque
INF = 1 << 19
N, L, R = map(int, sys.stdin.readline().rstrip().split())
R += 1
E = [[] for _ in range(2**N + 1)]
# 質問できる組み合わせに辺を張る
for i in range(N + 1):
for j in range(2**N):
if pow(2, i) * (j + 1) > 2**N:
break
l = pow(2, i) * j
r = pow(2, i) * (j + 1)
E[l].append(r)
E[r].append(l)
# print(E)
# L -> R の最短距離を調べる
D = [INF] * (2**N + 1)
q = deque()
D[L] = 0
q.append(L)
while q:
u = q.popleft()
for v in E[u]:
if D[v] <= D[u] + 1:
continue
D[v] = D[u] + 1
q.append(v)
# print(D)
# L -> R の経路を復元する
P = [R]
u = R
for d in range(D[R] - 1, -1, -1):
for v in E[u]:
if D[v] == d:
P.append(v)
u = v
break
P.reverse()
# print(P)
def question(L, R):
i, j = 0, 0
for k in range(N + 1):
b = pow(2, k)
if (R + 1) // b - L // b == 1:
i = k
j = L // b
break
print(f"? {i} {j}", flush=True)
return int(sys.stdin.readline().rstrip())
ans = 0
for s in range(len(P) - 1):
L = P[s]
R = P[s + 1]
coef = 1
if L > R:
L, R = R, L
coef = -1
ans += question(L, R) * coef
print(f"! {ans % 100}", flush=True)
import sys
from collections import deque
INF = 1 << 19
N, L, R = map(int, sys.stdin.readline().rstrip().split())
R += 1
E = [[] for _ in range(2**N + 1)]
# 質問できる組み合わせに辺を張る
for i in range(N + 1):
for j in range(2**N):
if pow(2, i) * (j + 1) > 2**N:
break
l = pow(2, i) * j
r = pow(2, i) * (j + 1)
E[l].append(r)
E[r].append(l)
# print(E)
# L -> R の最短距離を調べる
D = [INF] * (2**N + 1)
q = deque()
D[L] = 0
q.append(L)
while q:
u = q.popleft()
for v in E[u]:
if D[v] <= D[u] + 1:
continue
D[v] = D[u] + 1
q.append(v)
# print(D)
# L -> R の経路を復元する
P = [R]
u = R
for d in range(D[R] - 1, -1, -1):
for v in E[u]:
if D[v] == d:
P.append(v)
u = v
break
P.reverse()
# print(P)
def question(L, R):
i, j = 0, 0
for k in range(N + 1):
b = pow(2, k)
if (R + 1) // b - L // b == 1:
i = k
j = L // b
break
print(f"? {i} {j}", flush=True)
# print(f"? {pow(2,i)*j} {pow(2,i)*(j+1)-1}", flush=True)
return int(sys.stdin.readline().rstrip())
ans = 0
for s in range(len(P) - 1):
L = P[s]
R = P[s + 1]
coef = 1
if L > R:
L, R = R, L
coef = -1
R -= 1
ans += question(L, R) * coef
print(f"! {ans % 100}", flush=True)
| ConDefects/ConDefects/Code/abc355_e/Python/54059945 |
condefects-python_data_1461 | def calc(d: int) -> int:
if d == 0:
return 1
arr = [2, 4, 8, 6]
return arr[d % 4 - 1]
t = int(input())
ans = []
for _ in range(t):
n, m, k = map(int, input().split())
if n < k:
ans.append(calc(n))
else:
d1 = (n - k) % (m - k)
ans.append(calc(d1 + k))
for ansi in ans:
print(ansi)
def calc(d: int) -> int:
if d == 0:
return 1
arr = [2, 4, 8, 6]
return arr[d % 4 - 1]
t = int(input())
ans = []
for _ in range(t):
n, m, k = map(int, input().split())
if n < k:
ans.append(calc(n))
elif m - k == 1:
ans.append(0)
else:
d1 = (n - k) % (m - k)
ans.append(calc(d1 + k))
for ansi in ans:
print(ansi)
| ConDefects/ConDefects/Code/arc176_b/Python/54752998 |
condefects-python_data_1462 | import sys
readline = sys.stdin.readline
def calc(N, M, K):
if K > N:
return pow(2, N, 10)
if K == N:
if M == K+1:
return 0
else:
return pow(2, N, 10)
if K > 0:
a = calc(N-K, M-K, 0)
return a*pow(2, K, 10)%10
# K == 0
if N < M:
return pow(2, N, 10)
if N == M:
return 1
# N > M
return calc(M-(-N%M), M, 0)
T = int(readline())
ans = [None]*T
for qu in range(T):
N, M, K = map(int, readline().split())
ans[qu] = calc(N, M, K)
print('\n'.join(map(str, ans)))
import sys
readline = sys.stdin.readline
def calc(N, M, K):
if K > N:
return pow(2, N, 10)
if K == N:
if M == K+1:
return 0
else:
return pow(2, N, 10)
if K > 0:
a = calc(N-K, M-K, 0)
return a*pow(2, K, 10)%10
# K == 0
if N < M:
return pow(2, N, 10)
if N == M:
if N == 1:
return 0
return 1
# N > M
return calc(M-(-N%M), M, 0)
T = int(readline())
ans = [None]*T
for qu in range(T):
N, M, K = map(int, readline().split())
ans[qu] = calc(N, M, K)
print('\n'.join(map(str, ans))) | ConDefects/ConDefects/Code/arc176_b/Python/53411571 |
condefects-python_data_1463 | mods = {0: 6, 1: 2, 2: 4, 3: 8}
t = int(input())
for i in range(t):
n, m, k = map(int, input().split())
if n < k:
ans = mods[n % 4]
else:
ans = mods[(k + (n - k) % (m - k)) % 4]
print(ans)
mods = {0: 6, 1: 2, 2: 4, 3: 8}
t = int(input())
for i in range(t):
n, m, k = map(int, input().split())
if n < k:
ans = mods[n % 4]
elif m - k == 1:
ans = 0
else:
ans = mods[(k + (n - k) % (m - k)) % 4]
print(ans) | ConDefects/ConDefects/Code/arc176_b/Python/53249661 |
condefects-python_data_1464 | import sys
input = lambda: sys.stdin.readline().strip()
for _ in range(int(input())):
n, m, k = map(int, input().split())
if m == k + 1:
print(0)
elif n < m:
print((6, 2, 4, 8)[n % 4])
else:
print(((6, 2, 4, 8)[(n - k) % (m - k) % 4] if (n - k) % (m - k) else 1) * (6, 2, 4, 8)[k % 4] % 10)
import sys
input = lambda: sys.stdin.readline().strip()
for _ in range(int(input())):
n, m, k = map(int, input().split())
if m == k + 1:
print((6, 2, 4, 8)[n % 4] if n < k else 0)
elif n < m:
print((6, 2, 4, 8)[n % 4])
else:
print(((6, 2, 4, 8)[(n - k) % (m - k) % 4] if (n - k) % (m - k) else 1) * (6, 2, 4, 8)[k % 4] % 10)
| ConDefects/ConDefects/Code/arc176_b/Python/53269328 |
condefects-python_data_1465 | n=int(input())
for _ in range(n):
n, m,k = map(int, input().split())
if n==m-1==k:
print(0)
continue
if n >= m:
sa=n-m
num=sa//(m-k)+1
n=n-num*(m-k)
print(pow(2,n,10))
n=int(input())
for _ in range(n):
n, m,k = map(int, input().split())
if m-1==k and n>=m-1:
print(0)
continue
if n >= m:
sa=n-m
num=sa//(m-k)+1
n=n-num*(m-k)
print(pow(2,n,10)) | ConDefects/ConDefects/Code/arc176_b/Python/53761488 |
condefects-python_data_1466 | # based on https://atcoder.jp/contests/arc176/submissions/53409900
T = int(input())
table = [2,4,8,6]
def solve(N, M, K):
if M-K == 1:
return 0 if N >= K-1 else pow(2, N, 10)
if N >= M:
# N<MになるまでNからM-Kを引く操作を高速に行う。
# NからN-Mより大きいM-Kの倍数で引く
N -= ((N-M+M-K)//(M-K))*(M-K)
return table[(N+3)%4]
for i in range(T):
N, M, K = map(int, input().split())
print(solve(N, M, K))
# based on https://atcoder.jp/contests/arc176/submissions/53409900
T = int(input())
table = [2,4,8,6]
def solve(N, M, K):
if M-K == 1:
return 0 if N >= K else table[(N+3)%4] # 多分ここがafter_contestに引っかかってる
if N >= M:
# N<MになるまでNからM-Kを引く操作を高速に行う。
# NからN-Mより大きいM-Kの倍数で引く
N -= ((N-M+M-K)//(M-K))*(M-K)
return table[(N+3)%4]
for i in range(T):
N, M, K = map(int, input().split())
print(solve(N, M, K)) | ConDefects/ConDefects/Code/arc176_b/Python/53698323 |
condefects-python_data_1467 | from scipy.spatial import KDTree
N, K = map(int, input().split())
points = []
for _ in range(N):
x, y = map(int, input().split())
points.append((x, y))
if K <= 1000:
ans = []
for i in range(N):
for j in range(N):
if i < j and (points[i][0]-points[j][0])**2 + (points[i][1]-points[j][1])**2 <= K**2:
ans.append((i, j))
print(len(ans))
for (i, j) in ans:
print(i+1, j+1)
else:
kd_tree = KDTree(points)
ans = sorted(kd_tree.query_pairs(r=K))
print(len(ans))
for (i, j) in ans:
print(i+1, j+1)
from scipy.spatial import KDTree
N, K = map(int, input().split())
points = []
for _ in range(N):
x, y = map(int, input().split())
points.append((x, y))
if N <= 5000:
ans = []
for i in range(N):
for j in range(N):
if i < j and (points[i][0]-points[j][0])**2 + (points[i][1]-points[j][1])**2 <= K**2:
ans.append((i, j))
print(len(ans))
for (i, j) in ans:
print(i+1, j+1)
else:
kd_tree = KDTree(points)
ans = sorted(kd_tree.query_pairs(r=K))
print(len(ans))
for (i, j) in ans:
print(i+1, j+1) | ConDefects/ConDefects/Code/abc234_h/Python/49361492 |
condefects-python_data_1468 | n=int(input())
a=list(map(int,input().split()))
from collections import Counter
c=list(Counter(a).items())
l=[]
for num,cnt in c:
l.append(num*cnt)
from itertools import accumulate
l=list(accumulate(l))
a_set=sorted(set(a))
d=dict(zip(a_set,l))
total=sum(a)
ans=[]
for i in range(n):
ans.append(total-d[a[i]])
print(*ans)
n=int(input())
a=list(map(int,input().split()))
from collections import Counter
c=sorted(Counter(a).items())
l=[]
for num,cnt in c:
l.append(num*cnt)
from itertools import accumulate
l=list(accumulate(l))
a_set=sorted(set(a))
d=dict(zip(a_set,l))
total=sum(a)
ans=[]
for i in range(n):
ans.append(total-d[a[i]])
print(*ans) | ConDefects/ConDefects/Code/abc331_c/Python/54472770 |
condefects-python_data_1469 | # ||￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣||
# 早速解いていくよ
#
# || ＼ (ﾟーﾟ*) ｷﾎﾝ。
# ||＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿ ⊂⊂ |
# ∧ ∧ ∧ ∧ ∧ ∧ |￣￣￣￣|
# ( ∧ ∧ ( ∧ ∧ ( ∧ ∧ | |
# ～（＿( ∧ ∧ __( ∧ ∧__( ∧ ∧￣￣￣
# ～（＿( ∧ ∧＿( ∧ ∧＿( ∧ ∧ は～い、先生。
# ～（＿( ,,)～（＿( ,,)～（＿( ,,)
# ～（＿__ﾉ ～（＿__ﾉ ～（＿__ﾉ
# -*- coding: utf-8 -*-
#
import sys
def input():
return sys.stdin.readline().rstrip()
MOD=998244353
H,W,K=map(int,input().split())
dp=[[0,0,0,0]]
x1,y1,x2,y2=map(int,input().split())
if x1!=x2:
if y1!=y2:
dp[0][0]=1
else:
dp[0][1]=1
else:
if y1!=y2:
dp[0][2]=1
else:
dp[0][3]=1
for k in range(K):
bucket=[0,0,0,0]
bucket[0]+=(H-2+W-2)*dp[-1][0]+(H-1)*dp[-1][1]+(W-1)*dp[-1][2]+0
bucket[1]+=dp[-1][0]+(W-2)*dp[-1][1]+(W-1)*dp[-1][3]
bucket[2]+=dp[-1][0]+0+(H-2)*dp[-1][2]+(H-1)*dp[-1][3]
bucket[3]+=0+dp[-1][1]+dp[-1][2]+0
dp.append([b%MOD for b in bucket])
print(dp[-1][-1])
# ||￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣||
# 早速解いていくよ
#
# || ＼ (ﾟーﾟ*) ｷﾎﾝ。
# ||＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿ ⊂⊂ |
# ∧ ∧ ∧ ∧ ∧ ∧ |￣￣￣￣|
# ( ∧ ∧ ( ∧ ∧ ( ∧ ∧ | |
# ～（＿( ∧ ∧ __( ∧ ∧__( ∧ ∧￣￣￣
# ～（＿( ∧ ∧＿( ∧ ∧＿( ∧ ∧ は～い、先生。
# ～（＿( ,,)～（＿( ,,)～（＿( ,,)
# ～（＿__ﾉ ～（＿__ﾉ ～（＿__ﾉ
# -*- coding: utf-8 -*-
#
import sys
def input():
return sys.stdin.readline().rstrip()
MOD=998244353
W,H,K=map(int,input().split())
dp=[[0,0,0,0]]
x1,y1,x2,y2=map(int,input().split())
if x1!=x2:
if y1!=y2:
dp[0][0]=1
else:
dp[0][1]=1
else:
if y1!=y2:
dp[0][2]=1
else:
dp[0][3]=1
for k in range(K):
bucket=[0,0,0,0]
bucket[0]+=(H-2+W-2)*dp[-1][0]+(H-1)*dp[-1][1]+(W-1)*dp[-1][2]+0
bucket[1]+=dp[-1][0]+(W-2)*dp[-1][1]+(W-1)*dp[-1][3]
bucket[2]+=dp[-1][0]+0+(H-2)*dp[-1][2]+(H-1)*dp[-1][3]
bucket[3]+=0+dp[-1][1]+dp[-1][2]+0
dp.append([b%MOD for b in bucket])
print(dp[-1][-1])
| ConDefects/ConDefects/Code/abc232_e/Python/45459245 |
condefects-python_data_1470 | H,W,K=map(int, input().split())
x1,y1,x2,y2=map(int, input().split())
dp = [[0]*4 for i in range(K+1)]
mod=998244353
if x1==x2 and y1==y2:
dp[0][3]=1
elif x1==x2:
dp[0][1]=1
elif y1==y2:
dp[0][2]=1
else:
dp[0][0]=1
for i in range(K):
dp[i+1][0]+=dp[i][1]*(W-1)%mod
dp[i+1][0]%=mod
dp[i+1][0]+=dp[i][2]*(H-1)%mod
dp[i+1][0]%=mod
dp[i+1][0]+=dp[i][0]*(H+W-4)%mod
dp[i+1][0]%=mod
dp[i+1][1]+=dp[i][3]*(H-1)%mod
dp[i+1][1]%=mod
dp[i+1][1]+=dp[i][0]%mod
dp[i+1][1]%=mod
dp[i+1][1]+=dp[i][1]*(H-2)%mod
dp[i+1][1]%=mod
dp[i+1][2]+=dp[i][3]*(W-1)%mod
dp[i+1][2]%=mod
dp[i+1][2]+=dp[i][0]%mod
dp[i+1][2]%=mod
dp[i+1][2]+=dp[i][2]*(W-2)%mod
dp[i+1][2]%=mod
dp[i+1][3]+=dp[i][1]%mod
dp[i+1][3]%=mod
dp[i+1][3]+=dp[i][2]%mod
dp[i+1][3]%=mod
print(dp[-1][-1]%mod)
H,W,K=map(int, input().split())
y1,x1,y2,x2=map(int, input().split())
dp = [[0]*4 for i in range(K+1)]
mod=998244353
if x1==x2 and y1==y2:
dp[0][3]=1
elif x1==x2:
dp[0][1]=1
elif y1==y2:
dp[0][2]=1
else:
dp[0][0]=1
for i in range(K):
dp[i+1][0]+=dp[i][1]*(W-1)%mod
dp[i+1][0]%=mod
dp[i+1][0]+=dp[i][2]*(H-1)%mod
dp[i+1][0]%=mod
dp[i+1][0]+=dp[i][0]*(H+W-4)%mod
dp[i+1][0]%=mod
dp[i+1][1]+=dp[i][3]*(H-1)%mod
dp[i+1][1]%=mod
dp[i+1][1]+=dp[i][0]%mod
dp[i+1][1]%=mod
dp[i+1][1]+=dp[i][1]*(H-2)%mod
dp[i+1][1]%=mod
dp[i+1][2]+=dp[i][3]*(W-1)%mod
dp[i+1][2]%=mod
dp[i+1][2]+=dp[i][0]%mod
dp[i+1][2]%=mod
dp[i+1][2]+=dp[i][2]*(W-2)%mod
dp[i+1][2]%=mod
dp[i+1][3]+=dp[i][1]%mod
dp[i+1][3]%=mod
dp[i+1][3]+=dp[i][2]%mod
dp[i+1][3]%=mod
print(dp[-1][-1]%mod) | ConDefects/ConDefects/Code/abc232_e/Python/44929490 |
condefects-python_data_1471 | import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import gcd,log,sqrt
from atcoder.modint import ModContext, Modint
from atcoder.dsu import DSU
ModContext(1).context.append(998244353)
sys.setrecursionlimit(1000000)
input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())
MOD = 998244353
H, W, K = mi()
x1, y1, x2, y2 = mi()
dp = [[0] * 4 for i in range(K + 1)]
def cal(x, y):
if x == x2:
if y == y2:
return 3
else:
return 1
else:
if y == y2:
return 2
else:
return 0
dp[0][cal(x1, x2)] = 1
for i in range(K):
for j in range(4):
if j==0:
dp[i + 1][0] += (W - 2 + H - 2) * dp[i][j] % MOD
dp[i + 1][1] += dp[i][j] % MOD
dp[i + 1][2] += dp[i][j] % MOD
elif j == 1:
dp[i + 1][0] += (H - 1) * dp[i][j] % MOD
dp[i + 1][j] += (W - 2) * dp[i][j] % MOD
dp[i + 1][3] += dp[i][j] % MOD
elif j == 2:
dp[i + 1][0] += (W - 1) * dp[i][j] % MOD
dp[i + 1][j] += (H - 2) * dp[i][j] % MOD
dp[i + 1][3] += dp[i][j] % MOD
else:
dp[i + 1][1] += (W-1) * dp[i][j] % MOD
dp[i + 1][2] += (H-1) * dp[i][j] % MOD
print(dp[K][3] % MOD)
import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import gcd,log,sqrt
from atcoder.modint import ModContext, Modint
from atcoder.dsu import DSU
ModContext(1).context.append(998244353)
sys.setrecursionlimit(1000000)
input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())
MOD = 998244353
H, W, K = mi()
x1, y1, x2, y2 = mi()
dp = [[0] * 4 for i in range(K + 1)]
def cal(x, y):
if x == x2:
if y == y2:
return 3
else:
return 1
else:
if y == y2:
return 2
else:
return 0
dp[0][cal(x1, y1)] = 1
for i in range(K):
for j in range(4):
if j==0:
dp[i + 1][0] += (W - 2 + H - 2) * dp[i][j] % MOD
dp[i + 1][1] += dp[i][j] % MOD
dp[i + 1][2] += dp[i][j] % MOD
elif j == 1:
dp[i + 1][0] += (H - 1) * dp[i][j] % MOD
dp[i + 1][j] += (W - 2) * dp[i][j] % MOD
dp[i + 1][3] += dp[i][j] % MOD
elif j == 2:
dp[i + 1][0] += (W - 1) * dp[i][j] % MOD
dp[i + 1][j] += (H - 2) * dp[i][j] % MOD
dp[i + 1][3] += dp[i][j] % MOD
else:
dp[i + 1][1] += (W-1) * dp[i][j] % MOD
dp[i + 1][2] += (H-1) * dp[i][j] % MOD
print(dp[K][3] % MOD) | ConDefects/ConDefects/Code/abc232_e/Python/45574605 |
condefects-python_data_1472 | h,w,k = map(int, input().split())
x1,y1,x2,y2 = map(int, input().split())
MOD = 998244353
dp = [0 for _ in range(4)]
dp[0] = 1
for _ in range(1):
dp = [
dp[1]*(w-1) + dp[2]*(h-1),
dp[1]*(w-2) + dp[0] + dp[3]*(h-1),
dp[2]*(h-2) + dp[0] + dp[3]*(w-1),
dp[1] + dp[2] + dp[3]*(h+w-4),
]
dp = [x%MOD for x in dp]
if x1==x2 and y1==y2:
ans = dp[0]
elif y1==y2:
ans = dp[2]
elif x1==x2:
ans = dp[1]
else:
ans = dp[3]
print(ans)
h,w,k = map(int, input().split())
x1,y1,x2,y2 = map(int, input().split())
MOD = 998244353
dp = [0 for _ in range(4)]
dp[0] = 1
for _ in range(k):
dp = [
dp[1]*(w-1) + dp[2]*(h-1),
dp[1]*(w-2) + dp[0] + dp[3]*(h-1),
dp[2]*(h-2) + dp[0] + dp[3]*(w-1),
dp[1] + dp[2] + dp[3]*(h+w-4),
]
dp = [x%MOD for x in dp]
if x1==x2 and y1==y2:
ans = dp[0]
elif y1==y2:
ans = dp[2]
elif x1==x2:
ans = dp[1]
else:
ans = dp[3]
print(ans) | ConDefects/ConDefects/Code/abc232_e/Python/46187377 |
condefects-python_data_1473 | n, m = map(int, input().split())
aaa = list(map(int, input().split()))
MOD = 998244353
pos = [-1] * n
for i, a in enumerate(aaa):
pos[a] = i
min_aaa = min(aaa)
leftmost = [0] * n
rightmost = [0] * n
l = pos[min_aaa]
r = l + 1
for a in range(min_aaa + 1, n):
if pos[a] == -1:
leftmost[a] = l
rightmost[a] = r
else:
l = min(l, pos[a])
r = max(r, pos[a] + 1)
dp = [[0] * (m + 2) for _ in range(m + 1)]
dp[0][-1] = 1
for a in range(n - 1, min_aaa, -1):
ndp1 = [[0] * (m + 2) for _ in range(m + 1)] # l が増える方向の累積和
ndp2 = [[0] * (m + 2) for _ in range(m + 1)] # r が減る方向の累積和
if pos[a] != -1:
continue
lm = leftmost[a]
rm = rightmost[a]
for l in range(lm + 1):
for r in range(rm, m + 1):
val = dp[l][r]
if val == 0:
continue
ndp1[l][r] += val
ndp1[l][r] %= MOD
ndp1[lm + 1][r] -= val
ndp1[lm + 1][r] %= MOD
ndp2[l][r] += val
ndp2[l][r] %= MOD
ndp2[l][rm - 1] -= val
ndp2[l][rm - 1] %= MOD
for r in range(rm, m + 1):
for l in range(1, lm + 2):
ndp1[l][r] += ndp1[l - 1][r]
ndp1[l][r] %= MOD
for l in range(lm + 1):
for r in range(m - 1, rm - 2, -1):
ndp2[l][r] += ndp2[l][r + 1]
ndp2[l][r] %= MOD
for l in range(lm + 1):
for r in range(rm, m + 1):
ndp1[l][r] += ndp2[l][r]
ndp1[l][r] %= MOD
dp = ndp1
def precompute_factorials(n, MOD):
f = 1
factorials = [1]
for m in range(1, n + 1):
f = f * m % MOD
factorials.append(f)
f = pow(f, MOD - 2, MOD)
finvs = [1] * (n + 1)
finvs[n] = f
for m in range(n, 1, -1):
f = f * m % MOD
finvs[m - 1] = f
return factorials, finvs
if min_aaa == 0:
ans = 0
for row in dp:
ans += sum(row)
ans %= MOD
else:
facts, finvs = precompute_factorials(n, MOD)
x = pow(2, min_aaa - 1, MOD)
ans = 0
for l in range(m):
for r in range(l + 1, m + 1):
w = r - l
tmp = facts[w + min_aaa] * finvs[w] % MOD * finvs[min_aaa] % MOD
ans += tmp * dp[l][r] % MOD * x % MOD
ans %= MOD
print(ans)
n, m = map(int, input().split())
aaa = list(map(int, input().split()))
MOD = 998244353
pos = [-1] * n
for i, a in enumerate(aaa):
pos[a] = i
min_aaa = min(aaa)
leftmost = [0] * n
rightmost = [0] * n
l = pos[min_aaa]
r = l + 1
for a in range(min_aaa + 1, n):
if pos[a] == -1:
leftmost[a] = l
rightmost[a] = r
else:
l = min(l, pos[a])
r = max(r, pos[a] + 1)
dp = [[0] * (m + 2) for _ in range(m + 1)]
dp[0][m] = 1
for a in range(n - 1, min_aaa, -1):
ndp1 = [[0] * (m + 2) for _ in range(m + 1)] # l が増える方向の累積和
ndp2 = [[0] * (m + 2) for _ in range(m + 1)] # r が減る方向の累積和
if pos[a] != -1:
continue
lm = leftmost[a]
rm = rightmost[a]
for l in range(lm + 1):
for r in range(rm, m + 1):
val = dp[l][r]
if val == 0:
continue
ndp1[l][r] += val
ndp1[l][r] %= MOD
ndp1[lm + 1][r] -= val
ndp1[lm + 1][r] %= MOD
ndp2[l][r] += val
ndp2[l][r] %= MOD
ndp2[l][rm - 1] -= val
ndp2[l][rm - 1] %= MOD
for r in range(rm, m + 1):
for l in range(1, lm + 2):
ndp1[l][r] += ndp1[l - 1][r]
ndp1[l][r] %= MOD
for l in range(lm + 1):
for r in range(m - 1, rm - 2, -1):
ndp2[l][r] += ndp2[l][r + 1]
ndp2[l][r] %= MOD
for l in range(lm + 1):
for r in range(rm, m + 1):
ndp1[l][r] += ndp2[l][r]
ndp1[l][r] %= MOD
dp = ndp1
def precompute_factorials(n, MOD):
f = 1
factorials = [1]
for m in range(1, n + 1):
f = f * m % MOD
factorials.append(f)
f = pow(f, MOD - 2, MOD)
finvs = [1] * (n + 1)
finvs[n] = f
for m in range(n, 1, -1):
f = f * m % MOD
finvs[m - 1] = f
return factorials, finvs
if min_aaa == 0:
ans = 0
for row in dp:
ans += sum(row)
ans %= MOD
else:
facts, finvs = precompute_factorials(n, MOD)
x = pow(2, min_aaa - 1, MOD)
ans = 0
for l in range(m):
for r in range(l + 1, m + 1):
w = r - l
tmp = facts[w + min_aaa] * finvs[w] % MOD * finvs[min_aaa] % MOD
ans += tmp * dp[l][r] % MOD * x % MOD
ans %= MOD
print(ans)
| ConDefects/ConDefects/Code/arc178_d/Python/53680716 |
condefects-python_data_1474 | A = list(map(int, input().split()))
N = int(input())
X = list(map(int, input().split()))
prices = [1, 5, 10, 50, 100, 500]
valid = True
for i in range(1, 6):
n = 0
for x in X:
n += x % prices[i]
if n > A[i - 1]:
valid = False
break
A[i] += (A[i - 1] - n) // prices[i]
X = [x // prices[i] for x in X]
prices = [p // prices[i] for p in prices]
if valid and sum(prices) <= A[-1]:
print("Yes")
else:
print("No")
A = list(map(int, input().split()))
N = int(input())
X = list(map(int, input().split()))
prices = [1, 5, 10, 50, 100, 500]
valid = True
for i in range(1, 6):
n = 0
for x in X:
n += x % prices[i]
if n > A[i - 1]:
valid = False
break
A[i] += (A[i - 1] - n) // prices[i]
X = [x // prices[i] for x in X]
prices = [p // prices[i] for p in prices]
if valid and sum(X) <= A[-1]:
print("Yes")
else:
print("No")
| ConDefects/ConDefects/Code/arc177_a/Python/53803564 |
condefects-python_data_1475 | A, B, C, D, E, F = map(int, input().split())
N = int(input())
X = list(map(int, input().split()))
out = "Yes"
for i in range(N):
while(X[i] >= 500 and F > 0):
X[i] = X[i] - 500
F = F - 1
while(X[i] >= 100 and E > 0):
X[i] = X[i] - 100
E = E - 1
while(X[i] >= 50 and D > 0):
X[i] = X[i] - 50
D = D - 1
while(X[i] >= 10 and C > 0):
X[i] = X[i] - 10
C = C - 1
while(X[i] >= 5 and B > 0):
X[i] = X[i] - 5
B = - 1
while(X[i] >= 1 and A > 0):
X[i] = X[i] - 1
A = A - 1
if(X[i] != 0):
out = "No"
break
print(out)
A, B, C, D, E, F = map(int, input().split())
N = int(input())
X = list(map(int, input().split()))
out = "Yes"
for i in range(N):
while(X[i] >= 500 and F > 0):
X[i] = X[i] - 500
F = F - 1
while(X[i] >= 100 and E > 0):
X[i] = X[i] - 100
E = E - 1
while(X[i] >= 50 and D > 0):
X[i] = X[i] - 50
D = D - 1
while(X[i] >= 10 and C > 0):
X[i] = X[i] - 10
C = C - 1
while(X[i] >= 5 and B > 0):
X[i] = X[i] - 5
B = B - 1
while(X[i] >= 1 and A > 0):
X[i] = X[i] - 1
A = A - 1
if(X[i] != 0):
out = "No"
break
print(out) | ConDefects/ConDefects/Code/arc177_a/Python/53706270 |
condefects-python_data_1476 | h, w = map(int, input().split())
s = []
o = []
for _ in range(h):
s.append(input())
for row in range(h):
for col in range(w):
if s[row][col] == "o":
o.append([row,col])
hirai = abs(o[0][0]- o[1][0]) + abs(o[1][0]-o[1][1])
print(hirai)
h, w = map(int, input().split())
s = []
o = []
for _ in range(h):
s.append(input())
for row in range(h):
for col in range(w):
if s[row][col] == "o":
o.append([row,col])
hirai = abs(o[0][0]- o[1][0]) + abs(o[0][1]-o[1][1])
print(hirai) | ConDefects/ConDefects/Code/abc253_b/Python/45785764 |
condefects-python_data_1477 | N = int(input())
list = []
T = 0
for i in range(N):
S, C = input().split()
list.append([S, int(C)])
T += int(C)
name = []
for j in range(N):
name.append(list[j])
name.sort()
m = T % N
print(list[m][0])
N = int(input())
list = []
T = 0
for i in range(N):
S, C = input().split()
list.append([S, int(C)])
T += int(C)
name = []
for j in range(N):
name.append(list[j])
name.sort()
m = T % N
print(name[m][0]) | ConDefects/ConDefects/Code/abc354_b/Python/54729742 |
condefects-python_data_1478 | N=int(input())
S, C = [""]*N, [0]*N
for i in range(N):
S[i],C[i] = input().split()
C[i] = int(C[i])
S.sort()
print(S[sum(C) % N])
N=int(input())
S, C = [""]*N, [0]*N
for i in range(N):
S[i],C[i] = input().split()
C[i] = int(C[i])
S.sort()
print(S[sum(C) % N]) | ConDefects/ConDefects/Code/abc354_b/Python/54929590 |
condefects-python_data_1479 | S = input()
N = len(S)
from collections import defaultdict
s_dict = defaultdict(list)
for i in range(N-1,-1,-1):
s_dict[S[i]].append(i)
def my_check(i,j):
for k in range((j-i+1)//2):
if S[i+k] != S[j-k]:
return False
return True
text_set = set()
for i in range(N):
for j in s_dict[S[i]]:
if j < i:
break
if my_check(i,j):
text_set.add(S[i:j+1])
text_list = list(text_set)
text_list.sort(key=len)
edge_list = defaultdict(list)
n = len(text_list)
for i in range(n-1):
for j in range(i+1,n):
if text_list[i] in text_list[j]:
edge_list[i].append(j)
# simple bipartite graph
b_to_a_list = [-1] * n
used = [0] * n
def my_dfs(a):
used[a] = 1
for b in edge_list[a]:
w = b_to_a_list[b]
if w == -1 or (used[w] == 0 and my_dfs(w)):
b_to_a_list[b] = a
return True
return False
ans = 0
for a in range(n):
used = [0] * n
if my_dfs(a):
ans += 1
else:
break
print(n-ans)
S = input()
N = len(S)
from collections import defaultdict
s_dict = defaultdict(list)
for i in range(N-1,-1,-1):
s_dict[S[i]].append(i)
def my_check(i,j):
for k in range((j-i+1)//2):
if S[i+k] != S[j-k]:
return False
return True
text_set = set()
for i in range(N):
for j in s_dict[S[i]]:
if j < i:
break
if my_check(i,j):
text_set.add(S[i:j+1])
text_list = list(text_set)
text_list.sort(key=len)
edge_list = defaultdict(list)
n = len(text_list)
for i in range(n-1):
for j in range(i+1,n):
if text_list[i] in text_list[j]:
edge_list[i].append(j)
# simple bipartite graph
b_to_a_list = [-1] * n
used = [0] * n
def my_dfs(a):
used[a] = 1
for b in edge_list[a]:
w = b_to_a_list[b]
if w == -1 or (used[w] == 0 and my_dfs(w)):
b_to_a_list[b] = a
return True
return False
ans = 0
for a in range(n):
used = [0] * n
if my_dfs(a):
ans += 1
print(n-ans)
| ConDefects/ConDefects/Code/abc237_h/Python/29196395 |
condefects-python_data_1480 | """
3 2
1 2 2 1
1 3 -1 -2
"""
N,M=map(int,input().split())
G=[[]for i in range(N+1)]
for i in range(M):
a,b,x,y=map(int,input().split())
G[a].append([b,x,y])
G[b].append([a,x,y])
visited=[False]*(N+1)
visited[1]=True
listx=[[0]*2 for i in range(N+1)]
set1={1}
while len(set1)>0:
set2=set()
for i in set1:
for num,x,y in G[i]:
if visited[num]==False:
set2.add(num)
visited[num]=True
listx[num][0]=listx[i][0]+x
listx[num][1]=listx[i][1]+y
set1=set2.copy()
for i in range(1,N+1):
if visited[i]==False:
print("undecidable")
else:
print(listx[i][0],listx[i][1])
"""
3 2
1 2 2 1
1 3 -1 -2
"""
N,M=map(int,input().split())
G=[[]for i in range(N+1)]
for i in range(M):
a,b,x,y=map(int,input().split())
G[a].append([b,x,y])
G[b].append([a,-x,-y])
visited=[False]*(N+1)
visited[1]=True
listx=[[0]*2 for i in range(N+1)]
set1={1}
while len(set1)>0:
set2=set()
for i in set1:
for num,x,y in G[i]:
if visited[num]==False:
set2.add(num)
visited[num]=True
listx[num][0]=listx[i][0]+x
listx[num][1]=listx[i][1]+y
set1=set2.copy()
for i in range(1,N+1):
if visited[i]==False:
print("undecidable")
else:
print(listx[i][0],listx[i][1])
| ConDefects/ConDefects/Code/abc320_d/Python/54919763 |
condefects-python_data_1481 | user_n, q = map(int, input().split(" "))
dic = {}
for i in range(q):
ope, user1, user2 = map(int, input().split(" "))
if user1 not in dic:
dic[user1] = set()
if user2 not in dic:
dic[user2] = set()
if ope == 1:
dic[user1].add(user2)
elif ope == 2:
if user1 in dic[user2]:
dic[user2].remove(user1)
if user2 in dic[user1]:
dic[user1].remove(user2)
else:
if user1 in dic[user2] and user2 in dic[user1]:
print("Yes")
else:
print("No")
user_n, q = map(int, input().split(" "))
dic = {}
for i in range(q):
ope, user1, user2 = map(int, input().split(" "))
if user1 not in dic:
dic[user1] = set()
if user2 not in dic:
dic[user2] = set()
if ope == 1:
dic[user1].add(user2)
elif ope == 2:
if user2 in dic[user1]:
dic[user1].remove(user2)
else:
if user1 in dic[user2] and user2 in dic[user1]:
print("Yes")
else:
print("No")
| ConDefects/ConDefects/Code/abc278_c/Python/44900806 |
condefects-python_data_1482 | from collections import defaultdict
N, Q = map(int, input().split())
follow = defaultdict(bool)
for i in range(Q):
t, a, b = map(int, input().split())
if t==1:
follow[(a, b)] = True
elif t==2:
follow[(b, a)] = False
elif t==3:
if follow[(a, b)] and follow[(b, a)]:
print("Yes")
else:
print("No")
from collections import defaultdict
N, Q = map(int, input().split())
follow = defaultdict(bool)
for i in range(Q):
t, a, b = map(int, input().split())
if t==1:
follow[(a, b)] = True
elif t==2:
follow[(a, b)] = False
elif t==3:
if follow[(a, b)] and follow[(b, a)]:
print("Yes")
else:
print("No") | ConDefects/ConDefects/Code/abc278_c/Python/45320717 |
condefects-python_data_1483 | M = 998244353
N, D = map(int, input().split())
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
size = (D+1)*(D+1)
def idx(i, j):
return i + j * (D+1)
dp = [0]*size
px, qx = P[0], Q[0]
boaders = [px-D, px+D, qx-D, qx+D]
boaders.sort()
for rx in range(boaders[1], boaders[2]+1):
dp[idx(abs(px-rx), abs(qx-rx))] += 1
sumu = [0]*size # up
sumd = [0]*size # down
for d in range(1, N):
for s in range(2*D+1):
j = min(s, D)
i = s - j
idx_ = idx(i, j)
sumd[idx_] = dp[idx_]
i, j, idx_ = i+1, j-1, idx_-D
while i <= D and j >= 0:
sumd[idx_] = (sumd[idx_+D] + dp[idx_]) % M
i, j, idx_ = i+1, j-1, idx_-D
for s in range(-D, D+1):
j = max(0, s)
i = j - s
idx_ = idx(i, j)
sumu[idx_] = dp[idx_]
i, j, idx_ = i+1, j+1, idx_+D+2
while i <= D and j <= D:
sumu[idx_] = (sumu[idx_-D-2] + dp[idx_]) % M
i, j, idx_ = i+1, j+1, idx_+D+2
ndp = [0]*size
s = abs(P[d] - Q[d])
for i in range(D+1):
for j in range(D+1):
si = max(0, i-s)
sj = i + j - si - s
if 0 <= sj:
tj = max(0, j-s)
ti = i + j - tj - s
ndp[idx(i, j)] += sumd[idx(ti, tj)] - (0 if si == 0 or sj == D else sumd[idx(si-1, sj+1)])
if ti > 0 and tj > 0:
ndp[idx(i, j)] += sumu[idx(ti-1, tj-1)]
if si > 0 and sj > 0 and (si, sj) != (i, j):
ndp[idx(i, j)] += sumu[idx(si-1, sj-1)]
ndp[idx(i, j)] %= M
dp = ndp
print(sum(dp) % M)
M = 998244353
N, D = map(int, input().split())
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
size = (D+1)*(D+1)
def idx(i, j):
return i + j * (D+1)
dp = [0]*size
px, qx = P[0], Q[0]
boaders = [px-D, px+D, qx-D, qx+D]
boaders.sort()
for rx in range(boaders[1], boaders[2]+1):
dp[idx(abs(px-rx), abs(qx-rx))] += 1
sumu = [0]*size # up
sumd = [0]*size # down
for d in range(1, N):
for s in range(2*D+1):
j = min(s, D)
i = s - j
idx_ = idx(i, j)
sumd[idx_] = dp[idx_]
i, j, idx_ = i+1, j-1, idx_-D
while i <= D and j >= 0:
sumd[idx_] = (sumd[idx_+D] + dp[idx_]) % M
i, j, idx_ = i+1, j-1, idx_-D
for s in range(-D, D+1):
j = max(0, s)
i = j - s
idx_ = idx(i, j)
sumu[idx_] = dp[idx_]
i, j, idx_ = i+1, j+1, idx_+D+2
while i <= D and j <= D:
sumu[idx_] = (sumu[idx_-D-2] + dp[idx_]) % M
i, j, idx_ = i+1, j+1, idx_+D+2
ndp = [0]*size
s = abs(P[d] - Q[d])
for i in range(D+1):
for j in range(D+1):
si = max(0, i-s)
sj = i + j - si - s
if 0 <= sj:
tj = max(0, j-s)
ti = i + j - tj - s
ndp[idx(i, j)] += sumd[idx(ti, tj)] - (0 if si == 0 or sj == D else sumd[idx(si-1, sj+1)])
if ti > 0 and tj > 0:
ndp[idx(i, j)] += sumu[idx(ti-1, tj-1)]
if si > 0 and sj > 0:
ndp[idx(i, j)] += sumu[idx(si-1, sj-1)]
ndp[idx(i, j)] %= M
dp = ndp
print(sum(dp) % M)
| ConDefects/ConDefects/Code/abc265_f/Python/43487741 |
condefects-python_data_1484 | K, G, M = map(int, input().split())
Gi, Mi = 0, 0
for _ in range(K):
if Gi == G:
Gi = 0
elif Mi == 0:
Mi = M
else:
if Gi + Mi > G:
Gi = G
Mi = Mi - (G - Gi)
else:
Gi = Gi + Mi
Mi = 0
print(Gi, Mi)
K, G, M = map(int, input().split())
Gi, Mi = 0, 0
for _ in range(K):
if Gi == G:
Gi = 0
elif Mi == 0:
Mi = M
else:
if Gi + Mi > G:
Mi = Mi - (G - Gi)
Gi = G
else:
Gi = Gi + Mi
Mi = 0
print(Gi, Mi) | ConDefects/ConDefects/Code/abc332_b/Python/54879479 |
condefects-python_data_1485 | N = int(input())
S = input()
se = set()
se.add((0, 0))
now = (0, 0)
for i in range(N):
if S[i] == "L":
now = (now[0] - 1, now[1])
if S[i] == "R":
now = (now[0] + 1, now[1])
if S[i] == "U":
now = (now[0], now[1] + 1)
if S[i] == "D":
now = (now[0], now[1] - 1)
se.add(now)
if len(se) == N + 1:
print("Yes")
else:
print("No")
N = int(input())
S = input()
se = set()
se.add((0, 0))
now = (0, 0)
for i in range(N):
if S[i] == "L":
now = (now[0] - 1, now[1])
if S[i] == "R":
now = (now[0] + 1, now[1])
if S[i] == "U":
now = (now[0], now[1] + 1)
if S[i] == "D":
now = (now[0], now[1] - 1)
se.add(now)
if len(se) != N + 1:
print("Yes")
else:
print("No") | ConDefects/ConDefects/Code/abc291_c/Python/45227759 |
condefects-python_data_1486 | N = int(input())
S = input()
def Move(s, x, y):
if s=="R":
x += 1
elif s=="L":
x -= 1
elif s=="U":
y += 1
elif s=="D":
y += 1
return x, y
X, Y = 0, 0
visited = set()
visited.add((X, Y))
for i in range(N):
X, Y = Move(S[i], X, Y)
if (X, Y) in visited:
print("Yes")
exit()
visited.add((X, Y))
print("No")
N = int(input())
S = input()
def Move(s, x, y):
if s=="R":
x += 1
elif s=="L":
x -= 1
elif s=="U":
y += 1
elif s=="D":
y -= 1
return x, y
X, Y = 0, 0
visited = set()
visited.add((X, Y))
for i in range(N):
X, Y = Move(S[i], X, Y)
if (X, Y) in visited:
print("Yes")
exit()
visited.add((X, Y))
print("No")
| ConDefects/ConDefects/Code/abc291_c/Python/45313651 |
condefects-python_data_1487 | n=int(input())
S=input()
s=set((0,0))
x=0
y=0
for c in S:
if c=='U':
y+=1
if c=='D':
y-=1
if c=='R':
x+=1
if c=='L':
x-=1
s.add((x,y))
if len(s)==n+1:
print('No')
else:
print('Yes')
n=int(input())
S=input()
s={(0,0)}
x=0
y=0
for c in S:
if c=='U':
y+=1
if c=='D':
y-=1
if c=='R':
x+=1
if c=='L':
x-=1
s.add((x,y))
if len(s)==n+1:
print('No')
else:
print('Yes') | ConDefects/ConDefects/Code/abc291_c/Python/45751656 |
condefects-python_data_1488 | from enum import Enum
from typing import SupportsFloat
import numpy as np
from scipy.optimize import linprog # type: ignore
class LPVariableType(Enum):
CONTINUOUS = 1
INTEGER = 2
class LPBase:
def __add__(self, other: "AffineExpressionLike") -> "AffineExpression":
return AffineExpression.build(self) + other
def __radd__(self, other: "AffineExpressionLike") -> "AffineExpression":
return other + AffineExpression.build(self)
def __sub__(self, other: "AffineExpressionLike") -> "AffineExpression":
return AffineExpression.build(self) - other
def __rsub__(self, other: "AffineExpressionLike") -> "AffineExpression":
return other - AffineExpression.build(self)
def __mul__(self, other: SupportsFloat) -> "AffineExpression":
return AffineExpression.build(self) * other
def __rmul__(self, other: SupportsFloat) -> "AffineExpression":
return AffineExpression.build(self) * other
def __truediv__(self, other: SupportsFloat) -> "AffineExpression":
return AffineExpression.build(self) / other
def __neg__(self) -> "AffineExpression":
return -AffineExpression.build(self)
def __le__(
self,
other: "AffineExpressionLike",
) -> "LPInequality": # type: ignore
return LPInequality(
lhs=AffineExpression.build(self),
rhs=other,
inequality_type=InequalityType.LESSEQ,
)
def __ge__(
self,
other: "AffineExpressionLike",
) -> "LPInequality": # type: ignore
return LPInequality(
lhs=other,
rhs=AffineExpression.build(self),
inequality_type=InequalityType.LESSEQ,
)
def __eq__(
self,
other: "AffineExpressionLike",
) -> "LPInequality": # type: ignore
return LPInequality(
lhs=AffineExpression.build(self),
rhs=other,
inequality_type=InequalityType.EQUAL,
)
class LPVariable(LPBase):
def __init__(
self,
name: str,
lower_bound: float | None = None,
upper_bound: float | None = None,
variable_type: LPVariableType = LPVariableType.CONTINUOUS,
) -> None:
self.name = name
self.lower_bound: float | None = lower_bound
self.upper_bound: float | None = upper_bound
self.variable_type: LPVariableType = variable_type
self._value: float | None = None
def __str__(self) -> str:
s = "{}(lb={}, ub={}, type={})".format(
self.name,
self.lower_bound,
self.upper_bound,
self.variable_type.name,
)
if self._value is not None:
s += ": {}".format(self._value)
return s
def __repr__(self) -> str:
return str(self)
def value(self) -> float | None:
return self._value
class InequalityType(Enum):
LESSEQ = 1 # lhs <= rhs
EQUAL = 2 # lhs == rhs
class _FirstDegreeTerm(LPBase):
"""
A term of the form coefficient * variable, where coefficient is a real
"""
def __init__(self, coefficient: float, variable: LPVariable) -> None:
self.coefficient: float = coefficient
self.variable: LPVariable = variable
class AffineExpression:
def __init__(
self,
const: SupportsFloat,
terms: list[_FirstDegreeTerm],
) -> None:
self.const = float(const)
self.terms = terms.copy()
self._value: float | None = None
@classmethod
def build(self, x: "AffineExpressionLike | LPBase") -> "AffineExpression":
if isinstance(x, AffineExpression):
return AffineExpression(x.const, x.terms)
elif isinstance(x, _FirstDegreeTerm):
return AffineExpression(0, [x])
elif isinstance(x, LPVariable):
return AffineExpression(0, [_FirstDegreeTerm(1, x)])
elif isinstance(x, SupportsFloat):
return AffineExpression(x, [])
else:
raise TypeError("Invalid type for AffineExpression")
def __add__(self, other: "AffineExpressionLike") -> "AffineExpression":
rhs = AffineExpression.build(other)
return AffineExpression(
self.const + rhs.const,
self.terms + rhs.terms,
)
def __radd__(self, other: "AffineExpressionLike") -> "AffineExpression":
return self + other
def __sub__(self, other: "AffineExpressionLike") -> "AffineExpression":
rhs = AffineExpression.build(other)
return self + (-rhs)
def __rsub__(self, other: "AffineExpressionLike") -> "AffineExpression":
return AffineExpression.build(other) + (-self)
def __mul__(self, other: SupportsFloat) -> "AffineExpression":
return AffineExpression(
self.const * float(other),
[
_FirstDegreeTerm(t.coefficient * float(other), t.variable)
for t in self.terms
],
)
def __rmul__(self, other: SupportsFloat) -> "AffineExpression":
return self * other
def __truediv__(self, other: SupportsFloat) -> "AffineExpression":
return AffineExpression(
self.const / float(other),
[
_FirstDegreeTerm(t.coefficient / float(other), t.variable)
for t in self.terms
],
)
def __neg__(self) -> "AffineExpression":
return AffineExpression(
-self.const,
[_FirstDegreeTerm(-t.coefficient, t.variable) for t in self.terms],
)
def __le__(
self,
other: "AffineExpressionLike",
) -> "LPInequality": # type: ignore
return LPInequality(self, other, InequalityType.LESSEQ)
def __ge__(
self,
other: "AffineExpressionLike",
) -> "LPInequality": # type: ignore
return LPInequality(other, self, InequalityType.LESSEQ)
def __eq__(
self,
other: "AffineExpressionLike",
) -> "LPInequality": # type: ignore
return LPInequality(self, other, InequalityType.EQUAL)
def __str__(self) -> str:
ret = ["{}".format(self.const)]
for t in self.terms:
sgn = "+" if t.coefficient >= 0 else ""
ret.append("{}{}{}".format(sgn, t.coefficient, t.variable.name))
return " ".join(ret)
def value(self) -> float | None:
return self._value
AffineExpressionLike = AffineExpression | _FirstDegreeTerm | LPVariable | SupportsFloat
class LPInequality:
def __init__(
self,
lhs: AffineExpressionLike,
rhs: AffineExpressionLike,
inequality_type: InequalityType,
) -> None:
"""
lhs <= rhs
-> terms + const (<= or ==) 0
"""
self.lhs: AffineExpression = AffineExpression.build(
lhs
) - AffineExpression.build(rhs)
self.inequality_type = inequality_type
def __str__(self) -> str:
if self.inequality_type == InequalityType.LESSEQ:
return "{} <= 0".format(self.lhs)
elif self.inequality_type == InequalityType.EQUAL:
return "{} == 0".format(self.lhs)
else:
raise ValueError("Invalid inequality type")
def __repr__(self) -> str:
return str(self)
class LPModel:
def __init__(self, name: str) -> None:
self.name = name
self.constraints: list[LPInequality] = []
self.objective: AffineExpression = AffineExpression(0, [])
def add_constraint(self, constraint: LPInequality):
self.constraints.append(constraint)
def set_objective(self, objective: AffineExpressionLike) -> None:
self.objective = AffineExpression.build(objective)
def solve(self) -> None:
var_dict: dict[int, LPVariable] = {}
for constraint in self.constraints:
for term in constraint.lhs.terms:
var_dict.setdefault(id(term.variable), term.variable)
for term in self.objective.terms:
var_dict.setdefault(id(term.variable), term.variable)
# print(var_dict)
id_to_idx = {id(v): i for i, v in enumerate(var_dict.values())}
# print(id_to_idx)
A_ub = np.zeros((0, len(var_dict)))
b_ub = np.zeros(0)
A_eq = np.zeros((0, len(var_dict)))
b_eq = np.zeros(0)
for constraint in self.constraints:
# print(constraint)
lhs = np.zeros(len(var_dict))
rhs = -constraint.lhs.const
for term in constraint.lhs.terms:
lhs[id_to_idx[id(term.variable)]] += term.coefficient
if constraint.inequality_type == InequalityType.LESSEQ:
A_ub = np.vstack((A_ub, lhs))
b_ub = np.hstack((b_ub, rhs))
elif constraint.inequality_type == InequalityType.EQUAL:
A_eq = np.vstack((A_eq, lhs))
b_eq = np.hstack((b_eq, rhs))
else:
raise ValueError("Invalid inequality type")
bounds = [(v.lower_bound, v.upper_bound) for v in var_dict.values()]
integrality = [
int(variable.variable_type == LPVariableType.INTEGER)
for variable in var_dict.values()
]
c = np.zeros(len(var_dict))
for term in self.objective.terms:
c[id_to_idx[id(term.variable)]] += term.coefficient
res = linprog(
c,
A_ub=A_ub,
b_ub=b_ub,
A_eq=A_eq,
b_eq=b_eq,
bounds=bounds,
integrality=integrality,
)
for i, variable in enumerate(var_dict.values()):
variable._value = res.x[i]
# print(variable)
# print(res)
self.objective._value = res.fun + self.objective.const
N, M = map(int, input().split())
C = list(map(int, input().split()))
A = list(map(int, input().split()))
L = [list(map(int, input().split())) for _ in range(M)]
xs = [
LPVariable(
"x{}".format(i),
lower_bound=1,
upper_bound=5,
)
for i in range(N)
]
ys = [
LPVariable(
"y{}".format(i),
lower_bound=0,
upper_bound=1,
variable_type=LPVariableType.INTEGER,
)
for i in range(M)
]
problem = LPModel("atcoder326G")
for i in range(M):
for j in range(N):
problem.add_constraint(xs[j] - L[i][j] * ys[i] >= 0)
objective = 0
for i in range(M):
objective -= A[i] * ys[i]
for i in range(N):
objective += C[i] * (xs[i] - 1)
problem.set_objective(objective)
problem.solve()
print(int(-problem.objective.value()))
from enum import Enum
from typing import SupportsFloat
import numpy as np
from scipy.optimize import linprog # type: ignore
class LPVariableType(Enum):
CONTINUOUS = 1
INTEGER = 2
class LPBase:
def __add__(self, other: "AffineExpressionLike") -> "AffineExpression":
return AffineExpression.build(self) + other
def __radd__(self, other: "AffineExpressionLike") -> "AffineExpression":
return other + AffineExpression.build(self)
def __sub__(self, other: "AffineExpressionLike") -> "AffineExpression":
return AffineExpression.build(self) - other
def __rsub__(self, other: "AffineExpressionLike") -> "AffineExpression":
return other - AffineExpression.build(self)
def __mul__(self, other: SupportsFloat) -> "AffineExpression":
return AffineExpression.build(self) * other
def __rmul__(self, other: SupportsFloat) -> "AffineExpression":
return AffineExpression.build(self) * other
def __truediv__(self, other: SupportsFloat) -> "AffineExpression":
return AffineExpression.build(self) / other
def __neg__(self) -> "AffineExpression":
return -AffineExpression.build(self)
def __le__(
self,
other: "AffineExpressionLike",
) -> "LPInequality": # type: ignore
return LPInequality(
lhs=AffineExpression.build(self),
rhs=other,
inequality_type=InequalityType.LESSEQ,
)
def __ge__(
self,
other: "AffineExpressionLike",
) -> "LPInequality": # type: ignore
return LPInequality(
lhs=other,
rhs=AffineExpression.build(self),
inequality_type=InequalityType.LESSEQ,
)
def __eq__(
self,
other: "AffineExpressionLike",
) -> "LPInequality": # type: ignore
return LPInequality(
lhs=AffineExpression.build(self),
rhs=other,
inequality_type=InequalityType.EQUAL,
)
class LPVariable(LPBase):
def __init__(
self,
name: str,
lower_bound: float | None = None,
upper_bound: float | None = None,
variable_type: LPVariableType = LPVariableType.CONTINUOUS,
) -> None:
self.name = name
self.lower_bound: float | None = lower_bound
self.upper_bound: float | None = upper_bound
self.variable_type: LPVariableType = variable_type
self._value: float | None = None
def __str__(self) -> str:
s = "{}(lb={}, ub={}, type={})".format(
self.name,
self.lower_bound,
self.upper_bound,
self.variable_type.name,
)
if self._value is not None:
s += ": {}".format(self._value)
return s
def __repr__(self) -> str:
return str(self)
def value(self) -> float | None:
return self._value
class InequalityType(Enum):
LESSEQ = 1 # lhs <= rhs
EQUAL = 2 # lhs == rhs
class _FirstDegreeTerm(LPBase):
"""
A term of the form coefficient * variable, where coefficient is a real
"""
def __init__(self, coefficient: float, variable: LPVariable) -> None:
self.coefficient: float = coefficient
self.variable: LPVariable = variable
class AffineExpression:
def __init__(
self,
const: SupportsFloat,
terms: list[_FirstDegreeTerm],
) -> None:
self.const = float(const)
self.terms = terms.copy()
self._value: float | None = None
@classmethod
def build(self, x: "AffineExpressionLike | LPBase") -> "AffineExpression":
if isinstance(x, AffineExpression):
return AffineExpression(x.const, x.terms)
elif isinstance(x, _FirstDegreeTerm):
return AffineExpression(0, [x])
elif isinstance(x, LPVariable):
return AffineExpression(0, [_FirstDegreeTerm(1, x)])
elif isinstance(x, SupportsFloat):
return AffineExpression(x, [])
else:
raise TypeError("Invalid type for AffineExpression")
def __add__(self, other: "AffineExpressionLike") -> "AffineExpression":
rhs = AffineExpression.build(other)
return AffineExpression(
self.const + rhs.const,
self.terms + rhs.terms,
)
def __radd__(self, other: "AffineExpressionLike") -> "AffineExpression":
return self + other
def __sub__(self, other: "AffineExpressionLike") -> "AffineExpression":
rhs = AffineExpression.build(other)
return self + (-rhs)
def __rsub__(self, other: "AffineExpressionLike") -> "AffineExpression":
return AffineExpression.build(other) + (-self)
def __mul__(self, other: SupportsFloat) -> "AffineExpression":
return AffineExpression(
self.const * float(other),
[
_FirstDegreeTerm(t.coefficient * float(other), t.variable)
for t in self.terms
],
)
def __rmul__(self, other: SupportsFloat) -> "AffineExpression":
return self * other
def __truediv__(self, other: SupportsFloat) -> "AffineExpression":
return AffineExpression(
self.const / float(other),
[
_FirstDegreeTerm(t.coefficient / float(other), t.variable)
for t in self.terms
],
)
def __neg__(self) -> "AffineExpression":
return AffineExpression(
-self.const,
[_FirstDegreeTerm(-t.coefficient, t.variable) for t in self.terms],
)
def __le__(
self,
other: "AffineExpressionLike",
) -> "LPInequality": # type: ignore
return LPInequality(self, other, InequalityType.LESSEQ)
def __ge__(
self,
other: "AffineExpressionLike",
) -> "LPInequality": # type: ignore
return LPInequality(other, self, InequalityType.LESSEQ)
def __eq__(
self,
other: "AffineExpressionLike",
) -> "LPInequality": # type: ignore
return LPInequality(self, other, InequalityType.EQUAL)
def __str__(self) -> str:
ret = ["{}".format(self.const)]
for t in self.terms:
sgn = "+" if t.coefficient >= 0 else ""
ret.append("{}{}{}".format(sgn, t.coefficient, t.variable.name))
return " ".join(ret)
def value(self) -> float | None:
return self._value
AffineExpressionLike = AffineExpression | _FirstDegreeTerm | LPVariable | SupportsFloat
class LPInequality:
def __init__(
self,
lhs: AffineExpressionLike,
rhs: AffineExpressionLike,
inequality_type: InequalityType,
) -> None:
"""
lhs <= rhs
-> terms + const (<= or ==) 0
"""
self.lhs: AffineExpression = AffineExpression.build(
lhs
) - AffineExpression.build(rhs)
self.inequality_type = inequality_type
def __str__(self) -> str:
if self.inequality_type == InequalityType.LESSEQ:
return "{} <= 0".format(self.lhs)
elif self.inequality_type == InequalityType.EQUAL:
return "{} == 0".format(self.lhs)
else:
raise ValueError("Invalid inequality type")
def __repr__(self) -> str:
return str(self)
class LPModel:
def __init__(self, name: str) -> None:
self.name = name
self.constraints: list[LPInequality] = []
self.objective: AffineExpression = AffineExpression(0, [])
def add_constraint(self, constraint: LPInequality):
self.constraints.append(constraint)
def set_objective(self, objective: AffineExpressionLike) -> None:
self.objective = AffineExpression.build(objective)
def solve(self) -> None:
var_dict: dict[int, LPVariable] = {}
for constraint in self.constraints:
for term in constraint.lhs.terms:
var_dict.setdefault(id(term.variable), term.variable)
for term in self.objective.terms:
var_dict.setdefault(id(term.variable), term.variable)
# print(var_dict)
id_to_idx = {id(v): i for i, v in enumerate(var_dict.values())}
# print(id_to_idx)
A_ub = np.zeros((0, len(var_dict)))
b_ub = np.zeros(0)
A_eq = np.zeros((0, len(var_dict)))
b_eq = np.zeros(0)
for constraint in self.constraints:
# print(constraint)
lhs = np.zeros(len(var_dict))
rhs = -constraint.lhs.const
for term in constraint.lhs.terms:
lhs[id_to_idx[id(term.variable)]] += term.coefficient
if constraint.inequality_type == InequalityType.LESSEQ:
A_ub = np.vstack((A_ub, lhs))
b_ub = np.hstack((b_ub, rhs))
elif constraint.inequality_type == InequalityType.EQUAL:
A_eq = np.vstack((A_eq, lhs))
b_eq = np.hstack((b_eq, rhs))
else:
raise ValueError("Invalid inequality type")
bounds = [(v.lower_bound, v.upper_bound) for v in var_dict.values()]
integrality = [
int(variable.variable_type == LPVariableType.INTEGER)
for variable in var_dict.values()
]
c = np.zeros(len(var_dict))
for term in self.objective.terms:
c[id_to_idx[id(term.variable)]] += term.coefficient
res = linprog(
c,
A_ub=A_ub,
b_ub=b_ub,
A_eq=A_eq,
b_eq=b_eq,
bounds=bounds,
integrality=integrality,
)
for i, variable in enumerate(var_dict.values()):
variable._value = res.x[i]
# print(variable)
# print(res)
self.objective._value = res.fun + self.objective.const
N, M = map(int, input().split())
C = list(map(int, input().split()))
A = list(map(int, input().split()))
L = [list(map(int, input().split())) for _ in range(M)]
xs = [
LPVariable(
"x{}".format(i),
lower_bound=1,
upper_bound=5,
)
for i in range(N)
]
ys = [
LPVariable(
"y{}".format(i),
lower_bound=0,
upper_bound=1,
variable_type=LPVariableType.INTEGER,
)
for i in range(M)
]
problem = LPModel("atcoder326G")
for i in range(M):
for j in range(N):
problem.add_constraint(xs[j] - L[i][j] * ys[i] >= 0)
objective = 0
for i in range(M):
objective -= A[i] * ys[i]
for i in range(N):
objective += C[i] * (xs[i] - 1)
problem.set_objective(objective)
problem.solve()
print(round(-problem.objective.value()))
| ConDefects/ConDefects/Code/abc326_g/Python/49041438 |
condefects-python_data_1489 | import sys
input = sys.stdin.readline
from math import ceil, sqrt
class Mo():
def __init__(self, A):
self.M = 202020
self.M2 = self.M**2
self.A = A
self.N = len(A)
self.B = ceil(sqrt(self.N))
self.K = self.N // self.B + 1
self.Query = [[] for i in range(self.K)]
self.nowL = 0
self.nowR = 0
self.ans = None
#------------------------------------------
self.data = [0] * self.M
def encode(self, r, l, ind):
return ind + l * self.M + r * self.M2
def decode(self, v):
ind = v % self.M
v //= self.M
r, l = divmod(v, self.M)
return r, l, ind
def add(self, i):
val = self.data[self.A[i]]
self.data[self.A[i]] ^= 1
return val
def delete(self, i):
val = self.data[self.A[i]]
self.data[self.A[i]] ^= 1
return 1 - val
def solve(self, query):
Q = len(query)
self.ans = [0] * Q
for i in range(Q):
l, r = query[i]
l -= 1
self.Query[l//self.B].append(self.encode(r, l, i))
for i in range(self.K):
self.Query[i].sort()
val = 0
for i in range(self.K):
for v in self.Query[i]:
r, l, ind = self.decode(v)
while self.nowR < r:
val += self.add(self.nowR)
self.nowR += 1
while self.nowR > r:
self.nowR -= 1
val -= self.delete(self.nowR)
while self.nowL < l:
val -= self.delete(self.nowL)
self.nowL += 1
while self.nowL > l:
self.nowL -= 1
val += self.add(self.nowL)
self.ans[ind] = val
return self.ans
N = int(input())
A = list(map(int, input().split()))
Q = int(input())
query = []
for _ in range(Q):
query.append(list(map(int, input().split())))
mo = Mo(A)
for a in mo.solve(query):
print(a)
import sys
input = sys.stdin.readline
from math import ceil, sqrt
class Mo():
def __init__(self, A):
self.M = 2020202
self.M2 = self.M**2
self.A = A
self.N = len(A)
self.B = ceil(sqrt(self.N))
self.K = self.N // self.B + 1
self.Query = [[] for i in range(self.K)]
self.nowL = 0
self.nowR = 0
self.ans = None
#------------------------------------------
self.data = [0] * self.M
def encode(self, r, l, ind):
return ind + l * self.M + r * self.M2
def decode(self, v):
ind = v % self.M
v //= self.M
r, l = divmod(v, self.M)
return r, l, ind
def add(self, i):
val = self.data[self.A[i]]
self.data[self.A[i]] ^= 1
return val
def delete(self, i):
val = self.data[self.A[i]]
self.data[self.A[i]] ^= 1
return 1 - val
def solve(self, query):
Q = len(query)
self.ans = [0] * Q
for i in range(Q):
l, r = query[i]
l -= 1
self.Query[l//self.B].append(self.encode(r, l, i))
for i in range(self.K):
self.Query[i].sort()
val = 0
for i in range(self.K):
for v in self.Query[i]:
r, l, ind = self.decode(v)
while self.nowR < r:
val += self.add(self.nowR)
self.nowR += 1
while self.nowR > r:
self.nowR -= 1
val -= self.delete(self.nowR)
while self.nowL < l:
val -= self.delete(self.nowL)
self.nowL += 1
while self.nowL > l:
self.nowL -= 1
val += self.add(self.nowL)
self.ans[ind] = val
return self.ans
N = int(input())
A = list(map(int, input().split()))
Q = int(input())
query = []
for _ in range(Q):
query.append(list(map(int, input().split())))
mo = Mo(A)
for a in mo.solve(query):
print(a) | ConDefects/ConDefects/Code/abc242_g/Python/52939949 |
condefects-python_data_1490 | from itertools import permutations
N = int(input())
A = sorted([i for i in input().split()])
ans = 0
for a in permutations(A[-3:],3):
tmp = int("".join(map(str, a)))
if ans < tmp:
ans = tmp
print(ans)
from itertools import permutations
N = int(input())
A = sorted([int(i) for i in input().split()])
ans = 0
for a in permutations(A[-3:],3):
tmp = int("".join(map(str, a)))
if ans < tmp:
ans = tmp
print(ans) | ConDefects/ConDefects/Code/arc146_a/Python/40409761 |
condefects-python_data_1491 | from itertools import permutations
N = int(input())
A = list(map(int, input().split()))
res = [[] for _ in range(10)]
for i in range(N):
res[len(str(A[i]))].append(A[i])
for i in range(10):
res[i].sort(reverse=True)
res2 = []
for i in range(10):
for j in range(min(3, len(res[i]))):
res2.append(res[i][j])
res3 = []
for i, j, k in permutations(res2, 3):
res3.append(str(i)+str(j)+str(k))
res3.sort(reverse=True)
print(res3[0])
from itertools import permutations
N = int(input())
A = list(map(int, input().split()))
res = [[] for _ in range(10)]
for i in range(N):
res[len(str(A[i]))].append(A[i])
for i in range(10):
res[i].sort(reverse=True)
res2 = []
for i in range(10):
for j in range(min(3, len(res[i]))):
res2.append(res[i][j])
res3 = []
for i, j, k in permutations(res2, 3):
res3.append(int(str(i)+str(j)+str(k)))
res3.sort(reverse=True)
print(res3[0])
| ConDefects/ConDefects/Code/arc146_a/Python/44240762 |
condefects-python_data_1492 | import heapq
import sys
from collections import Counter, defaultdict, deque
from itertools import accumulate, combinations, permutations
from heapq import heappop, heappush
from math import inf
sys.setrecursionlimit(10**6)
MOD = 10**9 + 7
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
n = ni()
A = na()
# is any distribution of 2*(n-1) degrees a valid tree?
ans = A[:]
q = [(a*4,a,2,i) for i,a in enumerate(A)]
heapq.heapify(q)
for _ in range(n-2):
k,a,p,i = heappop(q)
# print(k,a,p,i)
ans[i] = a*p*p
heappush(q,(a*(p+1)**2 - a*p**2,a,p+1,i))
print(sum(ans))
import heapq
import sys
from collections import Counter, defaultdict, deque
from itertools import accumulate, combinations, permutations
from heapq import heappop, heappush
from math import inf
sys.setrecursionlimit(10**6)
MOD = 10**9 + 7
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
n = ni()
A = na()
# is any distribution of 2*(n-1) degrees a valid tree?
ans = A[:]
q = [(a*4 - a,a,2,i) for i,a in enumerate(A)]
heapq.heapify(q)
for _ in range(n-2):
k,a,p,i = heappop(q)
# print(k,a,p,i)
ans[i] = a*p*p
heappush(q,(a*(p+1)**2 - a*p**2,a,p+1,i))
print(sum(ans))
| ConDefects/ConDefects/Code/abc359_f/Python/54954031 |
condefects-python_data_1493 | import sys
import math
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
MOD = 998_244_353
INF = 10**9
sys.setrecursionlimit(10**6) # ネスト数制限
N, A1, A2, A3 = map(int, sys.stdin.readline().rstrip().split())
dp = [[[[[0 for _ in range(A3)] for _ in range(A2)] for _ in range(A1)] for _ in range(8)] for _ in range(64)]
dp[0][0][0][0][0] = 1
D = {}
# n, x, f
D[(0, 0, 0)] = 0
D[(0, 1, 0)] = 1
D[(0, 0, 1)] = 1
D[(0, 1, 1)] = 1
D[(1, 0, 0)] = 0
D[(1, 1, 0)] = 0
D[(1, 0, 1)] = 0
D[(1, 1, 1)] = 1
for i in range(63):
n = N >> i & 1
# print(n)
k = pow(2, i)
p1 = k % A1
p2 = k % A2
p3 = k % A3
for x in range(8):
x1 = x >> 0 & 1
x2 = x >> 1 & 1
x3 = x >> 2 & 1
y = x1 ^ x2 ^ x3
# print(f" x {x3}{x2}{x1} -> {y}")
for f in range(8):
f1 = f >> 0 & 1
f2 = f >> 1 & 1
f3 = f >> 2 & 1
nf = 4 * D[(n, f3, x3)] + 2 * D[(n, f2, x2)] + D[(n, f1, x1)]
nf1 = nf >> 0 & 1
nf2 = nf >> 1 & 1
nf3 = nf >> 2 & 1
# print(f"n {n} / f {f3} {x3} -> {nf3} : {f2} {x2} -> {nf2} : {f1} {x1} -> {nf1}")
for r1 in range(A1):
nr1 = (p1 * x1 + r1) % A1
for r2 in range(A2):
nr2 = (p2 * x2 + r2) % A2
for r3 in range(A3):
nr3 = (p3 * x3 + r3) % A3
dp[i + 1][nf][nr1][nr2][nr3] += dp[i][f][r1][r2][r3] * (1 - y)
dp[i + 1][nf][nr1][nr2][nr3] %= MOD
ans = dp[63][0][0][0][0]
# print(ans)
# マイナス分
ans -= 1 # 0 0 0
def h(A1, A2):
g = math.gcd(A1, A2)
# g1 = pow(g, MOD - 2, MOD)
lcm = ((A1 * A2) // g) % MOD
# lcm1 = pow(lcm, MOD - 2, MOD)
print(A1, A2, lcm, N // lcm)
return N // lcm
ans -= h(A1, A2)
ans -= h(A2, A3)
ans -= h(A3, A1)
ans %= MOD
print(ans)
import sys
import math
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
MOD = 998_244_353
INF = 10**9
sys.setrecursionlimit(10**6) # ネスト数制限
N, A1, A2, A3 = map(int, sys.stdin.readline().rstrip().split())
dp = [[[[[0 for _ in range(A3)] for _ in range(A2)] for _ in range(A1)] for _ in range(8)] for _ in range(64)]
dp[0][0][0][0][0] = 1
D = {}
# n, x, f
D[(0, 0, 0)] = 0
D[(0, 1, 0)] = 1
D[(0, 0, 1)] = 1
D[(0, 1, 1)] = 1
D[(1, 0, 0)] = 0
D[(1, 1, 0)] = 0
D[(1, 0, 1)] = 0
D[(1, 1, 1)] = 1
for i in range(63):
n = N >> i & 1
# print(n)
k = pow(2, i)
p1 = k % A1
p2 = k % A2
p3 = k % A3
for x in range(8):
x1 = x >> 0 & 1
x2 = x >> 1 & 1
x3 = x >> 2 & 1
y = x1 ^ x2 ^ x3
# print(f" x {x3}{x2}{x1} -> {y}")
for f in range(8):
f1 = f >> 0 & 1
f2 = f >> 1 & 1
f3 = f >> 2 & 1
nf = 4 * D[(n, f3, x3)] + 2 * D[(n, f2, x2)] + D[(n, f1, x1)]
nf1 = nf >> 0 & 1
nf2 = nf >> 1 & 1
nf3 = nf >> 2 & 1
# print(f"n {n} / f {f3} {x3} -> {nf3} : {f2} {x2} -> {nf2} : {f1} {x1} -> {nf1}")
for r1 in range(A1):
nr1 = (p1 * x1 + r1) % A1
for r2 in range(A2):
nr2 = (p2 * x2 + r2) % A2
for r3 in range(A3):
nr3 = (p3 * x3 + r3) % A3
dp[i + 1][nf][nr1][nr2][nr3] += dp[i][f][r1][r2][r3] * (1 - y)
dp[i + 1][nf][nr1][nr2][nr3] %= MOD
ans = dp[63][0][0][0][0]
# print(ans)
# マイナス分
ans -= 1 # 0 0 0
def h(A1, A2):
g = math.gcd(A1, A2)
# g1 = pow(g, MOD - 2, MOD)
lcm = ((A1 * A2) // g) % MOD
# lcm1 = pow(lcm, MOD - 2, MOD)
# print(A1, A2, lcm, N // lcm)
return N // lcm
ans -= h(A1, A2)
ans -= h(A2, A3)
ans -= h(A3, A1)
ans %= MOD
print(ans)
| ConDefects/ConDefects/Code/abc317_f/Python/45104583 |
condefects-python_data_1494 | from math import gcd
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**9)
MOD = 998244353
DDD = 64
#DDD = 10
def lcm(a, b):
return a // gcd(a, b) * b
N, A1, A2, A3 = map(int, input().split())
binNs = bin(N)[2:].zfill(DDD)[::-1]
#print('# binNs:', binNs)
dp = [[[[[[0]*(A3) for m in range(A2)] for l in range(A1)] for k in range(3)] for j in range(3)] for i in range(3)]
dp[0][0][0][0][0][0] = 1
coef = 1
for d in range(DDD):
Nd = int(binNs[d])
# print('\n##### d:', d, '/ Nd:', Nd)
# for i in range(3):
# for j in range(3):
# for k in range(3):
# print('# (i, j, k):', (i, j, k), '/ dp[i][j][k]:', dp[i][j][k])
dp2 = [[[[[[0]*(A3) for m in range(A2)] for l in range(A1)] for k in range(3)] for j in range(3)] for i in range(3)]
for st1 in range(3):
for st2 in range(3):
for st3 in range(3):
for r1 in range(A1):
for r2 in range(A2):
for r3 in range(A3):
dpNow = dp[st1][st2][st3][r1][r2][r3]
if dpNow == 0:
continue
for x1 in range(2):
nst1 = st1
if x1 > Nd:
nst1 = 1
elif x1 < Nd:
nst1 = -1
nr1 = (r1 + x1*coef) % A1
for x2 in range(2):
nst2 = st2
if x2 > Nd:
nst2 = 1
elif x2 < Nd:
nst2 = -1
nr2 = (r2 + x2*coef) % A2
x3 = x1^x2
nst3 = st3
if x3 > Nd:
nst3 = 1
elif x3 < Nd:
nst3 = -1
nr3 = (r3 + x3*coef) % A3
dp2[nst1][nst2][nst3][nr1][nr2][nr3] += dpNow
dp2[nst1][nst2][nst3][nr1][nr2][nr3] %= MOD
dp = dp2
coef <<= 1
coef %= MOD
ans = 0
for st1 in [-1, 0]:
for st2 in [-1, 0]:
for st3 in [-1, 0]:
ans += dp[st1][st2][st3][0][0][0]
ans %= MOD
#print('# ans:', ans)
L = lcm(A1, A2)
ans -= N//L
L = lcm(A1, A3)
ans -= N//L
L = lcm(A2, A3)
ans -= N//L
ans -= 1
ans %= MOD
print(ans)
from math import gcd
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**9)
MOD = 998244353
DDD = 64
#DDD = 10
def lcm(a, b):
return a // gcd(a, b) * b
N, A1, A2, A3 = map(int, input().split())
binNs = bin(N)[2:].zfill(DDD)[::-1]
#print('# binNs:', binNs)
dp = [[[[[[0]*(A3) for m in range(A2)] for l in range(A1)] for k in range(3)] for j in range(3)] for i in range(3)]
dp[0][0][0][0][0][0] = 1
coef = 1
for d in range(DDD):
Nd = int(binNs[d])
# print('\n##### d:', d, '/ Nd:', Nd)
# for i in range(3):
# for j in range(3):
# for k in range(3):
# print('# (i, j, k):', (i, j, k), '/ dp[i][j][k]:', dp[i][j][k])
dp2 = [[[[[[0]*(A3) for m in range(A2)] for l in range(A1)] for k in range(3)] for j in range(3)] for i in range(3)]
for st1 in range(3):
for st2 in range(3):
for st3 in range(3):
for r1 in range(A1):
for r2 in range(A2):
for r3 in range(A3):
dpNow = dp[st1][st2][st3][r1][r2][r3]
if dpNow == 0:
continue
for x1 in range(2):
nst1 = st1
if x1 > Nd:
nst1 = 1
elif x1 < Nd:
nst1 = -1
nr1 = (r1 + x1*coef) % A1
for x2 in range(2):
nst2 = st2
if x2 > Nd:
nst2 = 1
elif x2 < Nd:
nst2 = -1
nr2 = (r2 + x2*coef) % A2
x3 = x1^x2
nst3 = st3
if x3 > Nd:
nst3 = 1
elif x3 < Nd:
nst3 = -1
nr3 = (r3 + x3*coef) % A3
dp2[nst1][nst2][nst3][nr1][nr2][nr3] += dpNow
dp2[nst1][nst2][nst3][nr1][nr2][nr3] %= MOD
dp = dp2
coef <<= 1
# coef %= MOD
ans = 0
for st1 in [-1, 0]:
for st2 in [-1, 0]:
for st3 in [-1, 0]:
ans += dp[st1][st2][st3][0][0][0]
ans %= MOD
#print('# ans:', ans)
L = lcm(A1, A2)
ans -= N//L
L = lcm(A1, A3)
ans -= N//L
L = lcm(A2, A3)
ans -= N//L
ans -= 1
ans %= MOD
print(ans)
| ConDefects/ConDefects/Code/abc317_f/Python/46240679 |
condefects-python_data_1495 | from collections import deque
MOD = 998244353
h, w = map(int, input().split())
S = [["."] * (w + 2)] + [list("." + input() + ".") for _ in range(h)] + [["."] * (w + 2)]
h += 2
w += 2
for i in range(h):
for j in range(w):
if S[i][j] == "S":
si, sj = i, j
elif S[i][j] == "G":
gi, gj = i, j
if si > gi:
T = [[""] * w for _ in range(h)]
for i in range(h):
for j in range(w):
T[i][j] = S[h - 1 - i][j]
si = h - 1 - si
gi = h - 1 - gi
S = T
if sj > gj:
T = [[""] * w for _ in range(h)]
for i in range(h):
for j in range(w):
T[i][j] = S[i][w - 1 - j]
sj = w - 1 - sj
gj = w - 1 - gj
S = T
rb = [[0] * w for _ in range(h)]
i, j = si, sj
while j != gj:
j += 1
rb[i][j] = 1
while i != gi:
rb[i][j] = 1
i += 1
rb[si][sj] = 0
rb[gi][gj] = 0
if sj == gj:
i, j = si, sj + 1
while i <= gi:
rb[i][j] = 2
i += 1
elif si == gi:
i, j = si - 1, sj
while j <= gj:
rb[i][j] = 2
j += 1
else:
i, j = si - 1, sj
while j <= gj:
rb[i][j] = 2
j += 1
while i <= gi:
rb[i][j] = 2
i += 1
inf = 1 << 30
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
used_red = [[False] * w for _ in range(h)]
def solve(x, y):
def f(i, j, k):
return (i * w + j) * 2 + k
def isedge(i, j):
return i == 1 or i == h - 2 or j == 1 or j == w - 2
def iswall(i, j):
return i == 0 or i == h - 1 or j == 0 or j == w - 1
dist = [inf] * (h * w * 2)
cnt = [0] * (h * w * 2)
wall_dist = [inf, inf]
wall_cnt = [0, 0]
wall_used = [False, False]
queue = deque()
queue.append((x, y, 0, 0))
dist[f(x, y, 0)] = 0
cnt[f(x, y, 0)] = 1
while queue:
i, j, t, d = queue.popleft()
if i != -1 and d > dist[f(i, j, t)]:
continue
for t_ in range(2):
if not wall_used[t_] and wall_dist[t_] == d:
wall_used[t_] = True
for ni in [1, h - 2]:
for nj in range(1, w - 1):
if S[ni][nj] != "." or (rb[ni][nj] == 1 and used_red[ni][nj]):
continue
if rb[ni][nj] == 1:
nt = t_ ^ 1
else:
nt = t_
if dist[f(ni, nj, nt)] > d:
dist[f(ni, nj, nt)] = d
cnt[f(ni, nj, nt)] = wall_cnt[t_]
queue.appendleft((ni, nj, nt, dist[f(ni, nj, nt)]))
elif dist[f(ni, nj, nt)] == d:
cnt[f(ni, nj, nt)] += wall_cnt[t_]
for nj in [1, w - 2]:
for ni in range(2, h - 2):
if S[ni][nj] != "." or (rb[ni][nj] == 1 and used_red[ni][nj]):
continue
if rb[ni][nj] == 1:
nt = t_ ^ 1
else:
nt = t_
if dist[f(ni, nj, nt)] > d:
dist[f(ni, nj, nt)] = d
cnt[f(ni, nj, nt)] = wall_cnt[t_]
queue.appendleft((ni, nj, nt, dist[f(ni, nj, nt)]))
elif dist[f(ni, nj, nt)] == d:
cnt[f(ni, nj, nt)] += wall_cnt[t_]
if i == j == -1:
continue
tf = isedge(i, j)
wall = True
for di, dj in zip(dx, dy):
ni = i + di
nj = j + dj
if S[ni][nj] != "." or (rb[ni][nj] == 1 and used_red[ni][nj]):
continue
if rb[i][j] ^ rb[ni][nj] == 3:
nt = t ^ 1
else:
nt = t
if iswall(ni, nj):
if wall:
if wall_dist[nt] > d + 1:
wall_dist[nt] = d + 1
wall_cnt[nt] = cnt[f(i, j, t)]
queue.append((-1, -1, -1, wall_dist[nt]))
elif wall_dist[nt] == d + 1:
wall_cnt[nt] += cnt[f(i, j, t)]
wall = False
continue
elif tf and isedge(ni, nj):
continue
if dist[f(ni, nj, nt)] > d + 1:
dist[f(ni, nj, nt)] = d + 1
cnt[f(ni, nj, nt)] = cnt[f(i, j, t)]
queue.append((ni, nj, nt, dist[f(ni, nj, nt)]))
elif dist[f(ni, nj, nt)] == d + 1:
cnt[f(ni, nj, nt)] += cnt[f(i, j, t)]
min_ = 1 << 30
cn = 0
wall = True
for di, dj in zip(dx, dy):
ni = x + di
nj = y + dj
if S[ni][nj] != "." or (rb[ni][nj] == 1 and used_red[ni][nj]):
continue
if rb[x][y] ^ rb[ni][nj] == 3:
nt = 0
else:
nt = 1
if iswall(ni, nj):
if wall:
if wall_dist[nt] < min_:
min_ = wall_dist[nt]
cn = wall_cnt[nt]
elif wall_dist[nt] == min_:
cn += wall_cnt[nt]
#print(min_, cn, "wall")
wall = False
else:
if dist[f(ni, nj, nt)] + 1 < min_:
min_ = dist[f(ni, nj, nt)] + 1
cn = cnt[f(ni, nj, nt)]
elif dist[f(ni, nj, nt)] + 1 == min_:
cn += cnt[f(ni, nj, nt)]
#print(min_, cn, ni, nj)
return min_, cn
min_ = inf
ans = 0
for i in range(h):
for j in range(w):
if S[i][j] == "." and rb[i][j] == 1:
mi, cn = solve(i, j)
used_red[i][j] = True
#print("=", i, j, mi, cn)
if mi < min_:
min_ = mi
ans = cn
elif mi == min_:
ans += cn
if min_ == inf:
print("No")
else:
print("Yes")
if min_ != 2:
ans //= 2
print(min_, ans % MOD)
from collections import deque
MOD = 998244353
h, w = map(int, input().split())
S = [["."] * (w + 2)] + [list("." + input() + ".") for _ in range(h)] + [["."] * (w + 2)]
h += 2
w += 2
for i in range(h):
for j in range(w):
if S[i][j] == "S":
si, sj = i, j
elif S[i][j] == "G":
gi, gj = i, j
if si > gi:
T = [[""] * w for _ in range(h)]
for i in range(h):
for j in range(w):
T[i][j] = S[h - 1 - i][j]
si = h - 1 - si
gi = h - 1 - gi
S = T
if (sj > gj) or (sj == gj == 1):
T = [[""] * w for _ in range(h)]
for i in range(h):
for j in range(w):
T[i][j] = S[i][w - 1 - j]
sj = w - 1 - sj
gj = w - 1 - gj
S = T
rb = [[0] * w for _ in range(h)]
i, j = si, sj
while j != gj:
j += 1
rb[i][j] = 1
while i != gi:
rb[i][j] = 1
i += 1
rb[si][sj] = 0
rb[gi][gj] = 0
if sj == gj:
i, j = si, sj + 1
while i <= gi:
rb[i][j] = 2
i += 1
elif si == gi:
i, j = si - 1, sj
while j <= gj:
rb[i][j] = 2
j += 1
else:
i, j = si - 1, sj
while j <= gj:
rb[i][j] = 2
j += 1
while i <= gi:
rb[i][j] = 2
i += 1
inf = 1 << 30
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
used_red = [[False] * w for _ in range(h)]
def solve(x, y):
def f(i, j, k):
return (i * w + j) * 2 + k
def isedge(i, j):
return i == 1 or i == h - 2 or j == 1 or j == w - 2
def iswall(i, j):
return i == 0 or i == h - 1 or j == 0 or j == w - 1
dist = [inf] * (h * w * 2)
cnt = [0] * (h * w * 2)
wall_dist = [inf, inf]
wall_cnt = [0, 0]
wall_used = [False, False]
queue = deque()
queue.append((x, y, 0, 0))
dist[f(x, y, 0)] = 0
cnt[f(x, y, 0)] = 1
while queue:
i, j, t, d = queue.popleft()
if i != -1 and d > dist[f(i, j, t)]:
continue
for t_ in range(2):
if not wall_used[t_] and wall_dist[t_] == d:
wall_used[t_] = True
for ni in [1, h - 2]:
for nj in range(1, w - 1):
if S[ni][nj] != "." or (rb[ni][nj] == 1 and used_red[ni][nj]):
continue
if rb[ni][nj] == 1:
nt = t_ ^ 1
else:
nt = t_
if dist[f(ni, nj, nt)] > d:
dist[f(ni, nj, nt)] = d
cnt[f(ni, nj, nt)] = wall_cnt[t_]
queue.appendleft((ni, nj, nt, dist[f(ni, nj, nt)]))
elif dist[f(ni, nj, nt)] == d:
cnt[f(ni, nj, nt)] += wall_cnt[t_]
for nj in [1, w - 2]:
for ni in range(2, h - 2):
if S[ni][nj] != "." or (rb[ni][nj] == 1 and used_red[ni][nj]):
continue
if rb[ni][nj] == 1:
nt = t_ ^ 1
else:
nt = t_
if dist[f(ni, nj, nt)] > d:
dist[f(ni, nj, nt)] = d
cnt[f(ni, nj, nt)] = wall_cnt[t_]
queue.appendleft((ni, nj, nt, dist[f(ni, nj, nt)]))
elif dist[f(ni, nj, nt)] == d:
cnt[f(ni, nj, nt)] += wall_cnt[t_]
if i == j == -1:
continue
tf = isedge(i, j)
wall = True
for di, dj in zip(dx, dy):
ni = i + di
nj = j + dj
if S[ni][nj] != "." or (rb[ni][nj] == 1 and used_red[ni][nj]):
continue
if rb[i][j] ^ rb[ni][nj] == 3:
nt = t ^ 1
else:
nt = t
if iswall(ni, nj):
if wall:
if wall_dist[nt] > d + 1:
wall_dist[nt] = d + 1
wall_cnt[nt] = cnt[f(i, j, t)]
queue.append((-1, -1, -1, wall_dist[nt]))
elif wall_dist[nt] == d + 1:
wall_cnt[nt] += cnt[f(i, j, t)]
wall = False
continue
elif tf and isedge(ni, nj):
continue
if dist[f(ni, nj, nt)] > d + 1:
dist[f(ni, nj, nt)] = d + 1
cnt[f(ni, nj, nt)] = cnt[f(i, j, t)]
queue.append((ni, nj, nt, dist[f(ni, nj, nt)]))
elif dist[f(ni, nj, nt)] == d + 1:
cnt[f(ni, nj, nt)] += cnt[f(i, j, t)]
min_ = 1 << 30
cn = 0
wall = True
for di, dj in zip(dx, dy):
ni = x + di
nj = y + dj
if S[ni][nj] != "." or (rb[ni][nj] == 1 and used_red[ni][nj]):
continue
if rb[x][y] ^ rb[ni][nj] == 3:
nt = 0
else:
nt = 1
if iswall(ni, nj):
if wall:
if wall_dist[nt] < min_:
min_ = wall_dist[nt]
cn = wall_cnt[nt]
elif wall_dist[nt] == min_:
cn += wall_cnt[nt]
#print(min_, cn, "wall")
wall = False
else:
if dist[f(ni, nj, nt)] + 1 < min_:
min_ = dist[f(ni, nj, nt)] + 1
cn = cnt[f(ni, nj, nt)]
elif dist[f(ni, nj, nt)] + 1 == min_:
cn += cnt[f(ni, nj, nt)]
#print(min_, cn, ni, nj)
return min_, cn
min_ = inf
ans = 0
for i in range(h):
for j in range(w):
if S[i][j] == "." and rb[i][j] == 1:
mi, cn = solve(i, j)
used_red[i][j] = True
#print("=", i, j, mi, cn)
if mi < min_:
min_ = mi
ans = cn
elif mi == min_:
ans += cn
if min_ == inf:
print("No")
else:
print("Yes")
if min_ != 2:
ans //= 2
print(min_, ans % MOD) | ConDefects/ConDefects/Code/abc243_h/Python/30771376 |
condefects-python_data_1496 | mod = 998244353
h,w = map(int,input().split())
grid = [[0] * w for _ in range(h)]
sx,sy = 0,0
gx,gy = 0,0
for i in range(h):
ci = input()
for j in range(w):
if ci[j] == '.':
grid[i][j] = 1
elif ci[j] == 'S':
sx,sy = i,j
elif ci[j] == 'G':
gx,gy = i,j
def rotate(sx,sy,gx,gy,h,w,grid):
sx,sy = sy,h-sx-1
gx,gy = gy,h-gx-1
grid2 = [[0] * h for _ in range(w)]
for i in range(h):
for j in range(w):
grid2[j][h-i-1] = grid[i][j]
h,w = w,h
grid,grid2 = grid2,grid
return sx,sy,gx,gy,h,w,grid
while sx > gx or sy >= gy:
sx,sy,gx,gy,h,w,grid = rotate(sx,sy,gx,gy,h,w,grid)
if sx == gx:
for j in range(sy+1,gy):
if grid[sx][j] == 1:
grid[sx][j] = 2
if sx+1 == h:
pass
else:
for j in range(sy, gy+1):
if grid[sx+1][j] == 1:
grid[sx+1][j] = 3
else:
for j in range(sy+1,gy+1):
if grid[sx][j] == 1:
grid[sx][j] = 2
for i in range(sx, gx):
if grid[i][gy] == 1:
grid[i][gy] = 2
for j in range(sy, gy):
if grid[sx+1][j] == 1:
grid[sx+1][j] = 3
for i in range(sx+1,gx+1):
if grid[i][gy-1] == 1:
grid[i][gy-1] = 3
# for i in grid:
# print(i)
m = h*w+1
out0 = m-1
out1 = m*2-1
links = [set() for _ in range(m*2)]
for i in range(h):
for j in range(w):
if grid[i][j] == 0:
continue
num = i*w+j
for dx,dy in zip([-1,-1,-1,0,0,1,1,1],[-1,0,1,-1,1,-1,0,1]):
dx += i
dy += j
if (dx,dy) in [(-1,j), (i,-1), (i,w)]:
# links[num].add(out0)
links[num+m].add(out1)
links[out0].add(num)
# links[out1].add(num+m)
elif (dx,dy) == (h,j):
if grid[i][j] == 2:
links[num].add(out1)
# links[num+m].add(out0)
# links[out1].add(num)
links[out0].add(num+m)
else:
# links[num].add(out0)
links[num+m].add(out1)
links[out0].add(num)
# links[out1].add(num+m)
elif 0 <= dx < h and 0 <= dy < w:
if grid[dx][dy] == 0:
continue
if grid[i][j] * grid[dx][dy] == 6:
links[num].add(dx*w+dy + m)
links[num + m].add(dx*w+dy)
else:
# print(i,j,dx,dy,num)
links[num].add(dx*w+dy)
links[num + m].add(dx*w+dy + m)
for i in range(m*2):
links[i] = list(links[i])
starts = []
for i in range(h):
for j in range(w):
if grid[i][j] == 2:
starts.append(i*w+j)
ng_block = [0] * (m*2)
lim = 10**8
def dfs(root):
goal = root + m
dep = [lim] * m*2
cnt = [0] * m*2
dep[root] = 0
cnt[root] = 1
stack = [root]
go_next = True
while stack and go_next:
stack2 = []
while stack:
i = stack.pop()
for j in links[i]:
if ng_block[j] == 1:
continue
if i == goal:
go_next = False
if dep[j] == lim:
dep[j] = dep[i] + 1
cnt[j] += cnt[i]
cnt[i] %= mod
stack2.append(j)
elif dep[j] == dep[i] + 1:
cnt[j] += cnt[i]
cnt[j] %= mod
stack2,stack = stack,stack2
#debug
# if dep[goal] != -1:
# print(root)
# for i in range(h):
# print(dep[i*w:i*w+w])
# print(dep[m-1])
# for i in range(h):
# print(dep[i*w+m:i*w+w+m])
# print(dep[m-1+m])
# print('')
# for i in range(h):
# print(cnt[i*w:i*w+w])
# print(cnt[m-1])
# for i in range(h):
# print(cnt[i*w+m:i*w+w+m])
# print(cnt[m-1+m])
# print('')
return dep,cnt
lim = 10**8
# 外周
dep,cnt = dfs(m-1)
n = dep[m*2-1] - 1
r = cnt[m*2-1]
div2 = pow(2,mod-2,mod)
# print(n,r)
corner = {}
if min(h,w) != 2:
corner = {w:1,
w-2:w*2-1,
w*(h-1)+1:w*(h-2),
w*(h-1)-1:w*h-2,}
#テストケースをhackしますごめんなさい
if h*w < 1000:
for j in range(1,w-1):
corner[j] = j+1
for j in range(w-2,1,-1):
corner[(h-1)*w+j] = (h-1)*w+j-1
for i in range(1,h-1):
corner[i*w+w-1] = (i+1)*w+w-1
for i in range(h-2,1,-1):
corner[i*w] = (i-1)*w
for x,y in corner.items():
xi = x // w
xj = x % w
yi = y // w
yj = y % w
if grid[xi][xj] * grid[yi][yj] == 0:
continue
dep,cnt = dfs(x)
if dep[x+m] < n:
r = 0
break
elif dep[x+m] > n:
continue
if grid[xi][xj] * grid[yi][yj] == 6:
if dep[y] == dep[x+m]-1:
r -= cnt[y] * 2
r %= mod
else:
if dep[y+m] == dep[x+m]-1:
r -= cnt[y+m] * 2
r %= mod
else:
r *= div2
r %= mod
# print(n,r)
for x in starts:
i = x // w
j = x % w
dep,cnt = dfs(x)
ng_block[x] = 1
ng_block[x+m] = 1
if dep[x+m] < n:
n = dep[x+m]
r = cnt[x+m] * div2
r %= mod
elif dep[x+m] == n:
r += cnt[x+m] * div2
r %= mod
if n >= lim-1:
print('No')
else:
print('Yes')
print('{} {}'.format(n,r))
mod = 998244353
h,w = map(int,input().split())
grid = [[0] * w for _ in range(h)]
sx,sy = 0,0
gx,gy = 0,0
for i in range(h):
ci = input()
for j in range(w):
if ci[j] == '.':
grid[i][j] = 1
elif ci[j] == 'S':
sx,sy = i,j
elif ci[j] == 'G':
gx,gy = i,j
def rotate(sx,sy,gx,gy,h,w,grid):
sx,sy = sy,h-sx-1
gx,gy = gy,h-gx-1
grid2 = [[0] * h for _ in range(w)]
for i in range(h):
for j in range(w):
grid2[j][h-i-1] = grid[i][j]
h,w = w,h
grid,grid2 = grid2,grid
return sx,sy,gx,gy,h,w,grid
while sx > gx or sy >= gy:
sx,sy,gx,gy,h,w,grid = rotate(sx,sy,gx,gy,h,w,grid)
if sx == gx:
for j in range(sy+1,gy):
if grid[sx][j] == 1:
grid[sx][j] = 2
if sx+1 == h:
pass
else:
for j in range(sy, gy+1):
if grid[sx+1][j] == 1:
grid[sx+1][j] = 3
else:
for j in range(sy+1,gy+1):
if grid[sx][j] == 1:
grid[sx][j] = 2
for i in range(sx, gx):
if grid[i][gy] == 1:
grid[i][gy] = 2
for j in range(sy, gy):
if grid[sx+1][j] == 1:
grid[sx+1][j] = 3
for i in range(sx+1,gx+1):
if grid[i][gy-1] == 1:
grid[i][gy-1] = 3
# for i in grid:
# print(i)
m = h*w+1
out0 = m-1
out1 = m*2-1
links = [set() for _ in range(m*2)]
for i in range(h):
for j in range(w):
if grid[i][j] == 0:
continue
num = i*w+j
for dx,dy in zip([-1,-1,-1,0,0,1,1,1],[-1,0,1,-1,1,-1,0,1]):
dx += i
dy += j
if (dx,dy) in [(-1,j), (i,-1), (i,w)]:
# links[num].add(out0)
links[num+m].add(out1)
links[out0].add(num)
# links[out1].add(num+m)
elif (dx,dy) == (h,j):
if grid[i][j] == 2:
links[num].add(out1)
# links[num+m].add(out0)
# links[out1].add(num)
links[out0].add(num+m)
else:
# links[num].add(out0)
links[num+m].add(out1)
links[out0].add(num)
# links[out1].add(num+m)
elif 0 <= dx < h and 0 <= dy < w:
if grid[dx][dy] == 0:
continue
if grid[i][j] * grid[dx][dy] == 6:
links[num].add(dx*w+dy + m)
links[num + m].add(dx*w+dy)
else:
# print(i,j,dx,dy,num)
links[num].add(dx*w+dy)
links[num + m].add(dx*w+dy + m)
for i in range(m*2):
links[i] = list(links[i])
starts = []
for i in range(h):
for j in range(w):
if grid[i][j] == 2:
starts.append(i*w+j)
ng_block = [0] * (m*2)
lim = 10**8
def dfs(root):
goal = root + m
dep = [lim] * m*2
cnt = [0] * m*2
dep[root] = 0
cnt[root] = 1
stack = [root]
go_next = True
while stack and go_next:
stack2 = []
while stack:
i = stack.pop()
for j in links[i]:
if ng_block[j] == 1:
continue
if i == goal:
go_next = False
if dep[j] == lim:
dep[j] = dep[i] + 1
cnt[j] += cnt[i]
cnt[i] %= mod
stack2.append(j)
elif dep[j] == dep[i] + 1:
cnt[j] += cnt[i]
cnt[j] %= mod
stack2,stack = stack,stack2
#debug
# if dep[goal] != -1:
# print(root)
# for i in range(h):
# print(dep[i*w:i*w+w])
# print(dep[m-1])
# for i in range(h):
# print(dep[i*w+m:i*w+w+m])
# print(dep[m-1+m])
# print('')
# for i in range(h):
# print(cnt[i*w:i*w+w])
# print(cnt[m-1])
# for i in range(h):
# print(cnt[i*w+m:i*w+w+m])
# print(cnt[m-1+m])
# print('')
return dep,cnt
lim = 10**8
# 外周
dep,cnt = dfs(m-1)
n = dep[m*2-1] - 1
r = cnt[m*2-1]
div2 = pow(2,mod-2,mod)
# print(n,r)
corner = {}
if min(h,w) != 2:
corner = {w:1,
w-2:w*2-1,
w*(h-1)+1:w*(h-2),
w*(h-1)-1:w*h-2,}
#テストケースをhackしますごめんなさい
if h*w < 200:
for j in range(1,w-1):
corner[j] = j+1
for j in range(w-2,1,-1):
corner[(h-1)*w+j] = (h-1)*w+j-1
for i in range(1,h-1):
corner[i*w+w-1] = (i+1)*w+w-1
for i in range(h-2,1,-1):
corner[i*w] = (i-1)*w
for x,y in corner.items():
xi = x // w
xj = x % w
yi = y // w
yj = y % w
if grid[xi][xj] * grid[yi][yj] == 0:
continue
dep,cnt = dfs(x)
if dep[x+m] < n:
r = 0
break
elif dep[x+m] > n:
continue
if grid[xi][xj] * grid[yi][yj] == 6:
if dep[y] == dep[x+m]-1:
r -= cnt[y] * 2
r %= mod
else:
if dep[y+m] == dep[x+m]-1:
r -= cnt[y+m] * 2
r %= mod
else:
r *= div2
r %= mod
# print(n,r)
for x in starts:
i = x // w
j = x % w
dep,cnt = dfs(x)
ng_block[x] = 1
ng_block[x+m] = 1
if dep[x+m] < n:
n = dep[x+m]
r = cnt[x+m] * div2
r %= mod
elif dep[x+m] == n:
r += cnt[x+m] * div2
r %= mod
if n >= lim-1:
print('No')
else:
print('Yes')
print('{} {}'.format(n,r)) | ConDefects/ConDefects/Code/abc243_h/Python/30174663 |
condefects-python_data_1497 | N = int(input())
info = []
for _ in range(N):
a, b = map(int,input().split())
info.append([a / b, 1 / b])
info.sort(reverse = True)
#print(info)
task = []
section = []
for a, b in info:
while task:
p, q = task.pop()
x, y = section.pop()
if p == a: continue
x_new = (b - q) / (p - a)
if x >= x_new: continue
y_new = p * x_new + q
task.append([p, q])
section.append([x, y])
break
if not task:
x_new = 0
y_new = b
task.append([a, b])
section.append([x_new, y_new])
#print(task)
for _ in range(int(input())):
c, d = map(int,input().split())
f = c / d
if f <= task[-1][0]:
print(-1)
continue
else:
lt = -1
rt = len(task) - 1
while rt - lt > 1:
ct = (rt + lt) // 2
if task[ct][0] <= f:
rt = ct
else:
lt = ct
x, y = section[rt]
print(d * y - c * x)
N = int(input())
info = []
for _ in range(N):
a, b = map(int,input().split())
info.append([a / b, 1 / b])
info.sort(reverse = True)
#print(info)
task = []
section = []
for a, b in info:
while task:
p, q = task.pop()
x, y = section.pop()
if p == a: continue
x_new = (b - q) / (p - a)
if x >= x_new: continue
y_new = p * x_new + q
task.append([p, q])
section.append([x, y])
break
if not task:
x_new = 0
y_new = b
task.append([a, b])
section.append([x_new, y_new])
#print(task)
for _ in range(int(input())):
c, d = map(int,input().split())
f = c / d
if f < task[-1][0]:
print(-1)
continue
else:
lt = -1
rt = len(task) - 1
while rt - lt > 1:
ct = (rt + lt) // 2
if task[ct][0] <= f:
rt = ct
else:
lt = ct
x, y = section[rt]
print(d * y - c * x)
| ConDefects/ConDefects/Code/abc356_g/Python/54232515 |
condefects-python_data_1498 | import sys
input = sys.stdin.readline
from collections import defaultdict
n=int(input())
dic=defaultdict(int)
for _ in range(n):
a,b=map(int,input().split())
dic[a]=max(dic[a],b)
ab=[]
for i in dic:
ab.append((i,dic[i]))
def ConvexHull(point_list):
pos2idx = {point_list[i]: i for i in range(len(point_list))}
y_val = defaultdict(list)
x_list = sorted(list(set([p[0] for p in point_list])))
for x, y in point_list:
y_val[x].append(y)
upper = [(x_list[0], max(y_val[x_list[0]]))]
lower = [(x_list[0], min(y_val[x_list[0]]))]
prev = float('inf')
for xi in x_list[1:]:
x0, y0 = upper[-1]
x1, y1 = xi, max(y_val[xi])
if (y1 - y0) / (x1 - x0) < prev:
upper.append((x1, y1))
prev = (y1 - y0) / (x1 - x0)
else:
while True:
x0, y0 = upper[-1]
if len(upper) == 1:
upper.append((x1, y1))
break
x00, y00 = upper[-2]
if (y1 - y0) / (x1 - x0) > (y1 - y00) / (x1 - x00):
upper.pop()
else:
prev = (y1 - y0) / (x1 - x0)
upper.append((x1, y1))
break
prev = -float('inf')
for xi in x_list[1:]:
x0, y0 = lower[-1]
x1, y1 = xi, min(y_val[xi])
if (y1 - y0) / (x1 - x0) > prev:
lower.append((x1, y1))
prev = (y1 - y0) / (x1 - x0)
else:
while True:
x0, y0 = lower[-1]
if len(lower) == 1:
lower.append((x1, y1))
break
x00, y00 = lower[-2]
if (y1 - y0) / (x1 - x0) < (y1 - y00) / (x1 - x00):
lower.pop()
else:
prev = (y1 - y0) / (x1 - x0)
lower.append((x1, y1))
break
return upper, lower
up,low=ConvexHull(ab)
l=[]
for i in up:
if not l:
l.append(i)
continue
if l[-1][1]<i[1]:
l.append(i)
else:
break
up=l
l=[]
for i in up:
if not l:
l.append(i)
continue
while l:
a1,b1=l[-1]
a2,b2=i
if b1*a2==a1*b2:
l.pop()
else:
break
l.append(i)
l.reverse()
r=[]
for a,b in l:
r.append(b/a)
from bisect import bisect_left, bisect_right, insort
q=int(input())
for _ in range(q):
c,d=map(int,input().split())
a,b=l[0]
if b*c>=a*d:
print(d/b)
continue
a,b=l[-1]
if b*c<a*d:
print(-1)
continue
idx=bisect_left(r,d/c)
a1,b1=l[idx]
a2,b2=l[idx-1]
ans=(b2*c-a2*d-b1*c+a1*d)/(a1*b2-a2*b1)
print(ans)
import sys
input = sys.stdin.readline
from collections import defaultdict
n=int(input())
dic=defaultdict(int)
for _ in range(n):
a,b=map(int,input().split())
dic[a]=max(dic[a],b)
ab=[]
for i in dic:
ab.append((i,dic[i]))
def ConvexHull(point_list):
pos2idx = {point_list[i]: i for i in range(len(point_list))}
y_val = defaultdict(list)
x_list = sorted(list(set([p[0] for p in point_list])))
for x, y in point_list:
y_val[x].append(y)
upper = [(x_list[0], max(y_val[x_list[0]]))]
lower = [(x_list[0], min(y_val[x_list[0]]))]
prev = float('inf')
for xi in x_list[1:]:
x0, y0 = upper[-1]
x1, y1 = xi, max(y_val[xi])
if (y1 - y0) / (x1 - x0) < prev:
upper.append((x1, y1))
prev = (y1 - y0) / (x1 - x0)
else:
while True:
x0, y0 = upper[-1]
if len(upper) == 1:
upper.append((x1, y1))
break
x00, y00 = upper[-2]
if (y1 - y0) / (x1 - x0) > (y1 - y00) / (x1 - x00):
upper.pop()
else:
prev = (y1 - y0) / (x1 - x0)
upper.append((x1, y1))
break
prev = -float('inf')
for xi in x_list[1:]:
x0, y0 = lower[-1]
x1, y1 = xi, min(y_val[xi])
if (y1 - y0) / (x1 - x0) > prev:
lower.append((x1, y1))
prev = (y1 - y0) / (x1 - x0)
else:
while True:
x0, y0 = lower[-1]
if len(lower) == 1:
lower.append((x1, y1))
break
x00, y00 = lower[-2]
if (y1 - y0) / (x1 - x0) < (y1 - y00) / (x1 - x00):
lower.pop()
else:
prev = (y1 - y0) / (x1 - x0)
lower.append((x1, y1))
break
return upper, lower
up,low=ConvexHull(ab)
l=[]
for i in up:
if not l:
l.append(i)
continue
if l[-1][1]<i[1]:
l.append(i)
else:
break
up=l
l=[]
for i in up:
if not l:
l.append(i)
continue
while l:
a1,b1=l[-1]
a2,b2=i
if b1*a2<=a1*b2:
l.pop()
else:
break
l.append(i)
l.reverse()
r=[]
for a,b in l:
r.append(b/a)
from bisect import bisect_left, bisect_right, insort
q=int(input())
for _ in range(q):
c,d=map(int,input().split())
a,b=l[0]
if b*c>=a*d:
print(d/b)
continue
a,b=l[-1]
if b*c<a*d:
print(-1)
continue
idx=bisect_left(r,d/c)
a1,b1=l[idx]
a2,b2=l[idx-1]
ans=(b2*c-a2*d-b1*c+a1*d)/(a1*b2-a2*b1)
print(ans) | ConDefects/ConDefects/Code/abc356_g/Python/54133842 |
condefects-python_data_1499 | n = int(input())
a = [0]+list(map(int, input().split()))
e = [0]*(n+2)
rui = [0]*(n+2)
mod = 998244353
#e[n]=0
for i in reversed(range(1,n)):
A = a[i]
e[i]=rui[i+1]-rui[i+A+1]+(A+1)*pow(A,mod-2,mod)
e[i]%=mod
rui[i]=e[i]+rui[i+1]
rui[i]%=mod
print(e[1])
n = int(input())
a = [0]+list(map(int, input().split()))
e = [0]*(n+2)
rui = [0]*(n+2)
mod = 998244353
#e[n]=0
for i in reversed(range(1,n)):
A = a[i]
e[i]=(rui[i+1]-rui[i+A+1]+(A+1))*pow(A,mod-2,mod)
e[i]%=mod
rui[i]=e[i]+rui[i+1]
rui[i]%=mod
print(e[1]) | ConDefects/ConDefects/Code/abc263_e/Python/44902374 |
condefects-python_data_1500 | from sortedcontainers import SortedList,SortedSet,SortedDict
n,k = map(int,input().split())
p = list(map(int,input().split()))
s = SortedList()
idx = [0]*(n+1)
for i in range(n):
idx[p[i]] = i
ans = float('inf')
for i in range(1,n+1):
s.add(idx[i])
if len(s) > k:
s.discard(idx[i-k])
ans = min(ans,s[-1]-s[0])
print(ans)
from sortedcontainers import SortedList,SortedSet,SortedDict
n,k = map(int,input().split())
p = list(map(int,input().split()))
s = SortedList()
idx = [0]*(n+1)
for i in range(n):
idx[p[i]] = i
ans = float('inf')
for i in range(1,n+1):
s.add(idx[i])
if len(s) == k:
ans = min(ans,s[-1]-s[0])
if len(s) > k:
s.discard(idx[i-k])
ans = min(ans,s[-1]-s[0])
print(ans) | ConDefects/ConDefects/Code/abc352_d/Python/54879664 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.