id stringlengths 24 27 | content stringlengths 37 384k | max_stars_repo_path stringlengths 51 51 |
|---|---|---|
condefects-python_data_101 | Q=int(input())
A=[list(map(int,input().split())) for i in range(Q)]
B=[]
for i in range(Q):
if A[i][0] == 1:
B.append(A[i][0])
else:
print(B[-A[i][1]])
Q=int(input())
A=[list(map(int,input().split())) for i in range(Q)]
B=[]
for i in range(Q):
if A[i][0] == 1:
B.append(A[i][1])
... | ConDefects/ConDefects/Code/abc340_b/Python/54892821 |
condefects-python_data_102 | Q = int(input())
A = []
for i in range(Q):
c, d = map(int, input().split())
if c == 1:
A.append(c)
else:
print(A[-d])
Q = int(input())
A = []
for i in range(Q):
c, d = map(int, input().split())
if c == 1:
A.append(d)
else:
print(A[-d]) | ConDefects/ConDefects/Code/abc340_b/Python/54306887 |
condefects-python_data_103 | N = int(input())
A = []
for i in range(N):
query, num = map(int,input().split())
if query == 1:
A.append(num)
elif query == 2:
print(A[-1])
N = int(input())
A = []
for i in range(N):
query, num = map(int,input().split())
if query == 1:
A.append(num)
elif query == 2:
print(A[-num])
... | ConDefects/ConDefects/Code/abc340_b/Python/54768693 |
condefects-python_data_104 | Q = int(input())
A = []
for _ in range(Q):
t, k = map(int, input().split())
if t == 1:
A.append(t)
else:
print(A[-k])
Q = int(input())
A = []
for _ in range(Q):
t, k = map(int, input().split())
if t == 1:
A.append(k)
else:
print(A[-k]) | ConDefects/ConDefects/Code/abc340_b/Python/54695651 |
condefects-python_data_105 | from collections import deque
n,k=map(int,input().split())
a=[list(map(int,input().split())) for _ in range(n)]
q=int(input())
def root(s,t):
d=deque([(s,0)])
check=[0]*n
if s==t:
cnt=0
while d:
if cnt%100==0:
print(cnt)
cnt+=1
v,w=d.popleft()
for i in range(n):
... | ConDefects/ConDefects/Code/arc159_a/Python/43796233 |
condefects-python_data_106 | from collections import deque
n, k=map(int, input().split())
A =[[] for _ in range(n)]
for i in range(n):
a =list(map(int, input().split()))
for j in range(n):
if a[j] ==1:
A[i].append(j)
dist2 =[[-1] *n for _ in range(n)]
for i in range(n):
d =deque()
d.append(i)
v =d.pop()
... | ConDefects/ConDefects/Code/arc159_a/Python/41991860 |
condefects-python_data_107 | from math import gcd
import sys
M = 10**18
def main():
input = sys.stdin.readline
N, K = map(int, input().split())
XY = [tuple(map(int, input().split())) for _ in range(N)]
if K == 1:
return 'Infinity'
S = set()
ans = 0
for i in range(N):
xi, yi = XY[i]
for j in range... | ConDefects/ConDefects/Code/abc248_e/Python/45802660 |
condefects-python_data_108 | N,K=map(int,input().split())
if K==1:
print("Infinity")
exit()
S=set()
def gcd(a,b):
if b==0:
return a
else:
return gcd(b,(a%b))
XY=[list(map(int,input().split())) for i in range(N)]
for i in range(N):
x0,y0=XY[i]
for j in range(i+1,N):
x1,y1=XY[j]
dx=x1-x0
... | ConDefects/ConDefects/Code/abc248_e/Python/45230444 |
condefects-python_data_109 | N = int(input())
S=input()
ck=0
for i in range(N):
if S[i]!=S[-1-i]:
ck=1
if ck==0:
exit(print("Yes"))
if S[0]=="A" and S[-1]=="B":
exit(print("No"))
print("Yes")
N = int(input())
S=input()
ck=0
if S=="BA":
exit(print("No"))
for i in range(N):
if S[i]!=S[-1-i]:
ck=1
if ck==0:
ex... | ConDefects/ConDefects/Code/arc145_a/Python/43402663 |
condefects-python_data_110 | n = int(input())
s = list(input())
a = s[:n // 2]
b = list(reversed(s[(n + 1) // 2:]))
def main():
if a[0] != b[0]:
if a[0] == "A":
return False
return True
if main():
print("Yes")
else:
print("No")
n = int(input())
s = list(input())
a = s[:n // 2]
b = list(reversed(s[(n + 1) ... | ConDefects/ConDefects/Code/arc145_a/Python/45268312 |
condefects-python_data_111 | n=int(input())
s=input()
print('No' if s[0]=='A' and s[-1]=='B' else 'Yes')
n=int(input())
s=input()
print('No' if (s[0]=='A' and s[-1]=='B') or s=='BA' else 'Yes') | ConDefects/ConDefects/Code/arc145_a/Python/46163303 |
condefects-python_data_112 | n=int(input())
s=list(input())
if "".join(s)=="AB":
print("No")
exit()
if s[0]=="B":
print("Yes")
exit()
if s[0]=="A" and s[-1]=="B":
print("No")
exit()
print("Yes")
n=int(input())
s=list(input())
if "".join(s)=="BA":
print("No")
exit()
if s[0]=="B":
print("Yes")
exit()
if s[0]=... | ConDefects/ConDefects/Code/arc145_a/Python/42736417 |
condefects-python_data_113 | N = int(input())
S = input()
if S[0] == "B" and S[-1] == "A":
print("No")
elif S == "BA":
print("No")
else:
print("Yes")
N = int(input())
S = input()
if S[0] == "A" and S[-1] == "B":
print("No")
elif S == "BA":
print("No")
else:
print("Yes")
| ConDefects/ConDefects/Code/arc145_a/Python/45555747 |
condefects-python_data_114 | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
N = int(readline())
S = readline().rstrip()
if S[0] == 'A' and S[-1] == 'B':
print('No')
else:
print('Yes')
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
N = i... | ConDefects/ConDefects/Code/arc145_a/Python/42763842 |
condefects-python_data_115 | n = int(input())
s = list(input())
if (s[0]=='A') and (s[-1]=='B'):
print('No')
else:
print('Yes')
n = int(input())
s = list(input())
if (s[0]=='A') and (s[-1]=='B'):
print('No')
elif (len(s)==2) and (s[0]!=s[-1]):
print('No')
else:
print('Yes') | ConDefects/ConDefects/Code/arc145_a/Python/45291396 |
condefects-python_data_116 | # ARC145 A - AB Palindrome
# https://atcoder.jp/contests/arc145/tasks/arc145_a
def main():
N = int(input())
S = input()
ans = "Yes" if solve(N, S) is True else "No"
print(ans)
def solve(N: int, S: str) -> bool:
if S == "AA" or S == "BB":
return True
# 先頭文字が「A」、末尾文字が「B」のとき回文不可能
i... | ConDefects/ConDefects/Code/arc145_a/Python/43086658 |
condefects-python_data_117 |
inf = 10 ** 16
#頂点は1-index,下段は0-index
class LazySegTree:
#単位元と結合と作用をここで定義
Xunit = -inf
Aunit = 0
def Xf(self,x,y):
return max(x,y)
#Xf = max
def Af(self,a,b):
return a + b
#AのXへの作用
def operate(self,x,a):
return x + a
def __init__(self,N):
... | ConDefects/ConDefects/Code/abc292_h/Python/39455718 |
condefects-python_data_118 | import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################... | ConDefects/ConDefects/Code/abc292_h/Python/40600464 |
condefects-python_data_119 |
#####segfunc#####
def Sum(x, y):
return x+y
#################
class SegTree:
#init(init_val, ide_ele): 配列init_valで初期化 O(N)
#update(k, x): k番目の値をxに更新 O(logN)
#query(l, r): 区間[l, r)をsegfuncしたものを返す O(logN)
def __init__(self, init_val, segfunc, ide_ele):
#init_val: 配列の初期... | ConDefects/ConDefects/Code/abc292_h/Python/52014767 |
condefects-python_data_120 | B, G = map(int, input().split())
if B > G:
print("Bat")
else:
print("Grove")
B, G = map(int, input().split())
if B > G:
print("Bat")
else:
print("Glove")
| ConDefects/ConDefects/Code/abc334_a/Python/54632654 |
condefects-python_data_121 | n = int(input())
phrase = input().lower()
operation = int(input())
alphabet = "abcdefghijklmnopqrstuvwsyz"
for i in range(operation):
original, become = input().split()
alphabet = alphabet.replace(original, become)
new = ""
for ch in phrase:
new += alphabet[ord(ch)-97]
print(new)
n = int(input())
phra... | ConDefects/ConDefects/Code/abc342_c/Python/54936668 |
condefects-python_data_122 | from atcoder.lazysegtree import LazySegTree
from atcoder.segtree import SegTree
from math import log2,log,floor,ceil,gcd
from itertools import *
from collections import *
from copy import deepcopy
from heapq import *
import sys
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
def lcm(x,y):
return (x... | ConDefects/ConDefects/Code/abc342_c/Python/54516554 |
condefects-python_data_123 | from collections import deque
def slidemin(X, k):
q = deque([])
ret = []
for i in range(len(X)):
while q and q[-1][1] >= X[i]:
q.pop()
deque.append(q, (i + k, X[i]))
if q[0][0] == i:
deque.popleft(q)
if i >= k-1:
ret.append(q[0][1])
ret... | ConDefects/ConDefects/Code/abc303_g/Python/41795359 |
condefects-python_data_124 | #ABC303G Bags Game
'''
両端から1袋もらう。
A円賄賂してB個もらうか、C円賄賂してD個もらうか。
愚直な区間DPを書くと
DP[i][L][R]: 手番がiで、区間が[L,R)のとき、最適な操作をしたときのなにか
i=0: 高橋君(先手), X-Yを格納 i=1: 青木君(後手), Y-Xを格納
初期化はDP[i][x][x]=0
遷移はi=0なら max(DP[1][区間]+利得), i=1なら min(DP[0][区間]-利得)
ただ遷移がきついかな。L,Rの選び方でO(N^2)はいいけれど。
左右から取るクエリはO(1)だからこれはそのままでよくて、
区間クエリかな･･... | ConDefects/ConDefects/Code/abc303_g/Python/41906923 |
condefects-python_data_125 | N = int(input())
AC = sorted([[*list(map(int, input().split())), i+1] for i in range(N)], key=lambda x:x[1])
_max = AC[0][1]
not_discarded = [AC[0][2]]
for i in AC:
if _max < i[0]:
not_discarded.append(i[2])
_max = i[0]
print(len(not_discarded))
print(*sorted(not_discarded))
N = int(input())
AC = s... | ConDefects/ConDefects/Code/abc354_c/Python/54752444 |
condefects-python_data_126 | def rerooting():
# dfs1 bottom-up
dp1=[E]*n
for v in order[::-1]:
dp1[v]=g(dp1[v],v)
p=par[v]
if p!=-1:
dp1[p]=merge(dp1[p],f(dp1[v],p,v))
# dfs2 top-down
dp2=[E]*n
ans=[E]*n
for v in order:
s=len(edge[v])
cumR=[E]*(s+1)
cumR[s]=E
for i in range(s,0,-1):
u=ed... | ConDefects/ConDefects/Code/arc179_d/Python/54184092 |
condefects-python_data_127 | import sys
def input():
return sys.stdin.readline().rstrip()
from collections import deque
def main():
N, M = map(int, input().split())
link1 = [[] for _ in range(N)]
link2 = [[] for _ in range(N)]
inf = float('inf')
dist1 = [inf]*N
dist1[0] = 0
dist2 = [inf]*N
dist2[-1] = 0
... | ConDefects/ConDefects/Code/abc291_f/Python/45788276 |
condefects-python_data_128 | from collections import defaultdict, deque
import sys, math, bisect, heapq, copy
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional
from itertools import permutations
sys.setrecursionlimit(10**6)
def INT(): # 整数1つ
return int(input())
d... | ConDefects/ConDefects/Code/abc291_f/Python/45488021 |
condefects-python_data_129 | from collections import deque
from collections import defaultdict
from bisect import bisect_left
import sys
sys.setrecursionlimit(1000000)
from heapq import heappop, heappush
N,M=map(int, input().split())
Pos=[]
for _ in range(N):
s=input()
Pos.append(s)
dis1=[1<<60]*N
dis1[0]=0
que=deque()
que.append(0)
while(... | ConDefects/ConDefects/Code/abc291_f/Python/46006070 |
condefects-python_data_130 | import sys
input=lambda:sys.stdin.readline().rstrip()
N=int(input())
A=list(map(int,input().split()))
print(sum([abs(A[i-1]-A[i]) for i in range(N)])//2)
import sys
input=lambda:sys.stdin.readline().rstrip()
N=int(input())
A=list(map(int,input().split()))
print(max(sum([abs(A[i-1]-A[i]) for i in range(N)])//2,*A)) | ConDefects/ConDefects/Code/arc136_c/Python/29821665 |
condefects-python_data_131 | N = int(input())
A = list(map(int, input().split()))
B = []
before = A[-1]
for a in A:
B.append(a - before)
before = a
ans = sum([b for b in B if b > 0])
print(max(ans, min(A)))
N = int(input())
A = list(map(int, input().split()))
B = []
before = A[-1]
for a in A:
B.append(a - before)
before = a
ans... | ConDefects/ConDefects/Code/arc136_c/Python/29773426 |
condefects-python_data_132 | n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = [(i, 0) for i in a] + [(i, 1) for i in b]
c.sort()
ans = "No"
for i in range(n + m - 1):
if c[i][1] == c[i + 1][1]:
ans = "Yes"
print(ans)
n, m = map(int, input().split())
a = list(map(int, inpu... | ConDefects/ConDefects/Code/abc355_b/Python/55005403 |
condefects-python_data_133 | N, M = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = "No"
C = sorted(A + B)
for i in range(len(C)-1):
if (C[i] in A and C[i+1] in A) or (C[i] in B and C[i+1] in B):
ans = "Yes"
print(ans)
N, M = map(int, input().split())
A = list(map(int, input().split()... | ConDefects/ConDefects/Code/abc355_b/Python/55114037 |
condefects-python_data_134 | n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = []
for aa in a:
c.append((aa, 1))
for bb in b:
c.append((bb, 2))
c.sort()
for i in range(n + m - 1):
if c[i][1] == c[i+1][1]:
print("Yes")
exit()
print("No")
n, m = map(int, input()... | ConDefects/ConDefects/Code/abc355_b/Python/55109474 |
condefects-python_data_135 | N, M = map(int, input().split())
A = set(map(int, input().split()))
B = set(map(int, input().split()))
C = sorted(list(A | B))
for i in range(N - 1):
if C[i] in A and C[i + 1] in A:
print('Yes')
exit()
print('No')
N, M = map(int, input().split())
A = set(map(int, input().split()))
B = set(map(int, input().sp... | ConDefects/ConDefects/Code/abc355_b/Python/55062153 |
condefects-python_data_136 | N, L = map(int, input().split())
la = map(int, input().split())
from math import inf
dp = [inf] * (200005)
dp[0] = 0
for i in range(1, L-1):
w = i * (L-i)
for j in range(w, 200005):
dp[j] = min(dp[j], dp[j-w]+1)
for i in la:
if dp[i]==inf: print(-1)
else: print(dp[i])
N, L = map(int, input().split())
la... | ConDefects/ConDefects/Code/arc178_c/Python/53727508 |
condefects-python_data_137 | N,X=map(int,input().split())
DP=[0]*(X+1) #DP[n]=現在n円払えるか
DP[0]=1
for i in range(N):
a,b=map(int,input().split())
for n in range(X+1):
for c in range(1,b+1):
if 0<=n-c*a and DP[n-c*a]:
DP[n]=1
print("Yes" if DP[X] else "No")
N,X=map(int,input().split())
DP=[0]*(X+1) #DP[n]=現在n円払えるか
DP[0]=1... | ConDefects/ConDefects/Code/abc286_d/Python/45059364 |
condefects-python_data_138 | import sys
import math
from collections import defaultdict
from collections import Counter
from functools import lru_cache
sys.setrecursionlimit(10 ** 8)
MOD1 = 10**9 + 7
def main():
n, x = map(int, sys.stdin.readline().split())
a, b = [], []
for _ in range(n):
ai, bi = map(int, sys.stdin.readli... | ConDefects/ConDefects/Code/abc286_d/Python/45471607 |
condefects-python_data_139 | n, x = map(int, input().split())
a = [0 for _ in range(n)]
b = [0 for _ in range(n)]
for i in range(n):
a[i], b[i] = map(int, input().split())
dp = [[False for _ in range(x + 1)] for _ in range(n + 1)]
for i in range(n + 1):
dp[i][0] = True
for i in range(n):
for j in range(x):
for k in range(b[i] + 1):
... | ConDefects/ConDefects/Code/abc286_d/Python/45787313 |
condefects-python_data_140 | import sys
input = lambda: sys.stdin.readline().rstrip()
# sys.setrecursionlimit(10**7)
# sys.set_int_max_str_digits(10**6)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
def mp():return map(int,input().split())
def lmp():return list(map(int,input().split()))
def lm1(LIST): return list(map(lambda x:x-1... | ConDefects/ConDefects/Code/arc172_b/Python/50474956 |
condefects-python_data_141 | DIV = 998244353
if True:
n, k, l = map(int, input().split())
print(n, k, l)
ans = 1
for i in range(n):
m = n-k
print(m)
diff = min(m, i)
ans *= l-diff
ans %= DIV
print(ans)
DIV = 998244353
if True:
n, k, l = map(int, input().split())
ans = 1
for i in range(n):
m = n-k
diff = m... | ConDefects/ConDefects/Code/arc172_b/Python/51109428 |
condefects-python_data_142 | from collections import deque
N,M = map(int,input().split())
edge = []
for _ in range(M):
a,b,w = map(int,input().split())
a-=1
b-=1
edge.append((a,b,w))
def const_color(G):
c = [-1] * N
q = deque()
for st in range(N):
if c[st] == -1:
q.append(st)
c[st] = 0
... | ConDefects/ConDefects/Code/arc165_c/Python/45716699 |
condefects-python_data_143 | import sys
n,m = map(int, sys.stdin.readline().split())
mp = map(int, sys.stdin.read().split())
abc = list(zip(mp,mp, mp))
graph = [[] for i in range(n+1)]
for a,b,c in abc:
graph[a].append((b,c))
graph[b].append((a,c))
ok = float("inf")
# ng = 0
minng = 1000000007
for i in range(1, n+1):
graph[i].sort... | ConDefects/ConDefects/Code/arc165_c/Python/45733476 |
condefects-python_data_144 | import sys
n,m = map(int, sys.stdin.readline().split())
mp = map(int, sys.stdin.read().split())
abc = list(zip(mp,mp, mp))
graph = [[] for i in range(n+1)]
for a,b,c in abc:
graph[a].append((b,c))
graph[b].append((a,c))
ok = float("inf")
minng = 2000000001
for i in range(1, n+1):
graph[i].sort(key=lambd... | ConDefects/ConDefects/Code/arc165_c/Python/45734816 |
condefects-python_data_145 | f=lambda:map(int,input().split());N,M=f()
I=1<<60
D=[[I]*N for x in range(N)]
for m in range(M):u,v,c=f();D[u-1][v-1]=min(D[u-1][v-1],c)
for i in range(N):
for j in range(N):
for k in range(N):
D[j][k]=min(D[j][k],D[j][i]+D[i][k])
dp=[[I]*N for bit in range(1<<N)]
for bit in range(1,1<<N):
l... | ConDefects/ConDefects/Code/abc338_f/Python/52776716 |
condefects-python_data_146 | from collections import deque
n,m=map(int,input().split())
vuw=[list(map(int,input().split())) for i in range(m)]
INF=10**18
wf=[[INF]*n for i in range(n)]
for v,u,w in vuw:
v-=1
u-=1
wf[v][u]=w
for i in range(n):
wf[i][i]=0
for k in range(n):
for i in range(n):
for j in range(n):
wf[i][j]=min(... | ConDefects/ConDefects/Code/abc338_f/Python/53731825 |
condefects-python_data_147 | # -*- coding: utf-8 -*-
INF = float("inf")
n, m = map(int, input().split())
# d[u][v] := 頂点 u, v の最短距離
d = [[INF] * n for _ in range(n)]
graph: list[list[tuple[int, int]]] = [[] for _ in range(n)]
for _ in range(m):
u, v, w = map(int, input().split())
graph[u - 1].append((v - 1, w))
d[u - 1][v - 1] = w
... | ConDefects/ConDefects/Code/abc338_f/Python/52236687 |
condefects-python_data_148 | R=range;f=lambda:map(int,input().split());N,M=f()
I=1<<60
D=[[I]*N for x in R(N)]
for m in R(M):u,v,c=f();D[u-1][v-1]=min(D[u-1][v-1],c)
for a in R(N**3):i,j,k=a//N//N,a//N%N,a%N;D[j][k]=min(D[j][k],D[j][i]+D[i][k])
d=[[I]*N for b in R(1<<N)]
for b in R(1,1<<N):
L=[i for i in R(N)if b&1<<i]
if len(L)==1:
d[b][L[0]]... | ConDefects/ConDefects/Code/abc338_f/Python/52776877 |
condefects-python_data_149 | N, M = map(int, input().split())
G = [[] for _ in range(N)]
for _ in range(M):
U, V, W = map(int, input().split())
G[U-1].append((V-1, W))
def func(n):
for _ in range(M-1):
for i in range(N):
for v, w in G[i]:
dist[n][v] = min(dist[n][v], dist[n][i]+w)
INF = float("inf"... | ConDefects/ConDefects/Code/abc338_f/Python/53230147 |
condefects-python_data_150 | from collections import deque
N,M = map(int, input().split())
inf = 1<<30
dist = [[inf]*N for _ in range(N)]
for _ in range(M):
u,v,w = map(int, input().split())
dist[u-1][v-1] = w
for i in range(N):
dist[i][i] = 0
for k in range(N):
for i in range(N):
for j in range(N):
dist[i][j] ... | ConDefects/ConDefects/Code/abc338_f/Python/52289901 |
condefects-python_data_151 | N,M=map(int,input().split())
INF=10**9
#Warshall-Froid
D=[[INF for _ in range(N)] for _ in range(N)]
for i in range(N):D[i][i]=0
for _ in range(M):
u,v,d=map(int,input().split())
D[u-1][v-1]=d
for j in range(N):
for i in range(N):
for k in range(N):
D[i][k]=min(D[i][k],D[i][j]+D[j][k])
#dp[bit][i]:bitを訪... | ConDefects/ConDefects/Code/abc338_f/Python/54703600 |
condefects-python_data_152 | import sys
# import math
# from bisect import *
# from collections import *
# from functools import *
# from heapq import *
# from itertools import *
# from random import *
# from string import *
# from types import GeneratorType
# region fastio
input = lambda: sys.stdin.readline().rstrip()
sint = lambda: int(input()... | ConDefects/ConDefects/Code/abc262_d/Python/44381954 |
condefects-python_data_153 | p,q=map(str, input().split())
li=[3,4,8,9,14,23]
long=0
short=0
if p=='A':
short=0
elif p=='B':
short=li[0]
elif p=='C':
short=li[1]
elif p=='D':
short=li[2]
elif p=='E':
short=li[3]
elif p=='F':
short=li[4]
elif p=='G':
short=li[5]
if q=='A':
short=0
elif q=='B':
long=li[0]
elif q=... | ConDefects/ConDefects/Code/abc305_b/Python/46169156 |
condefects-python_data_154 | def is_palindrome(s):
return s == s[::-1]
def solve(n, k, s):
k %= 2 * n
s_inv = s[::-1]
if k < n:
t = s_inv[:k]
else:
t = s_inv + s_inv[-(k-n):]
return "Yes" if all(is_palindrome(x) for x in [s+t, t+s]) else "No"
t = int(input())
for _ in range(t):
n, k = map(int, input().... | ConDefects/ConDefects/Code/arc155_a/Python/45899321 |
condefects-python_data_155 | def main():
T = int(input())
for _ in range(T):
N, K = map(int, input().split())
S = list(input())
if K < N:
L1 = S + S[:K][::-1]
L2 = S[:K][::-1] + S
for i in range(N+K):
if L1[i] != L1[-i-1] or L2[i] != L2[-i-1]:
b... | ConDefects/ConDefects/Code/arc155_a/Python/40182881 |
condefects-python_data_156 | #!/usr/bin/env python3
YES = "Yes" # type: str
NO = "No" # type: str
def is_symmetrical(S: str):
N = len(S)
for i in range(N):
if S[i] != S[N-i-1]:
return False
return True
# K < 2Nの場合
def can_solve(S, K):
N = len(S)
S_inv = S[::-1]
if K <= N:
T = S_inv[-K:]
... | ConDefects/ConDefects/Code/arc155_a/Python/44408199 |
condefects-python_data_157 | for _ in range(int(input())):
n,k = map(int,input().split())
S = input()
k %= 2*n
T = "".join(S[~i] if i < n else S[i-k] for i in range(k))
if S+T == (S+T)[::-1] and T+S == (T+S)[::-1]:
print("Yes")
else:
print("No")
for _ in range(int(input())):
n,k = map(int,input().split())
S = input()
k %... | ConDefects/ConDefects/Code/arc155_a/Python/40823834 |
condefects-python_data_158 | N,A,B = map(int,input().split())
P,Q,R,S = map(int,input().split())
k1_min = max(1-A,1-B)
k1_max = min(N-A,N-B)
k2_min = max(1-A,B-N)
k2_max = min(N-A,B-1)
Z = [['.' for _ in range(S-R+1)] for _ in range(Q-P+1)]
if A<B:
for i in range(P,Q+1):
for j in range(R,S+1):
if i == j-(B+k1_min)+1:
Z[i-P][... | ConDefects/ConDefects/Code/abc230_c/Python/54240175 |
condefects-python_data_159 | # import sys
# sys.setrecursionlimit(10**6)
# sys.set_int_max_str_digits(10**6)
# mod = 998244353
# ds = [(-1,0),(0,1),(1,0),(0,-1)]
# alph = 'abcdefghijklmnopqrstuvwxyz'
def rint():
return list(map(int, input().split()))
# S = input()
N, = rint()
A = rint()
def sub(A):
ret = [0]*N
height = 0
for i ... | ConDefects/ConDefects/Code/abc336_d/Python/54268398 |
condefects-python_data_160 | N = int(input())
A = list(map(int, input().split()))
s = [0]
for a in A:
s.append(min(s[-1] + 1, a))
t = [0]
for a in A[::-1]:
t.append(min(t[-1] + 1, a))
ans = 0
for i in range(N // 2 + 1):
ans = max(ans, min(s[i+1], t[N-i]))
print(ans)
N = int(input())
A = list(map(int, input().split()))
s = [0]
for... | ConDefects/ConDefects/Code/abc336_d/Python/54930029 |
condefects-python_data_161 | n,*a = map(int,open(0).read().split())
b = [1]*n
for i in range(n-1):
if a[i]>b[i]:
b[i+1] = b[i] + 1
else: b[i+1] = a[i] + 1
c = [1]*n
for i in range(n-1,0,-1):
if a[i]>c[i]:
c[i-1] = c[i] + 1
else: c[i-1] = a[i] + 1
d = [1]*n
for i in range(n):
if a[i]>=b[i] or a[i]>=c[i]:
d[i] = min(b[i],c[i])
... | ConDefects/ConDefects/Code/abc336_d/Python/54315975 |
condefects-python_data_162 | n = int(input())
a = list(map(int, input().split()))
l = [0]*(n)
r = [0]*(n)
l[0] = 1
r[0] = 1
for i in range(1, n):
l[i] = min(l[i - 1] + 1, a[i])
for i in range(1, n):
r[i] = min(r[i - 1] + 1, a[n - i])
ans = 1
for i in range(n):
if ans < min(l[i], r[n - i - 1]):
ans = min(l[i], r[n - i - 1])
prin... | ConDefects/ConDefects/Code/abc336_d/Python/53237033 |
condefects-python_data_163 | import sys
sys.setrecursionlimit(10**7)
read_int = lambda: int(sys.stdin.readline())
read_ints = lambda: list(map(int, sys.stdin.readline().split(" ")))
read_float = lambda: float(sys.stdin.readline())
read_floats = lambda: list(map(float, sys.stdin.readline().split(" ")))
def get_logger(debug=True):
if not debu... | ConDefects/ConDefects/Code/abc336_d/Python/54659671 |
condefects-python_data_164 | n = int(input())
s = input()
c = list(map(int, input().split()))
zo = [0]
oz = [0]
for i in range(n):
if i % 2:
if s[i] == '1':
oz.append(oz[-1]+c[i])
zo.append(zo[-1])
else:
zo.append(zo[-1]+c[i])
oz.append(oz[-1])
else:
if s[i] == '1':
... | ConDefects/ConDefects/Code/abc346_d/Python/54469627 |
condefects-python_data_165 | N=int(input())
S=list(input())
C=list(map(int,input().split()))
ans=1<<32
oi=[0]*(N+1)
io=[0]*(N+1)
oi_=[0]*(N+1)
io_=[0]*(N+1)
for i in range(N):
oi[i+1]=oi[i]
io[i+1]=io[i]
oi_[N-i-1]=oi_[N-i]
io_[N-i-1]=io_[N-i]
if i%2==0:
if S[i]=='1':
oi[i+1]+=C[i]
else:
... | ConDefects/ConDefects/Code/abc346_d/Python/53744023 |
condefects-python_data_166 | N = int(input())
S = list(str(input()))
C = list(map(int, input().split()))
A = []
B = []
for i in range(N+1):
if i == 0:
A.append(0)
B.append(0)
elif int(S[i-1]) == i % 2:
A.append(A[i-1] + C[i-1])
B.append(B[i-1])
else:
A.append(A[i-1])
B.append(B[i-1] +... | ConDefects/ConDefects/Code/abc346_d/Python/54999312 |
condefects-python_data_167 | N = int(input())
S = input()
C = list(map(int, input().split()))
zeroichi = ['1' if i%2 == 1 else '0' for i in range(10**6) ]
ichizero = ['0' if i%2 == 1 else '1' for i in range(10**6) ]
ZL = [0]*(N+1)
Crev = C[::-1]
#0スタートパターン左
for i in range(N):
tmp = 0
if S[i] != zeroichi[i]:
tmp = C[i]
ZL[i+1] ... | ConDefects/ConDefects/Code/abc346_d/Python/53935383 |
condefects-python_data_168 | import sys
input = sys.stdin.readline
inf = 10 ** 18
def read(dtype=int):
return list(map(dtype, input().split()))
n, = read()
s, = read(str)
s = list(map(int, s))
c = read()
dp = [[inf, inf], [inf, inf]]
dp[s[0] ^ 1][0] = c[0]
dp[s[0]][0] = 0
for i in range(1, n):
ndp = [[inf, inf], [inf, inf]]
for k i... | ConDefects/ConDefects/Code/abc346_d/Python/54740445 |
condefects-python_data_169 | N = int(input())
S = input()
C = list(map(int,input().split()))
OI = [0 for i in range(N)]
IO = [0 for i in range(N)]
if S[0] == "0":
OI[0] = 0
IO[0] = C[0]
else:
IO[0] = 0
OI[0] = C[0]
for i in range(1,N):
if S[i] == "0" and i % 2 == 0:
IO[i] = IO[i-1] + C[i]
OI[i] = OI[i-1]
... | ConDefects/ConDefects/Code/abc346_d/Python/54543042 |
condefects-python_data_170 | n=int(input())
S=str(input())
C=list(map(int,input().split()))
mask=0
for i in range(n):
if int(S[i])==i%2:
mask|=1<<i
cost1=sum(C[i] for i in range(n) if mask>>i&1)
cost2=sum(C)-cost1
def changecost(mk,cost1,cost2):
costlist=[]
for i in range(n-1):
if i==0:
cost1i=cost1
cost2i=cost2
i... | ConDefects/ConDefects/Code/abc346_d/Python/54675380 |
condefects-python_data_171 | N = int(input())
a = list(input())
a_cost = list(map(int,input().split())) + [0]
zo = [0 for _ in range(N)]
oz = [0 for _ in range(N)]
for an in range(N):
if a[an] == str(0 + an % 2):
zo[an] = zo[an -1]
oz[an] = oz[an -1] + a_cost[an]
elif a[an] == str((1 + an) % 2):
zo[an] = zo[an -1] +... | ConDefects/ConDefects/Code/abc346_d/Python/55040229 |
condefects-python_data_172 | n = int(input())
P = list(map(int,input().split()))
l = n - 2
r = n - 1
while P[l] < P[r] :
l -= 1
r -= 1
r = n - 1
while P[l] < P[r] :
r -= 1
P[l] , P[r] = P[r] , P[l]
L = P[: l + 1]
R = P[r - 1 :]
R = sorted(R , reverse = True)
print(*(L + R))
n = int(input())
P = list(map(int,input().split()))
l =... | ConDefects/ConDefects/Code/abc276_c/Python/52142770 |
condefects-python_data_173 | N = int(input())
P = list(map(int, input().split()))
# どの桁から右を変更するか決め、変更する先頭を、最適なものに入れ替える
for i in range(1, N):
if P[-(i+1)] < min(P[-i:]):
continue
else:
mx = 0
for j, c in enumerate(P[-i:]):
if c < P[-(i+1)] and mx <c:
mx = c # P[-(i+1)]より小さい数の中で最大を探す
jj = j
P[-(i+1)], P[-(... | ConDefects/ConDefects/Code/abc276_c/Python/53488308 |
condefects-python_data_174 | N = int(input())
P = list(map(int,input().split()))
for i in range(N):
if P[-i] > P[-i - 1]:
continue
else:
num = P[-i - 1]
a = i
break
A = P[N - a - 1:] # 変化させる部分
A.sort()
B = []
B.append(A[A.index(num) - 1]) # 変化する数字の一番左
A.pop(A.index(num) - 1)
A.sort(reverse=True) # Bの後ろは逆順
print(*... | ConDefects/ConDefects/Code/abc276_c/Python/54054587 |
condefects-python_data_175 | T = int(input())
def compare(t1, t2):
length = min(len(t1), len(t2))
for i in range(length):
if t1[i] > t2[i]:
return False
if t1[i] < t2[i]:
return True
if len(t1) > len(t2):
return False
else:
return True
for i in range(T):
N = int(input())
... | ConDefects/ConDefects/Code/arc163_a/Python/45954819 |
condefects-python_data_176 | from collections import Counter
t=int(input())
for _ in range(t):
n=int(input())
s=list(input())
c=Counter(s)
s0=s[0]
if n==2:
s1=s[1]
if s0==s1 or s0>s1:
print('No')
continue
else:
print('Yes')
continue
for i in range(1,n):
ss=s[i]
if s0<ss or (s0==ss and s0... | ConDefects/ConDefects/Code/arc163_a/Python/44208378 |
condefects-python_data_177 | def solve():
n=int(input())
s=input()
for k in range(1,n):
flag = True
for i in range(min(k,n-k)):
if s[i]<s[k+i]:
print("Yes")
return
elif s[i]==s[k+i]:
continue
else:
flag = False
... | ConDefects/ConDefects/Code/arc163_a/Python/45935608 |
condefects-python_data_178 | import sys
from numba import njit, i4
input = sys.stdin.readline
def read():
return list(map(int, input().strip().split()))
t = int(input())
def solve():
n = int(input())
s = input().strip()
if max(s[1:]) > s[0]:
return 1
if max(s[1:]) < s[0]:
return 0
n = len(s)
z = ... | ConDefects/ConDefects/Code/arc163_a/Python/46203182 |
condefects-python_data_179 | def solve():
N = int(input())
S = input()
for i in range(1, N):
if S[0] < S[i]:
print('Yes')
return
print('No')
return
T = int(input())
for i in range(T):
solve()
def solve():
N = int(input())
S = input()
for i in range(1, N):
if S[0:i] < S[i... | ConDefects/ConDefects/Code/arc163_a/Python/44094167 |
condefects-python_data_180 | from collections import deque
t=int(input())
for i in range(t):
n=int(input())
s=list(map(str,input()))
s1,s2=s,deque()
tt=False
ss=True
for i in range(n-1):
s2.appendleft(s1[-1])
s1.pop()
for j in range(min(len(s1),len(s2))):
if ord(s1[j])<ord(s2[j]):
print("Yes")
tt=True
... | ConDefects/ConDefects/Code/arc163_a/Python/44822043 |
condefects-python_data_181 | T = int(input())
for _ in range(T):
N = int(input())
S = input()
base = S[0]
isOk = False
for i in range(1,N):
if S[:i] <= S[i:]:
isOk = True
print("Yes")
break
if not isOk:
print("No")
T = int(input())
for _ in range(T):
N = int(input())
S = input()
base = S[0]
isOk = Fal... | ConDefects/ConDefects/Code/arc163_a/Python/45436271 |
condefects-python_data_182 | T = int(input())
for i in range(T):
N = int(input())
S = input()
a = False
for j in range(1, N):
if S[0:j] < S[j]:
print("Yes")
a = True
break
elif S[0] == S[j]:
b = False
nex = 1
while not b:
nex += ... | ConDefects/ConDefects/Code/arc163_a/Python/45308371 |
condefects-python_data_183 | t=int(input())
for i in range(t):
input()
s=input()
cnt=0
for j in range(1,len(s)-1):
if s[j:]>s[:j]:
cnt=1
if cnt:print("Yes")
else:print("No")
t=int(input())
for i in range(t):
input()
s=input()
cnt=0
for j in range(1,len(s)):
if s[j:]>s[:j]:
cnt=1
if cnt:print("Yes")
else... | ConDefects/ConDefects/Code/arc163_a/Python/44451011 |
condefects-python_data_184 | Q=int(input())
for _ in range(Q):
A=list(map(int,input().split()))
v=list(map(int,input().split()))
if v[4]<A[4]:
print('No')
continue
v[4]-=A[4]
A[4]=0
if v[3]+v[4]<A[3]:
print('No')
continue
if v[3]>=A[3]:
v[3]-=A[3]
A[3]=0
else:
A[3]-=v[3]
v[3]=0
v[0]+=A[3]
v[4]-=A... | ConDefects/ConDefects/Code/abc226_g/Python/48936036 |
condefects-python_data_185 | Q=int(input())
for _ in range(Q):
A=list(map(int,input().split()))
B=list(map(int,input().split()))
if B[4]<A[4]:
print('No')
continue
B[4]-=A[4]
A[4]=0
if A[3]>B[3]+B[4]:
print('No')
continue
if B[3]>A[3]:
B[3]-=A[3]
A[3]=0
else:
A[3]-=B[3]
B[3]=0
B[4]-=A[3]
B[0]+=A[... | ConDefects/ConDefects/Code/abc226_g/Python/52807136 |
condefects-python_data_186 | import sys
readline=sys.stdin.readline
T=int(readline())
for t in range(T):
A=list(map(int,readline().split()))
B=list(map(int,readline().split()))
ans="Yes"
if A[4]>B[4]:
ans="No"
B[4]-=A[4]
mi=min(A[3],B[3])
A[3]-=mi
B[3]-=mi
if A[3]>B[4]:
ans="No"
B[4]-=A[3]
... | ConDefects/ConDefects/Code/abc226_g/Python/48239634 |
condefects-python_data_187 |
from collections import Counter
mod = 998244353
n,k = map(int,input().split())
a = list(map(int,input().split()))
a_c = Counter(a)
v = [0] * (n+1)
for i, c in a_c.items():
v[c] += 1
for i in range(n-1,0,-1):
v[i] += v[i+1]
dp = [[0] * (n+1) for i in range(n+1)]
dp[0][1] = 1
i = 1
for g in range(1, n+1):
l = v[g]
... | ConDefects/ConDefects/Code/abc267_g/Python/35931814 |
condefects-python_data_188 | 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().... | ConDefects/ConDefects/Code/abc347_d/Python/55147936 |
condefects-python_data_189 | a,b,C=map(int,input().split())
rev=False
if a<b:
a,b=b,a
rev=True
s=bin(C)
S=s[2:]
N=len(S)
A=0
B=0
bit=[]
for i in range(N):
j=N-1-i
if S[j]=='1':
bit.append(i)
if a-b>len(bit) or (a-b)%2!=len(bit)%2:
exit(print(-1))
cnt=len(bit)
d=a-b
base=b-(cnt-d)//2
next=False
for i in range(60):
if not i in bit:
if ba... | ConDefects/ConDefects/Code/abc347_d/Python/54756307 |
condefects-python_data_190 | a,b,c = map(int, input().split())
cbit = []
popcount = 0
for i in range(60):
if c & 1<<i != 0:
cbit.append(1)
popcount += 1
else:
cbit.append(0)
# print(cbit,popcount)
if a+b >= popcount and (a+b)%2 == popcount%2:
d = (a+b-popcount)//2
if a-d < 0 or b-d < 0:
print(-1)
... | ConDefects/ConDefects/Code/abc347_d/Python/54755669 |
condefects-python_data_191 | a, b, C = map(int, input().split())
def popcount(X, digit):
ret = 0
for i in range(digit):
if (1 << i & X):
ret += 1
return(ret)
c = popcount(C, 60)
if a + b + c > 120 or (a + b + c) % 2 == 1:
print(-1)
exit()
if a > b + c or b > a + c or c > a + b:
print(-1)
exit()
n00 = 60 - (a + b + c) // 2
n01 = (-... | ConDefects/ConDefects/Code/abc347_d/Python/55134495 |
condefects-python_data_192 | n = int(input())
s = input()
t = input()
a = []
for i in range(n):
if s[i] != t[i]:
if t[i] == "A":
a.append(0)
else:
a.append(1)
ans = 0
left = 0
right = 0
need = 0
for i in a:
if i == 0:
left += 1
else:
right += 1
if left < right:
... | ConDefects/ConDefects/Code/arc170_a/Python/54960940 |
condefects-python_data_193 | N, M = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(N)]
Asum = [[0]*M for _ in range(N)]
for i in range(N):
Asum[i][0] = A[i][0]
for j in range(1, M):
Asum[i][j] = Asum[i][j-1] + A[i][j]
if i > 0:
for j in range(M):
Asum[i][j] += Asum[i-1][j]
ans ... | ConDefects/ConDefects/Code/abc311_g/Python/43899768 |
condefects-python_data_194 | import sys
# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline()... | ConDefects/ConDefects/Code/abc343_g/Python/51192628 |
condefects-python_data_195 | import bisect, collections, copy, heapq, itertools, math, string
import random
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip... | ConDefects/ConDefects/Code/abc343_g/Python/50999715 |
condefects-python_data_196 | def fatores_primos(n):
dois = 0
tres = 0
while n % 2 == 0:
dois += 1
n //= 2
while n % 3 == 0:
tres += 1
n //= 3
return dois, tres, n
t = int(input())
entrada = list(map(int, input().split()))
lista = []
for e in entrada:
lista.append(fatores_primos(e))
... | ConDefects/ConDefects/Code/abc276_d/Python/45111251 |
condefects-python_data_197 | # import系 ---
from math import gcd
# 入力用 ---
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()))
LS = lambda: input().split()
# リストの最大公約数 ---
def gcd_all(li):
g = li[0]
for c in li[1:]:
... | ConDefects/ConDefects/Code/abc276_d/Python/45303110 |
condefects-python_data_198 | n=int(input())
count=[[0]*10 for _ in range(10)]
time=[[] for _ in range(10)]
for i in range(n):
s=input()
for x in range(10):
s_x=int(s[x])
count[s_x][x]+=1
time[s_x].append(i+(count[s_x][x]-1)*10)
ans=10**100
for i in range(10):
ans=min(ans,max(time[i]))
print(ans)
n=int(input())
... | ConDefects/ConDefects/Code/abc252_c/Python/45002861 |
condefects-python_data_199 | n = int(input())
s = [list(input()) for _ in range(n)]
ans = 100
for i in range(10):
num = str(i)
slot = [False for _ in range(n)]
for j in range(10*(n+5)):
for k in range(n):
if slot[k] == False and s[k][(j)%10] == num:
slot[k] = True
break
if all(slot):
ans = min(ans,j)
... | ConDefects/ConDefects/Code/abc252_c/Python/46168111 |
condefects-python_data_200 | N,M=map(int,input().split())
G=[[] for i in range(N)]
into=[0]*N
b=[0]*N
E=[[] for i in range(N)]
for i in range(M):
s,t=map(int,input().split())
s-=1
t-=1
into[t]+=1
G[s].append(t)
E[t].append(s)
b[t]+=1
from collections import deque
S=deque()
keep=[0]*N
K=[[] for i in range(N+1)]
result=[0]*N
dp=[0]*N
f... | ConDefects/ConDefects/Code/abc304_h/Python/48697427 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.