id
stringlengths 24
27
| content
stringlengths 37
384k
| max_stars_repo_path
stringlengths 51
51
|
|---|---|---|
condefects-python_data_1601
|
N, M = map(int, input().split())
P = [None] * N
C = [None] * N
F = [None] * N
for i in range(N):
tmp = list(map(int, input().split()))
P[i], C[i], F[i] = tmp[0], tmp[1], set(tmp[2:])
flag = False
for i in range(N):
for j in range(N):
if P[i] >= P[i] and F[j] >= F[i] and (P[i] > P[j] or (F[i] - F[j])):
flag = True
break
if flag:
break
if flag:
print("Yes")
else:
print("No")
N, M = map(int, input().split())
P = [None] * N
C = [None] * N
F = [None] * N
for i in range(N):
tmp = list(map(int, input().split()))
P[i], C[i], F[i] = tmp[0], tmp[1], set(tmp[2:])
flag = False
for i in range(N):
for j in range(N):
if P[i] >= P[j] and F[j] >= F[i] and (P[i] > P[j] or (F[j] - F[i])):
flag = True
break
if flag:
break
if flag:
print("Yes")
else:
print("No")
|
ConDefects/ConDefects/Code/abc310_b/Python/45952354
|
condefects-python_data_1602
|
N, M = map(int, input().split())
I = [list(map(int, input().split())) for _ in range(N)]
for i in range(N):
for j in range(N):
if i == j:
continue
if I[i][0] >= I[j][0]:
fj = set(I[j][2:])
fi = set(I[i][2:])
if len((fj | fi)) == len(fj):
if I[i][0] > I[j][0] or len((fj | fi)) - len(fj) > 0:
print('Yes')
exit()
print('No')
N, M = map(int, input().split())
I = [list(map(int, input().split())) for _ in range(N)]
for i in range(N):
for j in range(N):
if i == j:
continue
if I[i][0] >= I[j][0]:
fj = set(I[j][2:])
fi = set(I[i][2:])
if len((fj | fi)) == len(fj):
if I[i][0] > I[j][0] or len((fj | fi)) - len(fi) > 0:
print('Yes')
exit()
print('No')
|
ConDefects/ConDefects/Code/abc310_b/Python/45953433
|
condefects-python_data_1603
|
#提出コード------------------------------
import itertools
import sys
sys.setrecursionlimit(10**6)
def IN(): return int(input())
def IS(): return input()
def INL(): return list(map(int,input().split()))
def ITN(): return map(int,input().split())
N,M = ITN()
Price_and_func = [list(map(int,input().split())) for _ in range(N)]
def condition(l1,l2):
if l1[0] >= l2[0]:
if (set(l1[2:]) & set(l2[2:])) == set(l1[2:]):
if len(l2) > len(l1):
return True
else:
return False
else:
return False
else:
return False
for i in range(N):
for j in range(N):
if i == j: continue
if condition(Price_and_func[i],Price_and_func[j]) == True:
print('Yes')
exit()
print('No')
#提出コード------------------------------
import itertools
import sys
sys.setrecursionlimit(10**6)
def IN(): return int(input())
def IS(): return input()
def INL(): return list(map(int,input().split()))
def ITN(): return map(int,input().split())
N,M = ITN()
Price_and_func = [list(map(int,input().split())) for _ in range(N)]
def condition(l1,l2):
if l1[0] >= l2[0]:
if (set(l1[2:]) & set(l2[2:])) == set(l1[2:]):
if len(l2) > len(l1) or (l1 > l2):
return True
else:
return False
else:
return False
else:
return False
for i in range(N):
for j in range(N):
if i == j: continue
if condition(Price_and_func[i],Price_and_func[j]) == True:
print('Yes')
exit()
print('No')
|
ConDefects/ConDefects/Code/abc310_b/Python/46217262
|
condefects-python_data_1604
|
def main():
# input
# N:商品数 M:最大機能値
N, M = map(int,input().split())
# init
PCF = [0 for _ in range(N)]
# P:価格 C:機能数 F:機能
for i in range(N):
# 0-N個
PCF[i] = list(map(int,input().split()))
# print(PCF)
ans = False
# 総当たりで確認
for i in range(N):
# C
P_i = PCF[i][0]
# F
F_i = PCF[i][2:PCF[i][1]+2]
for j in range(N):#i+1
# C
P_j = PCF[j][0]
# F
F_j = PCF[j][2:PCF[j][1]+2]
# すべて満たす条件
if (P_i > P_j) and (set(F_j) >= set(F_i)) and ((P_i > P_j) or (set(F_j) > set(F_i))):
ans = True # True == 1
# print(i,j,F_i,F_j)
# output
if ans:
print("Yes")
else:
print("No")
main()
def main():
# input
# N:商品数 M:最大機能値
N, M = map(int,input().split())
# init
PCF = [0 for _ in range(N)]
# P:価格 C:機能数 F:機能
for i in range(N):
# 0-N個
PCF[i] = list(map(int,input().split()))
# print(PCF)
ans = False
# 総当たりで確認
for i in range(N):
# C
P_i = PCF[i][0]
# F
F_i = PCF[i][2:PCF[i][1]+2]
for j in range(N):#i+1
# C
P_j = PCF[j][0]
# F
F_j = PCF[j][2:PCF[j][1]+2]
# すべて満たす条件
if (P_i >= P_j) and (set(F_j) >= set(F_i)) and ((P_i > P_j) or (set(F_j) > set(F_i))):
ans = True # True == 1
# print(i,j,F_i,F_j)
# output
if ans:
print("Yes")
else:
print("No")
main()
|
ConDefects/ConDefects/Code/abc310_b/Python/46051370
|
condefects-python_data_1605
|
n,m=map(int,input().split())
s=[]
for i in range(n):
p,c,*f=map(int,input().split())
s.append([p,c,f])
for i in range(n):
for j in range(n):
if i!=j and s[i][0]>=s[j][1] and set(s[j][2])>=set(s[i][2]) \
and (s[i][0]>s[j][0] or set(s[j][2])-set(s[i][2])):
print("Yes")
exit()
print("No")
n,m=map(int,input().split())
s=[]
for i in range(n):
p,c,*f=map(int,input().split())
s.append([p,c,f])
for i in range(n):
for j in range(n):
if i!=j and s[i][0]>=s[j][0] and set(s[j][2])>=set(s[i][2]) \
and (s[i][0]>s[j][0] or set(s[j][2])-set(s[i][2])):
print("Yes")
exit()
print("No")
|
ConDefects/ConDefects/Code/abc310_b/Python/45742461
|
condefects-python_data_1606
|
n , m = map(int,input().split())
p = [None] * n
#c = [None] * n
f = [None] * n
#e1 = {}
for i in range(n):
e = list(map(int,input().split()))
p[i] = e[0]
# c[i] = e[1]
f[i] = set(e[2:])
for i in range(n):
for j in range(i):
if p[i] >= p[j] and f[j].issuperset(f[i]) and (p[i] > p[j] or len(f[j]) > len(f[i])):
# print("i=",i+1,"j=",j+1,f[j],"<=",f[i])
print("Yes")
exit()
# e1[p[i]] = f[i]
print("No")
n , m = map(int,input().split())
p = [None] * n
#c = [None] * n
f = [None] * n
#e1 = {}
for i in range(n):
e = list(map(int,input().split()))
p[i] = e[0]
# c[i] = e[1]
f[i] = set(e[2:])
for i in range(n):
for j in range(n):
if p[i] >= p[j] and f[j].issuperset(f[i]) and (p[i] > p[j] or len(f[j]) > len(f[i])):
# print("i=",i+1,"j=",j+1,f[j],"<=",f[i])
print("Yes")
exit()
# e1[p[i]] = f[i]
print("No")
|
ConDefects/ConDefects/Code/abc310_b/Python/46010800
|
condefects-python_data_1607
|
import heapq
N,M=map(int,input().split())
G=[[] for i in range(N+1)]
H=[[0,0]]
for i in range(M):
a,b,c=map(int,input().split())
G[a].append(i+1)
G[b].append(i+1)
H.append([a+b,c])
Q=[]
inf=10**9+10
D=[inf for i in range(N+1)]
memo=[-1 for i in range(N+1)]
D[1]=0
heapq.heappush(Q,[0,1])
while Q:
cost,cur=heapq.heappop(Q)
if D[cur]<cost:
continue
for i in G[cur]:
dst=H[i][0]-cur
w=H[i][1]
if D[dst]>D[cur]+w:
D[dst]=D[cur]+w
memo[dst]=i
heapq.heappush(Q,[D[dst],dst])
ans=[]
for i in range(N+1):
if memo[i]!=-1:
ans.append(memo[i])
print(*ans)
import heapq
N,M=map(int,input().split())
G=[[] for i in range(N+1)]
H=[[0,0]]
for i in range(M):
a,b,c=map(int,input().split())
G[a].append(i+1)
G[b].append(i+1)
H.append([a+b,c])
Q=[]
inf=10**18+10
D=[inf for i in range(N+1)]
memo=[-1 for i in range(N+1)]
D[1]=0
heapq.heappush(Q,[0,1])
while Q:
cost,cur=heapq.heappop(Q)
if D[cur]<cost:
continue
for i in G[cur]:
dst=H[i][0]-cur
w=H[i][1]
if D[dst]>D[cur]+w:
D[dst]=D[cur]+w
memo[dst]=i
heapq.heappush(Q,[D[dst],dst])
ans=[]
for i in range(N+1):
if memo[i]!=-1:
ans.append(memo[i])
print(*ans)
|
ConDefects/ConDefects/Code/abc252_e/Python/45066699
|
condefects-python_data_1608
|
from collections import defaultdict
N, M = map(int, input().split())
A = list(map(int, input().split()))
count = defaultdict(int)
for a in A:
count[a] += 1
S = set()
for a, n in count.items():
if n%2:
S.add(a)
if len(S) == 0:
print('Bob')
quit()
if M % 2:
print('Alice')
quit()
m = M // 2
large = set()
small = []
for a in S:
if a < m:
small.append(a)
else:
large.add(a)
if len(small) % 2:
print('Alice')
quit()
for a in small:
if a+m in large:
continue
print('Alice')
quit()
print('Bob')
from collections import defaultdict
N, M = map(int, input().split())
A = list(map(int, input().split()))
count = defaultdict(int)
for a in A:
count[a] += 1
S = set()
for a, n in count.items():
if n%2:
S.add(a)
if len(S) == 0:
print('Bob')
quit()
if M % 2:
print('Alice')
quit()
m = M // 2
large = set()
small = []
for a in S:
if a < m:
small.append(a)
else:
large.add(a)
if len(small) != len(large) or len(small) % 2:
print('Alice')
quit()
for a in small:
if a+m in large:
continue
print('Alice')
quit()
print('Bob')
|
ConDefects/ConDefects/Code/arc148_d/Python/41790396
|
condefects-python_data_1609
|
N,M = map(int,input().split())
A = list(map(int,input().split()))
from collections import defaultdict
dic = defaultdict(int)
for a in A:
dic[a] ^= 1
blue = 0
while dic:
k,v = dic.popitem()
if v==0: continue
if M%2:
exit(print('Alice'))
k2 = (k + M//2) % M
dic[k2]
if dic[k2] == 0:
exit(print('Alice'))
blue += 1
print('Alice' if blue%2 else 'Bob')
N,M = map(int,input().split())
A = list(map(int,input().split()))
from collections import defaultdict
dic = defaultdict(int)
for a in A:
dic[a] ^= 1
blue = 0
while dic:
k,v = dic.popitem()
if v==0: continue
if M%2:
exit(print('Alice'))
k2 = (k + M//2) % M
if dic[k2] == 0:
exit(print('Alice'))
del dic[k2]
blue += 1
print('Alice' if blue%2 else 'Bob')
|
ConDefects/ConDefects/Code/arc148_d/Python/45234117
|
condefects-python_data_1610
|
N,M=map(int, input().split())
array=list(map(int, input().split()))
sss=set()
for a in array:
if a in sss:
sss.remove(a)
else:
sss.add(a)
if M%2==1:
if sss:
print("Alice")
else:
print("Bob")
else:
if len(sss)%4!=0:
print("Alice")
exit()
for s in sss:
if s+M//2 not in sss:
print("Alice")
exit()
print("Bob")
N,M=map(int, input().split())
array=list(map(int, input().split()))
sss=set()
for a in array:
if a in sss:
sss.remove(a)
else:
sss.add(a)
if M%2==1:
if sss:
print("Alice")
else:
print("Bob")
else:
if len(sss)%4!=0:
print("Alice")
exit()
for s in sss:
if (s+M//2)%M not in sss:
print("Alice")
exit()
print("Bob")
|
ConDefects/ConDefects/Code/arc148_d/Python/35204671
|
condefects-python_data_1611
|
def main():
from sys import stdin, setrecursionlimit
# setrecursionlimit(1000000)
input = stdin.readline
def iinput(): return int(input())
def sinput(): return input().rstrip()
def i0input(): return int(input()) - 1
def linput(): return list(input().split())
def liinput(): return list(map(int, input().split()))
def miinput(): return map(int, input().split())
def li0input(): return list(map(lambda x: int(x) - 1, input().split()))
def mi0input(): return map(lambda x: int(x) - 1, input().split())
INF = 1000000000000000000
MOD = 1000000007
N, M = miinput()
A = liinput()
B = set()
for a in A:
if a in B:
B.discard(a)
else:
B.add(a)
if not B:
print('Bob')
return
if (len(B) // 2 & 1 == 0) and (M & 1 == 0):
B = sorted(B)
C, D = B[:N//2], B[N//2:]
res = set()
for c, d in zip(C, D):
if c % (M // 2) != d % (M // 2):
print('Alice')
return
print('Bob')
return
print('Alice')
main()
def main():
from sys import stdin, setrecursionlimit
# setrecursionlimit(1000000)
input = stdin.readline
def iinput(): return int(input())
def sinput(): return input().rstrip()
def i0input(): return int(input()) - 1
def linput(): return list(input().split())
def liinput(): return list(map(int, input().split()))
def miinput(): return map(int, input().split())
def li0input(): return list(map(lambda x: int(x) - 1, input().split()))
def mi0input(): return map(lambda x: int(x) - 1, input().split())
INF = 1000000000000000000
MOD = 1000000007
N, M = miinput()
A = liinput()
B = set()
for a in A:
if a in B:
B.discard(a)
else:
B.add(a)
if not B:
print('Bob')
return
if (len(B) // 2 & 1 == 0) and (M & 1 == 0):
B = sorted(B)
C, D = B[:len(B)//2], B[len(B)//2:]
res = set()
for c, d in zip(C, D):
if c % (M // 2) != d % (M // 2):
print('Alice')
return
print('Bob')
return
print('Alice')
main()
|
ConDefects/ConDefects/Code/arc148_d/Python/40705107
|
condefects-python_data_1612
|
from collections import defaultdict
n,m = map(int,input().split())
a = list(map(int,input().split()))
a.sort()
d = defaultdict(int)
for i in a:
d[i] += 1
d[i] %= 2
flag = True
idx = []
for k,v in d.items():
flag &= not v
if k <= m//2:
idx.append(k)
if flag:
print("Bob")
elif m%2:
print("Alice")
else:
flag = True
cnt = 0
for i in idx:
if (d[i] and d[i+m//2]):
cnt += 1
flag &= (d[i] and d[i+m//2]) or (not d[i] and not d[i+m//2])
if flag and not cnt%2:
print("Bob")
else:
print("Alice")
from collections import defaultdict
n,m = map(int,input().split())
a = list(map(int,input().split()))
a.sort()
d = defaultdict(int)
for i in a:
d[i] += 1
d[i] %= 2
flag = True
idx = []
for k,v in d.items():
flag &= not v
if k < m//2:
idx.append(k)
if flag:
print("Bob")
elif m%2:
print("Alice")
else:
flag = True
cnt = 0
for i in idx:
if (d[i] and d[i+m//2]):
cnt += 1
flag &= (d[i] and d[i+m//2]) or (not d[i] and not d[i+m//2])
if flag and not cnt%2:
print("Bob")
else:
print("Alice")
|
ConDefects/ConDefects/Code/arc148_d/Python/42270342
|
condefects-python_data_1613
|
from collections import Counter
N, M = map(int, input().split())
A = [int(i)%M for i in input().split()]
C = Counter([i*2 % M for i in A])
S = 0
for i in A:
S = (S+i) % M
ans = 'Alice'
if all(i % 2 == 0 for i in C.values()):
x = 0
for i,j in C.items():
x += (i*j//2) % M
if x == S:
ans = 'Bob'
print(ans)
from collections import Counter
N, M = map(int, input().split())
A = [int(i)%M for i in input().split()]
C = Counter([i*2 % M for i in A])
S = 0
for i in A:
S = (S+i) % M
ans = 'Alice'
if all(i % 2 == 0 for i in C.values()):
x = 0
for i,j in C.items():
x = (x + i*j//2) % M
if x == S:
ans = 'Bob'
print(ans)
|
ConDefects/ConDefects/Code/arc148_d/Python/34818045
|
condefects-python_data_1614
|
import sys
from collections import defaultdict, Counter, deque
from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate
import operator
from math import sqrt, gcd, factorial
#from math import isqrt, prod, comb #python3.8用(notpypy)
#from bisect import bisect_left, bisect_right
from functools import lru_cache, reduce, cmp_to_key
#from heapq import heappush, heappop, heapify, heappushpop, heapreplace
#import numpy as np
#import networkx as nx
#from networkx.utils import UnionFind
#from numba import njit, b1, i1, i4, i8, f8
#numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1
#from scipy.sparse import csr_matrix
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError, maximum_bipartite_matching, maximum_flow, minimum_spanning_tree
def input(): return sys.stdin.readline().rstrip()
def divceil(n, k): return 1+(n-1)//k # n/kの切り上げを返す
def yn(hantei, yes='Yes', no='No'): print(yes if hantei else no)
def main():
mod = 10**9+7
mod2 = 998244353
n,m=map(int, input().split())
A=list(map(int, input().split()))
Cnt=Counter(A)
for i in Cnt.keys():
Cnt[i]%=2
if m%2==1:
yn(all(Cnt[i]==0 for i in Cnt.keys()),'Bob','Alice')
else:
yn(all((Cnt[i]==1 and Cnt[(i+(m//2))%m]==1) or (Cnt[i]==0 and Cnt[(i+(m//2))%m]==0) for i in Cnt.keys()),'Bob','Alice')
if __name__ == '__main__':
main()
import sys
from collections import defaultdict, Counter, deque
from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate
import operator
from math import sqrt, gcd, factorial
#from math import isqrt, prod, comb #python3.8用(notpypy)
#from bisect import bisect_left, bisect_right
from functools import lru_cache, reduce, cmp_to_key
#from heapq import heappush, heappop, heapify, heappushpop, heapreplace
#import numpy as np
#import networkx as nx
#from networkx.utils import UnionFind
#from numba import njit, b1, i1, i4, i8, f8
#numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1
#from scipy.sparse import csr_matrix
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError, maximum_bipartite_matching, maximum_flow, minimum_spanning_tree
def input(): return sys.stdin.readline().rstrip()
def divceil(n, k): return 1+(n-1)//k # n/kの切り上げを返す
def yn(hantei, yes='Yes', no='No'): print(yes if hantei else no)
def main():
mod = 10**9+7
mod2 = 998244353
n,m=map(int, input().split())
A=list(map(int, input().split()))
Cnt=Counter(A)
for i in Cnt.keys():
Cnt[i]%=2
if m%2==1:
yn(all(Cnt[i]==0 for i in Cnt.keys()),'Bob','Alice')
else:
yn(all((Cnt[i]==1 and Cnt[(i+(m//2))%m]==1) or (Cnt[i]==0 and Cnt[(i+(m//2))%m]==0) for i in Cnt.keys()) and sum(Cnt.values())%4==0,'Bob','Alice')
if __name__ == '__main__':
main()
|
ConDefects/ConDefects/Code/arc148_d/Python/34807717
|
condefects-python_data_1615
|
from collections import Counter
n, m = map(int, input().split())
a = list(map(int, input().split()))
s = sum(a)
for i in range(n * 2):
a[i] = a[i] * 2 % m
a.sort()
x = 0
for i in range(0, n * 2, 2):
if a[i] != a[i + 1]:
print('Alice')
break
x += a[i]
else:
if x == s:
print('Bob')
else:
print('Alice')
from collections import Counter
n, m = map(int, input().split())
a = list(map(int, input().split()))
s = sum(a)
for i in range(n * 2):
a[i] = a[i] * 2 % m
a.sort()
x = 0
for i in range(0, n * 2, 2):
if a[i] != a[i + 1]:
print('Alice')
break
x += a[i]
else:
if x % m == s % m:
print('Bob')
else:
print('Alice')
|
ConDefects/ConDefects/Code/arc148_d/Python/34805310
|
condefects-python_data_1616
|
from collections import Counter
def solve_odd(a, m):
c = Counter(a)
return any(cnt%2 for cnt in c.values())
def solve_even(a, m):
mm = m//2
c = Counter(v%mm for v in a)
if any(cnt%2 for cnt in c.values()):
return True
r = 0
c = Counter(a)
for v in set(a):
if v >= m:
continue
r += c[v]%2
return r % 2
n,m = map(int,input().split())
a = list(map(int,input().split()))
res = solve_even(a, m) if m%2 == 0 else solve_odd(a, m)
print('Alice' if res else 'Bob')
from collections import Counter
def solve_odd(a, m):
c = Counter(a)
return any(cnt%2 for cnt in c.values())
def solve_even(a, m):
mm = m//2
c = Counter(v%mm for v in a)
if any(cnt%2 for cnt in c.values()):
return True
r = 0
c = Counter(a)
for v in set(a):
if v >= mm:
continue
r += c[v]%2
return r % 2
n,m = map(int,input().split())
a = list(map(int,input().split()))
res = solve_even(a, m) if m%2 == 0 else solve_odd(a, m)
print('Alice' if res else 'Bob')
|
ConDefects/ConDefects/Code/arc148_d/Python/38916424
|
condefects-python_data_1617
|
S, T = map(str, input().split())
print(S, 'sun')
S, T = map(str, input().split())
print(S, 'san')
|
ConDefects/ConDefects/Code/abc325_a/Python/54458696
|
condefects-python_data_1618
|
S,T=map(str,input().split())
print(S+' '+'san')
S,T=map(str,input().split())
print(S+' '+'san')
|
ConDefects/ConDefects/Code/abc325_a/Python/54471524
|
condefects-python_data_1619
|
X,L=input().split()
print(X+""+"san")
X,L=input().split()
print(X+" "+"san")
|
ConDefects/ConDefects/Code/abc325_a/Python/54463664
|
condefects-python_data_1620
|
from collections import deque
n, d = map(int, input().split())
wall = [list(map(int, input().split())) for _ in range(n)]
wall.sort()
q = deque(wall)
ans = 0
now = 0
while q:
nex = q.popleft()
if nex[0] <= now:
continue
now = nex[1] + d - 1
ans += 1
print(ans)
from collections import deque
n, d = map(int, input().split())
wall = [list(map(int, input().split())) for _ in range(n)]
wall.sort(key=lambda x : x[1])
q = deque(wall)
ans = 0
now = 0
while q:
nex = q.popleft()
if nex[0] <= now:
continue
now = nex[1] + d - 1
ans += 1
print(ans)
|
ConDefects/ConDefects/Code/abc230_d/Python/45013914
|
condefects-python_data_1621
|
import sys
sys.setrecursionlimit(10**7)
import re
import copy
import bisect
import math
import itertools
import more_itertools
from collections import deque
from collections import defaultdict
from collections import Counter
from heapq import heapify, heappush, heappop, heappushpop, heapreplace
from functools import cmp_to_key as cmpk
import functools
al = "abcdefghijklmnopqrstuvwxyz"
au = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
def ii():
return int(input())
def gl():
return list(map(int, input().split()))
def gs():
return list(input().split())
def gr(l):
res = itertools.groupby(l)
return list([(key, len(list(v))) for key, v in res])
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())
def glm(h,w):
a = []
for i in range(h):
a.append(gl())
return a
def gsm(h,w):
a = []
for i in range(h):
a.append(input().split())
return a
def kiriage(n, r):
if n % r == 0:
return n // r
else:
return (n // r) + 1
def next_perm(a):
l = copy.copy(a)
l = list(l)
i = len(l) - 2
while 0 <= i and l[i] >= l[i+1]:
i -= 1
if i == 1:
return False
j = len(l) - 1
while not (l[i] < l[j]):
j -= 1
l[i], l[j] = l[j], l[i]
return l[:i+1] + rev(l[i+1:])
def ketawa(n):
ans = 0
s = str(n)
for i in s:
ans += int(i)
return ans
def rev(a):
a = a[:]
return list(reversed(a))
def lcm2(x, y):
return (x * y) // math.gcd(x, y)
def lcm3(*ints):
return functools.reduce(lcm2, ints)
def gcd3(*ints):
return functools.reduce(math.gcd, ints)
def cntsep(a, b, k):
r = a % k
m = a - r
ans = (b - m) // (k+1)
if r > 0:
ans -= 1
return ans
def putedges(g, idx = 0):
n = len(g)
e = []
cnt2 = 0
for i in range(n):
for j in g[i]:
cnt2 += 1
e.append((i, j))
m = len(g)
print(n, cnt2)
for i in e:
if idx == 0:
print(*[i[0], i[1]])
else:
print(*[i[0] + 1, i[1] + 1])
def drev(d):
newd = {}
for k in rev(list(d.keys())):
newd[k] = d[k]
return newd
def dvsort(d):
return dict(sorted(d.items(), key = lambda x: x[1]))
def dksort(d):
return dict(sorted(d.items()))
def rmwh(a):
while not '#' in a[0]:
a = a[1:]
while not '#' in a[-1]:
a = a[:-1]
ok = True
while True:
for y in range(len(a)):
if a[y][0] == '#':
ok = False
if ok:
for y in range(len(a)):
a[y] = a[y][1:]
else:
break
ok = True
while True:
for y in range(len(a)):
if a[y][-1] == '#':
ok = False
if ok:
for y in range(len(a)):
a[y] = a[y][:-1]
else:
break
return a
def comb_cnt(n, k):
return math.factorial(n) // (math.factorial(n - k) * math.factorial(k))
def sinhen(n, l):
if n < l:
return [n]
else:
return sinhen(n // l, l) + [n % l]
# from decimal import *
# def myround(x, k):
# if k < 0:
# return float(Decimal(str(x)).quantize(Decimal('1E' + str(k+1)), rounding = ROUND_HALF_UP))
# else:
# return int(Decimal(str(x)).quantize(Decimal('1E' + str(k+1)), rounding = ROUND_HALF_UP))
def cnt_com(l1, r1, l2, r2):
if l1 > l2:
l1, l2, r1, r2 = l2, l1, r2, r1
if l1 <= l2 and l2 <= r2 and r2 <= r1:
return r2 - l2
elif l1 <= l2 and l2 <= r1 and r1 <= r2:
return r1 - l2
elif r1 <= l2:
return 0
def cut_yoko(a, y):
a_copy = copy.deepcopy(a)
res = []
for x in range(len(a[0])):
res.append(a_copy[y][x])
return res
def cut_tate(a, x):
a_copy = copy.deepcopy(a)
res = []
for y in range(len(a)):
res.append(a_copy[y][x])
return res
def zalg(s):
n = len(s)
a = [0] * n
i = 1
j = 0
a[0] = len(s)
l = len(s)
while i < l:
while i + j < l and s[j] == s[i+j]:
j += 1
if not j:
i += 1
continue
a[i] = j
k = 1
while l-i > k < j - a[k]:
a[i+k] = a[k]
k += 1
i += k
j -= k
return a
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedSet.py
import math
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional
T = TypeVar('T')
class SortedSet(Generic[T]):
BUCKET_RATIO = 50
REBUILD_RATIO = 170
def _build(self, a: Optional[List[T]] = None) -> None:
"Evenly divide `a` into buckets."
if a is None: a = list(self)
size = len(a)
bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO)))
self.a = [a[size * i // bucket_size : size * (i + 1) // bucket_size] for i in range(bucket_size)]
def __init__(self, a: Iterable[T] = []) -> None:
"Make a new SortedSet from iterable. / O(N) if sorted and unique / O(N log N)"
a = list(a)
self.size = len(a)
if not all(a[i] < a[i + 1] for i in range(len(a) - 1)):
a = sorted(set(a))
self._build(a)
def __iter__(self) -> Iterator[T]:
for i in self.a:
for j in i: yield j
def __reversed__(self) -> Iterator[T]:
for i in reversed(self.a):
for j in reversed(i): yield j
def __eq__(self, other) -> bool:
return list(self) == list(other)
def __len__(self) -> int:
return self.size
def __repr__(self) -> str:
return "SortedSet" + str(self.a)
def __str__(self) -> str:
s = str(list(self))
return "{" + s[1 : len(s) - 1] + "}"
def _position(self, x: T) -> Tuple[List[T], int]:
"Find the bucket and position which x should be inserted. self must not be empty."
for a in self.a:
if x <= a[-1]: break
return (a, bisect_left(a, x))
def __contains__(self, x: T) -> bool:
if self.size == 0: return False
a, i = self._position(x)
return i != len(a) and a[i] == x
def add(self, x: T) -> bool:
"Add an element and return True if added. / O(竏哢)"
if self.size == 0:
self.a = [[x]]
self.size = 1
return True
a, i = self._position(x)
if i != len(a) and a[i] == x: return False
a.insert(i, x)
self.size += 1
if len(a) > len(self.a) * self.REBUILD_RATIO:
self._build()
return True
def _pop(self, a: List[T], i: int) -> T:
ans = a.pop(i)
self.size -= 1
if not a: self._build()
return ans
def discard(self, x: T) -> bool:
"Remove an element and return True if removed. / O(竏哢)"
if self.size == 0: return False
a, i = self._position(x)
if i == len(a) or a[i] != x: return False
self._pop(a, i)
return True
def lt(self, x: T) -> Optional[T]:
"Find the largest element < x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] < x:
return a[bisect_left(a, x) - 1]
def le(self, x: T) -> Optional[T]:
"Find the largest element <= x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] <= x:
return a[bisect_right(a, x) - 1]
def gt(self, x: T) -> Optional[T]:
"Find the smallest element > x, or None if it doesn't exist."
for a in self.a:
if a[-1] > x:
return a[bisect_right(a, x)]
def ge(self, x: T) -> Optional[T]:
"Find the smallest element >= x, or None if it doesn't exist."
for a in self.a:
if a[-1] >= x:
return a[bisect_left(a, x)]
def __getitem__(self, i: int) -> T:
"Return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return a[i]
else:
for a in self.a:
if i < len(a): return a[i]
i -= len(a)
raise IndexError
def pop(self, i: int = -1) -> T:
"Pop and return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return self._pop(a, i)
else:
for a in self.a:
if i < len(a): return self._pop(a, i)
i -= len(a)
raise IndexError
def index(self, x: T) -> int:
"Count the number of elements < x."
ans = 0
for a in self.a:
if a[-1] >= x:
return ans + bisect_left(a, x)
ans += len(a)
return ans
def index_right(self, x: T) -> int:
"Count the number of elements <= x."
ans = 0
for a in self.a:
if a[-1] > x:
return ans + bisect_right(a, x)
ans += len(a)
return ans
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedMultiset.py
import math
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional
T = TypeVar('T')
class SortedMultiset(Generic[T]):
BUCKET_RATIO = 50
REBUILD_RATIO = 170
def _build(self, a: Optional[List[T]] = None) -> None:
"Evenly divide `a` into buckets."
if a is None: a = list(self)
size = len(a)
bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO)))
self.a = [a[size * i // bucket_size : size * (i + 1) // bucket_size] for i in range(bucket_size)]
def __init__(self, a: Iterable[T] = []) -> None:
"Make a new SortedMultiset from iterable. / O(N) if sorted / O(N log N)"
a = list(a)
self.size = len(a)
if not all(a[i] <= a[i + 1] for i in range(len(a) - 1)):
a = sorted(a)
self._build(a)
def __iter__(self) -> Iterator[T]:
for i in self.a:
for j in i: yield j
def __reversed__(self) -> Iterator[T]:
for i in reversed(self.a):
for j in reversed(i): yield j
def __eq__(self, other) -> bool:
return list(self) == list(other)
def __len__(self) -> int:
return self.size
def __repr__(self) -> str:
return "SortedMultiset" + str(self.a)
def __str__(self) -> str:
s = str(list(self))
return "{" + s[1 : len(s) - 1] + "}"
def _position(self, x: T) -> Tuple[List[T], int]:
"Find the bucket and position which x should be inserted. self must not be empty."
for a in self.a:
if x <= a[-1]: break
return (a, bisect_left(a, x))
def __contains__(self, x: T) -> bool:
if self.size == 0: return False
a, i = self._position(x)
return i != len(a) and a[i] == x
def count(self, x: T) -> int:
"Count the number of x."
return self.index_right(x) - self.index(x)
def add(self, x: T) -> None:
"Add an element. / O(竏哢)"
if self.size == 0:
self.a = [[x]]
self.size = 1
return
a, i = self._position(x)
a.insert(i, x)
self.size += 1
if len(a) > len(self.a) * self.REBUILD_RATIO:
self._build()
def _pop(self, a: List[T], i: int) -> T:
ans = a.pop(i)
self.size -= 1
if not a: self._build()
return ans
def discard(self, x: T) -> bool:
"Remove an element and return True if removed. / O(竏哢)"
if self.size == 0: return False
a, i = self._position(x)
if i == len(a) or a[i] != x: return False
self._pop(a, i)
return True
def lt(self, x: T) -> Optional[T]:
"Find the largest element < x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] < x:
return a[bisect_left(a, x) - 1]
def le(self, x: T) -> Optional[T]:
"Find the largest element <= x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] <= x:
return a[bisect_right(a, x) - 1]
def gt(self, x: T) -> Optional[T]:
"Find the smallest element > x, or None if it doesn't exist."
for a in self.a:
if a[-1] > x:
return a[bisect_right(a, x)]
def ge(self, x: T) -> Optional[T]:
"Find the smallest element >= x, or None if it doesn't exist."
for a in self.a:
if a[-1] >= x:
return a[bisect_left(a, x)]
def __getitem__(self, i: int) -> T:
"Return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return a[i]
else:
for a in self.a:
if i < len(a): return a[i]
i -= len(a)
raise IndexError
def pop(self, i: int = -1) -> T:
"Pop and return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return self._pop(a, i)
else:
for a in self.a:
if i < len(a): return self._pop(a, i)
i -= len(a)
raise IndexError
def index(self, x: T) -> int:
"Count the number of elements < x."
ans = 0
for a in self.a:
if a[-1] >= x:
return ans + bisect_left(a, x)
ans += len(a)
return ans
def index_right(self, x: T) -> int:
"Count the number of elements <= x."
ans = 0
for a in self.a:
if a[-1] > x:
return ans + bisect_right(a, x)
ans += len(a)
return ans
def dijkstra(g, st):
vi = set()
res = [inf for i in range(len(g))]
res[st] = 0
s = SortedSet([])
s.add((0, st))
while len(s) != 0:
dis, now = s.pop(0)
vi.add(now)
# print(s, res, now, dis)
for to in g[now].keys():
if to in vi:
continue
w = g[now][to]
if dis + w <= res[to]:
if res[to] == inf:
s.add((dis + w, to))
res[to] = dis + w
else:
r = s.discard((res[to], to))
if r == False:
print('discard error')
print(s)
print(res[to], to)
s.add((dis + w, to))
res[to] = dis + w
return res
def tarjan(g):
n = len(g)
scc, s, p = [], [], []
q = [i for i in range(n)]
state = [0] * n
while q:
node = q.pop()
if node < 0:
d = state[~node] - 1
if p[-1] > d:
scc.append(s[d:])
del s[d:]
p.pop()
for v in scc[-1]:
state[v] = -1
elif state[node] > 0:
while p[-1] > state[node]:
p.pop()
elif state[node] == 0:
s.append(node)
p.append(len(s))
state[node] = len(s)
q.append(~node)
q.extend(g[node])
return scc
def mbs(a, key):
ng = -1
ok = len(a)
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if a[mid] >= key:
ok = mid
else:
ng = mid
return ok
def satlow(f, lower = 0, upper = 10**9):
ng = lower
ok = upper
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if f(mid):
ok = mid
else:
ng = mid
return ok
def listsatlow(a, f):
ng = -1
ok = len(a)
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if f(a[mid]):
ok = mid
else:
ng = mid
return ok
v4 = [[-1, 0], [0, -1], [0, 1], [1, 0]]
inf = float('inf')
ans = inf
cnt=0
ay="Yes"
an="No"
#main
n, d = gl()
a = glm(n, 2)
a = list(sorted(a, key = lambda x: x[0]))
now = a[0]
for i in range(1, n):
l, r = a[i]
if now[1] + d <= l:
cnt += 1
now = [l, r]
cnt += 1
print(cnt)
import sys
sys.setrecursionlimit(10**7)
import re
import copy
import bisect
import math
import itertools
import more_itertools
from collections import deque
from collections import defaultdict
from collections import Counter
from heapq import heapify, heappush, heappop, heappushpop, heapreplace
from functools import cmp_to_key as cmpk
import functools
al = "abcdefghijklmnopqrstuvwxyz"
au = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
def ii():
return int(input())
def gl():
return list(map(int, input().split()))
def gs():
return list(input().split())
def gr(l):
res = itertools.groupby(l)
return list([(key, len(list(v))) for key, v in res])
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())
def glm(h,w):
a = []
for i in range(h):
a.append(gl())
return a
def gsm(h,w):
a = []
for i in range(h):
a.append(input().split())
return a
def kiriage(n, r):
if n % r == 0:
return n // r
else:
return (n // r) + 1
def next_perm(a):
l = copy.copy(a)
l = list(l)
i = len(l) - 2
while 0 <= i and l[i] >= l[i+1]:
i -= 1
if i == 1:
return False
j = len(l) - 1
while not (l[i] < l[j]):
j -= 1
l[i], l[j] = l[j], l[i]
return l[:i+1] + rev(l[i+1:])
def ketawa(n):
ans = 0
s = str(n)
for i in s:
ans += int(i)
return ans
def rev(a):
a = a[:]
return list(reversed(a))
def lcm2(x, y):
return (x * y) // math.gcd(x, y)
def lcm3(*ints):
return functools.reduce(lcm2, ints)
def gcd3(*ints):
return functools.reduce(math.gcd, ints)
def cntsep(a, b, k):
r = a % k
m = a - r
ans = (b - m) // (k+1)
if r > 0:
ans -= 1
return ans
def putedges(g, idx = 0):
n = len(g)
e = []
cnt2 = 0
for i in range(n):
for j in g[i]:
cnt2 += 1
e.append((i, j))
m = len(g)
print(n, cnt2)
for i in e:
if idx == 0:
print(*[i[0], i[1]])
else:
print(*[i[0] + 1, i[1] + 1])
def drev(d):
newd = {}
for k in rev(list(d.keys())):
newd[k] = d[k]
return newd
def dvsort(d):
return dict(sorted(d.items(), key = lambda x: x[1]))
def dksort(d):
return dict(sorted(d.items()))
def rmwh(a):
while not '#' in a[0]:
a = a[1:]
while not '#' in a[-1]:
a = a[:-1]
ok = True
while True:
for y in range(len(a)):
if a[y][0] == '#':
ok = False
if ok:
for y in range(len(a)):
a[y] = a[y][1:]
else:
break
ok = True
while True:
for y in range(len(a)):
if a[y][-1] == '#':
ok = False
if ok:
for y in range(len(a)):
a[y] = a[y][:-1]
else:
break
return a
def comb_cnt(n, k):
return math.factorial(n) // (math.factorial(n - k) * math.factorial(k))
def sinhen(n, l):
if n < l:
return [n]
else:
return sinhen(n // l, l) + [n % l]
# from decimal import *
# def myround(x, k):
# if k < 0:
# return float(Decimal(str(x)).quantize(Decimal('1E' + str(k+1)), rounding = ROUND_HALF_UP))
# else:
# return int(Decimal(str(x)).quantize(Decimal('1E' + str(k+1)), rounding = ROUND_HALF_UP))
def cnt_com(l1, r1, l2, r2):
if l1 > l2:
l1, l2, r1, r2 = l2, l1, r2, r1
if l1 <= l2 and l2 <= r2 and r2 <= r1:
return r2 - l2
elif l1 <= l2 and l2 <= r1 and r1 <= r2:
return r1 - l2
elif r1 <= l2:
return 0
def cut_yoko(a, y):
a_copy = copy.deepcopy(a)
res = []
for x in range(len(a[0])):
res.append(a_copy[y][x])
return res
def cut_tate(a, x):
a_copy = copy.deepcopy(a)
res = []
for y in range(len(a)):
res.append(a_copy[y][x])
return res
def zalg(s):
n = len(s)
a = [0] * n
i = 1
j = 0
a[0] = len(s)
l = len(s)
while i < l:
while i + j < l and s[j] == s[i+j]:
j += 1
if not j:
i += 1
continue
a[i] = j
k = 1
while l-i > k < j - a[k]:
a[i+k] = a[k]
k += 1
i += k
j -= k
return a
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedSet.py
import math
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional
T = TypeVar('T')
class SortedSet(Generic[T]):
BUCKET_RATIO = 50
REBUILD_RATIO = 170
def _build(self, a: Optional[List[T]] = None) -> None:
"Evenly divide `a` into buckets."
if a is None: a = list(self)
size = len(a)
bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO)))
self.a = [a[size * i // bucket_size : size * (i + 1) // bucket_size] for i in range(bucket_size)]
def __init__(self, a: Iterable[T] = []) -> None:
"Make a new SortedSet from iterable. / O(N) if sorted and unique / O(N log N)"
a = list(a)
self.size = len(a)
if not all(a[i] < a[i + 1] for i in range(len(a) - 1)):
a = sorted(set(a))
self._build(a)
def __iter__(self) -> Iterator[T]:
for i in self.a:
for j in i: yield j
def __reversed__(self) -> Iterator[T]:
for i in reversed(self.a):
for j in reversed(i): yield j
def __eq__(self, other) -> bool:
return list(self) == list(other)
def __len__(self) -> int:
return self.size
def __repr__(self) -> str:
return "SortedSet" + str(self.a)
def __str__(self) -> str:
s = str(list(self))
return "{" + s[1 : len(s) - 1] + "}"
def _position(self, x: T) -> Tuple[List[T], int]:
"Find the bucket and position which x should be inserted. self must not be empty."
for a in self.a:
if x <= a[-1]: break
return (a, bisect_left(a, x))
def __contains__(self, x: T) -> bool:
if self.size == 0: return False
a, i = self._position(x)
return i != len(a) and a[i] == x
def add(self, x: T) -> bool:
"Add an element and return True if added. / O(竏哢)"
if self.size == 0:
self.a = [[x]]
self.size = 1
return True
a, i = self._position(x)
if i != len(a) and a[i] == x: return False
a.insert(i, x)
self.size += 1
if len(a) > len(self.a) * self.REBUILD_RATIO:
self._build()
return True
def _pop(self, a: List[T], i: int) -> T:
ans = a.pop(i)
self.size -= 1
if not a: self._build()
return ans
def discard(self, x: T) -> bool:
"Remove an element and return True if removed. / O(竏哢)"
if self.size == 0: return False
a, i = self._position(x)
if i == len(a) or a[i] != x: return False
self._pop(a, i)
return True
def lt(self, x: T) -> Optional[T]:
"Find the largest element < x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] < x:
return a[bisect_left(a, x) - 1]
def le(self, x: T) -> Optional[T]:
"Find the largest element <= x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] <= x:
return a[bisect_right(a, x) - 1]
def gt(self, x: T) -> Optional[T]:
"Find the smallest element > x, or None if it doesn't exist."
for a in self.a:
if a[-1] > x:
return a[bisect_right(a, x)]
def ge(self, x: T) -> Optional[T]:
"Find the smallest element >= x, or None if it doesn't exist."
for a in self.a:
if a[-1] >= x:
return a[bisect_left(a, x)]
def __getitem__(self, i: int) -> T:
"Return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return a[i]
else:
for a in self.a:
if i < len(a): return a[i]
i -= len(a)
raise IndexError
def pop(self, i: int = -1) -> T:
"Pop and return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return self._pop(a, i)
else:
for a in self.a:
if i < len(a): return self._pop(a, i)
i -= len(a)
raise IndexError
def index(self, x: T) -> int:
"Count the number of elements < x."
ans = 0
for a in self.a:
if a[-1] >= x:
return ans + bisect_left(a, x)
ans += len(a)
return ans
def index_right(self, x: T) -> int:
"Count the number of elements <= x."
ans = 0
for a in self.a:
if a[-1] > x:
return ans + bisect_right(a, x)
ans += len(a)
return ans
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedMultiset.py
import math
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional
T = TypeVar('T')
class SortedMultiset(Generic[T]):
BUCKET_RATIO = 50
REBUILD_RATIO = 170
def _build(self, a: Optional[List[T]] = None) -> None:
"Evenly divide `a` into buckets."
if a is None: a = list(self)
size = len(a)
bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO)))
self.a = [a[size * i // bucket_size : size * (i + 1) // bucket_size] for i in range(bucket_size)]
def __init__(self, a: Iterable[T] = []) -> None:
"Make a new SortedMultiset from iterable. / O(N) if sorted / O(N log N)"
a = list(a)
self.size = len(a)
if not all(a[i] <= a[i + 1] for i in range(len(a) - 1)):
a = sorted(a)
self._build(a)
def __iter__(self) -> Iterator[T]:
for i in self.a:
for j in i: yield j
def __reversed__(self) -> Iterator[T]:
for i in reversed(self.a):
for j in reversed(i): yield j
def __eq__(self, other) -> bool:
return list(self) == list(other)
def __len__(self) -> int:
return self.size
def __repr__(self) -> str:
return "SortedMultiset" + str(self.a)
def __str__(self) -> str:
s = str(list(self))
return "{" + s[1 : len(s) - 1] + "}"
def _position(self, x: T) -> Tuple[List[T], int]:
"Find the bucket and position which x should be inserted. self must not be empty."
for a in self.a:
if x <= a[-1]: break
return (a, bisect_left(a, x))
def __contains__(self, x: T) -> bool:
if self.size == 0: return False
a, i = self._position(x)
return i != len(a) and a[i] == x
def count(self, x: T) -> int:
"Count the number of x."
return self.index_right(x) - self.index(x)
def add(self, x: T) -> None:
"Add an element. / O(竏哢)"
if self.size == 0:
self.a = [[x]]
self.size = 1
return
a, i = self._position(x)
a.insert(i, x)
self.size += 1
if len(a) > len(self.a) * self.REBUILD_RATIO:
self._build()
def _pop(self, a: List[T], i: int) -> T:
ans = a.pop(i)
self.size -= 1
if not a: self._build()
return ans
def discard(self, x: T) -> bool:
"Remove an element and return True if removed. / O(竏哢)"
if self.size == 0: return False
a, i = self._position(x)
if i == len(a) or a[i] != x: return False
self._pop(a, i)
return True
def lt(self, x: T) -> Optional[T]:
"Find the largest element < x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] < x:
return a[bisect_left(a, x) - 1]
def le(self, x: T) -> Optional[T]:
"Find the largest element <= x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] <= x:
return a[bisect_right(a, x) - 1]
def gt(self, x: T) -> Optional[T]:
"Find the smallest element > x, or None if it doesn't exist."
for a in self.a:
if a[-1] > x:
return a[bisect_right(a, x)]
def ge(self, x: T) -> Optional[T]:
"Find the smallest element >= x, or None if it doesn't exist."
for a in self.a:
if a[-1] >= x:
return a[bisect_left(a, x)]
def __getitem__(self, i: int) -> T:
"Return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return a[i]
else:
for a in self.a:
if i < len(a): return a[i]
i -= len(a)
raise IndexError
def pop(self, i: int = -1) -> T:
"Pop and return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return self._pop(a, i)
else:
for a in self.a:
if i < len(a): return self._pop(a, i)
i -= len(a)
raise IndexError
def index(self, x: T) -> int:
"Count the number of elements < x."
ans = 0
for a in self.a:
if a[-1] >= x:
return ans + bisect_left(a, x)
ans += len(a)
return ans
def index_right(self, x: T) -> int:
"Count the number of elements <= x."
ans = 0
for a in self.a:
if a[-1] > x:
return ans + bisect_right(a, x)
ans += len(a)
return ans
def dijkstra(g, st):
vi = set()
res = [inf for i in range(len(g))]
res[st] = 0
s = SortedSet([])
s.add((0, st))
while len(s) != 0:
dis, now = s.pop(0)
vi.add(now)
# print(s, res, now, dis)
for to in g[now].keys():
if to in vi:
continue
w = g[now][to]
if dis + w <= res[to]:
if res[to] == inf:
s.add((dis + w, to))
res[to] = dis + w
else:
r = s.discard((res[to], to))
if r == False:
print('discard error')
print(s)
print(res[to], to)
s.add((dis + w, to))
res[to] = dis + w
return res
def tarjan(g):
n = len(g)
scc, s, p = [], [], []
q = [i for i in range(n)]
state = [0] * n
while q:
node = q.pop()
if node < 0:
d = state[~node] - 1
if p[-1] > d:
scc.append(s[d:])
del s[d:]
p.pop()
for v in scc[-1]:
state[v] = -1
elif state[node] > 0:
while p[-1] > state[node]:
p.pop()
elif state[node] == 0:
s.append(node)
p.append(len(s))
state[node] = len(s)
q.append(~node)
q.extend(g[node])
return scc
def mbs(a, key):
ng = -1
ok = len(a)
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if a[mid] >= key:
ok = mid
else:
ng = mid
return ok
def satlow(f, lower = 0, upper = 10**9):
ng = lower
ok = upper
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if f(mid):
ok = mid
else:
ng = mid
return ok
def listsatlow(a, f):
ng = -1
ok = len(a)
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if f(a[mid]):
ok = mid
else:
ng = mid
return ok
v4 = [[-1, 0], [0, -1], [0, 1], [1, 0]]
inf = float('inf')
ans = inf
cnt=0
ay="Yes"
an="No"
#main
n, d = gl()
a = glm(n, 2)
a = list(sorted(a, key = lambda x: x[1]))
now = a[0]
for i in range(1, n):
l, r = a[i]
if now[1] + d <= l:
cnt += 1
now = [l, r]
cnt += 1
print(cnt)
|
ConDefects/ConDefects/Code/abc230_d/Python/45946021
|
condefects-python_data_1622
|
import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from functools import lru_cache
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())
N, D = mi()
P = []
for i in range(N):
l, r = mi()
P.append((r, l))
P.sort()
ans = 0
x = -1000
for i in range(N):
r, l = P[i]
if l > x + D - 1:
ans += 1
x = r
print(ans)
import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from functools import lru_cache
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())
N, D = mi()
P = []
for i in range(N):
l, r = mi()
P.append((r, l))
P.sort()
ans = 0
x = - 1e10
for i in range(N):
r, l = P[i]
if l > x + D - 1:
ans += 1
x = r
print(ans)
|
ConDefects/ConDefects/Code/abc230_d/Python/46047126
|
condefects-python_data_1623
|
from operator import itemgetter
N,D=map(int,input().split())
li=[list(map(int,input().split())) for _ in range(N)]
li.sort(key=itemgetter(1))
punch_length=-1
ans=0
for i in range(N):
l,r=li[i]
if ans==0:
ans+=1
punch_length=r+D-1
else:
if punch_length<l:
ans+=1
punch_length==r+D-1
print(ans)
from operator import itemgetter
N,D=map(int,input().split())
li=[list(map(int,input().split())) for _ in range(N)]
li.sort(key=itemgetter(1))
punch_length=-1
ans=0
for i in range(N):
l,r=li[i]
if ans==0:
ans+=1
punch_length=r+D-1
else:
if punch_length<l:
ans+=1
punch_length=r+D-1
print(ans)
|
ConDefects/ConDefects/Code/abc230_d/Python/44825161
|
condefects-python_data_1624
|
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, D = lr()
x = []
inf = 1 << 60
for i in range(N):
l, r = lr()
# 壁の左端、左右、壁の番号
x.append((l, 0, i))
# 壁の右端、左右、壁の番号
x.append((r, 1, i))
sx = sorted(x)
l = []
r = 1 << 60
w = set()
cnt = 0
for p in sx:
v, f, wn = p[0], p[1], p[2]
# 壁の右端
if f:
# 既に壊されている壁はスキップ
if wn not in w:
r = min(r, v)
# 壁の左端
else:
# まだ壊されていない壁がある時
if r != inf:
# 最も右端が左側の壁と同時に壊せる範囲よりも左端が右の場合
if r + D - 1 < v:
# 今まで見た壁を壊す
while len(l):
w.add(l.pop())
# パンチをカウント
cnt += 1
# 壊されていない壁リストに追加
l.append(wn)
# 残った壁を壊す
cnt += 1
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, D = lr()
x = []
inf = 1 << 60
for i in range(N):
l, r = lr()
# 壁の左端、左右、壁の番号
x.append((l, 0, i))
# 壁の右端、左右、壁の番号
x.append((r, 1, i))
sx = sorted(x)
l = []
r = 1 << 60
w = set()
cnt = 0
for p in sx:
v, f, wn = p[0], p[1], p[2]
# 壁の右端
if f:
# 既に壊されている壁はスキップ
if wn not in w:
r = min(r, v)
# 壁の左端
else:
# まだ壊されていない壁がある時
if r != inf:
# 最も右端が左側の壁と同時に壊せる範囲よりも左端が右の場合
if r + D - 1 < v:
# 今まで見た壁を壊す
while len(l):
w.add(l.pop())
# パンチをカウント
cnt += 1
# 右端をリセット
r = inf
# 壊されていない壁リストに追加
l.append(wn)
# 残った壁を壊す
cnt += 1
print(cnt)
|
ConDefects/ConDefects/Code/abc230_d/Python/46232718
|
condefects-python_data_1625
|
N = int(input())
A = list(map(int, input().split()))
count = [0 for _ in range(10**6)]
for i in range(N):
count[A[i]] += 1
binary_list = []
binary_sum = []
for i in range(64):
b = []
for j in range(6):
b.append((i>>j)&1)
binary_list.append((i>>j)&1)
binary_sum.append((sum(b)%2)==1)
one_to_sixty_four = list(range(1,64))
count_rect = [0 for _ in [0]*(11**6)]
powers = [11**k for k in range(6)]
for i in range(10**6):
q = count[i]
p = i
b = [-1,-1,-1,-1,-1,-1]
for j in [0,1,2,3,4,5]:
b[j] = p%10+1
p //= 10
c = 0
for k in [0,1,2,3,4,5]:
c += b[k] * powers[k]
for j in one_to_sixty_four:
d = c
for k in [0,1,2,3,4,5]:
d -= binary_list[j*6+k]*powers[k]
if binary_sum[j]:
q += count_rect[d]
#print(f"added count_rect[{d}]: {count_rect[d]}")
else:
q -= count_rect[d]
#print(f"subtracted count_rect[{d}]: {count_rect[d]}")
count_rect[c] = q
#print(i, c, count[i], count_rect[c])
ans = 0
for a in A:
p = a
b = [-1,-1,-1,-1,-1,-1]
check = True
for j in [0,1,2,3,4,5]:
b[j] = 10-p%10
if b[j]<=4:
check = False
p //= 10
c = 0
for k in [0,1,2,3,4,5]:
c += b[k] * powers[k]
#print(b, c, count_rect[c])
ans += count_rect[c]
if check:
ans -= 1
print(ans//2)
N = int(input())
A = list(map(int, input().split()))
count = [0 for _ in range(10**6)]
for i in range(N):
count[A[i]] += 1
binary_list = []
binary_sum = []
for i in range(64):
b = []
for j in range(6):
b.append((i>>j)&1)
binary_list.append((i>>j)&1)
binary_sum.append((sum(b)%2)==1)
one_to_sixty_four = list(range(1,64))
count_rect = [0 for _ in [0]*(11**6)]
powers = [11**k for k in range(6)]
for i in range(10**6):
q = count[i]
p = i
b = [-1,-1,-1,-1,-1,-1]
for j in [0,1,2,3,4,5]:
b[j] = p%10+1
p //= 10
c = 0
for k in [0,1,2,3,4,5]:
c += b[k] * powers[k]
for j in one_to_sixty_four:
d = c
for k in [0,1,2,3,4,5]:
d -= binary_list[j*6+k]*powers[k]
if binary_sum[j]:
q += count_rect[d]
#print(f"added count_rect[{d}]: {count_rect[d]}")
else:
q -= count_rect[d]
#print(f"subtracted count_rect[{d}]: {count_rect[d]}")
count_rect[c] = q
#print(i, c, count[i], count_rect[c])
ans = 0
for a in A:
p = a
b = [-1,-1,-1,-1,-1,-1]
check = True
for j in [0,1,2,3,4,5]:
b[j] = 10-p%10
if b[j]<=5:
check = False
p //= 10
c = 0
for k in [0,1,2,3,4,5]:
c += b[k] * powers[k]
#print(b, c, count_rect[c])
ans += count_rect[c]
if check:
ans -= 1
print(ans//2)
|
ConDefects/ConDefects/Code/arc136_d/Python/42996075
|
condefects-python_data_1626
|
def read(): return list(map(int, input().strip().split()))
n, = read()
a = read()
S = [0 for i in range(10**6+5)]
selfpair = 0
for i in a:
S[i] = 1
if all([int(j) < 5 for j in str(i)]):
selfpair += 1
for j in range(6):
for i in range(10**6):
if (i // 10**j) % 10:
S[i] += S[i-10**j]
ans = 0
for i in a:
ans += S[999999 - i]
print((ans - selfpair) // 2)
def read(): return list(map(int, input().strip().split()))
n, = read()
a = read()
S = [0 for i in range(10**6+5)]
selfpair = 0
for i in a:
S[i] += 1
if all([int(j) < 5 for j in str(i)]):
selfpair += 1
for j in range(6):
for i in range(10**6):
if (i // 10**j) % 10:
S[i] += S[i-10**j]
ans = 0
for i in a:
ans += S[999999 - i]
print((ans - selfpair) // 2)
|
ConDefects/ConDefects/Code/arc136_d/Python/33407252
|
condefects-python_data_1627
|
n = int(input())
a = list(map(int,input().split()))
dp = [0] * 1000000
for i in range(n):
dp[999999-a[i]] += 1
for i in range(6):
mask = 10**i
for j in range(999999, -1, -1):
if (j//mask)%10 != 9:
dp[j] += dp[j+mask]
ans = 0
for i in range(n):
mode = 1
for j in range(6):
if (a[i]//(10**j))%10 > 5:
mode = 0
if mode:
ans -= 1
ans += dp[a[i]]
print(ans//2)
n = int(input())
a = list(map(int,input().split()))
dp = [0] * 1000000
for i in range(n):
dp[999999-a[i]] += 1
for i in range(6):
mask = 10**i
for j in range(999999, -1, -1):
if (j//mask)%10 != 9:
dp[j] += dp[j+mask]
ans = 0
for i in range(n):
mode = 1
for j in range(6):
if (a[i]//(10**j))%10 >= 5:
mode = 0
if mode:
ans -= 1
ans += dp[a[i]]
print(ans//2)
|
ConDefects/ConDefects/Code/arc136_d/Python/31067656
|
condefects-python_data_1628
|
mod=998244353
memo={}
def calc(l,r,tl,tr,flag,v):
if l>r:
return 0
if l==r:
if (l*tl)^(r*tr)==v and flag:
return 1
return 0
if (l,r,tl,tr,flag,v) in memo:
return memo[(l,r,tl,tr,flag,v)]
res=0
for l0 in range(2):
for r0 in range(2):
sl=l0&tl
sr=r0&tr
if sl^sr==v&1:
nflag=0
if l0!=r0:
nflag=(l0<r0)
else:
nflag=flag
res+=calc((l+1-l0)//2,(r-r0)//2,tl,tr,nflag,v>>1)
res%=mod
memo[(l,r,tl,tr,flag,v)]=res
return res
def solve(L,R,V):
ans=0
s=[0,1,3,0]
for i in range(4):
for j in range(4):
if s[i]^s[j]==V&3:
ans+=calc((L+3-i)//4,(R-j)//4,(i&1)^1,(j&1)^1,i<j,V>>2)
return ans
def naive(L,R,V):
ans=0
for l in range(L+1,R+1):
for r in range(l,R+1):
res=0
for i in range(l,r+1):
res^=i
if res==V:
ans+=1
return ans
debug=0
if not debug:
L,R,V=map(int,input().split())
print(solve(L-1,R,V))
exit()
import random
while True:
L=random.randint(0,100)
R=random.randint(L+1,101)
V=random.randint(0,100)
print(L,R,V)
if solve(L,R,V)!=naive(L,R,V):
print(L,R,V)
print(solve(L,R,V),naive(L,R,V))
mod=998244353
memo={}
def calc(l,r,tl,tr,flag,v):
if l>r:
return 0
if l==r:
if (l*tl)^(r*tr)==v and flag:
return 1
return 0
if (l,r,tl,tr,flag,v) in memo:
return memo[(l,r,tl,tr,flag,v)]
res=0
for l0 in range(2):
for r0 in range(2):
sl=l0&tl
sr=r0&tr
if sl^sr==v&1:
nflag=0
if l0!=r0:
nflag=(l0<r0)
else:
nflag=flag
res+=calc((l+1-l0)//2,(r-r0)//2,tl,tr,nflag,v>>1)
res%=mod
memo[(l,r,tl,tr,flag,v)]=res
return res
def solve(L,R,V):
ans=0
s=[0,1,3,0]
for i in range(4):
for j in range(4):
if s[i]^s[j]==V&3:
ans+=calc((L+3-i)//4,(R-j)//4,(i&1)^1,(j&1)^1,i<j,V>>2)
return ans%mod
def naive(L,R,V):
ans=0
for l in range(L+1,R+1):
for r in range(l,R+1):
res=0
for i in range(l,r+1):
res^=i
if res==V:
ans+=1
return ans
debug=0
if not debug:
L,R,V=map(int,input().split())
print(solve(L-1,R,V))
exit()
import random
while True:
L=random.randint(0,100)
R=random.randint(L+1,101)
V=random.randint(0,100)
print(L,R,V)
if solve(L,R,V)!=naive(L,R,V):
print(L,R,V)
print(solve(L,R,V),naive(L,R,V))
|
ConDefects/ConDefects/Code/arc133_d/Python/44249322
|
condefects-python_data_1629
|
P = 998244353
i12 = P + 1 >> 1
def chk(x, nx, dx, lx, rx):
ng = 0
if dx < lx:
ng ^= 1
if rx < dx:
ng ^= 2
if (x ^ 3) & ng :
return 0
nnx = x
if lx < dx:
nnx |= 1
if dx < rx:
nnx |= 2
if nnx == nx:
return 1
return 0
def subcalc(v, l1, r1, l2, r2):
if l1 > r1 or l2 > r2:
return 0
X = [[0] * 4 for _ in range(4)]
X[0][0] = 1
for kk in range(59, -1, -1):
d = v >> kk & 1
lx = l1 >> kk & 1
rx = r1 >> kk & 1
ly = l2 >> kk & 1
ry = r2 >> kk & 1
nX = [[0] * 4 for _ in range(4)]
for x in range(4):
for nx in range(4):
for dx in range(2):
fx = chk(x, nx, dx, lx, rx)
for y in range(4):
for ny in range(4):
for dy in range(2):
if d != dx ^ dy:
continue
fy = chk(y, ny, dy, ly, ry)
nX[nx][ny] = (nX[nx][ny] + X[x][y] * fx * fy) % P
X = nX
ret = sum([sum(x) % P for x in X])
return ret % P
def calc(L, R, V):
def td(x):
if x == 0:
return (1, 0)
if x == 1:
return (0, 1)
if x == 2:
return (1, 3)
if x == 3:
return (0, 0)
def calccalc(L1, R1, L2, R2, V):
ret = 0
for x in range(4):
tx, dx = td(x)
for y in range(4):
ty, dy = td(y)
l1 = (L1 - x + 3) // 4
r1 = (R1 - x) // 4
l2 = (L2 - y + 3) // 4
r2 = (R2 - y) // 4
v = V // 4
if l1 > r1 or l2 > r2:
continue
if dx ^ dy != V % 4:
continue
if tx == ty == 0:
if V == dx ^ dy:
ret += (r1 - l1 + 1) * (r2 - l2 + 1) % P
if x == y:
ret += min(r1, r2) - max(l1, l2) + 1
elif tx == 0:
if l2 <= v <= r2:
ret += (r1 - l1 + 1)
elif ty == 0:
if l1 <= v <= r1:
ret += (r2 - l2 + 1)
else:
r = subcalc(v, l1, r1, l2, r2)
if x == y:
r += min(r1, r2) - max(l1, l2) + 1
ret += r
return ret % P
ret = 0
ret += calccalc(L, R - 1, L, R - 1, V) * i12
ret += calccalc(L - 1, L - 1, L, R, V)
ret += calccalc(L, R - 1, R, R, V)
if V == 0:
ret -= R - L
return ret % P
L, R, V = map(int, input().split())
print(calc(L, R, V))
P = 998244353
i12 = P + 1 >> 1
def chk(x, nx, dx, lx, rx):
ng = 0
if dx < lx:
ng ^= 1
if rx < dx:
ng ^= 2
if (x ^ 3) & ng :
return 0
nnx = x
if lx < dx:
nnx |= 1
if dx < rx:
nnx |= 2
if nnx == nx:
return 1
return 0
def subcalc(v, l1, r1, l2, r2):
if l1 > r1 or l2 > r2:
return 0
X = [[0] * 4 for _ in range(4)]
X[0][0] = 1
for kk in range(59, -1, -1):
d = v >> kk & 1
lx = l1 >> kk & 1
rx = r1 >> kk & 1
ly = l2 >> kk & 1
ry = r2 >> kk & 1
nX = [[0] * 4 for _ in range(4)]
for x in range(4):
for nx in range(4):
for dx in range(2):
fx = chk(x, nx, dx, lx, rx)
for y in range(4):
for ny in range(4):
for dy in range(2):
if d != dx ^ dy:
continue
fy = chk(y, ny, dy, ly, ry)
nX[nx][ny] = (nX[nx][ny] + X[x][y] * fx * fy) % P
X = nX
ret = sum([sum(x) % P for x in X])
return ret % P
def calc(L, R, V):
def td(x):
if x == 0:
return (1, 0)
if x == 1:
return (0, 1)
if x == 2:
return (1, 3)
if x == 3:
return (0, 0)
def calccalc(L1, R1, L2, R2, V):
ret = 0
for x in range(4):
tx, dx = td(x)
for y in range(4):
ty, dy = td(y)
l1 = (L1 - x + 3) // 4
r1 = (R1 - x) // 4
l2 = (L2 - y + 3) // 4
r2 = (R2 - y) // 4
v = V // 4
if l1 > r1 or l2 > r2:
continue
if dx ^ dy != V % 4:
continue
if tx == ty == 0:
if V == dx ^ dy:
ret += (r1 - l1 + 1) * (r2 - l2 + 1) % P
if x == y:
ret += min(r1, r2) - max(l1, l2) + 1
elif tx == 0:
if l2 <= v <= r2:
ret += (r1 - l1 + 1)
elif ty == 0:
if l1 <= v <= r1:
ret += (r2 - l2 + 1)
else:
r = subcalc(v, l1, r1, l2, r2)
if x == y and V == 0:
r += min(r1, r2) - max(l1, l2) + 1
ret += r
return ret % P
ret = 0
ret += calccalc(L, R - 1, L, R - 1, V) * i12
ret += calccalc(L - 1, L - 1, L, R, V)
ret += calccalc(L, R - 1, R, R, V)
if V == 0:
ret -= R - L
return ret % P
L, R, V = map(int, input().split())
print(calc(L, R, V))
|
ConDefects/ConDefects/Code/arc133_d/Python/28699500
|
condefects-python_data_1630
|
def f(L,R,V):
#L,R,V=map(int,input().split())
ans=0
V2=V
L2=L
R2=R
if V%2==0:
V+=1
L+=1-L%2
R-=R%2
if L>R:
return 0
mod=998244353
#dp[i][Rflag][Lflag][flag] i桁目までRのflag,Lのflag xorがVのi桁目までと一致してる個数,等しいか？
S=bin(L)[2:]
T=bin(R)[2:]
K=bin(V)[2:]
S="0"*(len(T)-len(S))+S
if len(K)>len(T):
print(0)
exit()
K="0"*+(len(T)-len(K))+K
K="0"+K
S="0"+S
T="0"+T
dp=[[[[0]*2 for i in range(2)] for j in range(2)] for s in range(len(T))]
dp[0][1][1][1]=1
for i in range(1,len(T)):
if int(T[i])^int(S[i])==int(K[i]):
if int(K[i])==0:
dp[i][1][1][1]+=dp[i-1][1][1][1]
dp[i][1][1][0]+=dp[i-1][1][1][0]
if int(T[i])>int(S[i]):
dp[i][1][1][0]+=dp[i-1][1][1][1]
if int(K[i])==0:
dp[i][1][0][1]+=dp[i-1][1][0][1]
if int(T[i])>int(S[i]):
dp[i][1][0][1]+=dp[i-1][1][1][1]
if int(T[i])^int(K[i])<int(T[i]):
dp[i][1][0][0]+=dp[i-1][1][0][1]
if int(T[i])^int(K[i])>int(S[i]):
dp[i][1][0][0]+=dp[i-1][1][1][0]
#dp[i][1][0][0]+=dp[i-1][1][1][1]
dp[i][1][0][0]+=dp[i-1][1][0][0]
if int(K[i])==0:
dp[i][0][1][1]+=dp[i-1][0][1][1]
if int(K[i])==0 and int(T[i])>int(S[i]):
dp[i][0][1][1]+=dp[i-1][1][1][1]
dp[i][0][1][0]+=dp[i-1][0][1][0]
if int(T[i])==1 and int(S[i])==int(K[i]):
dp[i][0][1][0]+=dp[i-1][1][1][0]
if int(S[i])==0 and int(K[i])==1:
dp[i][0][1][0]+=dp[i-1][0][1][1]
#dp[i][0][1][0]+=dp[i-1][1][1][1]
if int(K[i])==0:
dp[i][0][0][1]+=dp[i-1][0][0][1]*2
if int(S[i])==0:
dp[i][0][0][1]+=dp[i-1][0][1][1]
if int(T[i])==1:
dp[i][0][0][1]+=dp[i-1][1][0][1]
#if 1-int(S[i])==1-int(T[i]):
#dp[i][0][0][1]+=dp[i-1][1][1][1]
if int(K[i])==1:
dp[i][0][0][0]+=dp[i-1][0][0][1]
#dp[i][0][0][0]+=dp[i-1][1][0][1]
#dp[i][0][0][0]+=dp[i-1][0][1][1]
#dp[i][0][0][0]+=dp[i-1][1][1][1]
dp[i][0][0][0]+=dp[i-1][0][0][0]*2
if int(T[i])==1:
dp[i][0][0][0]+=dp[i-1][1][0][0]
if int(S[i])==0:
dp[i][0][0][0]+=dp[i-1][0][1][0]
if int(T[i])==1 and int(S[i])==0 and int(K[i])==1:
dp[i][0][0][0]+=dp[i-1][1][1][0]
for n in range(8):
s=n//4
k=(n%4)//2
t=n%2
dp[i][s][k][t]%=mod
#ans+=dp[len(T)-2][1][1][1]
ans+=dp[len(T)-2][1][1][0]
#ans+=dp[len(T)-2][1][0][1]
ans+=dp[len(T)-2][1][0][0]
#ans+=dp[len(T)-2][0][1][1]
ans+=dp[len(T)-2][0][1][0]
#ans+=dp[len(T)-2][0][0][1]
ans+=dp[len(T)-2][0][0][0]
return ans%mod
mod=998244353
ans=0
L,R,V=map(int,input().split())
if V==1:
if L==1:
ans+=(R-L)//4+1
L+=L%2
R-=1-R%2
R+=2
V=0
if V==0:
L+=L%2
R-=1-R%2
if L>R:
print(0)
exit()
else:
s=(R-L+1)//2
if s%2==1:
s=s//2
print((ans+s*(s+1))%mod)
else:
s=s//2
print((ans+s*s)%mod)
exit()
ans=0
"""
ans=0
for i in range(L,R+1):
this=0
for j in range(i,R+1):
this^=j
if this==V:
ans+=1
print(ans)
"""
if L<=V<=R:
a=0
if V%2==0:
a+=(V-L)//4
a+=(R+1-V)//4
a+=1
else:
a+=(V+1-L)//4
a+=(R-V)//4
a+=1
if V%4==0:
print((f(L,R,V)+a)%mod)
if V%4==1:
print((a)%mod)
if V%4==2:
print((a)%mod)
if V%4==3:
print((f(L,R,V)+a)%mod)
else:
if V%4==1 or V%4==2:
print(0)
else:
print(f(L,R,V))
def f(L,R,V):
#L,R,V=map(int,input().split())
ans=0
V2=V
L2=L
R2=R
if V%2==0:
V+=1
L+=1-L%2
R-=R%2
if L>R:
return 0
mod=998244353
#dp[i][Rflag][Lflag][flag] i桁目までRのflag,Lのflag xorがVのi桁目までと一致してる個数,等しいか？
S=bin(L)[2:]
T=bin(R)[2:]
K=bin(V)[2:]
S="0"*(len(T)-len(S))+S
if len(K)>len(T):
print(0)
exit()
K="0"*+(len(T)-len(K))+K
K="0"+K
S="0"+S
T="0"+T
dp=[[[[0]*2 for i in range(2)] for j in range(2)] for s in range(len(T))]
dp[0][1][1][1]=1
for i in range(1,len(T)):
if int(T[i])^int(S[i])==int(K[i]):
if int(K[i])==0:
dp[i][1][1][1]+=dp[i-1][1][1][1]
dp[i][1][1][0]+=dp[i-1][1][1][0]
if int(T[i])>int(S[i]):
dp[i][1][1][0]+=dp[i-1][1][1][1]
if int(K[i])==0:
dp[i][1][0][1]+=dp[i-1][1][0][1]
if int(T[i])>int(S[i]):
dp[i][1][0][1]+=dp[i-1][1][1][1]
if int(T[i])^int(K[i])<int(T[i]):
dp[i][1][0][0]+=dp[i-1][1][0][1]
if int(T[i])^int(K[i])>int(S[i]):
dp[i][1][0][0]+=dp[i-1][1][1][0]
#dp[i][1][0][0]+=dp[i-1][1][1][1]
dp[i][1][0][0]+=dp[i-1][1][0][0]
if int(K[i])==0:
dp[i][0][1][1]+=dp[i-1][0][1][1]
if int(K[i])==0 and int(T[i])>int(S[i]):
dp[i][0][1][1]+=dp[i-1][1][1][1]
dp[i][0][1][0]+=dp[i-1][0][1][0]
if int(T[i])==1 and int(S[i])==int(K[i]):
dp[i][0][1][0]+=dp[i-1][1][1][0]
if int(S[i])==0 and int(K[i])==1:
dp[i][0][1][0]+=dp[i-1][0][1][1]
#dp[i][0][1][0]+=dp[i-1][1][1][1]
if int(K[i])==0:
dp[i][0][0][1]+=dp[i-1][0][0][1]*2
if int(S[i])==0:
dp[i][0][0][1]+=dp[i-1][0][1][1]
if int(T[i])==1:
dp[i][0][0][1]+=dp[i-1][1][0][1]
#if 1-int(S[i])==1-int(T[i]):
#dp[i][0][0][1]+=dp[i-1][1][1][1]
if int(K[i])==1:
dp[i][0][0][0]+=dp[i-1][0][0][1]
#dp[i][0][0][0]+=dp[i-1][1][0][1]
#dp[i][0][0][0]+=dp[i-1][0][1][1]
#dp[i][0][0][0]+=dp[i-1][1][1][1]
dp[i][0][0][0]+=dp[i-1][0][0][0]*2
if int(T[i])==1:
dp[i][0][0][0]+=dp[i-1][1][0][0]
if int(S[i])==0:
dp[i][0][0][0]+=dp[i-1][0][1][0]
if int(T[i])==1 and int(S[i])==0 and int(K[i])==1:
dp[i][0][0][0]+=dp[i-1][1][1][0]
for n in range(8):
s=n//4
k=(n%4)//2
t=n%2
dp[i][s][k][t]%=mod
#ans+=dp[len(T)-2][1][1][1]
ans+=dp[len(T)-2][1][1][0]
#ans+=dp[len(T)-2][1][0][1]
ans+=dp[len(T)-2][1][0][0]
#ans+=dp[len(T)-2][0][1][1]
ans+=dp[len(T)-2][0][1][0]
#ans+=dp[len(T)-2][0][0][1]
ans+=dp[len(T)-2][0][0][0]
return ans%mod
mod=998244353
ans=0
L,R,V=map(int,input().split())
if V==1:
if L==1:
ans+=(R-L)//4+1
L+=L%2
R-=1-R%2
R+=2
V=0
if V==0:
if L==1:
ans+=1+(R-3)//4
L+=L%2
R-=1-R%2
if L>R:
print(0)
exit()
else:
s=(R-L+1)//2
if s%2==1:
s=s//2
print((ans+s*(s+1))%mod)
else:
s=s//2
print((ans+s*s)%mod)
exit()
ans=0
"""
ans=0
for i in range(L,R+1):
this=0
for j in range(i,R+1):
this^=j
if this==V:
ans+=1
print(ans)
"""
if L<=V<=R:
a=0
if V%2==0:
a+=(V-L)//4
a+=(R+1-V)//4
a+=1
else:
a+=(V+1-L)//4
a+=(R-V)//4
a+=1
if V%4==0:
print((f(L,R,V)+a)%mod)
if V%4==1:
print((a)%mod)
if V%4==2:
print((a)%mod)
if V%4==3:
print((f(L,R,V)+a)%mod)
else:
if V%4==1 or V%4==2:
print(0)
else:
print(f(L,R,V))
|
ConDefects/ConDefects/Code/arc133_d/Python/28706821
|
condefects-python_data_1631
|
"""
a = 4 * x
a ^ (a + 1) ^ (a + 2) ^ (a + 3) = 0
l_0 := (l - 1) // 4 * 4
r_0 := r // 4 * 4
(l_0 ^ ... ^ l - 1) ^ (r_0 ^ ... ^ r) == V
下2桁とそれ以外に分ける
a = 4 * x
a = a
a ^ (a + 1) = 1
a ^ (a + 1) ^ (a + 2) = a + 3
a ^ (a + 1) ^ (a + 2) ^ (a + 3) = 0
"""
MOD = 998244353
l, r, v = map(int, input().split())
l -= 1
X = [0, 1, 3, 0]
v_0 = v % 4
v_1 = v // 4
bl = v_1.bit_length() - 1
def solve(l, r, a, b):
if a % 2 == 1 and b % 2 == 1:
if v_1 != 0:
return 0
else:
d = r - l + 1
if a < b:
return (d + 1) * d // 2
else:
return d * (d - 1) // 2
elif a % 2 == 1:
if l <= v_1 <= r:
if a < b:
return v_1 - l + 1
else:
return v_1 - l
else:
return 0
elif b % 2 == 1:
if l <= v_1 <= r:
if a < b:
return r - v_1 + 1
else:
return r - v_1
else:
return 0
elif v_1 == 0:
if a < b:
return r - l + 1
else:
return 0
else:
"""
l <= x < y <= r
x ^ y == v_0
の数え上げ
a < b
であれば x <= y になる
x = y は v_1 = 0 の時だけだから無視して良い
"""
memo = {}
"""
x := x がl以上をすでに満たしてる
y := y がr以下をすでに満たしてる
ll := 下から何桁目か
eq := x == y
"""
def dfs(x, y, ll, eq):
if ll == -1:
return x == -1 and y == -1
if (x, y, ll, eq) in memo:
return memo[(x, y, ll, eq)]
def plus(nx, ny, eq):
if ny == -1:
pass
elif ny > r:
return 0
elif ny + (1 << ll) - 1 <= r:
ny = -1
if nx == -1:
pass
elif nx >= l:
nx = -1
elif nx + (1 << ll) - 1 < l:
return 0
return dfs(nx, ny, ll - 1, eq)
ret = 0
if v_1 >> ll & 1:
# x に渡す
if not eq:
if x == -1:
nx = -1
else:
nx = x + (1 << ll)
ret += plus(nx, y, False)
# y に渡す
if y == -1:
ny = y
else:
ny = y + (1 << ll)
ret += plus(x, ny, False)
else:
# 両方に渡さない
ret += plus(x, y, eq)
# 両方に渡す
if x == -1:
nx = -1
else:
nx = x + (1 << ll)
if y == -1:
ny = y
else:
ny = y + (1 << ll)
ret += plus(nx, ny, eq)
ret %= MOD
memo[(x, y, ll, eq)] = ret
return ret
if (1 << (bl + 1)) - 1 < l:
return 0
if l == 0:
ll = -1
else:
ll = 0
if r >= ((1 << (bl + 1)) - 1):
rr = -1
else:
rr = 0
return dfs(ll, rr, bl, True)
ret = 0
for x in range(l, r + 1):
y = x ^ v_1
if x ^ y == v_1 and x <= y <= r:
ret += 1
return ret
ans = 0
for a in range(4):
for b in range(4):
if X[a] ^ X[b] != v_0:
continue
ll = (l - a + 3) // 4
assert l <= ll * 4 + a < l + 4
rr = (r - b) // 4
assert r - 4 < rr * 4 + b <= r
if ll > rr:
continue
ans += solve(ll, rr, a, b)
ans %= MOD
print(ans)
"""
a = 4 * x
a ^ (a + 1) ^ (a + 2) ^ (a + 3) = 0
l_0 := (l - 1) // 4 * 4
r_0 := r // 4 * 4
(l_0 ^ ... ^ l - 1) ^ (r_0 ^ ... ^ r) == V
下2桁とそれ以外に分ける
a = 4 * x
a = a
a ^ (a + 1) = 1
a ^ (a + 1) ^ (a + 2) = a + 3
a ^ (a + 1) ^ (a + 2) ^ (a + 3) = 0
"""
MOD = 998244353
l, r, v = map(int, input().split())
l -= 1
X = [0, 1, 3, 0]
v_0 = v % 4
v_1 = v // 4
def solve(l, r, a, b):
if a % 2 == 1 and b % 2 == 1:
if v_1 != 0:
return 0
else:
d = r - l + 1
if a < b:
return (d + 1) * d // 2
else:
return d * (d - 1) // 2
elif a % 2 == 1:
if l <= v_1 <= r:
if a < b:
return v_1 - l + 1
else:
return v_1 - l
else:
return 0
elif b % 2 == 1:
if l <= v_1 <= r:
if a < b:
return r - v_1 + 1
else:
return r - v_1
else:
return 0
elif v_1 == 0:
if a < b:
return r - l + 1
else:
return 0
else:
bl = max(v_1.bit_length(), l.bit_length(), r.bit_length()) - 1
"""
l <= x < y <= r
x ^ y == v_0
の数え上げ
a < b
であれば x <= y になる
x = y は v_1 = 0 の時だけだから無視して良い
"""
memo = {}
"""
x := x がl以上をすでに満たしてる
y := y がr以下をすでに満たしてる
ll := 下から何桁目か
eq := x == y
"""
def dfs(x, y, ll, eq):
if ll == -1:
return x == -1 and y == -1
if (x, y, ll, eq) in memo:
return memo[(x, y, ll, eq)]
def plus(nx, ny, eq):
if ny == -1:
pass
elif ny > r:
return 0
elif ny + (1 << ll) - 1 <= r:
ny = -1
if nx == -1:
pass
elif nx >= l:
nx = -1
elif nx + (1 << ll) - 1 < l:
return 0
return dfs(nx, ny, ll - 1, eq)
ret = 0
if v_1 >> ll & 1:
# x に渡す
if not eq:
if x == -1:
nx = -1
else:
nx = x + (1 << ll)
ret += plus(nx, y, False)
# y に渡す
if y == -1:
ny = y
else:
ny = y + (1 << ll)
ret += plus(x, ny, False)
else:
# 両方に渡さない
ret += plus(x, y, eq)
# 両方に渡す
if x == -1:
nx = -1
else:
nx = x + (1 << ll)
if y == -1:
ny = y
else:
ny = y + (1 << ll)
ret += plus(nx, ny, eq)
ret %= MOD
memo[(x, y, ll, eq)] = ret
return ret
if (1 << (bl + 1)) - 1 < l:
return 0
if l == 0:
ll = -1
else:
ll = 0
if r >= ((1 << (bl + 1)) - 1):
rr = -1
else:
rr = 0
return dfs(ll, rr, bl, True)
ret = 0
for x in range(l, r + 1):
y = x ^ v_1
if x ^ y == v_1 and x <= y <= r:
ret += 1
return ret
ans = 0
for a in range(4):
for b in range(4):
if X[a] ^ X[b] != v_0:
continue
ll = (l - a + 3) // 4
assert l <= ll * 4 + a < l + 4
rr = (r - b) // 4
assert r - 4 < rr * 4 + b <= r
if ll > rr:
continue
ans += solve(ll, rr, a, b)
ans %= MOD
print(ans)
|
ConDefects/ConDefects/Code/arc133_d/Python/28699416
|
condefects-python_data_1632
|
"""
毎回hatのビット列を生成して確かめるっていうのがだめ
境目を動かしていって、境目付近を見ればいい
"""
n = int(input())
s = list(input())
w = list(map(int, input().split()))
people = []
# 正解数
# 最初、0番目の人より左にあって、全て1と予測するので1の数をカウントしておく
cnt = 0
for i in range(n):
people.append((w[i], s[i]))
if s[i] == '1':
cnt += 1
people.sort()
ans = cnt
for i in range(n): # 左から仕切りをごかす
w, s = people[i]
# 0の人を飛び越えたら1足す
if s == '0':
cnt += 1
# 1の人を飛び越えたら1減らす
if s == '1':
cnt -= 1
# 隣の人と体重が同じならそれは境界とはいえない
# ansの更新を行わない(cntの計算だけしておいてスキップ)
if i+1 >= n or w != people[i+1]:
ans = max(ans, cnt)
print(ans)
"""
毎回hatのビット列を生成して確かめるっていうのがだめ
境目を動かしていって、境目付近を見ればいい
"""
n = int(input())
s = list(input())
w = list(map(int, input().split()))
people = []
# 正解数
# 最初、0番目の人より左にあって、全て1と予測するので1の数をカウントしておく
cnt = 0
for i in range(n):
people.append((w[i], s[i]))
if s[i] == '1':
cnt += 1
people.sort()
ans = cnt
for i in range(n): # 左から仕切りをごかす
w, s = people[i]
# 0の人を飛び越えたら1足す
if s == '0':
cnt += 1
# 1の人を飛び越えたら1減らす
if s == '1':
cnt -= 1
# 隣の人と体重が同じならそれは境界とはいえない
# ansの更新を行わない(cntの計算だけしておいてスキップ)
if i+1 >= n or w != people[i+1][0]:
ans = max(ans, cnt)
print(ans)
|
ConDefects/ConDefects/Code/abc257_c/Python/45044587
|
condefects-python_data_1633
|
INT = lambda : int(input())
MI = lambda : map(int, input().split())
MI_DEC = lambda : map(lambda x : int(x)-1, input().split())
LI = lambda : list(map(int, input().split()))
LI_DEC = lambda : list(map(lambda x : int(x)-1, input().split()))
N, X = MI()
AB = [LI() for i in range(N)]
sum = 0
ans = float('inf')
for i in range(1, N+1):
a, b = AB[i-1][0], AB[i-1][1]
sum += (a + b)
ans = min(ans, sum + (X - i)*b)
print(ans)
INT = lambda : int(input())
MI = lambda : map(int, input().split())
MI_DEC = lambda : map(lambda x : int(x)-1, input().split())
LI = lambda : list(map(int, input().split()))
LI_DEC = lambda : list(map(lambda x : int(x)-1, input().split()))
N, X = MI()
AB = [LI() for i in range(N)]
sum = 0
ans = float('inf')
for i in range(1, N+1):
if X - i < 0:
break
a, b = AB[i-1][0], AB[i-1][1]
sum += (a + b)
ans = min(ans, sum + (X - i)*b)
print(ans)
|
ConDefects/ConDefects/Code/abc258_d/Python/45493012
|
condefects-python_data_1634
|
n, x = map(int, input().split())
a, b = [0] * n, [0] * n
for i in range(n):
a[i], b[i] = map(int, input().split())
cum_a = [0]
cum_b = [0]
for i in range(n):
cum_a.append(cum_a[-1] + a[i])
cum_b.append(cum_b[-1] + b[i])
ans = 10 ** 20
for i in range(n):
temp = cum_a[i + 1] + cum_b[i] + b[i] * (x - i)
ans = min(ans, temp)
print(ans)
n, x = map(int, input().split())
a, b = [0] * n, [0] * n
for i in range(n):
a[i], b[i] = map(int, input().split())
cum_a = [0]
cum_b = [0]
for i in range(n):
cum_a.append(cum_a[-1] + a[i])
cum_b.append(cum_b[-1] + b[i])
ans = 10 ** 20
for i in range(n):
if i + 1 > x:
break
temp = cum_a[i + 1] + cum_b[i] + b[i] * (x - i)
ans = min(ans, temp)
print(ans)
|
ConDefects/ConDefects/Code/abc258_d/Python/45477729
|
condefects-python_data_1635
|
n, x = map(int, input().split())
ab = [list(map(int, input().split())) for _ in range(n)]
t = 0
c = 0
mn = 10 ** 18
for i in range(n):
if c >= x:
break
a = ab[i][0]
b = ab[i][1]
t += a
ans = (x - c) * b + t
mn = min(ans, mn)
c += 1
t += b
print(mn)
n, x = map(int, input().split())
ab = [list(map(int, input().split())) for _ in range(n)]
t = 0
c = 0
mn = 10 ** 19
for i in range(n):
if c >= x:
break
a = ab[i][0]
b = ab[i][1]
t += a
ans = (x - c) * b + t
mn = min(ans, mn)
c += 1
t += b
print(mn)
|
ConDefects/ConDefects/Code/abc258_d/Python/44886966
|
condefects-python_data_1636
|
N, X = map(int, input().split())
AB = [tuple(map(int, input().split())) for _ in [0]*N]
dp = [[0]*(N+1), [0]*(N+1)]
ans = 10**18
for i in range(N):
dp[0][i+1] = dp[0][i] + AB[i][0]+AB[i][1]
dp[1][i+1] = dp[0][i+1] + AB[i][1]*(max(0, X-i-1))
ans = min(ans, dp[1][i+1])
print(ans)
N, X = map(int, input().split())
AB = [tuple(map(int, input().split())) for _ in [0]*N]
dp = [[0]*(N+1), [0]*(N+1)]
ans = 10**20
for i in range(N):
dp[0][i+1] = dp[0][i] + AB[i][0]+AB[i][1]
dp[1][i+1] = dp[0][i+1] + AB[i][1]*(max(0, X-i-1))
ans = min(ans, dp[1][i+1])
print(ans)
|
ConDefects/ConDefects/Code/abc258_d/Python/45951298
|
condefects-python_data_1637
|
N, X = map(int, input().split())
sums = [0] * N
a, b = [], []
for i in range(N):
ai, bi = map(int, input().split())
a.append(ai)
b.append(bi)
sums[i] = ai + bi
for i in range(1, N):
sums[i] += sums[i - 1]
ans = [0] * N
INF = 10 ** 9
for i in range(N):
if X - (i + 1) < 0:
ans[i] = INF
else:
ans[i] = sums[i] + b[i] * (X - (i + 1))
print(min(ans))
N, X = map(int, input().split())
sums = [0] * N
a, b = [], []
for i in range(N):
ai, bi = map(int, input().split())
a.append(ai)
b.append(bi)
sums[i] = ai + bi
for i in range(1, N):
sums[i] += sums[i - 1]
ans = [0] * N
INF = 10 ** 10
for i in range(N):
if X - (i + 1) < 0:
ans[i] = INF
else:
ans[i] = sums[i] + b[i] * (X - (i + 1))
print(min(ans))
|
ConDefects/ConDefects/Code/abc258_d/Python/45032060
|
condefects-python_data_1638
|
n,x=map(int,input().split())
L=[list(map(int,input().split())) for i in range(n)]
total=[0 for i in range(n)]
total[0]=L[0][0]+L[0][1]
for i in range(1,n):
total[i]=total[i-1]+L[i][0]+L[i][1]
ans=10**15
m=10**10
for i in range(min(n,x)):
num=0
num+=total[i]
if m>L[i][1]:
m=L[i][1]
num+=(x-i-1)*m
if ans>num:
ans=num
print(ans)
n,x=map(int,input().split())
L=[list(map(int,input().split())) for i in range(n)]
total=[0 for i in range(n)]
total[0]=L[0][0]+L[0][1]
for i in range(1,n):
total[i]=total[i-1]+L[i][0]+L[i][1]
ans=10**20
m=10**10
for i in range(min(n,x)):
num=0
num+=total[i]
if m>L[i][1]:
m=L[i][1]
num+=(x-i-1)*m
if ans>num:
ans=num
print(ans)
|
ConDefects/ConDefects/Code/abc258_d/Python/45080701
|
condefects-python_data_1639
|
n,x=map(int,input().split())
s=[list(map(int,input().split())) for i in range(n)]
ans=10**20
su=[0]*(n+1)
for i in range(n):
su[i+1]=su[i]+sum(s[i])
su2=[s[i][0]]*n
for i in range(n):
su2[i]=min(su2[i-1],s[i][1])
for i in range(min(n,x)):
ans=min(ans,su[i+1]+su2[i]*(x-i-1))
print(ans)
n,x=map(int,input().split())
s=[list(map(int,input().split())) for i in range(n)]
ans=10**20
su=[0]*(n+1)
for i in range(n):
su[i+1]=su[i]+sum(s[i])
su2=[s[0][1]]*n
for i in range(n):
su2[i]=min(su2[i-1],s[i][1])
for i in range(min(n,x)):
ans=min(ans,su[i+1]+su2[i]*(x-i-1))
print(ans)
|
ConDefects/ConDefects/Code/abc258_d/Python/46036686
|
condefects-python_data_1640
|
N, X = [int(x) for x in input().split()]
AB = [[int(i) for i in input().split()] for _ in range(N)]
inf = 10**18
dp = [[0, inf] for _ in range(N + 1)]
min_b = inf
for i, (a, b) in enumerate(AB):
dp[i + 1][1] = min(dp[i][1], b)
dp[i + 1][0] = dp[i][0] + a + b
ans = inf
for i in range(1, N + 1):
second_play = dp[i][1]
cur_time = dp[i][0] + max((X - i), 0)*second_play
ans = min(ans, cur_time)
print(ans)
N, X = [int(x) for x in input().split()]
AB = [[int(i) for i in input().split()] for _ in range(N)]
inf = 2 * 10**18
dp = [[0, inf] for _ in range(N + 1)]
min_b = inf
for i, (a, b) in enumerate(AB):
dp[i + 1][1] = min(dp[i][1], b)
dp[i + 1][0] = dp[i][0] + a + b
ans = inf
for i in range(1, N + 1):
second_play = dp[i][1]
cur_time = dp[i][0] + max((X - i), 0)*second_play
ans = min(ans, cur_time)
print(ans)
|
ConDefects/ConDefects/Code/abc258_d/Python/45791882
|
condefects-python_data_1641
|
n,x=map(int,input().split())
L=[list(map(int,input().split())) for i in range(n)]
total=[0 for i in range(n)]
total[0]=L[0][0]+L[0][1]
for i in range(1,n):
total[i]=total[i-1]+L[i][0]+L[i][1]
ans=10**10
m=10**10
for i in range(min(n,x)):
num=0
num+=total[i]
if m>L[i][1]:
m=L[i][1]
num+=(x-i-1)*m
if ans>num:
ans=num
print(ans)
n,x=map(int,input().split())
L=[list(map(int,input().split())) for i in range(n)]
total=[0 for i in range(n)]
total[0]=L[0][0]+L[0][1]
for i in range(1,n):
total[i]=total[i-1]+L[i][0]+L[i][1]
ans=10**40
m=10**10
for i in range(min(n,x)):
num=0
num+=total[i]
if m>L[i][1]:
m=L[i][1]
num+=(x-i-1)*m
if ans>num:
ans=num
print(ans)
|
ConDefects/ConDefects/Code/abc258_d/Python/45080402
|
condefects-python_data_1642
|
N,X = map(int,input().split())
AB = [list(map(int,input().split()))for _ in range(N)]
ans = 10**18
ruiseki = 0
now=0
for i in range(N):
ruiseki += sum(AB[i])
now+=1
if (X-now)>=0:
ans = min(ans,ruiseki+(X-now)*AB[i][1])
print(ans)
N,X = map(int,input().split())
AB = [list(map(int,input().split()))for _ in range(N)]
ans = 10**100
ruiseki = 0
now=0
for i in range(N):
ruiseki += sum(AB[i])
now+=1
if (X-now)>=0:
ans = min(ans,ruiseki+(X-now)*AB[i][1])
print(ans)
|
ConDefects/ConDefects/Code/abc258_d/Python/45951540
|
condefects-python_data_1643
|
n, x = map(int, input().split())
s = []
bs = []
for i in range(n):
a, b = map(int, input().split())
if i == 0:
s.append(a+b)
else:
s.append(s[i-1] + a + b)
bs.append(b)
ans = 100000000000000000
for max_stage in range(n):
if x-1 <= max_stage:
time = s[x-1]
else:
time = s[max_stage] + bs[max_stage] * (x-max_stage-1)
ans = min(ans, time)
print(ans)
n, x = map(int, input().split())
s = []
bs = []
for i in range(n):
a, b = map(int, input().split())
if i == 0:
s.append(a+b)
else:
s.append(s[i-1] + a + b)
bs.append(b)
ans = 10 ** 20
for max_stage in range(n):
if x-1 <= max_stage:
time = s[x-1]
else:
time = s[max_stage] + bs[max_stage] * (x-max_stage-1)
ans = min(ans, time)
print(ans)
|
ConDefects/ConDefects/Code/abc258_d/Python/45041498
|
condefects-python_data_1644
|
n,x=map(int,input().split())
L=[[0,0]]
for _ in range(n):
a,b=map(int,input().split())
L+=[[L[-1][0]+a+b,b]]
ans=[]
for i in range(1,n):
ans+=[L[i][0]+L[i][1]*max(0,x-i)]
print(min(ans))
n,x=map(int,input().split())
L=[[0,0]]
for _ in range(n):
a,b=map(int,input().split())
L+=[[L[-1][0]+a+b,b]]
ans=[]
for i in range(1,n+1):
ans+=[L[i][0]+L[i][1]*max(0,x-i)]
print(min(ans))
|
ConDefects/ConDefects/Code/abc258_d/Python/45022453
|
condefects-python_data_1645
|
N, X = map(int, input().split())
games = []
total = 0
min_clear = 10**16
for i in range(min(N, X)):
a, b = map(int, input().split())
total += (a + b)
iteration = (X - i - 1) * b
tmp_ans = total + iteration
min_clear = min(min_clear, tmp_ans)
print(min_clear)
N, X = map(int, input().split())
games = []
total = 0
min_clear = 10**20
for i in range(min(N, X)):
a, b = map(int, input().split())
total += (a + b)
iteration = (X - i - 1) * b
tmp_ans = total + iteration
min_clear = min(min_clear, tmp_ans)
print(min_clear)
|
ConDefects/ConDefects/Code/abc258_d/Python/45815493
|
condefects-python_data_1646
|
import sys
input = sys.stdin.readline
from collections import deque
S=input().strip()
T=input().strip()
K=int(input())
CHANGE=[input().split() for i in range(K)]
DP=[[[1<<60]*len(T) for i in range(len(T))] for j in range(26)]
C1=[]
C2=[]
for x,y in CHANGE:
if len(y)==1:
C1.append([x,y])
else:
C2.append([x,y])
E1=[[1<<60]*26 for i in range(26)]
for i in range(26):
E1[i][i]=0
E2=[[] for i in range(26)]
for x,y in C1:
x0=ord(x)-97
y0=ord(y)-97
E2[y0].append(x0)
for i in range(26):
Q=deque()
Q.append(i)
while Q:
x=Q.popleft()
for to in E2[x]:
if E1[i][to]>E1[i][x]+1:
E1[i][to]=E1[i][x]+1
Q.append(to)
for i in range(len(T)):
x=ord(T[i])-97
for j in range(26):
DP[j][i][i]=E1[x][j]
for sa in range(len(T)):
for i in range(sa,len(T)):
first=i-sa
last=i
for x,y in C2:
DPX=[[1<<60]*len(T) for i in range(len(y))]
for j in range(len(y)):
sx=ord(y[j])-97
if j==0:
for k in range(first,last+1):
if DP[sx][first][k]!=1<<60:
DPX[j][k]=DP[sx][first][k]
else:
for k in range(first,last+1):
if DPX[j-1][k]!=1<<60:
for l in range(k+1,last+1):
if DP[sx][k+1][l]!=1<<60:
DPX[j][l]=min(DPX[j][l],DPX[j-1][k]+DP[sx][k+1][l])
if DPX[len(y)-1][last]!=1<<60:
DP[ord(x)-97][first][last]=DPX[len(y)-1][last]+1
for j in range(26):
if DP[j][first][last]!=1<<60:
for to in range(26):
DP[to][first][last]=min(DP[to][first][last],DP[j][first][last]+E1[j][to])
DPX=[[1<<60]*len(T) for i in range(len(S))]
for j in range(len(S)):
sx=ord(S[j])-97
if j==0:
for k in range(len(T)):
if DP[sx][0][k]!=1<<60:
DPX[j][k]=DP[sx][0][k]
else:
for k in range(len(T)):
if DPX[j-1][k]!=1<<60:
for l in range(k+1,len(T)):
if DP[sx][k+1][l]!=1<<60:
DPX[j][l]=min(DPX[j][l],DPX[j-1][k]+DP[sx][k+1][l])
if DPX[len(S)-1][last]>=1<<30:
print(-1)
else:
print(DPX[len(S)-1][last])
import sys
input = sys.stdin.readline
from collections import deque
S=input().strip()
T=input().strip()
K=int(input())
CHANGE=[input().split() for i in range(K)]
DP=[[[1<<60]*len(T) for i in range(len(T))] for j in range(26)]
C1=[]
C2=[]
for x,y in CHANGE:
if len(y)==1:
C1.append([x,y])
else:
C2.append([x,y])
E1=[[1<<60]*26 for i in range(26)]
for i in range(26):
E1[i][i]=0
E2=[[] for i in range(26)]
for x,y in C1:
x0=ord(x)-97
y0=ord(y)-97
E2[y0].append(x0)
for i in range(26):
Q=deque()
Q.append(i)
while Q:
x=Q.popleft()
for to in E2[x]:
if E1[i][to]>E1[i][x]+1:
E1[i][to]=E1[i][x]+1
Q.append(to)
for i in range(len(T)):
x=ord(T[i])-97
for j in range(26):
DP[j][i][i]=E1[x][j]
for sa in range(len(T)):
for i in range(sa,len(T)):
first=i-sa
last=i
for x,y in C2:
DPX=[[1<<60]*len(T) for i in range(len(y))]
for j in range(len(y)):
sx=ord(y[j])-97
if j==0:
for k in range(first,last+1):
if DP[sx][first][k]!=1<<60:
DPX[j][k]=DP[sx][first][k]
else:
for k in range(first,last+1):
if DPX[j-1][k]!=1<<60:
for l in range(k+1,last+1):
if DP[sx][k+1][l]!=1<<60:
DPX[j][l]=min(DPX[j][l],DPX[j-1][k]+DP[sx][k+1][l])
if DPX[len(y)-1][last]!=1<<60:
DP[ord(x)-97][first][last]=min(DP[ord(x)-97][first][last],DPX[len(y)-1][last]+1)
for j in range(26):
if DP[j][first][last]!=1<<60:
for to in range(26):
DP[to][first][last]=min(DP[to][first][last],DP[j][first][last]+E1[j][to])
DPX=[[1<<60]*len(T) for i in range(len(S))]
for j in range(len(S)):
sx=ord(S[j])-97
if j==0:
for k in range(len(T)):
if DP[sx][0][k]!=1<<60:
DPX[j][k]=DP[sx][0][k]
else:
for k in range(len(T)):
if DPX[j-1][k]!=1<<60:
for l in range(k+1,len(T)):
if DP[sx][k+1][l]!=1<<60:
DPX[j][l]=min(DPX[j][l],DPX[j-1][k]+DP[sx][k+1][l])
if DPX[len(S)-1][last]>=1<<30:
print(-1)
else:
print(DPX[len(S)-1][last])
|
ConDefects/ConDefects/Code/abc261_g/Python/33560185
|
condefects-python_data_1647
|
import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import gcd,log
input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())
"""
- 全体加算:yをクソデカにする 全体減産も可能
N=1の場合:自明
N=2の場合
a=bならc=dが必要でN=1に帰着 a < b とする
全体加算して 0,a(a≠0) に帰着
0,a からは x,y = 1,a+1 として 1,0 x,y = b,1+b として 0,b に変化できるので
0,a から 0,d-c にして全体加算
N=3の場合
"""
def solve_distinct(N,A,B):
if N == 1:
res = []
if A[0] <= B[0]:
res.append((B[0]-A[0],10**18))
else:
res.append((10**18-(A[0]-B[0]),10**18))
return res
for i in range(N):
for j in range(N):
if A[i] == A[j] and B[i]!=B[j]:
return [-1]
res = []
M = max(max(B),max(A)) + 1
idx = [i for i in range(N)]
idx.sort(key=lambda i:A[i])
goal = [-1] * N
pre = -1
for i in idx:
r = B[i]
"""
x >= (pre-r+Q-1)//Q
"""
if r < pre+M:
x = (pre+M-r+M-1)//M
r += M * x
assert r-pre >= M
goal[i] = r
pre = r
for i in (idx[0],):
r = B[i]
"""
x >= (pre-r+Q-1)//Q
"""
if r < pre+M:
x = (pre+M-r+M-1)//M
r += M * x
assert r-pre >= M
goal[i] = r
pre = r
tmp = A.copy()
#x = 1
#y = tmp[idx[-1]] + 1
#res.append((x,y))
#for i in range(N):
#tmp[i] = (tmp[i]+x) % y
for k in range(1,N)[::-1]:
d = goal[idx[(k+1)%N]] - goal[idx[k]] - tmp[idx[(k+1)%N]]
assert 0 <= d
x = d
y = (tmp[idx[k]]+d)
res.append((x,y))
for i in range(N):
tmp[i] = (tmp[i]+x) % y
print(tmp)
"""
x = goal[idx[0]]
y = 10**18
res.append((x,y))
for i in range(N):
tmp[i] = (tmp[i]+x) % y
"""
res.append((goal[idx[1]]%M,M))
for i in range(N):
tmp[i] = (tmp[i]+goal[idx[1]]) % M
assert tmp[i] == B[i]
return res
def solve(N,A,B):
if N == 1:
res = []
if A[0] <= B[0]:
res.append((B[0]-A[0],10**18))
else:
res.append((10**18-(A[0]-B[0]),10**18))
return res
for i in range(N):
for j in range(N):
if A[i] == A[j] and B[i]!=B[j]:
return [-1]
idx = []
new_A = []
new_B = []
for i in range(N):
if A[i] not in new_A:
new_A.append(A[i])
new_B.append(B[i])
return solve_distinct(len(new_A),new_A,new_B)
def checker(N,_A,B,res):
A = _A.copy()
assert len(res) <= N
for x,y in res:
assert 0 <= x < y
for i in range(N):
A[i] = (A[i]+x) % y
return A == B
while False:
N = random.randint(4,10)
A = [random.randint(0,10) for i in range(N)]
B = [random.randint(0,10) for i in range(N)]
res = solve(N,A,B)
if res!=[-1]:
assert checker(N,A,B,res)
print("OK")
N = int(input())
A = li()
B = li()
res = solve(N,A,B)
if res == [-1]:
print("No")
else:
assert checker(N,A,B,res)
print("Yes")
print(len(res))
for x,y in res:
print(x,y)
import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import gcd,log
input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())
"""
- 全体加算:yをクソデカにする 全体減産も可能
N=1の場合:自明
N=2の場合
a=bならc=dが必要でN=1に帰着 a < b とする
全体加算して 0,a(a≠0) に帰着
0,a からは x,y = 1,a+1 として 1,0 x,y = b,1+b として 0,b に変化できるので
0,a から 0,d-c にして全体加算
N=3の場合
"""
def solve_distinct(N,A,B):
if N == 1:
res = []
if A[0] <= B[0]:
res.append((B[0]-A[0],10**18))
else:
res.append((10**18-(A[0]-B[0]),10**18))
return res
for i in range(N):
for j in range(N):
if A[i] == A[j] and B[i]!=B[j]:
return [-1]
res = []
M = max(max(B),max(A)) + 1
idx = [i for i in range(N)]
idx.sort(key=lambda i:A[i])
goal = [-1] * N
pre = -1
for i in idx:
r = B[i]
"""
x >= (pre-r+Q-1)//Q
"""
if r < pre+M:
x = (pre+M-r+M-1)//M
r += M * x
assert r-pre >= M
goal[i] = r
pre = r
for i in (idx[0],):
r = B[i]
"""
x >= (pre-r+Q-1)//Q
"""
if r < pre+M:
x = (pre+M-r+M-1)//M
r += M * x
assert r-pre >= M
goal[i] = r
pre = r
tmp = A.copy()
#x = 1
#y = tmp[idx[-1]] + 1
#res.append((x,y))
#for i in range(N):
#tmp[i] = (tmp[i]+x) % y
for k in range(1,N)[::-1]:
d = goal[idx[(k+1)%N]] - goal[idx[k]] - tmp[idx[(k+1)%N]]
assert 0 <= d
x = d
y = (tmp[idx[k]]+d)
res.append((x,y))
for i in range(N):
tmp[i] = (tmp[i]+x) % y
#print(tmp)
"""
x = goal[idx[0]]
y = 10**18
res.append((x,y))
for i in range(N):
tmp[i] = (tmp[i]+x) % y
"""
res.append((goal[idx[1]]%M,M))
for i in range(N):
tmp[i] = (tmp[i]+goal[idx[1]]) % M
assert tmp[i] == B[i]
return res
def solve(N,A,B):
if N == 1:
res = []
if A[0] <= B[0]:
res.append((B[0]-A[0],10**18))
else:
res.append((10**18-(A[0]-B[0]),10**18))
return res
for i in range(N):
for j in range(N):
if A[i] == A[j] and B[i]!=B[j]:
return [-1]
idx = []
new_A = []
new_B = []
for i in range(N):
if A[i] not in new_A:
new_A.append(A[i])
new_B.append(B[i])
return solve_distinct(len(new_A),new_A,new_B)
def checker(N,_A,B,res):
A = _A.copy()
assert len(res) <= N
for x,y in res:
assert 0 <= x < y
for i in range(N):
A[i] = (A[i]+x) % y
return A == B
while False:
N = random.randint(4,10)
A = [random.randint(0,10) for i in range(N)]
B = [random.randint(0,10) for i in range(N)]
res = solve(N,A,B)
if res!=[-1]:
assert checker(N,A,B,res)
print("OK")
N = int(input())
A = li()
B = li()
res = solve(N,A,B)
if res == [-1]:
print("No")
else:
assert checker(N,A,B,res)
print("Yes")
print(len(res))
for x,y in res:
print(x,y)
|
ConDefects/ConDefects/Code/agc063_c/Python/44118621
|
condefects-python_data_1648
|
from __pypy__.builders import StringBuilder
import sys
from os import read as os_read, write as os_write
from atexit import register as atexist_register
from typing import Generic, Iterator, List, Tuple, Dict, Iterable, Sequence, Callable, Union, Optional, TypeVar
T = TypeVar('T')
Pair = Tuple[int, int]
Graph = List[List[int]]
Poly = List[int]
Vector = List[int]
Matrix = List[List[int]]
Func10 = Callable[[int], None]
Func20 = Callable[[int, int], None]
Func11 = Callable[[int], int]
Func21 = Callable[[int, int], int]
Func31 = Callable[[int, int, int], int]
class Fastio:
ibuf = bytes()
pil = pir = 0
sb = StringBuilder()
def load(self):
self.ibuf = self.ibuf[self.pil:]
self.ibuf += os_read(0, 131072)
self.pil = 0; self.pir = len(self.ibuf)
def flush_atexit(self): os_write(1, self.sb.build().encode())
def flush(self):
os_write(1, self.sb.build().encode())
self.sb = StringBuilder()
def fastin(self):
if self.pir - self.pil < 64: self.load()
minus = x = 0
while self.ibuf[self.pil] < 45: self.pil += 1
if self.ibuf[self.pil] == 45: minus = 1; self.pil += 1
while self.ibuf[self.pil] >= 48:
x = x * 10 + (self.ibuf[self.pil] & 15)
self.pil += 1
if minus: return -x
return x
def fastin_string(self):
if self.pir - self.pil < 64: self.load()
while self.ibuf[self.pil] <= 32: self.pil += 1
res = bytearray()
while self.ibuf[self.pil] > 32:
if self.pir - self.pil < 64: self.load()
res.append(self.ibuf[self.pil])
self.pil += 1
return res
def fastout(self, x): self.sb.append(str(x))
def fastoutln(self, x): self.sb.append(str(x)); self.sb.append('\n')
fastio = Fastio()
rd = fastio.fastin; rds = fastio.fastin_string; wt = fastio.fastout; wtn = fastio.fastoutln; flush = fastio.flush
atexist_register(fastio.flush_atexit)
sys.stdin = None; sys.stdout = None
def rdl(n): return [rd() for _ in range(n)]
def wtnl(l): wtn(' '.join(map(str, l)))
def wtn_yes(): wtn("Yes")
def wtn_no(): wtn("No")
def print(*arg): wtnl(arg)
def modinv(a: int, m: int) -> int:
'''return x s.t. x == a^(-1) (mod m)'''
b = m; u = 1; v = 0
while b:
t = a // b
a, b = b, a - t * b
u, v = v, u - t * v
u %= m
return u
MOD = 998244353
_IMAG = 911660635
_IIMAG = 86583718
_rate2 = (0, 911660635, 509520358, 369330050, 332049552, 983190778, 123842337, 238493703, 975955924, 603855026, 856644456, 131300601, 842657263, 730768835, 942482514, 806263778, 151565301, 510815449, 503497456, 743006876, 741047443, 56250497, 867605899, 0)
_rate3 = (0, 372528824, 337190230, 454590761, 816400692, 578227951, 180142363, 83780245, 6597683, 70046822, 623238099, 183021267, 402682409, 631680428, 344509872, 689220186, 365017329, 774342554, 729444058, 102986190, 128751033, 395565204, 0)
_irate3 = (0, 509520358, 929031873, 170256584, 839780419, 282974284, 395914482, 444904435, 72135471, 638914820, 66769500, 771127074, 985925487, 262319669, 262341272, 625870173, 768022760, 859816005, 914661783, 430819711, 272774365, 530924681, 0)
class NTT:
@staticmethod
def _fft(a: Vector) -> None:
n = len(a)
h = (n - 1).bit_length()
le = 0
for le in range(0, h - 1, 2):
p = 1 << (h - le - 2)
rot = 1
for s in range(1 << le):
rot2 = rot * rot % MOD
rot3 = rot2 * rot % MOD
offset = s << (h - le)
for i in range(p):
a0 = a[i + offset]
a1 = a[i + offset + p] * rot
a2 = a[i + offset + p * 2] * rot2
a3 = a[i + offset + p * 3] * rot3
a1na3imag = (a1 - a3) % MOD * _IMAG
a[i + offset] = (a0 + a2 + a1 + a3) % MOD
a[i + offset + p] = (a0 + a2 - a1 - a3) % MOD
a[i + offset + p * 2] = (a0 - a2 + a1na3imag) % MOD
a[i + offset + p * 3] = (a0 - a2 - a1na3imag) % MOD
rot = rot * _rate3[(~s & -~s).bit_length()] % MOD
if h - le & 1:
rot = 1
for s in range(1 << (h - 1)):
offset = s << 1
l = a[offset]
r = a[offset + 1] * rot
a[offset] = (l + r) % MOD
a[offset + 1] = (l - r) % MOD
rot = rot * _rate2[(~s & -~s).bit_length()] % MOD
@staticmethod
def _ifft(a: Vector) -> None:
n = len(a)
h = (n - 1).bit_length()
le = h
for le in range(h, 1, -2):
p = 1 << (h - le)
irot = 1
for s in range(1 << (le - 2)):
irot2 = irot * irot % MOD
irot3 = irot2 * irot % MOD
offset = s << (h - le + 2)
for i in range(p):
a0 = a[i + offset]
a1 = a[i + offset + p]
a2 = a[i + offset + p * 2]
a3 = a[i + offset + p * 3]
a2na3iimag = (a2 - a3) * _IIMAG % MOD
a[i + offset] = (a0 + a1 + a2 + a3) % MOD
a[i + offset + p] = (a0 - a1 + a2na3iimag) * irot % MOD
a[i + offset + p * 2] = (a0 + a1 - a2 - a3) * irot2 % MOD
a[i + offset + p * 3] = (a0 - a1 - a2na3iimag) * irot3 % MOD
irot = irot * _irate3[(~s & -~s).bit_length()] % MOD
if le & 1:
p = 1 << (h - 1)
for i in range(p):
l = a[i]
r = a[i + p]
a[i] = l + r if l + r < MOD else l + r - MOD
a[i + p] = l - r if l - r >= 0 else l - r + MOD
@classmethod
def ntt(cls, a: Vector) -> None:
if len(a) <= 1: return
cls._fft(a)
@classmethod
def intt(cls, a:Vector) -> None:
if len(a) <= 1: return
cls._ifft(a)
iv = modinv(len(a), MOD)
for i, x in enumerate(a): a[i] = x * iv % MOD
@classmethod
def multiply(cls, s: Vector, t: Vector) -> Vector:
n, m = len(s), len(t)
l = n + m - 1
if min(n, m) <= 60:
a = [0] * l
for i, x in enumerate(s):
for j, y in enumerate(t):
a[i + j] = (a[i + j] + x * y) % MOD
return a
z = 1 << (l - 1).bit_length()
a = s + [0] * (z - n)
b = t + [0] * (z - m)
cls._fft(a)
cls._fft(b)
for i, x in enumerate(b): a[i] = a[i] * x % MOD
cls._ifft(a)
a[l:] = []
iz = modinv(z, MOD)
return [x * iz % MOD for x in a]
@classmethod
def pow2(cls, s: Vector) -> Vector:
n = len(s)
l = (n << 1) - 1
if n <= 60:
a = [0] * l
for i, x in enumerate(s):
for j, y in enumerate(s):
a[i + j] = (a[i + j] + x * y) % MOD
return a
z = 1 << (l - 1).bit_length()
a = s + [0] * (z - n)
cls._fft(a)
for i, x in enumerate(a): a[i] = x * x % MOD
cls._ifft(a)
a[l:] = []
iz = modinv(z, MOD)
return [x * iz % MOD for x in a]
@classmethod
def ntt_doubling(cls, a: Vector) -> None:
M = len(a)
b = a[:]
cls.intt(b)
r = 1
zeta = pow(3, (MOD - 1) // (M << 1), MOD)
for i, x in enumerate(b):
b[i] = x * r % MOD
r = r * zeta % MOD
cls.ntt(b)
a += b
# https://nyaannyaan.github.io/library/ntt/relaxed-convolution.hpp
class RelaxedConvolution:
def __init__(self, n: int) -> None:
self.n = n
self.q = 0
self.a = [0] * (n + 1)
self.b = [0] * (n + 1)
self.c = [0] * (n + 1)
self.aa: List[Poly] = []
self.bb: List[Poly] = []
def get(self, x: int, y: int) -> int:
'''
x: a[q]
y: b[q]
return: c[q]
'''
q, n = self.q, self.n
a, b, c = self.a, self.b, self.c
aa, bb = self.aa, self.bb
assert(q <= n)
a[q] = x; b[q] = y
c[q] += a[q] * b[0] + (b[q] * a[0] if q else 0)
c[q] %= MOD
def precalc(lg: int) -> None:
if len(aa) <= lg:
aa[len(aa):] = [0] * (lg + 1 - len(aa))
bb[len(bb):] = [0] * (lg + 1 - len(bb))
if aa[lg]: return
d = 1 << lg
s = a[:d << 1]
t = b[:d << 1]
NTT.ntt(s); NTT.ntt(t)
aa[lg] = s; bb[lg] = t
self.q += 1; q += 1
if q > n:
return c[q - 1]
f: Poly = []
g: Poly = []
for lg in range(q.bit_length()):
d = 1 << lg
if q & ((d << 1) - 1) != d:
continue
if q == d:
f = a[:d] + [0] * d
g = b[:d] + [0] * d
NTT.ntt(f); NTT.ntt(g)
f = [f[i] * y % MOD for i, y in enumerate(g)]
NTT.intt(f)
for i in range(q, min(q + d, n + 1)):
c[i] += f[d + i - q]
c[i] %= MOD
else:
precalc(lg)
f = [a[q - d + i] for i in range(d)] + [0] * d
g = [b[q - d + i] for i in range(d)] + [0] * d
NTT.ntt(f); NTT.ntt(g)
s = aa[lg]; t = bb[lg]
for i in range(d << 1):
f[i] = (f[i] * t[i] + g[i] * s[i]) % MOD
NTT.intt(f)
for i in range(q, min(q + d, n + 1)):
c[i] += f[d + i - q]
c[i] %= MOD
return c[q - 1]
N = rd()
A = rdl(N)
F = [1]
G = [0]
conv = RelaxedConvolution(N)
for i in range(N):
f = F[i]
G.append(G[-1] + conv.get(f, f))
F.append(G[-1] * A[i] % MOD)
wtnl(F)
from __pypy__.builders import StringBuilder
import sys
from os import read as os_read, write as os_write
from atexit import register as atexist_register
from typing import Generic, Iterator, List, Tuple, Dict, Iterable, Sequence, Callable, Union, Optional, TypeVar
T = TypeVar('T')
Pair = Tuple[int, int]
Graph = List[List[int]]
Poly = List[int]
Vector = List[int]
Matrix = List[List[int]]
Func10 = Callable[[int], None]
Func20 = Callable[[int, int], None]
Func11 = Callable[[int], int]
Func21 = Callable[[int, int], int]
Func31 = Callable[[int, int, int], int]
class Fastio:
ibuf = bytes()
pil = pir = 0
sb = StringBuilder()
def load(self):
self.ibuf = self.ibuf[self.pil:]
self.ibuf += os_read(0, 131072)
self.pil = 0; self.pir = len(self.ibuf)
def flush_atexit(self): os_write(1, self.sb.build().encode())
def flush(self):
os_write(1, self.sb.build().encode())
self.sb = StringBuilder()
def fastin(self):
if self.pir - self.pil < 64: self.load()
minus = x = 0
while self.ibuf[self.pil] < 45: self.pil += 1
if self.ibuf[self.pil] == 45: minus = 1; self.pil += 1
while self.ibuf[self.pil] >= 48:
x = x * 10 + (self.ibuf[self.pil] & 15)
self.pil += 1
if minus: return -x
return x
def fastin_string(self):
if self.pir - self.pil < 64: self.load()
while self.ibuf[self.pil] <= 32: self.pil += 1
res = bytearray()
while self.ibuf[self.pil] > 32:
if self.pir - self.pil < 64: self.load()
res.append(self.ibuf[self.pil])
self.pil += 1
return res
def fastout(self, x): self.sb.append(str(x))
def fastoutln(self, x): self.sb.append(str(x)); self.sb.append('\n')
fastio = Fastio()
rd = fastio.fastin; rds = fastio.fastin_string; wt = fastio.fastout; wtn = fastio.fastoutln; flush = fastio.flush
atexist_register(fastio.flush_atexit)
sys.stdin = None; sys.stdout = None
def rdl(n): return [rd() for _ in range(n)]
def wtnl(l): wtn(' '.join(map(str, l)))
def wtn_yes(): wtn("Yes")
def wtn_no(): wtn("No")
def print(*arg): wtnl(arg)
def modinv(a: int, m: int) -> int:
'''return x s.t. x == a^(-1) (mod m)'''
b = m; u = 1; v = 0
while b:
t = a // b
a, b = b, a - t * b
u, v = v, u - t * v
u %= m
return u
MOD = 998244353
_IMAG = 911660635
_IIMAG = 86583718
_rate2 = (0, 911660635, 509520358, 369330050, 332049552, 983190778, 123842337, 238493703, 975955924, 603855026, 856644456, 131300601, 842657263, 730768835, 942482514, 806263778, 151565301, 510815449, 503497456, 743006876, 741047443, 56250497, 867605899, 0)
_rate3 = (0, 372528824, 337190230, 454590761, 816400692, 578227951, 180142363, 83780245, 6597683, 70046822, 623238099, 183021267, 402682409, 631680428, 344509872, 689220186, 365017329, 774342554, 729444058, 102986190, 128751033, 395565204, 0)
_irate3 = (0, 509520358, 929031873, 170256584, 839780419, 282974284, 395914482, 444904435, 72135471, 638914820, 66769500, 771127074, 985925487, 262319669, 262341272, 625870173, 768022760, 859816005, 914661783, 430819711, 272774365, 530924681, 0)
class NTT:
@staticmethod
def _fft(a: Vector) -> None:
n = len(a)
h = (n - 1).bit_length()
le = 0
for le in range(0, h - 1, 2):
p = 1 << (h - le - 2)
rot = 1
for s in range(1 << le):
rot2 = rot * rot % MOD
rot3 = rot2 * rot % MOD
offset = s << (h - le)
for i in range(p):
a0 = a[i + offset]
a1 = a[i + offset + p] * rot
a2 = a[i + offset + p * 2] * rot2
a3 = a[i + offset + p * 3] * rot3
a1na3imag = (a1 - a3) % MOD * _IMAG
a[i + offset] = (a0 + a2 + a1 + a3) % MOD
a[i + offset + p] = (a0 + a2 - a1 - a3) % MOD
a[i + offset + p * 2] = (a0 - a2 + a1na3imag) % MOD
a[i + offset + p * 3] = (a0 - a2 - a1na3imag) % MOD
rot = rot * _rate3[(~s & -~s).bit_length()] % MOD
if h - le & 1:
rot = 1
for s in range(1 << (h - 1)):
offset = s << 1
l = a[offset]
r = a[offset + 1] * rot
a[offset] = (l + r) % MOD
a[offset + 1] = (l - r) % MOD
rot = rot * _rate2[(~s & -~s).bit_length()] % MOD
@staticmethod
def _ifft(a: Vector) -> None:
n = len(a)
h = (n - 1).bit_length()
le = h
for le in range(h, 1, -2):
p = 1 << (h - le)
irot = 1
for s in range(1 << (le - 2)):
irot2 = irot * irot % MOD
irot3 = irot2 * irot % MOD
offset = s << (h - le + 2)
for i in range(p):
a0 = a[i + offset]
a1 = a[i + offset + p]
a2 = a[i + offset + p * 2]
a3 = a[i + offset + p * 3]
a2na3iimag = (a2 - a3) * _IIMAG % MOD
a[i + offset] = (a0 + a1 + a2 + a3) % MOD
a[i + offset + p] = (a0 - a1 + a2na3iimag) * irot % MOD
a[i + offset + p * 2] = (a0 + a1 - a2 - a3) * irot2 % MOD
a[i + offset + p * 3] = (a0 - a1 - a2na3iimag) * irot3 % MOD
irot = irot * _irate3[(~s & -~s).bit_length()] % MOD
if le & 1:
p = 1 << (h - 1)
for i in range(p):
l = a[i]
r = a[i + p]
a[i] = l + r if l + r < MOD else l + r - MOD
a[i + p] = l - r if l - r >= 0 else l - r + MOD
@classmethod
def ntt(cls, a: Vector) -> None:
if len(a) <= 1: return
cls._fft(a)
@classmethod
def intt(cls, a:Vector) -> None:
if len(a) <= 1: return
cls._ifft(a)
iv = modinv(len(a), MOD)
for i, x in enumerate(a): a[i] = x * iv % MOD
@classmethod
def multiply(cls, s: Vector, t: Vector) -> Vector:
n, m = len(s), len(t)
l = n + m - 1
if min(n, m) <= 60:
a = [0] * l
for i, x in enumerate(s):
for j, y in enumerate(t):
a[i + j] = (a[i + j] + x * y) % MOD
return a
z = 1 << (l - 1).bit_length()
a = s + [0] * (z - n)
b = t + [0] * (z - m)
cls._fft(a)
cls._fft(b)
for i, x in enumerate(b): a[i] = a[i] * x % MOD
cls._ifft(a)
a[l:] = []
iz = modinv(z, MOD)
return [x * iz % MOD for x in a]
@classmethod
def pow2(cls, s: Vector) -> Vector:
n = len(s)
l = (n << 1) - 1
if n <= 60:
a = [0] * l
for i, x in enumerate(s):
for j, y in enumerate(s):
a[i + j] = (a[i + j] + x * y) % MOD
return a
z = 1 << (l - 1).bit_length()
a = s + [0] * (z - n)
cls._fft(a)
for i, x in enumerate(a): a[i] = x * x % MOD
cls._ifft(a)
a[l:] = []
iz = modinv(z, MOD)
return [x * iz % MOD for x in a]
@classmethod
def ntt_doubling(cls, a: Vector) -> None:
M = len(a)
b = a[:]
cls.intt(b)
r = 1
zeta = pow(3, (MOD - 1) // (M << 1), MOD)
for i, x in enumerate(b):
b[i] = x * r % MOD
r = r * zeta % MOD
cls.ntt(b)
a += b
# https://nyaannyaan.github.io/library/ntt/relaxed-convolution.hpp
class RelaxedConvolution:
def __init__(self, n: int) -> None:
self.n = n
self.q = 0
self.a = [0] * (n + 1)
self.b = [0] * (n + 1)
self.c = [0] * (n + 1)
self.aa: List[Poly] = []
self.bb: List[Poly] = []
def get(self, x: int, y: int) -> int:
'''
x: a[q]
y: b[q]
return: c[q]
'''
q, n = self.q, self.n
a, b, c = self.a, self.b, self.c
aa, bb = self.aa, self.bb
assert(q <= n)
a[q] = x; b[q] = y
c[q] += a[q] * b[0] + (b[q] * a[0] if q else 0)
c[q] %= MOD
def precalc(lg: int) -> None:
if len(aa) <= lg:
aa[len(aa):] = [0] * (lg + 1 - len(aa))
bb[len(bb):] = [0] * (lg + 1 - len(bb))
if aa[lg]: return
d = 1 << lg
s = a[:d << 1]
t = b[:d << 1]
NTT.ntt(s); NTT.ntt(t)
aa[lg] = s; bb[lg] = t
self.q += 1; q += 1
if q > n:
return c[q - 1]
f: Poly = []
g: Poly = []
for lg in range(q.bit_length()):
d = 1 << lg
if q & ((d << 1) - 1) != d:
continue
if q == d:
f = a[:d] + [0] * d
g = b[:d] + [0] * d
NTT.ntt(f); NTT.ntt(g)
f = [f[i] * y % MOD for i, y in enumerate(g)]
NTT.intt(f)
for i in range(q, min(q + d, n + 1)):
c[i] += f[d + i - q]
c[i] %= MOD
else:
precalc(lg)
f = [a[q - d + i] for i in range(d)] + [0] * d
g = [b[q - d + i] for i in range(d)] + [0] * d
NTT.ntt(f); NTT.ntt(g)
s = aa[lg]; t = bb[lg]
for i in range(d << 1):
f[i] = (f[i] * t[i] + g[i] * s[i]) % MOD
NTT.intt(f)
for i in range(q, min(q + d, n + 1)):
c[i] += f[d + i - q]
c[i] %= MOD
return c[q - 1]
N = rd()
A = rdl(N)
F = [1]
G = [0]
conv = RelaxedConvolution(N)
for i in range(N):
f = F[i]
G.append(G[-1] + conv.get(f, f))
F.append(G[-1] * A[i] % MOD)
wtnl(F[1:])
|
ConDefects/ConDefects/Code/abc315_h/Python/44773178
|
condefects-python_data_1649
|
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):
return {r: self.members(r) for r in self.roots()}
def __str__(self):
return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
from heapq import heapify, heappop as pop, heappush as push
N, M, K = map(int, input().split())
edge = [[] for _ in range(N)]
for _ in range(M):
a, b, c = map(int, input().split())
a -= 1; b -= 1
edge[a].append((c, b))
edge[b].append((c, a))
dist = [10**18]*N
visited = [False]*N
for i in range(K):
dist[i] = 0
q = [(0, i) for i in range(K)]
heapify(q)
while q:
d, n = pop(q)
if visited[n]:
continue
visited[n] = True
for ed, e in edge[n]:
if visited[e]:
continue
if dist[n]+ed < dist[e]:
dist[e] = dist[n]+ed
push(q, (dist[e], e))
new_edges = []
for i, temp in enumerate(edge):
for d, j in temp:
new_edges.append((dist[i]+dist[j]+d, i, j))
new_edges.sort()
new_edges.append((10**20, -1, -1))
Q = int(input())
query = []
for i in range(Q):
x, y, t = map(int, input().split())
query.append((t, x-1, y-1, i))
query.sort()
ans = [None]*Q
uf = UnionFind(N)
next_edge_idx = 0
for t, x, y, i in query:
while new_edges[next_edge_idx][0] <= t:
d, a, b = new_edges[next_edge_idx]
uf.union(a, b)
next_edge_idx += 1
if uf.same(x, y):
ans[i] = "Yes"
else:
ans[i] = "No"
print(*ans, sep="\n")
print(dist)
print(new_edges)
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):
return {r: self.members(r) for r in self.roots()}
def __str__(self):
return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
from heapq import heapify, heappop as pop, heappush as push
N, M, K = map(int, input().split())
edge = [[] for _ in range(N)]
for _ in range(M):
a, b, c = map(int, input().split())
a -= 1; b -= 1
edge[a].append((c, b))
edge[b].append((c, a))
dist = [10**18]*N
visited = [False]*N
for i in range(K):
dist[i] = 0
q = [(0, i) for i in range(K)]
heapify(q)
while q:
d, n = pop(q)
if visited[n]:
continue
visited[n] = True
for ed, e in edge[n]:
if visited[e]:
continue
if dist[n]+ed < dist[e]:
dist[e] = dist[n]+ed
push(q, (dist[e], e))
new_edges = []
for i, temp in enumerate(edge):
for d, j in temp:
new_edges.append((dist[i]+dist[j]+d, i, j))
new_edges.sort()
new_edges.append((10**20, -1, -1))
Q = int(input())
query = []
for i in range(Q):
x, y, t = map(int, input().split())
query.append((t, x-1, y-1, i))
query.sort()
ans = [None]*Q
uf = UnionFind(N)
next_edge_idx = 0
for t, x, y, i in query:
while new_edges[next_edge_idx][0] <= t:
d, a, b = new_edges[next_edge_idx]
uf.union(a, b)
next_edge_idx += 1
if uf.same(x, y):
ans[i] = "Yes"
else:
ans[i] = "No"
print(*ans, sep="\n")
|
ConDefects/ConDefects/Code/abc250_h/Python/31555605
|
condefects-python_data_1650
|
from collections import deque
N, M = map(int, input().split())
E = [[] for _ in range(N)]
for _ in range(M):
u, v = map(int, input().split())
E[u - 1].append(v - 1)
E[v - 1].append(u - 1)
S = tuple(map(int, input()))
stack = deque([(0, None, True)])
visited = [False] * N
P = []
while stack:
q, p, first = stack.pop()
if visited[q]:
if not first and P[-1] != q: P.append(q)
continue
visited[q] = True
P.append(q)
if first:
for e in E[q]:
if e == p: continue
stack.append((q, None, False))
stack.append((e, q, True))
L = [None] * N
for i, p in enumerate(P):
L[p] = i
C = [0] * N
ans = []
for i, p in enumerate(P[1:], 1):
pprev = P[i - 1]
ans.append(p)
C[p] += 1
C[p] %= 2
if C[pprev] != S[pprev] and L[pprev] == i - 1:
ans.append(pprev)
C[pprev] += 1
C[pprev] %= 2
ans.append(p)
C[p] += 1
C[p] %= 2
if C[0] != S[0]:
ans = ans[:-1]
print(len(ans))
print(' '.join(map(str, ans)))
from collections import deque
N, M = map(int, input().split())
E = [[] for _ in range(N)]
for _ in range(M):
u, v = map(int, input().split())
E[u - 1].append(v - 1)
E[v - 1].append(u - 1)
S = tuple(map(int, input()))
stack = deque([(0, None, True)])
visited = [False] * N
P = []
while stack:
q, p, first = stack.pop()
if visited[q]:
if not first and P[-1] != q: P.append(q)
continue
visited[q] = True
P.append(q)
if first:
for e in E[q]:
if e == p: continue
stack.append((q, None, False))
stack.append((e, q, True))
L = [None] * N
for i, p in enumerate(P):
L[p] = i
C = [0] * N
ans = []
for i, p in enumerate(P[1:], 1):
pprev = P[i - 1]
ans.append(p)
C[p] += 1
C[p] %= 2
if C[pprev] != S[pprev] and L[pprev] == i - 1:
ans.append(pprev)
C[pprev] += 1
C[pprev] %= 2
ans.append(p)
C[p] += 1
C[p] %= 2
if C[0] != S[0]:
ans = ans[:-1]
print(len(ans))
print(' '.join(map(str, [a + 1 for a in ans])))
|
ConDefects/ConDefects/Code/abc244_g/Python/32985131
|
condefects-python_data_1651
|
array = list(map(int,input().split()))
xy1 = array
array = list(map(int,input().split()))
xy2 = array
array = list(map(int,input().split()))
xy3 = array
x = []
for i in range(2):
if xy1[i] == xy2[i]:
x.append(xy3[i])
elif xy1[i] == xy3[i]:
x.append(xy2[i])
else:
x.append(xy1[i])
print(x)
array = list(map(int,input().split()))
xy1 = array
array = list(map(int,input().split()))
xy2 = array
array = list(map(int,input().split()))
xy3 = array
x = []
for i in range(2):
if xy1[i] == xy2[i]:
x.append(xy3[i])
elif xy1[i] == xy3[i]:
x.append(xy2[i])
else:
x.append(xy1[i])
print(f'{x[0]} {x[1]}')
|
ConDefects/ConDefects/Code/abc246_a/Python/45745121
|
condefects-python_data_1652
|
n, m, k = map(int, input().split())
a = list(map(int, input().split()))
r = 1 << 30
l = 0
while r - l > 1:
mid = (r + l) // 2
c = []
for i in a:
msk = (1 << 30) - 1
imid = mid
while i > imid:
msk >>= 1
i &= msk
imid &= msk
c.append(imid - i)
c.sort()
if sum(c[:k]) <= m:
l = mid
else:
r = mid
print(l)
n, m, k = map(int, input().split())
a = list(map(int, input().split()))
r = 1 << 40
l = 0
while r - l > 1:
mid = (r + l) // 2
c = []
for i in a:
msk = (1 << 30) - 1
imid = mid
while i > imid:
msk >>= 1
i &= msk
imid &= msk
c.append(imid - i)
c.sort()
if sum(c[:k]) <= m:
l = mid
else:
r = mid
print(l)
|
ConDefects/ConDefects/Code/arc146_b/Python/43257634
|
condefects-python_data_1653
|
import sys
sys.setrecursionlimit(10000000)
from collections import deque, namedtuple
## Input crap
infile = sys.stdin
intokens = deque()
def getTokens():
while not intokens:
for c in infile.readline().rstrip().split() :
intokens.append(c)
def gs(): getTokens(); return intokens.popleft()
def gi(): return int(gs())
def gf(): return float(gs())
def gbs(): return [c for c in gs()]
def gis(n): return [gi() for i in range(n)]
def ia(m): return [0] * m
def iai(m,v): return [v] * m
def twodi(n,m,v): return [iai(m,v) for i in range(n)]
def fill2(m) : r = gis(2*m); return r[0::2],r[1::2]
def fill3(m) : r = gis(3*m); return r[0::3],r[1::3],r[2::3]
def fill4(m) : r = gis(4*m); return r[0::4],r[1::4],r[2::4],r[3::4]
MOD = 998244353
##MOD = 1000000007
def main() :
if len(sys.argv) > 1 : global infile; infile = open(sys.argv[1],'rt')
## PROGRAM STARTS HERE
N,M,K = gi(),gi(),gi(); A = gis(N)
ans = 0; working = [0]*N
for pos in range(29,-1,-1) :
cand = ans | 1<<pos
for i,a in enumerate(A) :
m = cand & (~a)
if m == 0 : working[i] = 0
else :
mask = (1<<(m.bit_length()))-1
working[i] = (mask&cand) - (mask&a)
working.sort(); incs = 0
for i in range(K):
incs += working[i]
if incs > M : break
if incs <= M : ans = cand
print(ans)
if __name__ == "__main__" :
main()
import sys
sys.setrecursionlimit(10000000)
from collections import deque, namedtuple
## Input crap
infile = sys.stdin
intokens = deque()
def getTokens():
while not intokens:
for c in infile.readline().rstrip().split() :
intokens.append(c)
def gs(): getTokens(); return intokens.popleft()
def gi(): return int(gs())
def gf(): return float(gs())
def gbs(): return [c for c in gs()]
def gis(n): return [gi() for i in range(n)]
def ia(m): return [0] * m
def iai(m,v): return [v] * m
def twodi(n,m,v): return [iai(m,v) for i in range(n)]
def fill2(m) : r = gis(2*m); return r[0::2],r[1::2]
def fill3(m) : r = gis(3*m); return r[0::3],r[1::3],r[2::3]
def fill4(m) : r = gis(4*m); return r[0::4],r[1::4],r[2::4],r[3::4]
MOD = 998244353
##MOD = 1000000007
def main() :
if len(sys.argv) > 1 : global infile; infile = open(sys.argv[1],'rt')
## PROGRAM STARTS HERE
N,M,K = gi(),gi(),gi(); A = gis(N)
ans = 0; working = [0]*N
for pos in range(31,-1,-1) :
cand = ans | 1<<pos
for i,a in enumerate(A) :
m = cand & (~a)
if m == 0 : working[i] = 0
else :
mask = (1<<(m.bit_length()))-1
working[i] = (mask&cand) - (mask&a)
working.sort(); incs = 0
for i in range(K):
incs += working[i]
if incs > M : break
if incs <= M : ans = cand
print(ans)
if __name__ == "__main__" :
main()
|
ConDefects/ConDefects/Code/arc146_b/Python/40312293
|
condefects-python_data_1654
|
def can(A,digit):
maskA = [a & (2**digit-1) for a in A]
maskA.sort()
ok = []
ng = []
for a in maskA:
if 1<<(digit-1) & a:
ok.append(a)
else:
ng.append(a)
if len(ok) >= K:
return ok,0
else:
tmp = 0
for i in range(K-len(ok)):
x = ng.pop()
tmp += (1<<(digit-1))-x
return [1<<(digit-1)]*(K-len(ok))+ok,tmp
N,M,K = map(int,input().split())
A = list(map(int,input().split()))
ans = 0
for i in range(30,0,-1):
newa,cost = can(A,i)
if cost <= M:
M -= cost
A = newa
ans += 2**(i-1)
print(ans)
def can(A,digit):
maskA = [a & (2**digit-1) for a in A]
maskA.sort()
ok = []
ng = []
for a in maskA:
if 1<<(digit-1) & a:
ok.append(a)
else:
ng.append(a)
if len(ok) >= K:
return ok,0
else:
tmp = 0
for i in range(K-len(ok)):
x = ng.pop()
tmp += (1<<(digit-1))-x
return [1<<(digit-1)]*(K-len(ok))+ok,tmp
N,M,K = map(int,input().split())
A = list(map(int,input().split()))
ans = 0
for i in range(31,0,-1):
newa,cost = can(A,i)
if cost <= M:
M -= cost
A = newa
ans += 2**(i-1)
print(ans)
|
ConDefects/ConDefects/Code/arc146_b/Python/42233391
|
condefects-python_data_1655
|
import heapq
N,M,K=map(int,input().split())
A=list(map(int,input().split()))
maxbit=int(max(A)+M).bit_length()
# maxA=2**maxbit
ans=0
C=[0]*N
m=2**maxbit
for i in range(maxbit+1):
B=[]
for j in range(N):
if (A[j]>>(maxbit-i))&1:
B.append(C[j])
else:
B.append(ans+m-A[j]+C[j])
B.sort()
if sum(B[:K])<=M:
ans+=m
for j in range(N):
if (A[j]>>(maxbit-i))&1:
count=m-A[j]
A[j]+=count
C[j]+=count
else:
for j in range(N):
if (A[j]>>(maxbit-i))&1:
A[j]-=m
m//=2
print(ans)
import heapq
N,M,K=map(int,input().split())
A=list(map(int,input().split()))
maxbit=int(max(A)+M).bit_length()
# maxA=2**maxbit
ans=0
C=[0]*N
m=2**maxbit
for i in range(maxbit+1):
B=[]
for j in range(N):
if (A[j]>>(maxbit-i))&1:
B.append(C[j])
else:
B.append(ans+m-A[j]+C[j])
B.sort()
if sum(B[:K])<=M:
ans+=m
for j in range(N):
if not (A[j]>>(maxbit-i))&1:
count=m-A[j]
A[j]+=count
C[j]+=count
else:
for j in range(N):
if (A[j]>>(maxbit-i))&1:
A[j]-=m
m//=2
print(ans)
|
ConDefects/ConDefects/Code/arc146_b/Python/41500955
|
condefects-python_data_1656
|
n, l, r = map(int, input().split())
a = list(map(int, input().split()))
b = [i % (l + r) for i in a]
g = [int(l <= i <= r) for i in b]
ans = 0
for i in g:
ans ^= i
if ans:
print("First")
else:
print("Second")
n, l, r = map(int, input().split())
a = list(map(int, input().split()))
b = [i % (l + r) for i in a]
g = [i // l for i in b]
ans = 0
for i in g:
ans ^= i
if ans:
print("First")
else:
print("Second")
|
ConDefects/ConDefects/Code/abc297_g/Python/47814164
|
condefects-python_data_1657
|
n,l,r = map(int, input().split())
alist = list(map(int, input().split()))
s = l+r
xor = 0
for a in alist:
a %= s
xor ^= a
if xor == 0:
print("Second")
else:
print("First")
n,l,r = map(int, input().split())
alist = list(map(int, input().split()))
s = l+r
xor = 0
lose = 0
for a in alist:
a %= s
a //= l
xor ^= a
if xor == 0:
print("Second")
else:
print("First")
|
ConDefects/ConDefects/Code/abc297_g/Python/52394876
|
condefects-python_data_1658
|
N,L,R=map(int,input().split())
A=list(map(int,input().split()))
g=[0]*N
for i in range(N):
M=A[i]%(L+R)
g[i]=M
res=0
for i in range(N):
res^=g[i]
print('First' if res!=0 else 'Second')
N,L,R=map(int,input().split())
A=list(map(int,input().split()))
g=[0]*N
for i in range(N):
M=A[i]%(L+R)
g[i]=M//L
res=0
for i in range(N):
res^=g[i]
print('First' if res!=0 else 'Second')
|
ConDefects/ConDefects/Code/abc297_g/Python/44405855
|
condefects-python_data_1659
|
import bisect
import collections
import functools
import heapq
import itertools
import math
import operator
import string
import sys
readline = sys.stdin.readline
LS = lambda: readline().strip()
LI = lambda: int(readline().strip())
LLS = lambda: readline().strip().split()
LL = lambda: list(map(int, readline().strip().split()))
LLMI = lambda: list(map((1).__rsub__, LL()))
N, A, B = LL()
D = sorted(set(d % (A + B) for d in LL()))
print("Yes" if any((D[(i + 1) % len(D)] - D[i]) % (A + B) > B for i in range(len(D))) else "No")
import bisect
import collections
import functools
import heapq
import itertools
import math
import operator
import string
import sys
readline = sys.stdin.readline
LS = lambda: readline().strip()
LI = lambda: int(readline().strip())
LLS = lambda: readline().strip().split()
LL = lambda: list(map(int, readline().strip().split()))
LLMI = lambda: list(map((1).__rsub__, LL()))
N, A, B = LL()
D = sorted(set(d % (A + B) for d in LL()))
print("Yes" if any((D[(i + 1) % len(D)] - D[i]) % (A + B) > B for i in range(len(D))) or len(D) == 1 else "No")
|
ConDefects/ConDefects/Code/abc347_c/Python/55146553
|
condefects-python_data_1660
|
n, a, b = map(int, input().split())
D = list(map(int, input().split()))
w = a + b
mod_D = []
for d in D:
mod_D.append(d % w)
mod_D = sorted(list(set(mod_D)))
length = len(mod_D)
for i in range(length):
mod_D.append(mod_D[i] + w)
for i in range(len(mod_D)-1):
if (mod_D[i+1] - mod_D[i]) % w > b:
print("Yes")
exit()
print("No")
n, a, b = map(int, input().split())
D = list(map(int, input().split()))
w = a + b
mod_D = []
for d in D:
mod_D.append(d % w)
mod_D = sorted(list(set(mod_D)))
length = len(mod_D)
for i in range(length):
mod_D.append(mod_D[i] + w)
for i in range(len(mod_D)-1):
if mod_D[i+1] - mod_D[i] > b:
print("Yes")
exit()
print("No")
|
ConDefects/ConDefects/Code/abc347_c/Python/55043661
|
condefects-python_data_1661
|
import sys
import queue
import math
def init():
sys.stdin = open('in.txt', "r")
sys.stdout = open('out.txt', 'w')
input = sys.stdin.readline
# s = set()
# a = int(input())
# mp = dict()
# q = queue.Queue()
n, a, b = map(int, input().split())
d = list(map(int, input().split()))
for i in range(n):
d[i] %= (a + b)
if d[i] == 0:
d[i] = a + b
d.sort()
if d[n - 1] - d[0] + 1 <= a:
print('Yes')
exit(0)
for i in range(1, n):
if d[i] - d[i - 1] <= a and d[i - 1] <= a:
print('Yes')
exit(0)
print("No")
#提交前记得修改DEBUG参数
#字符串读入一定要加strip
import sys
import queue
import math
def init():
sys.stdin = open('in.txt', "r")
sys.stdout = open('out.txt', 'w')
input = sys.stdin.readline
# s = set()
# a = int(input())
# mp = dict()
# q = queue.Queue()
n, a, b = map(int, input().split())
d = list(map(int, input().split()))
for i in range(n):
d[i] %= (a + b)
if d[i] == 0:
d[i] = a + b
d.sort()
if d[n - 1] - d[0] + 1 <= a:
print('Yes')
exit(0)
for i in range(1, n):
if d[i] - d[i - 1] > b and d[i - 1] <= a:
print('Yes')
exit(0)
print("No")
#提交前记得修改DEBUG参数
#字符串读入一定要加strip
|
ConDefects/ConDefects/Code/abc347_c/Python/55155622
|
condefects-python_data_1662
|
import random
def solve(n, p):
while True:
a, b = random.sample(range(2, p), 2)
rig = (1 + pow(a, 3 * n, p) + pow(b, 3 * n, p)) % p
lef = (
(1 + a + b)
% p
* (1 + pow(a, n, p) + pow(b, n, p))
% p
* (1 + pow(a, 2 * n, p) + pow(b, 2 * n, p))
% p
)
if lef == 0:
continue
x = rig * pow(lef, p - 2, p) % p
y = x * a % p
z = x * b % p
return sorted((x, y, z))
def test(T=100000):
for _ in range(T):
n = random.randint(1, 10**9)
p = 5
x, y, z = solve(n, p)
# print(x, y, z)
assert (
(x + y + z)
% p
* (pow(x, n, p) + pow(y, n, p) + pow(z, n, p))
% p
* (pow(x, 2 * n, p) + pow(y, 2 * n, p) + pow(z, 2 * n, p))
% p
) == (pow(x, 3 * n, p) + pow(y, 3 * n, p) + pow(z, 3 * n, p)) % p
def main():
T = int(input())
for _ in range(T):
n, p = map(int, input().split())
x, y, z = solve(n, p)
print(x, y, z)
# assert (
# (x + y + z)
# % p
# * (pow(x, n, p) + pow(y, n, p) + pow(z, n, p))
# % p
# * (pow(x, 2 * n, p) + pow(y, 2 * n, p) + pow(z, 2 * n, p))
# % p
# ) == (pow(x, 3 * n, p) + pow(y, 3 * n, p) + pow(z, 3 * n, p)) % p
main()
# test()
import random
def solve(n, p):
while True:
a, b = random.sample(range(2, p), 2)
rig = (1 + pow(a, 3 * n, p) + pow(b, 3 * n, p)) % p
lef = (
(1 + a + b)
% p
* (1 + pow(a, n, p) + pow(b, n, p))
% p
* (1 + pow(a, 2 * n, p) + pow(b, 2 * n, p))
% p
)
if lef == 0 or rig == 0:
continue
x = rig * pow(lef, p - 2, p) % p
y = x * a % p
z = x * b % p
return sorted((x, y, z))
def test(T=100000):
for _ in range(T):
n = random.randint(1, 10**9)
p = 5
x, y, z = solve(n, p)
# print(x, y, z)
assert (
(x + y + z)
% p
* (pow(x, n, p) + pow(y, n, p) + pow(z, n, p))
% p
* (pow(x, 2 * n, p) + pow(y, 2 * n, p) + pow(z, 2 * n, p))
% p
) == (pow(x, 3 * n, p) + pow(y, 3 * n, p) + pow(z, 3 * n, p)) % p
def main():
T = int(input())
for _ in range(T):
n, p = map(int, input().split())
x, y, z = solve(n, p)
print(x, y, z)
# assert (
# (x + y + z)
# % p
# * (pow(x, n, p) + pow(y, n, p) + pow(z, n, p))
# % p
# * (pow(x, 2 * n, p) + pow(y, 2 * n, p) + pow(z, 2 * n, p))
# % p
# ) == (pow(x, 3 * n, p) + pow(y, 3 * n, p) + pow(z, 3 * n, p)) % p
main()
# test()
|
ConDefects/ConDefects/Code/arc158_d/Python/39679022
|
condefects-python_data_1663
|
N = int(input())
a = ""
for i in range(N+1):
a += "o"
print('L'+a+'ng')
N = int(input())
a = ""
for i in range(N):
a += "o"
print('L'+a+'ng')
|
ConDefects/ConDefects/Code/abc336_a/Python/54733464
|
condefects-python_data_1664
|
n=int(input())
ans="l"+"o"*(n)+"ng"
print(ans)
n=int(input())
ans="L"+"o"*(n)+"ng"
print(ans)
|
ConDefects/ConDefects/Code/abc336_a/Python/54729953
|
condefects-python_data_1665
|
N = int(input())
Xo = "o" * (N-3)
ans = "L" + Xo + "n" + "g"
print(ans)
N = int(input())
Xo = "o" * N
ans = "L" + Xo + "n" + "g"
print(ans)
|
ConDefects/ConDefects/Code/abc336_a/Python/54679232
|
condefects-python_data_1666
|
S = input()
if "<" in S and "=" in S:
if S.count("<") == S.count(">") :
print("Yes")
else :
print("No")
else :
print("No")
S = input()
if "<" in S and "=" in S and ">" == S[-1]:
if S.count("<") == S.count(">") :
print("Yes")
else :
print("No")
else :
print("No")
|
ConDefects/ConDefects/Code/abc345_a/Python/54946927
|
condefects-python_data_1667
|
n = input()
cnta,cntb =0,0
stack = []
bool = True
for i in range(len(n)):
if n[i]=='<':
cnta+=1
elif n[i]=='>':
cntb+=1
if cntb>cnta:
bool = False
break;
if bool and cnta==cntb:
print("Yes")
else:
print("No")
n = input()
cnta,cntb =0,0
stack = []
bool = True
for i in range(len(n)):
if n[i]=='<':
cnta+=1
elif n[i]=='>':
cntb+=1
if cntb>cnta:
bool = False
break;
if bool and ((cnta >0 and cntb>0) and (cnta==cntb)):
print("Yes")
else:
print("No")
|
ConDefects/ConDefects/Code/abc345_a/Python/54949643
|
condefects-python_data_1668
|
#!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
def main():
n, m = map(int,input().split())
x = list(map(int,input().split()))
d = list(map(int,input().split()))
arrow = [None] * (10 ** 6 + 1)
currentMin = 1
currentMinLoc = 1
direction = 1
length = 10 ** 6
zeroDict = dict()
for index, elem in enumerate(d):
if length == 0:
break
prev_pivot = currentMinLoc - currentMin * direction
current_pivot = prev_pivot + direction * elem
currentEnd = currentMinLoc + (length - 1) * direction
if (currentMinLoc - current_pivot) * direction > 0:
currentMin = abs(currentMinLoc - current_pivot)
elif (current_pivot - currentEnd) * direction > 0:
direction = -direction
currentMinLoc = currentEnd
currentMin = abs(currentEnd - current_pivot)
else:
if abs(current_pivot - currentMinLoc) <= abs(currentEnd - current_pivot):
for j in range(currentMinLoc, current_pivot + direction, direction):
arrow[j] = current_pivot * 2 - j
if arrow[j] == j:
zeroDict[j] = index + 1
length -= 1
currentMin = 1
currentMinLoc = current_pivot + direction
else:
for j in range(current_pivot, currentEnd + direction, direction):
arrow[j] = current_pivot * 2 - j
if arrow[j] == j:
zeroDict[j] = index + 1
length -= 1
currentMin = 1
direction = -direction
currentMinLoc = current_pivot + direction
graph = [[] for _ in range(10 ** 6 + 1)]
for i in range(10 ** 6 + 1):
if arrow[i] is not None and arrow[i] != i:
graph[arrow[i]].append(i)
num = [0]
for i in range(1, 10 ** 6 + 1):
if arrow[i] is None:
num.append(abs(i - currentMinLoc) + currentMin)
else:
num.append(None)
dist = [None] * (10 ** 6 + 1)
for i in range(10 ** 6 + 1):
if arrow[i] is None:
stack = [i]
dist[i] = 0
while stack:
v = stack.pop()
for u in graph[v]:
if dist[u] is None:
dist[u] = dist[v] + 1
num[u] = num[v]
stack.append(u)
elif arrow[i] == i:
stack = [i]
dist[i] = zeroDict[i]
num[i] = 0
while stack:
v = stack.pop()
for u in graph[v]:
if dist[u] is None:
dist[u] = dist[v]
num[u] = num[v]
stack.append(u)
for elem in x:
if num[elem] == 0:
print("Yes " + str(dist[elem]))
else:
print("No " + str(num[elem] if (dist[elem] + direction) % 2 == 0 else -num[elem]))
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._file = 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")
# endregion
if __name__ == "__main__":
main()
#!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
def main():
n, m = map(int,input().split())
x = list(map(int,input().split()))
d = list(map(int,input().split()))
arrow = [None] * (10 ** 6 + 1)
currentMin = 1
currentMinLoc = 1
direction = 1
length = 10 ** 6
zeroDict = dict()
for index, elem in enumerate(d):
if length == 0:
break
prev_pivot = currentMinLoc - currentMin * direction
current_pivot = prev_pivot + direction * elem
currentEnd = currentMinLoc + (length - 1) * direction
if (currentMinLoc - current_pivot) * direction > 0:
currentMin = abs(currentMinLoc - current_pivot)
elif (current_pivot - currentEnd) * direction > 0:
direction = -direction
currentMinLoc = currentEnd
currentMin = abs(currentEnd - current_pivot)
else:
if abs(current_pivot - currentMinLoc) <= abs(currentEnd - current_pivot):
for j in range(currentMinLoc, current_pivot + direction, direction):
arrow[j] = current_pivot * 2 - j
if arrow[j] == j:
zeroDict[j] = index + 1
length -= 1
currentMin = 1
currentMinLoc = current_pivot + direction
else:
for j in range(current_pivot, currentEnd + direction, direction):
arrow[j] = current_pivot * 2 - j
if arrow[j] == j:
zeroDict[j] = index + 1
length -= 1
currentMin = 1
direction = -direction
currentMinLoc = current_pivot + direction
graph = [[] for _ in range(10 ** 6 + 1)]
for i in range(10 ** 6 + 1):
if arrow[i] is not None and arrow[i] != i:
graph[arrow[i]].append(i)
num = [0]
for i in range(1, 10 ** 6 + 1):
if arrow[i] is None:
num.append(abs(i - currentMinLoc) + currentMin)
else:
num.append(None)
dist = [None] * (10 ** 6 + 1)
for i in range(10 ** 6 + 1):
if arrow[i] is None:
stack = [i]
dist[i] = 0
while stack:
v = stack.pop()
for u in graph[v]:
if dist[u] is None:
dist[u] = dist[v] + 1
num[u] = num[v]
stack.append(u)
elif arrow[i] == i:
stack = [i]
dist[i] = zeroDict[i]
num[i] = 0
while stack:
v = stack.pop()
for u in graph[v]:
if dist[u] is None:
dist[u] = dist[v]
num[u] = num[v]
stack.append(u)
for elem in x:
if num[elem] == 0:
print("Yes " + str(dist[elem]))
else:
print("No " + str(num[elem] if (dist[elem] + (direction == -1)) % 2 == 0 else -num[elem]))
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._file = 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")
# endregion
if __name__ == "__main__":
main()
|
ConDefects/ConDefects/Code/arc149_d/Python/35355978
|
condefects-python_data_1669
|
import sys
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
n = ii()
k = n * (n - 1) // 2
if k % 3 != 0:
print('No')
else:
import random
K = list(range(1, n))
for _ in range(10 ** 5):
A = [[] for _ in range(3)]
for v in K:
A[random.randint(0, 2)].append(v)
if sum(A[0]) == sum(A[1]) == sum(A[2]):
break
else:
print('No')
exit()
print('Yes')
ans = [[0] * (n) for _ in range(n)]
for i in range(n - 1):
if i + 1 in A[0]:
for j in range(i + 1):
ans[i + 1][j] = 'W'
if i + 1 in A[1]:
for j in range(i + 1):
ans[i + 1][j] = 'R'
if i + 1 in A[2]:
for j in range(i + 1):
ans[i + 1][j] = 'B'
for i in range(n - 1, 0, -1):
print(''.join(ans[i][:i]))
import sys
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
n = ii()
k = n * (n - 1) // 2
if k % 3 != 0:
print('No')
else:
import random
K = list(range(1, n))
for _ in range(10 ** 6):
A = [[] for _ in range(3)]
for v in K:
A[random.randint(0, 2)].append(v)
if sum(A[0]) == sum(A[1]) == sum(A[2]):
break
else:
print('No')
exit()
print('Yes')
ans = [[0] * (n) for _ in range(n)]
for i in range(n - 1):
if i + 1 in A[0]:
for j in range(i + 1):
ans[i + 1][j] = 'W'
if i + 1 in A[1]:
for j in range(i + 1):
ans[i + 1][j] = 'R'
if i + 1 in A[2]:
for j in range(i + 1):
ans[i + 1][j] = 'B'
for i in range(n - 1, 0, -1):
print(''.join(ans[i][:i]))
|
ConDefects/ConDefects/Code/arc131_e/Python/32651833
|
condefects-python_data_1670
|
# cook your dish here
import sys
import bisect
from bisect import bisect_left as lb
from bisect import bisect_right as rb
input_=lambda: sys.stdin.readline().strip("\r\n")
from math import log
from math import gcd
from math import atan2,acos
from random import randint
from queue import Queue
sa=lambda :input_()
sb=lambda:int(input_())
sc=lambda:input_().split()
sd=lambda:list(map(int,input_().split()))
sflo=lambda:list(map(float,input_().split()))
se=lambda:float(input_())
sf=lambda:list(input_())
flsh=lambda: sys.stdout.flush()
sys.setrecursionlimit(10**6)
mod=10**9+7
mod1=998244353
gp=[]
cost=[]
dp=[]
mx=[]
ans1=[]
ans2=[]
special=[]
specnode=[]
a=0
kthpar=[]
def dfs2(root,par):
if par!=-1:
dp[root]=dp[par]+1
for i in range(1,20):
if kthpar[root][i-1]!=-1:
kthpar[root][i]=kthpar[kthpar[root][i-1]][i-1]
for child in gp[root]:
if child==par:continue
kthpar[child][0]=root
dfs(child,root)
ans=0
b=[]
vis=[]
tot=0
time=[]
time1=[]
adj=[]
mx=-1
eps=0.0000001
a=[]
def check(a,b):
if a=='G' and b=="C":
return 0
if a=="C" and b=="G":
return 1
if a=="C" and b=="P":
return 0
if a=="P" and b=="C":
return 1
if a=="P" and b=="G":
return 0
if a=="G" and b=="P":
return 1
return 2
gp=[]
vis=[]
def dfs(root):
global gp,vis
for i in gp[root]:
if vis[i]==0:
vis[i]=1
dfs(i)
dx=[1,0,-1,0]
dy=[0,1,0,-1]
def hnbhai(tc):
n=sb()
edge=n*(n-1)
edge//=2
if edge%3!=0 or n<=5:
print("No")
return
ans=""
#multiple of 6 so 5 sum each
if n%6==0:
#54321
ans="RWBBW"
if n%6==3:
#87654321
ans="RWBBRWWB"
if n%6==4:
#987654321
ans="RWWRBBBBB"
while(len(ans)!=n-1):
#654321
ans+="RWBBWR"
print("Yes")
for i in range(n-1):
print(ans[i]*(n-1-i))
for _ in range(1):
hnbhai(_+1)
# cook your dish here
import sys
import bisect
from bisect import bisect_left as lb
from bisect import bisect_right as rb
input_=lambda: sys.stdin.readline().strip("\r\n")
from math import log
from math import gcd
from math import atan2,acos
from random import randint
from queue import Queue
sa=lambda :input_()
sb=lambda:int(input_())
sc=lambda:input_().split()
sd=lambda:list(map(int,input_().split()))
sflo=lambda:list(map(float,input_().split()))
se=lambda:float(input_())
sf=lambda:list(input_())
flsh=lambda: sys.stdout.flush()
sys.setrecursionlimit(10**6)
mod=10**9+7
mod1=998244353
gp=[]
cost=[]
dp=[]
mx=[]
ans1=[]
ans2=[]
special=[]
specnode=[]
a=0
kthpar=[]
def dfs2(root,par):
if par!=-1:
dp[root]=dp[par]+1
for i in range(1,20):
if kthpar[root][i-1]!=-1:
kthpar[root][i]=kthpar[kthpar[root][i-1]][i-1]
for child in gp[root]:
if child==par:continue
kthpar[child][0]=root
dfs(child,root)
ans=0
b=[]
vis=[]
tot=0
time=[]
time1=[]
adj=[]
mx=-1
eps=0.0000001
a=[]
def check(a,b):
if a=='G' and b=="C":
return 0
if a=="C" and b=="G":
return 1
if a=="C" and b=="P":
return 0
if a=="P" and b=="C":
return 1
if a=="P" and b=="G":
return 0
if a=="G" and b=="P":
return 1
return 2
gp=[]
vis=[]
def dfs(root):
global gp,vis
for i in gp[root]:
if vis[i]==0:
vis[i]=1
dfs(i)
dx=[1,0,-1,0]
dy=[0,1,0,-1]
def hnbhai(tc):
n=sb()
edge=n*(n-1)
edge//=2
if edge%3!=0 or n<=5:
print("No")
return
ans=""
#multiple of 6 so 5 sum each
if n%6==0:
#54321
ans="RWBBW"
if n%6==3:
#87654321
ans="RWBBRWWB"
if n%6==4:
#987654321
ans="RWWRBBBBB"
while(len(ans)!=n-1):
#654321
ans="RWBBWR"+ans
print("Yes")
for i in range(n-1):
print(ans[i]*(n-1-i))
for _ in range(1):
hnbhai(_+1)
|
ConDefects/ConDefects/Code/arc131_e/Python/27746730
|
condefects-python_data_1671
|
import sys, os, io
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
def f(u, v):
return u * (m + 1) + v
n = int(input())
ans = "Yes" if not (n * (n - 1)) % 3 and n >= 6 else "No"
print(ans)
if ans == "No":
exit()
m = n * (n - 1) // 6
dp = [0] * ((m + 1) * (m + 1))
p = [-1] * ((m + 1) * (m + 1))
dp[0] = 1
s = 0
for i in range(1, n):
for j in range(min(s, m), -1, -1):
for k in range(min(s - j, m), -1, -1):
u = f(j, k)
if not dp[u]:
continue
for nj, nk in [(j + i, k), (j, k + i)]:
if not max(nj, nk) <= m:
continue
v = f(nj, nk)
if not dp[v]:
dp[v], p[v] = 1, u
s += i
c = ["R"] * n
i, j = m, m
while f(i, j):
ni, nj = divmod(p[f(i, j)], m + 1)
c[i - ni], c[j - nj] = "G", "B"
i, j = ni, nj
ans = []
for i in range(1, n):
ans0 = c[n - i] * (n - i)
ans.append(ans0)
sys.stdout.write("\n".join(ans))
import sys, os, io
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
def f(u, v):
return u * (m + 1) + v
n = int(input())
ans = "Yes" if not (n * (n - 1)) % 3 and n >= 6 else "No"
print(ans)
if ans == "No":
exit()
m = n * (n - 1) // 6
dp = [0] * ((m + 1) * (m + 1))
p = [-1] * ((m + 1) * (m + 1))
dp[0] = 1
s = 0
for i in range(1, n):
for j in range(min(s, m), -1, -1):
for k in range(min(s - j, m), -1, -1):
u = f(j, k)
if not dp[u]:
continue
for nj, nk in [(j + i, k), (j, k + i)]:
if not max(nj, nk) <= m:
continue
v = f(nj, nk)
if not dp[v]:
dp[v], p[v] = 1, u
s += i
c = ["R"] * n
i, j = m, m
while f(i, j):
ni, nj = divmod(p[f(i, j)], m + 1)
c[i - ni], c[j - nj] = "B", "W"
i, j = ni, nj
ans = []
for i in range(1, n):
ans0 = c[n - i] * (n - i)
ans.append(ans0)
sys.stdout.write("\n".join(ans))
|
ConDefects/ConDefects/Code/arc131_e/Python/42742272
|
condefects-python_data_1672
|
p=print;r=range;N=int(input());a=[];b=[0]*3;d=N*(N-1)//6
for i in r(1,N):
for c in r(3):
if b[c]+i<=d:a.append("RBW"[c]*i);b[c]+=i;break
else:p("No");exit()
p("Yes");p(*a,sep='\n')
p=print;r=range;N=int(input());a=[];b=[0]*3;d=N*(N-1)//6
for i in r(N-1,0,-1):
for c in r(3):
if b[c]+i<=d:a.append("RBW"[c]*i);b[c]+=i;break
else:p("No");exit()
p("Yes");p(*a,sep='\n')
|
ConDefects/ConDefects/Code/arc131_e/Python/27742677
|
condefects-python_data_1673
|
N=int(input())
if N%3==2 or N==4:
print("No")
else:
print("Yes")
n=N
R=[]
B=[]
W=[]
while n>10:
R.append(n-1)
R.append(n-6)
B.append(n-2)
B.append(n-5)
W.append(n-3)
W.append(n-4)
n-=6
if n==6:
R.append(1)
R.append(4)
B.append(2)
B.append(3)
W.append(5)
elif n==7:
R.append(1)
R.append(6)
B.append(2)
B.append(5)
W.append(3)
W.append(4)
elif n==9:
R.append(8)
R.append(4)
B.append(7)
B.append(5)
W.append(1)
W.append(2)
W.append(3)
W.append(6)
elif n==10:
R.append(9)
R.append(6)
B.append(8)
B.append(7)
W.append(1)
W.append(2)
W.append(3)
W.append(4)
W.append(5)
for i in reversed(range(1,N)):
if i in R:
print("R"*i)
elif i in B:
print("B"*i)
else:
print("W"*i)
N=int(input())
if N%3==2 or N<=4 :
print("No")
else:
print("Yes")
n=N
R=[]
B=[]
W=[]
while n>10:
R.append(n-1)
R.append(n-6)
B.append(n-2)
B.append(n-5)
W.append(n-3)
W.append(n-4)
n-=6
if n==6:
R.append(1)
R.append(4)
B.append(2)
B.append(3)
W.append(5)
elif n==7:
R.append(1)
R.append(6)
B.append(2)
B.append(5)
W.append(3)
W.append(4)
elif n==9:
R.append(8)
R.append(4)
B.append(7)
B.append(5)
W.append(1)
W.append(2)
W.append(3)
W.append(6)
elif n==10:
R.append(9)
R.append(6)
B.append(8)
B.append(7)
W.append(1)
W.append(2)
W.append(3)
W.append(4)
W.append(5)
for i in reversed(range(1,N)):
if i in R:
print("R"*i)
elif i in B:
print("B"*i)
else:
print("W"*i)
|
ConDefects/ConDefects/Code/arc131_e/Python/27740591
|
condefects-python_data_1674
|
class List2D:
def __init__(self,H,W,grid):
self.H,self.W=H,W
self.H0,self.W0=H,W
self.grid=grid
self._reverseH=0
self._reverseW=0
self.trans=0
@classmethod
def full(cls,H,W,fill_value):
return cls(H,W,[fill_value]*(H*W))
@classmethod
def from_grid(cls,grid):
tmp=[]
for array in grid:
tmp.extend(array)
return cls(len(grid),len(grid[0]),tmp)
def __getitem__(self, item):
if type(item) is tuple:
h,w=item
h,w=self.map(h,w)
return self.grid[h*self.W0+w]
else:
sys.stderr.write("getitem: not grid[h][w] but grid[h,w]\n")
tmp=[]
for w in range(self.W):
h,w=item,w
h,w=self.map(h,w)
tmp.append(self.grid[h*self.W0+w])
return tmp
def __setitem__(self,item,val):
h,w=item
h,w=self.map(h,w)
self.grid[h*self.W0+w]=val
def reverseH(self):
if self.trans==0:
self._reverseH=1-self._reverseH
else:
self._reverseW=1-self._reverseW
def reverseW(self):
if self.trans==1:
self._reverseH=1-self._reverseH
else:
self._reverseW=1-self._reverseW
def transpose(self):
self.H,self.W=self.W,self.H
self.trans=1-self.trans
def rotate(self,time=1):
time%=4
for _ in range(time):
self.transpose()
self.reverseH()
def map(self,h,w):
if self.trans:
h,w=w,h
if self._reverseH:
h=self.H0-1-h
if self._reverseW:
w=self.W0-1-w
return h,w
def accumulate(self):
res=self.copy()
for h in range(self.H-1):
for w in range(self.W):
res[h+1,w]+=res[h,w]
for w in range(self.W-1):
for h in range(self.H):
res[h,w+1]+=res[h,w]
return res
def get_range(self,h0,w0,h1,w1):
""" sum in [h0,h1)*[w0,w1) after accumulate """
if h0>=h1 or w0>=w1:
return 0
res=self[h1-1,w1-1]
if h0>=1:
res-=self[h0-1,w1-1]
if w0>=1:
res-=self[h1-1,w0-1]
if h0>=1 and w0>=1:
res+=self[h0-1,w0-1]
return res
def make_list(self):
return list(self)
def __iter__(self):
for h in range(self.H):
tmp=[]
for w in range(self.W):
tmp.append(self[h,w])
yield tmp
def __str__(self):
res=[]
for h in range(self.H):
tmp=[]
for w in range(self.W):
tmp.append(self[h,w])
res.append(str(tmp))
res.append("")
return "\n".join(res)
def __len__(self):
return self.H
def __eq__(self, other):
if type(other) is List2D:
if self.H==other.H and self.W==other.W:
for h in range(self.H):
for w in range(self.W):
if self[h,w]!=other[h,w]:
return False
return True
else:
return False
else:
if self.H==len(other) and self.W==len(other[0]):
for h in range(self.H):
for w in range(self.W):
if self[h,w]!=other[h][w]:
return False
return True
else:
return False
def copy(self):
res=List2D.full(self.H,self.W,0)
for h,array in enumerate(self):
for w,val in enumerate(array):
res[h,w]=val
return res
##############################################################
def example():
global input
example = iter(
"""
2 3
1 2 3
4 5 6
"""
.strip().split("\n"))
input = lambda: next(example)
##############################################################
import sys
input = sys.stdin.readline
from itertools import *
from collections import Counter
def make(N):
for P in product(range(1,4),repeat=N*(N-1)//2):
data=List2D.full(N,N,0)
c=0
C=Counter(P)
if not C[1]==C[2]==C[3]:
continue
for i in range(N):
for j in range(i+1,N):
data[j,i]=data[i,j]=P[c]
c+=1
yield data
def check(data):
N=len(data)
f=1
for i in range(N):
for j in range(i+1,N):
for k in range(j+1,N):
S={data[i,j],data[j,k],data[k,i]}
if len(S)==3:
f=0
break
if f==0:
break
if f==0:
break
return f
def main(N):
if N*(N-1)%6!=0:
return -1
if N<=5:
return -1
W=N*(N-1)//6
cnt=0
dp=[List2D.full(W+1,W+1,0) for _ in range(N)]
dp[0][0,0]=1
for n in range(1,N):
for a in range(min(cnt+1,W+1)):
for b in range(min(cnt+1,W+1)):
dp[n][a,b]|=dp[n-1][a,b]
if a+n<=W:
dp[n][a+n,b]|=dp[n-1][a,b]
if b+n<=W:
dp[n][a,b+n]|=dp[n-1][a,b]
cnt+=n
path=[]
X=[-1]*N
a,b,=W,W
for n in range(1,N)[::-1]:
if a-n>=0 and dp[n-1][a-n,b]==1:
path.append((0,n))
X[n]=0
a-=n
elif b-n>=0 and dp[n-1][a,b-n]==1:
path.append((1,n))
X[n]=1
b-=n
elif dp[n-1][a,b]==1:
path.append((2,n))
X[n]=2
return X
N=int(input())
res=main(N)
if res==-1:
print("No")
else:
print("Yes")
d=["R","G","B"]
for i in range(1,N)[::-1]:
print(d[res[i]]*i)
class List2D:
def __init__(self,H,W,grid):
self.H,self.W=H,W
self.H0,self.W0=H,W
self.grid=grid
self._reverseH=0
self._reverseW=0
self.trans=0
@classmethod
def full(cls,H,W,fill_value):
return cls(H,W,[fill_value]*(H*W))
@classmethod
def from_grid(cls,grid):
tmp=[]
for array in grid:
tmp.extend(array)
return cls(len(grid),len(grid[0]),tmp)
def __getitem__(self, item):
if type(item) is tuple:
h,w=item
h,w=self.map(h,w)
return self.grid[h*self.W0+w]
else:
sys.stderr.write("getitem: not grid[h][w] but grid[h,w]\n")
tmp=[]
for w in range(self.W):
h,w=item,w
h,w=self.map(h,w)
tmp.append(self.grid[h*self.W0+w])
return tmp
def __setitem__(self,item,val):
h,w=item
h,w=self.map(h,w)
self.grid[h*self.W0+w]=val
def reverseH(self):
if self.trans==0:
self._reverseH=1-self._reverseH
else:
self._reverseW=1-self._reverseW
def reverseW(self):
if self.trans==1:
self._reverseH=1-self._reverseH
else:
self._reverseW=1-self._reverseW
def transpose(self):
self.H,self.W=self.W,self.H
self.trans=1-self.trans
def rotate(self,time=1):
time%=4
for _ in range(time):
self.transpose()
self.reverseH()
def map(self,h,w):
if self.trans:
h,w=w,h
if self._reverseH:
h=self.H0-1-h
if self._reverseW:
w=self.W0-1-w
return h,w
def accumulate(self):
res=self.copy()
for h in range(self.H-1):
for w in range(self.W):
res[h+1,w]+=res[h,w]
for w in range(self.W-1):
for h in range(self.H):
res[h,w+1]+=res[h,w]
return res
def get_range(self,h0,w0,h1,w1):
""" sum in [h0,h1)*[w0,w1) after accumulate """
if h0>=h1 or w0>=w1:
return 0
res=self[h1-1,w1-1]
if h0>=1:
res-=self[h0-1,w1-1]
if w0>=1:
res-=self[h1-1,w0-1]
if h0>=1 and w0>=1:
res+=self[h0-1,w0-1]
return res
def make_list(self):
return list(self)
def __iter__(self):
for h in range(self.H):
tmp=[]
for w in range(self.W):
tmp.append(self[h,w])
yield tmp
def __str__(self):
res=[]
for h in range(self.H):
tmp=[]
for w in range(self.W):
tmp.append(self[h,w])
res.append(str(tmp))
res.append("")
return "\n".join(res)
def __len__(self):
return self.H
def __eq__(self, other):
if type(other) is List2D:
if self.H==other.H and self.W==other.W:
for h in range(self.H):
for w in range(self.W):
if self[h,w]!=other[h,w]:
return False
return True
else:
return False
else:
if self.H==len(other) and self.W==len(other[0]):
for h in range(self.H):
for w in range(self.W):
if self[h,w]!=other[h][w]:
return False
return True
else:
return False
def copy(self):
res=List2D.full(self.H,self.W,0)
for h,array in enumerate(self):
for w,val in enumerate(array):
res[h,w]=val
return res
##############################################################
def example():
global input
example = iter(
"""
2 3
1 2 3
4 5 6
"""
.strip().split("\n"))
input = lambda: next(example)
##############################################################
import sys
input = sys.stdin.readline
from itertools import *
from collections import Counter
def make(N):
for P in product(range(1,4),repeat=N*(N-1)//2):
data=List2D.full(N,N,0)
c=0
C=Counter(P)
if not C[1]==C[2]==C[3]:
continue
for i in range(N):
for j in range(i+1,N):
data[j,i]=data[i,j]=P[c]
c+=1
yield data
def check(data):
N=len(data)
f=1
for i in range(N):
for j in range(i+1,N):
for k in range(j+1,N):
S={data[i,j],data[j,k],data[k,i]}
if len(S)==3:
f=0
break
if f==0:
break
if f==0:
break
return f
def main(N):
if N*(N-1)%6!=0:
return -1
if N<=5:
return -1
W=N*(N-1)//6
cnt=0
dp=[List2D.full(W+1,W+1,0) for _ in range(N)]
dp[0][0,0]=1
for n in range(1,N):
for a in range(min(cnt+1,W+1)):
for b in range(min(cnt+1,W+1)):
dp[n][a,b]|=dp[n-1][a,b]
if a+n<=W:
dp[n][a+n,b]|=dp[n-1][a,b]
if b+n<=W:
dp[n][a,b+n]|=dp[n-1][a,b]
cnt+=n
path=[]
X=[-1]*N
a,b,=W,W
for n in range(1,N)[::-1]:
if a-n>=0 and dp[n-1][a-n,b]==1:
path.append((0,n))
X[n]=0
a-=n
elif b-n>=0 and dp[n-1][a,b-n]==1:
path.append((1,n))
X[n]=1
b-=n
elif dp[n-1][a,b]==1:
path.append((2,n))
X[n]=2
return X
N=int(input())
res=main(N)
if res==-1:
print("No")
else:
print("Yes")
d=["R","W","B"]
for i in range(1,N)[::-1]:
print(d[res[i]]*i)
|
ConDefects/ConDefects/Code/arc131_e/Python/38955195
|
condefects-python_data_1675
|
n = int(input())
if(n<=4):
print("No")
exit()
if(n*(n-1)%3!=0):
print("No")
exit()
if(n*(n-1)%3!=0):
print("No")
exit()
ans = [["."]*n for _ in range(n)]
R = []
B = []
W = []
def divide(n):
global R,B,W
if(n>10):
R += [n-1,n-6]
B += [n-2,n-5]
W += [n-3,n-4]
divide(n-6)
else:
if(n==6):
R += [1,4]
B += [2,3]
W += [5]
elif(n==7):
R += [1,6]
B += [2,5]
W += [3,4]
elif(n==9):
R += [1,2,3,6]
B += [4,8]
W += [5,7]
else:
R += [1,2,3,4,5]
B += [6,9]
W += [7,8]
divide(n)
for i in range(1,n):
for ii in range(n+1):
if(i+ii in R):
ans[i][n-ii-1]="R"
elif(i+ii in B):
ans[i][n-ii-1]="B"
elif(i+ii in W):
ans[i][n-ii-1]="W"
else:
continue
print("Yes")
for i in range(1,n):
d = ans[i][i:]
print("".join(d))
n = int(input())
if(n<=4):
print("No")
exit()
if(n*(n-1)%3!=0):
print("No")
exit()
if(n*(n-1)%3!=0):
print("No")
exit()
ans = [["."]*n for _ in range(n)]
R = []
B = []
W = []
def divide(n):
global R,B,W
if(n>10):
R += [n-1,n-6]
B += [n-2,n-5]
W += [n-3,n-4]
divide(n-6)
else:
if(n==6):
R += [1,4]
B += [2,3]
W += [5]
elif(n==7):
R += [1,6]
B += [2,5]
W += [3,4]
elif(n==9):
R += [1,2,3,6]
B += [4,8]
W += [5,7]
else:
R += [1,2,3,4,5]
B += [6,9]
W += [7,8]
divide(n)
for i in range(1,n):
for ii in range(n+1):
if(i+ii in R):
ans[i][n-ii-1]="R"
elif(i+ii in B):
ans[i][n-ii-1]="B"
elif(i+ii in W):
ans[i][n-ii-1]="W"
else:
continue
print("Yes")
for i in range(1,n):
d = ans[i][i:]
print("".join(d)[::-1])
|
ConDefects/ConDefects/Code/arc131_e/Python/27727642
|
condefects-python_data_1676
|
"""
自分より小さいものに有向辺を貼るとする。
その全てに関して、同じ色を使うとする。
すると、3頂点のうち、最大は必ず同じ辺で入出
そのような組み合わせを見つけるとよい。
N-1
N-2
N-3
N-4
...
1
の中からいくつか取り、
N(N-1)/6 を2こ作りたい
雑に行ける？
dp[i][j] = 和が (i,j) の場合の前の推移
"""
import sys
from sys import stdin
import pprint
N = int(stdin.readline())
if ( N*(N-1)//2 ) % 3 != 0:
print ("No")
sys.exit()
e = N * (N-1) // 6
#print (e)
dp = [ [ [ None ] * (e+1) for i in range(e+1) ] for k in range(N)]
dp[0][0][0] = (0,0,0)
for pl in range(N-1):
for i in range(e+1):
for j in range(e+1):
if dp[pl][i][j] == None:
continue
dp[pl+1][i][j] = (pl,i,j)
dp[pl+1][i][j] = (pl,i,j)
#iに加える
if i + pl+1 <= e:
dp[pl+1][i+pl+1][j] = (pl,i,j)
if j + pl+1 <= e:
dp[pl+1][i][j+pl+1] = (pl,i,j)
#pprint.pprint (dp)
if dp[N-1][e][e] == None:
print ("No")
sys.exit()
ans = [ None ] * (N-1)
i,x,y = N-1,e,e
while x+y != 0:
nexi,nexx,nexy = dp[i][x][y]
#print (nexx,nexy)
print (nexx,nexy)
diff = None
if x != nexx:
diff = x - nexx
ans[(N-1) - diff] = "R" * diff
elif y != nexy:
diff = y - nexy
ans[(N-1) - diff] = "W" * diff
#print (x,y,nexx,nexy,diff)
i,x,y = nexi,nexx,nexy
for i in range(N-1):
if ans[i] == None:
ans[i] = "B" * (N-1-i)
print ("Yes")
for i in ans:
print (i)
"""
自分より小さいものに有向辺を貼るとする。
その全てに関して、同じ色を使うとする。
すると、3頂点のうち、最大は必ず同じ辺で入出
そのような組み合わせを見つけるとよい。
N-1
N-2
N-3
N-4
...
1
の中からいくつか取り、
N(N-1)/6 を2こ作りたい
雑に行ける？
dp[i][j] = 和が (i,j) の場合の前の推移
"""
import sys
from sys import stdin
import pprint
N = int(stdin.readline())
if ( N*(N-1)//2 ) % 3 != 0:
print ("No")
sys.exit()
e = N * (N-1) // 6
#print (e)
dp = [ [ [ None ] * (e+1) for i in range(e+1) ] for k in range(N)]
dp[0][0][0] = (0,0,0)
for pl in range(N-1):
for i in range(e+1):
for j in range(e+1):
if dp[pl][i][j] == None:
continue
dp[pl+1][i][j] = (pl,i,j)
dp[pl+1][i][j] = (pl,i,j)
#iに加える
if i + pl+1 <= e:
dp[pl+1][i+pl+1][j] = (pl,i,j)
if j + pl+1 <= e:
dp[pl+1][i][j+pl+1] = (pl,i,j)
#pprint.pprint (dp)
if dp[N-1][e][e] == None:
print ("No")
sys.exit()
ans = [ None ] * (N-1)
i,x,y = N-1,e,e
while x+y != 0:
nexi,nexx,nexy = dp[i][x][y]
#print (nexx,nexy)
#print (nexx,nexy)
diff = None
if x != nexx:
diff = x - nexx
ans[(N-1) - diff] = "R" * diff
elif y != nexy:
diff = y - nexy
ans[(N-1) - diff] = "W" * diff
#print (x,y,nexx,nexy,diff)
i,x,y = nexi,nexx,nexy
for i in range(N-1):
if ans[i] == None:
ans[i] = "B" * (N-1-i)
print ("Yes")
for i in ans:
print (i)
|
ConDefects/ConDefects/Code/arc131_e/Python/27729425
|
condefects-python_data_1677
|
N = int(input())
s = "RGB"
ans = [""]*(N-1)
cnts = [0]*3
if N%3==2:
print("No")
exit()
cnt = N*(N-1)//6
for i in range(N-1):
for c in range(3):
if cnts[c] + (N-1-i) <= cnt:
ans[i] = s[c]*(N-1-i)
cnts[c] += N-1-i
break
else:
print("No")
exit()
print("Yes")
print(*ans, sep='\n')
N = int(input())
s = "RBW"
ans = [""]*(N-1)
cnts = [0]*3
if N%3==2:
print("No")
exit()
cnt = N*(N-1)//6
for i in range(N-1):
for c in range(3):
if cnts[c] + (N-1-i) <= cnt:
ans[i] = s[c]*(N-1-i)
cnts[c] += N-1-i
break
else:
print("No")
exit()
print("Yes")
print(*ans, sep='\n')
|
ConDefects/ConDefects/Code/arc131_e/Python/27742492
|
condefects-python_data_1678
|
#N=int(input())
S=input()
ans=0
for i in range(len(S)-1,-1,-1):
x=ord(S[i])-ord('A')+1
print(x)
ans+=26**(len(S)-i-1)*x
#a,b=map(int,input().split())
print(ans)
#N=int(input())
S=input()
ans=0
for i in range(len(S)-1,-1,-1):
x=ord(S[i])-ord('A')+1
#print(x)
ans+=26**(len(S)-i-1)*x
#a,b=map(int,input().split())
print(ans)
|
ConDefects/ConDefects/Code/abc285_c/Python/45507788
|
condefects-python_data_1679
|
n=int(input())
INDEX=-1
now=float('inf')
ans=[]
for i in range(n):
s,a=input().split()
a=int(a)
ans.append([s,a])
if now>a:
now=a
INDEX=i
for i in range(n):
print(*ans[(i+INDEX)%n])
n=int(input())
INDEX=-1
now=float('inf')
ans=[]
for i in range(n):
s,a=input().split()
a=int(a)
ans.append([s,a])
if now>a:
now=a
INDEX=i
for i in range(n):
print(ans[(i+INDEX)%n][0])
|
ConDefects/ConDefects/Code/abc304_a/Python/45720608
|
condefects-python_data_1680
|
x, y = map(int, input().split())
print("Yes" if y - x == 2 or x - y == 3 else "No")
x, y = map(int, input().split())
print("Yes" if 0 < y - x <= 2 or 0 < x - y <= 3 else "No")
|
ConDefects/ConDefects/Code/abc326_a/Python/54729093
|
condefects-python_data_1681
|
x,y = map(int, input().split())
if y-x <= -3 or y-x > 3:
print("Yes")
else:
print("No")
x,y = map(int, input().split())
if y-x >= -3 and y-x < 3:
print("Yes")
else:
print("No")
|
ConDefects/ConDefects/Code/abc326_a/Python/54727999
|
condefects-python_data_1682
|
X, Y = map(int, input().split())
floors_to_move = Y - X
if floors_to_move == 2 or floors_to_move == -3:
print('Yes')
else:
print('No')
X, Y = map(int, input().split())
floors_to_move = Y - X
if 0 < floors_to_move <= 2 or -3 <= floors_to_move < 0:
print('Yes')
else:
print('No')
|
ConDefects/ConDefects/Code/abc326_a/Python/54490935
|
condefects-python_data_1683
|
X,Y=map(int,input().split());
if X>Y:#下り:
j=X-Y;
if j<=3:
print("Yes");
else:
print("No");
else:
k=Y-X;
if k>=2:
print("Yes");
else:
print("No")
X,Y=map(int,input().split());
if X>Y:#下り:
j=X-Y;
if j<=3:
print("Yes");
else:
print("No");
else:
k=Y-X;
if k<=2:
print("Yes");
else:
print("No")
|
ConDefects/ConDefects/Code/abc326_a/Python/54516500
|
condefects-python_data_1684
|
x,y = map(int,input().split())
if y-x == 2 or x-y == 3:
print("Yes")
else:
print("No")
x,y = map(int,input().split())
if 0 <= y-x <= 2 or 0 <= x-y <= 3:
print("Yes")
else:
print("No")
|
ConDefects/ConDefects/Code/abc326_a/Python/54933438
|
condefects-python_data_1685
|
Q=int(input())
for _ in range(Q):
P,A,B,S,G=map(int,input().split())
mod=P
if S==G:
print(0)
continue
if A==0:
if B==P:
print(1)
continue
else:
print(-1)
continue
def g(x):
ans=1
w=x
n=mod-2
while n>0:
if n&1:
ans*=w
ans%=mod
w**=2
w%=mod
n//=2
return ans
if A==1:
if B==0:
print(-1)
continue
ans=(G-S)*g(B)
ans%=mod
print(ans)
continue
c=B*g(A-1)
c%=mod
if ((S+c)%mod)==0:
print(-1)
continue
ans=(G+c)*g(S+c)
ans%=mod
T={}
d=1
from math import sqrt
k=int(sqrt(mod))
for i in range(k):
if not d in T:
T[d]=i
d*=A
d%=mod
result=10**20
for y in range(k+2):
e=ans*pow(A,-k*y,mod)
e%=mod
if e in T:
pos=T[e]
result=y*k+pos
break
if result<10**20:
print(result)
else:
print(-1)
Q=int(input())
for _ in range(Q):
P,A,B,S,G=map(int,input().split())
mod=P
if S==G:
print(0)
continue
if A==0:
if B==G:
print(1)
continue
else:
print(-1)
continue
def g(x):
ans=1
w=x
n=mod-2
while n>0:
if n&1:
ans*=w
ans%=mod
w**=2
w%=mod
n//=2
return ans
if A==1:
if B==0:
print(-1)
continue
ans=(G-S)*g(B)
ans%=mod
print(ans)
continue
c=B*g(A-1)
c%=mod
if ((S+c)%mod)==0:
print(-1)
continue
ans=(G+c)*g(S+c)
ans%=mod
T={}
d=1
from math import sqrt
k=int(sqrt(mod))
for i in range(k):
if not d in T:
T[d]=i
d*=A
d%=mod
result=10**20
for y in range(k+2):
e=ans*pow(A,-k*y,mod)
e%=mod
if e in T:
pos=T[e]
result=y*k+pos
break
if result<10**20:
print(result)
else:
print(-1)
|
ConDefects/ConDefects/Code/abc270_g/Python/49185222
|
condefects-python_data_1686
|
def extgcd(a, b):
"""returns gcd(a, b), s, r s.t. a * s + b * r == gcd(a, b)"""
s, bs = 0, 1
r, br = b, a
while r:
q = br // r
br, r = r, br - q * r
bs, s = s, bs - q * s
return br, bs, (br-bs*a)//b if b else 0
import math
def sol(a, b, mod):
"""solve ax≡b %mod"""
g = math.gcd(a, mod)
if g==1:
gg, x, y = extgcd(a, mod)
return (b*x)%mod
else:
if b%g==0:
a//=g
b//=g
mod//=g
gg, x, y = extgcd(a, mod)
return (b*x)%mod
else:
return -1
def bsgs(X, Y, M):
D = {1: 0}
sq = int(M**.5)+1
# Baby-step
Z = 1
for i in range(sq):
Z = Z * X % M
D[Z] = i+1
if Y in D:
return D[Y]
# Giant-step
R = pow(Z, M-2, M) # R = X^(-sq)
for i in range(1, sq+1):
Y = Y * R % M
if Y in D:
return D[Y] + i*sq
return -1
def solve(p,a,b,s,g):
if a==0:
if g==s:return 0
elif g==b:return 1
else:return -1
elif a==1:
return sol(b,(g-s)%p,p)
else:
inv = b*pow(a-1,p-2,p)%p
s+=inv;g+=inv
s%=p;g%=p
if s==0:
if g==0:
return 0
else:
return -1
g *=pow(s,p-2,p)
g %= p
return bsgs(a,g,p)
t = int(input())
for i in range(t):
p,a,b,s,g = map(int, input().split())
print(solve(p,a,b,s,g))
def extgcd(a, b):
"""returns gcd(a, b), s, r s.t. a * s + b * r == gcd(a, b)"""
s, bs = 0, 1
r, br = b, a
while r:
q = br // r
br, r = r, br - q * r
bs, s = s, bs - q * s
return br, bs, (br-bs*a)//b if b else 0
import math
def sol(a, b, mod):
"""solve ax≡b %mod"""
g = math.gcd(a, mod)
if g==1:
gg, x, y = extgcd(a, mod)
return (b*x)%mod
else:
if b%g==0:
a//=g
b//=g
mod//=g
gg, x, y = extgcd(a, mod)
return (b*x)%mod
else:
return -1
def bsgs(X, Y, M):
D = {1: 0}
sq = int(M**.5)+1
# Baby-step
Z = 1
for i in range(sq):
Z = Z * X % M
if Z not in D:D[Z] = i+1
if Y in D:
return D[Y]
# Giant-step
R = pow(Z, M-2, M) # R = X^(-sq)
for i in range(1, sq+1):
Y = Y * R % M
if Y in D:
return D[Y] + i*sq
return -1
def solve(p,a,b,s,g):
if a==0:
if g==s:return 0
elif g==b:return 1
else:return -1
elif a==1:
return sol(b,(g-s)%p,p)
else:
inv = b*pow(a-1,p-2,p)%p
s+=inv;g+=inv
s%=p;g%=p
if s==0:
if g==0:
return 0
else:
return -1
g *=pow(s,p-2,p)
g %= p
return bsgs(a,g,p)
t = int(input())
for i in range(t):
p,a,b,s,g = map(int, input().split())
print(solve(p,a,b,s,g))
|
ConDefects/ConDefects/Code/abc270_g/Python/43228358
|
condefects-python_data_1687
|
import sys
input = sys.stdin.readline
def Matprod(A, B, mod, N):
temp = [0] * N*N
for i in range(N):
for j in range(N):
ij = i * N + j
for k in range(N):
temp[ij] += A[i*N+k] * B[k*N+j]
temp[ij] %= mod
return temp
def Matpow_Linear(A, M, mod, N):
Mat = [0] * N*N
for i in range(N):
Mat[i*N+i] = 1
while M:
if M & 1:
Mat = Matprod(Mat, A, mod, N)
A = Matprod(A, A, mod, N)
M >>= 1
return Mat
def f(x, a, b, mod):
return (x * a + b) % mod
def baby_step_giant_step(s, g, mod, A, B):
now = g
D = dict()
M = int(mod**0.5) + 1
for j in range(M):
D[now] = j
now = f(now, A, B, mod)
now = s
L = [A, B, 0, 1]
L = Matpow_Linear(L, M, mod, 2)
am, bm = L[0], L[1]
for i in range(1, M + 1):
now = f(now, am, bm, mod)
if now in D:
return i * M - D[now]
return -1
T = int(input())
for _ in range(T):
P, A, B, S, G = map(int, input().split())
#fの逆関数がない時(A=0)は例外処理する。
if A == 0:
if S == G:
print(0)
elif G == B:
print(1)
else:
print(-1)
continue
print(baby_step_giant_step(S, G, P, A, B))
import sys
input = sys.stdin.readline
def Matprod(A, B, mod, N):
temp = [0] * N*N
for i in range(N):
for j in range(N):
ij = i * N + j
for k in range(N):
temp[ij] += A[i*N+k] * B[k*N+j]
temp[ij] %= mod
return temp
def Matpow_Linear(A, M, mod, N):
Mat = [0] * N*N
for i in range(N):
Mat[i*N+i] = 1
while M:
if M & 1:
Mat = Matprod(Mat, A, mod, N)
A = Matprod(A, A, mod, N)
M >>= 1
return Mat
def f(x, a, b, mod):
return (x * a + b) % mod
def baby_step_giant_step(s, g, mod, A, B):
now = g
D = dict()
M = int(mod**0.5) + 1
for j in range(M + 1):
D[now] = j
now = f(now, A, B, mod)
now = s
L = [A, B, 0, 1]
L = Matpow_Linear(L, M, mod, 2)
am, bm = L[0], L[1]
for i in range(1, M + 1):
now = f(now, am, bm, mod)
if now in D:
return i * M - D[now]
return -1
T = int(input())
for _ in range(T):
P, A, B, S, G = map(int, input().split())
#fの逆関数がない時(A=0)は例外処理する。
if A == 0:
if S == G:
print(0)
elif G == B:
print(1)
else:
print(-1)
continue
print(baby_step_giant_step(S, G, P, A, B))
|
ConDefects/ConDefects/Code/abc270_g/Python/52785891
|
condefects-python_data_1688
|
def resolve():
import sys
input = sys.stdin.readline
t = int(input())
for _ in range(t):
p, a, b, s, g = map(int, input().split())
def f(x):
return (a * x + b) % p
r = int(p**0.5) + 1
xr = pow(a, r, p)
yr = b
for _ in range(r - 1):
yr = (a * yr + b) % p
def fr(x):
return (xr * x + yr) % p
if a == 0:
print(0 if s == g else 1 if g == 0 else -1)
else:
print(bsgs2(s, g, r, f, fr))
def bsgs2(a, b, r, f, fr):
# f^x(a) = b (mod m) たる最小のx
# r = int(m**0.5) + 1, fr:f^r
if a == b:
return 0
# baby step
baby = {}
for i in range(r):
baby[b] = i
b = f(b)
# giant step
for j in range(1, r + 3):
a = fr(a)
if a in baby:
return j * r - baby[a]
return -1
if __name__ == "__main__":
resolve()
def resolve():
import sys
input = sys.stdin.readline
t = int(input())
for _ in range(t):
p, a, b, s, g = map(int, input().split())
def f(x):
return (a * x + b) % p
r = int(p**0.5) + 1
xr = pow(a, r, p)
yr = b
for _ in range(r - 1):
yr = (a * yr + b) % p
def fr(x):
return (xr * x + yr) % p
if a == 0:
print(0 if s == g else 1 if g == b else -1)
else:
print(bsgs2(s, g, r, f, fr))
def bsgs2(a, b, r, f, fr):
# f^x(a) = b (mod m) たる最小のx
# r = int(m**0.5) + 1, fr:f^r
if a == b:
return 0
# baby step
baby = {}
for i in range(r):
baby[b] = i
b = f(b)
# giant step
for j in range(1, r + 3):
a = fr(a)
if a in baby:
return j * r - baby[a]
return -1
if __name__ == "__main__":
resolve()
|
ConDefects/ConDefects/Code/abc270_g/Python/49178986
|
condefects-python_data_1689
|
import sys
readline = sys.stdin.readline
n,m,k = map(int,readline().split())
ac = [list(map(int,readline().split())) for _ in range(m)]
ac = ac[::-1]
d = n-k
pow7 = [7**i for i in range(20)]
for i in range(20)[::-1]:
P = pow7[i]
q,d = divmod(d,P)
if q==0: continue
for _ in range(q):
p = P
res = []
ac2 = [x[:] for x in ac]
while ac2[-1][1] and p >= ac2[-1][1]:
a,c = ac2.pop()
p -= c
ac2[-1][1] -= p
#print(ac,ac2,"yes",P)
while ac2:
a1,c1 = ac[-1]
a2,c2 = ac2[-1]
v = min(c1,c2)
r = (a1+a2)%7
#print(r,v)
if res and res[-1][0] == r:
res[-1][1] += v
else:
res.append([(a1+a2)%7,v])
if c1==v:
ac.pop()
else:
ac[-1][1] -= v
if c2==v:
ac2.pop()
else:
ac2[-1][1] -= v
ac = res
#print(ac)
#print(ac)
ans = []
for a,c in ac:
ans += [a%7]*c
print(*ans[::-1])
import sys
readline = sys.stdin.readline
n,m,k = map(int,readline().split())
ac = [list(map(int,readline().split())) for _ in range(m)]
ac = ac[::-1]
d = n-k
pow7 = [7**i for i in range(20)]
for i in range(20)[::-1]:
P = pow7[i]
q,d = divmod(d,P)
if q==0: continue
for _ in range(q):
p = P
res = []
ac2 = [x[:] for x in ac]
while ac2[-1][1] and p >= ac2[-1][1]:
a,c = ac2.pop()
p -= c
ac2[-1][1] -= p
#print(ac,ac2,"yes",P)
while ac2:
a1,c1 = ac[-1]
a2,c2 = ac2[-1]
v = min(c1,c2)
r = (a1+a2)%7
#print(r,v)
if res and res[-1][0] == r:
res[-1][1] += v
else:
res.append([(a1+a2)%7,v])
if c1==v:
ac.pop()
else:
ac[-1][1] -= v
if c2==v:
ac2.pop()
else:
ac2[-1][1] -= v
ac = res[::-1]
#print(ac)
#print(ac)
ans = []
for a,c in ac:
ans += [a%7]*c
print(*ans[::-1])
|
ConDefects/ConDefects/Code/abc251_h/Python/31690776
|
condefects-python_data_1690
|
a=list(map(int,input().split()))
print(max(0,max(a[0],a[1])-min(a[2],a[3])))
a=list(map(int,input().split()))
print(max(0,min(a[1],a[3])-max(a[0],a[2])))
|
ConDefects/ConDefects/Code/abc261_a/Python/45683542
|
condefects-python_data_1691
|
L,R,LL,RR = map(int,input().split())
l = max(L,LL)
r = min(R,RR)
ans = max(r-l+1,0)
print(ans)
L,R,LL,RR = map(int,input().split())
l = max(L,LL)
r = min(R,RR)
ans = max(r-l,0)
print(ans)
|
ConDefects/ConDefects/Code/abc261_a/Python/44843749
|
condefects-python_data_1692
|
L1,R1,L2,R2 = map(int,input().split())
if L1 <= L2 <= R1 <= R2:
print(R1-L2)
elif L2 <= L1 <= R2 <= R1:
print(R2-L1)
elif L2 <= L1 <= R1 <= R2:
print(R1-L1)
elif L1 <= L2 <= R2 <= R1:
print(R2-L2)
L1,R1,L2,R2 = map(int,input().split())
if L1 <= L2 <= R1 <= R2:
print(R1-L2)
elif L2 <= L1 <= R2 <= R1:
print(R2-L1)
elif L2 <= L1 <= R1 <= R2:
print(R1-L1)
elif L1 <= L2 <= R2 <= R1:
print(R2-L2)
else:
print(0)
|
ConDefects/ConDefects/Code/abc261_a/Python/45791113
|
condefects-python_data_1693
|
#!/usr/bin/env python3
l1, r1, l2, r2 = [int(x) for x in input().split()]
if r1 <= l2 or r2 < l1:
print(0)
elif l2 < r1 and l1 < l2:
print(min(r1, r2) - max(l1, l2))
#!/usr/bin/env python3
l1, r1, l2, r2 = [int(x) for x in input().split()]
if r1 <= l2 or r2 < l1:
print(0)
else:
print(min(r1, r2) - max(l1, l2))
|
ConDefects/ConDefects/Code/abc261_a/Python/45222195
|
condefects-python_data_1694
|
l1,r1,l2,r2=map(int,input().split())
ans=0
for i in range(0,100):
if l1<i<=r1 and l2<i<=r2:
ans+=1
print(ans)
l1,r1,l2,r2=map(int,input().split())
ans=0
for i in range(0,101):
if l1<i<=r1 and l2<i<=r2:
ans+=1
print(ans)
|
ConDefects/ConDefects/Code/abc261_a/Python/45536785
|
condefects-python_data_1695
|
import sys
inf = 1e9
def input():
return sys.stdin.readline().strip()
def solution(chords):
chords = [sorted(x) for x in chords]
m = {e:s for s,e in chords}
starts = set(map(lambda x: x[0], chords))
ends = set(map(lambda x: x[1], chords))
N = len(chords)
s = []
for x in range(N):
if (x+1) in starts:
s.append(x+1)
elif (x+1) in ends:
if s:
e = s.pop()
if e != m[x+1]:
print("Yes")
return
print("No")
def main():
n = int(input())
solution(list([tuple(map(int, input().split())) for _ in range(n)]))
if __name__ == "__main__":
main()
import sys
inf = 1e9
def input():
return sys.stdin.readline().strip()
def solution(chords):
chords = [sorted(x) for x in chords]
m = {e:s for s,e in chords}
starts = set(map(lambda x: x[0], chords))
ends = set(map(lambda x: x[1], chords))
N = len(chords)
s = []
for x in range(2*N):
if (x+1) in starts:
s.append(x+1)
elif (x+1) in ends:
if s:
e = s.pop()
if e != m[x+1]:
print("Yes")
return
print("No")
def main():
n = int(input())
solution(list([tuple(map(int, input().split())) for _ in range(n)]))
if __name__ == "__main__":
main()
|
ConDefects/ConDefects/Code/abc338_e/Python/54041010
|
condefects-python_data_1696
|
n = int(input())
s = list(map(int,input().split()))
for i in range(n):
ans = 0
for l in range(7):
ans += s[l+i]
print(str(ans),"",end = "")
n = int(input())
s = list(map(int,input().split()))
for i in range(n):
ans = 0
for l in range(7):
ans += s[l+i*7]
print(str(ans),"",end = "")
|
ConDefects/ConDefects/Code/abc307_a/Python/45989937
|
condefects-python_data_1697
|
N = int(input())
l = list(map(int,input().split()))
lis = []
d = []
b = 0
for j in range(int(N/7)):
for k in l[7*b:7*(b+1)]:
lis.append(k)
d.append(sum(lis))
lis.clear()
b += 1
print(*d)
N = int(input())
l = list(map(int,input().split()))
lis = []
d = []
b = 0
for j in range(int(N)):
for k in l[7*b:7*(b+1)]:
lis.append(k)
d.append(sum(lis))
lis.clear()
b += 1
print(*d)
|
ConDefects/ConDefects/Code/abc307_a/Python/45778588
|
condefects-python_data_1698
|
N = int(input())
A = list(map(int,input().split()))
res = [0]*N
SUM = 0
for i in range(len(A)):
SUM += A[i]
if (i + 1)%7==0:
res[i//7] = SUM
SUM = 0
print(res)
N = int(input())
A = list(map(int,input().split()))
res = [0]*N
SUM = 0
for i in range(len(A)):
SUM += A[i]
if (i + 1)%7==0:
res[i//7] = SUM
SUM = 0
print(*res)
|
ConDefects/ConDefects/Code/abc307_a/Python/45953883
|
condefects-python_data_1699
|
import sys
import os
from io import BytesIO, IOBase
BUFSIZE = 8192
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")
def I():
return input()
def II():
return int(input())
def MI():
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())
#------------------------------FastIO---------------------------------
from bisect import *
from heapq import *
from collections import *
from functools import *
from itertools import *
from time import *
from random import *
from math import log, gcd
#dfs - stack#
#check top!#
mod = 998244353
dp = [[0 for _ in range(5010)] for _ in range(5010)]
def solve():
n = II()
r = LII()
c = LII()
if sum(r) != sum(c):
print(0)
return
x, s = 0, 0
for i in range(n):
s += c[i]
if c[i] == 2:
x += 1
dp[0][x] = 1
for i in range(1, n + 1):
s -= r[i - 1]
for j in range(n + 1):
y = s - 2 * j
if y < 0:
break
if r[i - 1] == 0:
dp[i][j] = dp[i - 1][j]
elif r[i - 1] == 1:
dp[i][j] = (dp[i - 1][j + 1] * (j + 1) % mod + dp[i - 1][j] * (y + 1) % mod) % mod
else:
dp[i][j] = (dp[i - 1][j + 1] * (j + 1) % mod + dp[i - 1][j + 2] * ((j + 2) * (j + 1) // 2) % mod + dp[i - 1][j] * ((y + 2) * (y + 1) // 2) % mod + dp[i - 1][j + 1] * (j + 1) * y % mod) % mod
print(dp[n - 1][0] % mod)
for _ in range(1):solve()
import sys
import os
from io import BytesIO, IOBase
BUFSIZE = 8192
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")
def I():
return input()
def II():
return int(input())
def MI():
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())
#------------------------------FastIO---------------------------------
from bisect import *
from heapq import *
from collections import *
from functools import *
from itertools import *
from time import *
from random import *
from math import log, gcd
#dfs - stack#
#check top!#
mod = 998244353
dp = [[0 for _ in range(5010)] for _ in range(5010)]
def solve():
n = II()
r = LII()
c = LII()
if sum(r) != sum(c):
print(0)
return
x, s = 0, 0
for i in range(n):
s += c[i]
if c[i] == 2:
x += 1
dp[0][x] = 1
for i in range(1, n + 1):
s -= r[i - 1]
for j in range(n + 1):
y = s - 2 * j
if y < 0:
break
if r[i - 1] == 0:
dp[i][j] = dp[i - 1][j]
elif r[i - 1] == 1:
dp[i][j] = (dp[i - 1][j + 1] * (j + 1) % mod + dp[i - 1][j] * (y + 1) % mod) % mod
else:
dp[i][j] = (dp[i - 1][j + 1] * (j + 1) % mod + dp[i - 1][j + 2] * ((j + 2) * (j + 1) // 2) % mod + dp[i - 1][j] * ((y + 2) * (y + 1) // 2) % mod + dp[i - 1][j + 1] * (j + 1) * y % mod) % mod
print(dp[n][0])
for _ in range(1):solve()
|
ConDefects/ConDefects/Code/abc273_g/Python/35719660
|
condefects-python_data_1700
|
N, M = map(int, input().split())
S = [list(input()) for _ in range(N)]
ans = M + 10
for bit in range(1 << N): #訪れるポップコーン売り場の選び方＝bit
store = []
for i in range(N): #N個の売り場について
if bit >> i & 1: #bitのi番目のビットが1かどうか pythonで1はTrue, 0はFalse
store.append(i) #bitで1だった売り場のindexをstoreに入れる
data = [0] * M
for s_i in store: #storeに格納された売り場のindex=s_iについて
for j, s_j in enumerate(S[s_i]):
if s_j == 'o': #s_i番目の売り場のj番目の要素s_jがoだったら
data[j] == 1
if data == [1] * M:
ans = min(ans, len(store))
print(ans)
N, M = map(int, input().split())
S = [list(input()) for _ in range(N)]
ans = M + 10
for bit in range(1 << N): #訪れるポップコーン売り場の選び方＝bit
store = []
for i in range(N): #N個の売り場について
if bit >> i & 1: #bitのi番目のビットが1かどうか pythonで1はTrue, 0はFalse
store.append(i) #bitで1だった売り場のindexをstoreに入れる
data = [0] * M
for s_i in store: #storeに格納された売り場のindex=s_iについて
for j, s_j in enumerate(S[s_i]):
if s_j == 'o': #s_i番目の売り場のj番目の要素s_jがoだったら
data[j] = 1
if data == [1] * M:
ans = min(ans, len(store))
print(ans)
|
ConDefects/ConDefects/Code/abc358_c/Python/54990754
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.