input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N = int(input())
s_lst = [input() for i in range(N)]
M = int(input())
t_lst = [input() for i in range(M)]
dict = {}
for i in s_lst:
dict[i] = 0
for i in t_lst:
dict[i] = 0
for i in s_lst:
dict[i] += 1
for i in t_lst:
dict[i] -= 1
infinity = float('inf')
max = -infinity
for i in dict.val... | N = int(input())
s_lst = [input() for i in range(N)]
M = int(input())
t_lst = [input() for i in range(M)]
dict = {}
for i in s_lst:
if not i in dict.keys():
dict[i] = 1
else:
dict[i] += 1
for i in t_lst:
if not i in dict.keys():
dict[i] = -1
else:
dict[i] ... | p03408 |
n = int(eval(input()))
s = [(input().split()) for _ in range(n)]
m = int(eval(input()))
t = [(input().split()) for _ in range(m)]
ans = 0
for i in range(n):
ans = max(ans, s.count(s[i]) - t.count(s[i]))
print(ans) | n = int(eval(input()))
s = [(input().split()) for _ in range(n)]
m = int(eval(input()))
t = [(input().split()) for _ in range(m)]
ans = 0
for i in s:
ans = max(ans, s.count(i) - t.count(i))
print(ans) | p03408 |
import sys
import math
#https://atcoder.jp/contests/agc008/submissions/15248942
sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033... | K = int(eval(input()))
print(("ACL" * K)) | p02534 |
N=int(eval(input()))
S=""
for i in range(N):
S+="ACL"
print(S) | print(("ACL"*int(eval(input())))) | p02534 |
n = int(eval(input()))
ans = n*('ACL')
print (ans) | print((int(eval(input()))*'ACL')) | p02534 |
a=""
for i in range(int(eval(input()))):
a+="ACL"
print(a) | print(("ACL"*int(eval(input())))) | p02534 |
a,b,c = list(map(int,input().split()))
if b-a==c-b:
print("YES")
else:
print("NO") | a,b,c = list(map(int,input().split()))
print(("YES" if b-a == c-b else "NO")) | p03759 |
a, b, c = list(map(int, input().split()))
print(("YES" if b - a == c - b else "NO"))
| a, b, c = list(map(int, input().split()))
print((("NO", "YES")[b - a == c - b])) | p03759 |
a,b,c=input().split()
a=int(a)
b=int(b)
c=int(c)
if b-a==c-b:
print("YES")
else:
print("NO") | a,b,c = list(map(int,input().split()))
k1 = b-a
k2 = c-b
if k1==k2:
print("YES")
else:
print("NO") | p03759 |
a=list(map(int,input().split()))
if a[1]-a[0]==a[2]-a[1]:
print('YES')
else:
print('NO') | a=sorted(list(map(int,input().split())))
if a[1]-a[0]==a[2]-a[1]:
print('YES')
else:
print('NO') | p03759 |
x=input().split()
if int(x[0]) + int(x[2]) == int(x[1]) * 2:
print("YES")
else:
print("NO")
| a = input().split()
if int(a[1]) - int(a[0]) == int(a[2]) - int(a[1]):
print('YES')
else:
print('NO') | p03759 |
a,b,c=list(map(int,input().split()));print(('YNEOS'[b-a!=c-b::2])) | a,b,c=list(map(int,input().split()))
print(('YNEOS'[a+c!=b+b::2])) | p03759 |
a,b,c = list(map(int,input().split()))
if (a+c)/2 == b:
print("YES")
else:
print("NO")
| a, b, c = list(map(int, input().split()))
if (b - a) == (c - b):
print("YES")
else:
print("NO") | p03759 |
a, b, c = list(map(int, input().split()))
if (b - a) == (c - b):
print("YES")
else:
print("NO") | a, b, c = list(map(int, input().split()))
if b - a == c - b:
print("YES")
else:
print("NO") | p03759 |
a,b,c=list(map(int,input().split()))
print(('YES' if a+c==b*2 else 'NO')) | a,b,c = list(map(int,input().split()))
if b - a == c -b:
print('YES')
else:
print('NO') | p03759 |
a=[int(i) for i in input().split()]
if (a[2]+a[0])/2==a[1]:
print('YES')
else:
print('NO') | a,b,c=list(map(int,input().split()))
if (a+c)/2==b:
print('YES')
else:
print('NO') | p03759 |
from collections import deque
def bfs(start):
queue = deque([start])
visited = []
while queue:
label = queue.pop()
#if label not in visited:
visited.append(label)
for v in d[label]:
if v not in visited:
tekazu[v] = tekazu[label] +... | from collections import deque
def bfs(start):
queue = deque([start])
visited = []
while queue:
label = queue.pop()
#if label not in visited:
visited.append(label)
for v in d[label]:
if tekazu[v] == float("inf"):
tekazu[v] = tekazu... | p03662 |
from collections import deque
import sys
input = sys.stdin.readline
n=int(eval(input()))
g=[[] for i in range(n)]
for i in range(n-1):
a,b=list(map(int,input().split()))
a-=1
b-=1
g[a].append(b)
g[b].append(a)
q=deque([[0,[0]]])
v=[0]*n
v[0]=1
f=0
while q:
p=q.popleft()
#if ... | import math
import sys
sys.setrecursionlimit(1000000)
N = int(eval(input()))
graph = {}
SCORE = 0
def dfs(visited,v,depth):
visited[v] = depth
for next_v in graph[v]:
if visited[next_v] == -1 :
dfs(visited,next_v,depth + 1)
for _ in range(N-1):
a,b = list(map(int,in... | p03662 |
import sys
sys.setrecursionlimit(10**8)
def find_path(now, par):
if now == n - 1:
path.append(n - 1)
return True
for to in g[now]:
if to == par: continue
if find_path(to, now):
path.append(now)
return True
return False
def dfs1(now, par... | import sys
sys.setrecursionlimit(10**8)
def find_path(now, par):
if now == n - 1:
path.append(n - 1)
return True
for to in g[now]:
if to == par: continue
if find_path(to, now):
path.append(now)
return True
return False
def dfs(now, par,... | p03662 |
def read_data():
N = int(eval(input()))
Es = [[] for i in range(N)]
for i in range(N - 1):
a, b = list(map(int, input().split()))
Es[a - 1].append(b - 1)
Es[b - 1].append(a - 1)
return N, Es
def solve(N, Es):
if N == 2:
return "Snuke"
path = find_pa... | def read_data():
N = int(eval(input()))
Es = [[] for i in range(N)]
for i in range(N - 1):
a, b = list(map(int, input().split()))
Es[a - 1].append(b - 1)
Es[b - 1].append(a - 1)
return N, Es
def solve(N, Es):
if N == 2:
return "Snuke"
visited = [0] * ... | p03662 |
import queue
class Edge:
def __init__(self, to, cost):
self.to = to
self.cost = cost
class P:
def __init__(self, distance, v):
self.distance = distance
self.v = v
def dijkstra(_s):
que = queue.Queue()
global d
d = [float("inf") for i in range(N... | import queue
class Edge:
def __init__(self, to, cost):
self.to = to
self.cost = cost
class P:
def __init__(self, distance, v):
self.distance = distance
self.v = v
# def dijkstra(_s):
# que = queue.Queue()
# global d
# d = [float("inf") for i in... | p03662 |
import sys
p = []
path = [ 0 for i in range(10**5+1)]
def main():
sys.setrecursionlimit(1000000)
N = int(eval(input()))
e = [ [] for i in range(N)]
for i in range(N-1):
a,b = list(map(int,input().split()))
a-=1
b-=1
e[a].append(b)
e[b].append... |
import sys
sys.setrecursionlimit(1000000)
N = int(eval(input()))
e = [ [] for i in range(N)]
for i in range(N-1):
a,b = list(map(int,input().split()))
a-=1
b-=1
e[a].append(b)
e[b].append(a)
col = [ -1 for i in range(N)]
col[0] = 0
p = []
path = [ 0 for i in range(10**5+1)]
d... | p03662 |
n = int(input())
d = {}
for _ in range(n-1):
v,u = list(map(int, input().split()))
if v in d:
d[v].append(u)
else:
d[v] = [u]
if u in d:
d[u].append(v)
else:
d[u] = [v]
visited = [False] * (n+1)
# 0 == fennec, 1 == sunuke
q = [(1,1,0), (n,n,1)]
count_f = 0
count_s = 0
... | n = int(input())
d = {}
for _ in range(n-1):
v,u = list(map(int, input().split()))
if v in d:
d[v].append(u)
else:
d[v] = [u]
if u in d:
d[u].append(v)
else:
d[u] = [v]
# -1: not yet, 0: fennec, 1: sunuke
visited = [-1] * (n+1)
visited[1] = 0
visited[n] = 1
# 0 == fennec,... | p03662 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
3 5
0 1 1
0 2 2
0 3 3
1 1 2
1 2 2
output:
3
2
"""
import sys
class BinaryIndexedTree(object):
__slots__ = ('length', 'dat')
def __init__(self, n):
"""
Init a BIT with update and find for range sum queries.
... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
3 5
0 1 1
0 2 2
0 3 3
1 1 2
1 2 2
output:
3
2
"""
import sys
class BinaryIndexedTree(object):
__slots__ = ('length', 'dat')
def __init__(self, n):
"""
Init a BIT with update and find for range sum queries.
... | p02346 |
import math
import functools
class SegmentTree:
def __init__(self, a: list, default: int, op):
real_size = len(a)
self.elem_size = 1 << int(math.ceil(math.log2(real_size))) # honto ha int() iranai
self.tree_size = 2 * self.elem_size + 1
self.tree = [default] * (self.elem_... | import math
class SegmentTree:
__slots__ = ["elem_size", "tree_size", "tree"]
def __init__(self, a: list, default: int):
real_size = len(a)
self.elem_size = 1 << math.ceil(math.log2(real_size))
self.tree_size = 2 * self.elem_size + 1
self.tree = [default] * (self.ele... | p02346 |
import math
class SegmentTree:
__slots__ = ["elem_size", "tree_size", "tree"]
def __init__(self, a: list, default: int):
real_size = len(a)
self.elem_size = 1 << math.ceil(math.log2(real_size))
self.tree_size = 2 * self.elem_size + 1
self.tree = [default] * (self.ele... | import math
class SegmentTree:
__slots__ = ["elem_size", "tree_size", "tree"]
def __init__(self, a: list, default: int):
real_size = len(a)
self.elem_size = 1 << math.ceil(math.log2(real_size))
self.tree_size = 2 * self.elem_size + 1
self.tree = [default] * (self.ele... | p02346 |
import math
class SegmentTree:
__slots__ = ["elem_size", "tree_size", "tree"]
def __init__(self, a: list, default: int):
real_size = len(a)
self.elem_size = 1 << math.ceil(math.log2(real_size))
self.tree_size = 2 * self.elem_size + 1
self.tree = [default] * (self.ele... | import sys
class BinaryIndexedTree(object):
__slots__ = ["tree"]
def __init__(self, size: int):
self.tree = [0]*(size+1)
def add(self, index: int, value: int) -> None:
tree = self.tree
next_index = index + 1
while next_index < len(tree):
tree[ne... | p02346 |
class TemplateTree:
def __init__(self, iterable):
self.iter_size = self.get_size(iterable)
self.size = self.iter_size * 2 - 1
self.value = [None] * self.size
for i, v in enumerate(iterable):
self.value[self.iter_size + i - 1] = v
self.set_value(0)
self.range = [None] * self.size
... | class TemplateTree:
def __init__(self, iterable):
self.iter_size = self.get_size(iterable)
self.size = self.iter_size * 2 - 1
self.value = [None] * self.size
for i, v in enumerate(iterable):
self.value[self.iter_size + i - 1] = v
self.set_value(0)
self.range = [None] * self.size
... | p02346 |
import math
class FenwickTree:
"""
FenwickTree(Binary Indexed Tree)
total number: n
queries:
1. add(i, val): add val to i-th value
2. sum(n): sum(bit[0] + ... + bit[n-1])
complexity: O(log n)
Self-balancing binary search tree or Segment Tree can do the same, it takes longer t... | class FenwickTree:
"""FenwickTree (Binary Indexed Tree, 0-index)
Queries:
1. add(i, val): add val to i-th value
2. sum(n): sum(bit[0] + ... + bit[n-1])
complexity: O(log n)
See: http://hos.ac/slides/20140319_bit.pdf
"""
def __init__(self, a_list):
self.N ... | p02346 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**15
mod = 10**9+7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**15
mod = 10**9+7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
... | p02346 |
class RSQ:
def __init__(self, length, ini_num = float("inf")):
self.length = 1
self.ini_num = ini_num
if length == 1:
length = 2
while self.length < length:
self.length <<= 1
self.segtree = [ini_num] * (2 * self.length - 1)
def update(se... | class RSQ:
def __init__(self, length, ini_num = float("inf")):
self.length = 1
self.ini_num = ini_num
if length == 1:
length = 2
while self.length < length:
self.length <<= 1
self.segtree = [ini_num] * (2 * self.length - 1)
def update(se... | p02346 |
# -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_B&lang=jp
"""
import sys
from sys import stdin
input = stdin.readline
class RSQ(object):
INT_MAX = 2**31 - 1
def __init__(self, nn, init_val=0):
self.val = [init_val] * (nn+1)
self.n = 1... | # -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_B&lang=jp
"""
import sys
from sys import stdin
input = stdin.readline
class BIT(object):
def __init__(self, n):
self.n = n
self.bit = [0] * (n + 1)
def sum(self, i):
s = 0
... | p02346 |
import sys
inf = (1 << 31) - 1
def solve():
n, q = list(map(int, sys.stdin.readline().split()))
sg = SegTree([0]*n)
for qi in range(q):
# print(sg.data)
c, x, y = list(map(int, sys.stdin.readline().split()))
if c == 0:
x -= 1
sg.add(x, y)
... | import sys
inf = (1 << 31) - 1
def solve():
n, q = list(map(int, sys.stdin.readline().split()))
bit = BinaryIndexedTree([0]*n)
for qi in range(q):
c, x, y = list(map(int, sys.stdin.readline().split()))
if c == 0:
x -= 1
bit.add(x, y)
else:
... | p02346 |
#!/usr/bin/env python3
import sys
#count '<'
def count_S(S, N):
ret=S.find('>')
#print("<",S,N,ret)
if ret==-1:
ret=N
return ret
#count '>'
def count_L(S, N):
ret=S.find('<')
if ret==-1:
ret=N
#print(">",S,N,ret)
return ret
def count_L_slow(S, N):
... | #!/usr/bin/env python3
import sys
#count '<'
def count_S(S, N):
ret=S.find('>')
#print("<",S,N,ret)
if ret==-1:
ret=N
return ret
#count '>'
def count_L(S, N):
ret=S.find('<')
if ret==-1:
ret=N
#print(">",S,N,ret)
return ret
def count_S_slow(S, ns, N)... | p02873 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
S = readline().rstrip().decode('utf-8')
N = len(S)+1
from_left = [0]*N
from_right = [0]*N
for i,s in enumerate(S,1):
if s == '>':
from_left[i] = 0
else:
from_le... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
S = read().rstrip().decode('utf-8')
S = S.replace('><','>,<').split(',')
answer = 0
for T in S:
# <<<< >>>> の形
a = T.count('<')
b = T.count('>')
x = a * (a-1) // 2 + b * (... | p02873 |
#AGC040A
import sys
s = sys.stdin.readline().rstrip()
n = len(s)
L = [0 for i in range(n+1)]
f = False
while (f==False):
f = True
for i in range(n):
if s[i] =='<' and not L[i+1] >L[i]:
L[i+1] = L[i]+1
f = False
elif s[i] == '>' and not L[i] > L[i+1]:
... | #AGC040
import sys
s = sys.stdin.readline().rstrip()
n = len(s)
L = [0 for _ in range(n+1)]
for i in range(n):
if s[i] == '<':
L[i+1] = L[i] +1
#print(L)
for i in range(n-1,-1,-1):
if s[i] == '>':
L[i] = max(L[i], L[i+1]+1)
#print(L)
print((sum(L))) | p02873 |
import itertools,sys
def S(): return sys.stdin.readline().rstrip()
S = S()
groupby_S = itertools.groupby(S)
ans = 0
rangeN = [i for i in range(len(S)+1)]
rangeN_accumulate = list(itertools.accumulate(rangeN))
group = []
temp = []
for k,g in groupby_S:
if k=='<':
temp.append(len(list(g)))
els... | import sys
def S(): return sys.stdin.readline().rstrip()
S = S()
seq = [0]*(len(S)+1)
for i in range(len(S)):
if S[i]=='<':
seq[i+1] = seq[i]+1
for j in range(len(S))[::-1]:
if S[j]=='>':
seq[j] = max(seq[j],seq[j+1]+1)
print((sum(seq)))
| p02873 |
import sys
def S(): return sys.stdin.readline().rstrip()
S = S()
seq = [0]*(len(S)+1)
for i in range(len(S)):
if S[i]=='<':
seq[i+1] = seq[i]+1
for j in range(len(S))[::-1]:
if S[j]=='>':
seq[j] = max(seq[j],seq[j+1]+1)
print((sum(seq)))
| import sys
def S(): return sys.stdin.readline().rstrip()
S = S()
seq = [0]*(len(S)+1)
for i in range(len(S)):
if S[i]=='<':
seq[i+1] = seq[i]+1
for j in range(len(S)-1,-1,-1):
if S[j]=='>':
seq[j] = max(seq[j],seq[j+1]+1)
print((sum(seq)))
| p02873 |
import sys
from collections import deque
readline = sys.stdin.readline
readlines = sys.stdin.readlines
ns = lambda: readline().rstrip() # input string
ni = lambda: int(readline().rstrip()) # input int
nm = lambda: list(map(int, readline().split())) # input multiple int
nl = lambda: list(map(int, readline().sp... | import sys
from collections import deque
readline = sys.stdin.readline
readlines = sys.stdin.readlines
ns = lambda: readline().rstrip() # input string
ni = lambda: int(readline().rstrip()) # input int
nm = lambda: list(map(int, readline().split())) # input multiple int
nl = lambda: list(map(int, readline().sp... | p02873 |
S = input().strip()
N = len(S)+1
A = [0 for _ in range(N)]
B = []
for i in range(N):
if i==0 and S[i]=="<":
B.append(0)
elif i<N-2 and S[i]==">" and S[i+1]=="<":
B.append(i+1)
elif i==N-2 and S[i]==">":
B.append(i+1)
for j in range(len(B)-1):
ind0 = B[j]
ind1 = B... | S = input().strip()
N = len(S)+1
A = [0 for _ in range(N)]
flag = -1
B = []
for i in range(N-1):
if flag==-1 and S[i]=="<":
B.append(i)
flag = 1
elif flag==1 and S[i]==">":
flag = -1
if flag==-1:
B.append(N-1)
for b in B:
for i in range(b,N-1):
if S[i]=="<"... | p02873 |
import sys
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
s = str(input().rstrip('\n'))
s = list(map(str, s.replace("><", ">_<").split("_")))
cnt = 0
for v in s:
a = 0
b = 0
for i in range(len(v)):
if v[i] == "<":
a +... | import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
s = str(readline().rstrip().decode('utf-8'))
s = s.replace("><", ">_<").split("_")
cnt = 0
for sv in s:
r = l = 0
for i in range(len(sv)):
if sv[i] == ">":
r ... | p02873 |
import sys
input = sys.stdin.readline
S=tuple(input().strip())
N=len(S)+1
x = [0]
for i in range(1,N):
if S[i-1] == '<':
x.append(x[i-1] + 1)
else:
x.append(0)
for j in range(i):
if x[i-1-j] == x[i-j]:
x[i-1-j] += 1
else:
... | import sys
input = sys.stdin.readline
S=tuple(input().strip())
N=len(S)+1
sets = []
count = 0
for c in S:
d = 1 if c == '<' else -1
if count * d < 0:
sets.append(count)
count = d
else:
count += d
sets.append(count)
sum = 0
for i in range(len(sets)):
k=sets[i... | p02873 |
m = int(eval(input()))
while m:
m -= 1
ax, ay, bx, by = list(map(int, input().split()))
n = int(eval(input()))
dx, dy = bx - ax, by - ay
intersections = set()
while n:
n -= 1
sx, sy, tx, ty, o, l = list(map(int, input().split()))
tdx, tdy = tx - sx, ty - sy
... | m = int(eval(input()))
while m:
m -= 1
ax, ay, bx, by = list(map(int, input().split()))
n = int(eval(input()))
dx, dy = bx - ax, by - ay
intersections = set()
while n:
n -= 1
sx, sy, tx, ty, o, l = list(map(int, input().split()))
tdx, tdy = tx - sx, ty - sy
... | p01128 |
import sys
input = sys.stdin.readline
class BaseXor:
def __init__(self):
self.size = 0
self.base = []
def base_calculate(self, x, b):
return min(x, x ^ b)
def make_base(self, x):
for b in self.base:
x = self.base_calculate(x, b)
return... | import sys
input = sys.stdin.readline
class BaseXor:
def __init__(self):
self.size = 0
self.base = []
def base_calculate(self, x, b):
return min(x, x ^ b)
def make_base(self, x):
for b in self.base:
x = self.base_calculate(x, b)
return... | p02651 |
#!python3
import sys
iim = lambda: map(int, sys.stdin.readline().rstrip().split())
def f(a, s, n):
if s[-1] == "1":
return 1
st = {0,}
for i in range(n-1, -1, -1):
ai, si = a[i], s[i]
if si == "0":
tmp = [ai ^x for x in st]
st.update(tmp)
... | #!python3
import sys
iim = lambda: map(int, sys.stdin.readline().rstrip().split())
X = (10**18).bit_length()
def f(a, s, n):
if s[-1] == "1":
return 1
B = [None] * X
for i in range(n-1, -1, -1):
ai, si = a[i], s[i]
if si == "0":
while True:
... | p02651 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, ... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, ... | p02651 |
# coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
# 逆から、人1が多かったらその時点で駄目、人0が人1の数を覆い尽くす必要がある
T = ir()
def solve():
N = ir()
A = lr()
S = sr()
dp = [None] * (N+1)
dp[N] = {0}
for i in range(N-1, ... | # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
# 逆から, zero_cardsに数を貯めて行き、bitで0に出来るか
T = ir()
for _ in range(T):
N = ir()
A = lr()
S = sr()
zero_cards = []
for a, person in zip(A[::-1], S[::-1]):
... | p02651 |
import sys
from copy import deepcopy
def canMake(k, Nums):#Numsにある数でkを作れるか
L = len(Nums)
index = 0
bit = []
for i in reversed(range(60)):
flag = 0
for j in range(index, L):
if Nums[j] & (1 << i) == (1 << i):
flag = 1
Nums[index], N... | import sys
from copy import deepcopy
def canMake(k, Nums):#Numsにある数でkを作れるか
L = len(Nums)
index = 0
bit = dict()
for i in reversed(range(60)): #掃き出し法
flag = 0
tp = (1 << i)
for j in range(index, L):
if Nums[j] & tp == tp:
flag = 1
... | p02651 |
from collections import defaultdict
from functools import lru_cache
itl = lambda: list(map(int, input().strip().split()))
def solve():
N = int(eval(input()))
nums = itl()
S = input().strip()
@lru_cache(None)
def dp(i, target):
if i == N:
return (target == 0)
... | from collections import defaultdict
itl = lambda: list(map(int, input().strip().split()))
def solve():
N = int(eval(input()))
nums = itl()
S = input().strip()
basis = []
for i in range(N - 1, -1, -1):
v = nums[i]
for b in basis:
v = min(v, v ^ b)
... | p02651 |
I=input
n=int
for i in range(n(eval(input()))):
I();t=[];x=0
for i,j in zip(list(map(n,I().split()[::-1])),I()[::-1]):
for k in t:i^=k*(i^k<i)
j=n(j);t+=[i*(j^1)];x|=(i>0)&j
print(x) | I=input
n=int
for i in range(n(eval(input()))):
I();t=[];x=0
for i,j in zip(list(map(n,I().split()[::-1])),I()[::-1]):
[i:=(i^k*(i^k<i))for k in t];j=n(j);t+=[i*(j^1)];x|=(i>0)&j
print(x) | p02651 |
x,y=input().split()
while (x!='0'or y!='0'):
if(int(x)>int(y)):print(("{} {}".format(y,x)))
else:print(("{} {}".format(x,y)))
x,y=input().split() | while 1:
x,y=map(int,input().split())
if x==0 and y==0:break
print(*[y,x] if x>y else [x,y])
| p02397 |
while 1:
n=input()
if n=='0 0':break
x,y=map(int,n.split())
print(y,x) if x>y else print(n)
| a=[]
while 1:
n=input()
if n=='0 0':break
a.append(n)
for s in a:
x,y=map(int,s.split())
print(y,x) if x>y else print(s)
| p02397 |
while True:
x, y = list(map(int, input().split()))
if (x == 0 and y == 0) :
break
if (x < y) :
print((str(x) + " " + str(y)))
else :
print((str(y) + " " + str(x))) | while True:
t = input().split()
a = int(t[0])
b = int(t[1])
if (a == 0) and (b == 0):
break
if (a < b):
print((str(a) + " " + str(b)))
else:
print((str(b) + " " + str(a))) | p02397 |
while True:
a,b = list(map(int, input().split()))
if (a == 0) and (b == 0):
break
elif (a < b):
print((str(a) + " " + str(b)))
else :
print((str(b) + " " + str(a))) |
while True:
a,b = list(map(int, input().split()))
if (a == 0 and b == 0):
break
else:
if (a < b):
print((str(a) + " " + str(b)))
else :
print((str(b) +" "+ str(a)))
| p02397 |
import sys
while True:
xy=sys.stdin.readline()
nums=xy.split( ' ' )
for i in range( len( nums) ):
nums[i] = int( nums[i] )
if nums[0] == 0 and nums[1] == 0:
break
else:
if nums[1] < nums[0]:
t=nums[0]
nums[0]=nums[1]
nums[1]=t
print(( "{} {}".format( nums[0], nums[1] ) )) | import sys
while True:
nums = [ int( val ) for val in sys.stdin.readline().split( " " ) ]
if 0 == nums[0] and 0 == nums[1]:
break
else:
nums.sort()
print(( "{} {}".format( nums[0], nums[1] ) )) | p02397 |
import sys
for line in sys.stdin:
a,b = line.split()
a,b = int(a),int(b)
if a == 0 and b == 0: break
if b<a: a,b = b,a
print('%d %d' %(a, b)) | while True:
a, b = sorted(map(int, input().split()))
if (a, b) == (0, 0): break
print(a, b) | p02397 |
while 1:
a,b = list(map(int, input().split()))
if a == b == 0:
break
elif a < b:
print("%s %s" % (a,b))
else:
print("%s %s" % (b,a)) | while 1:
a,b = list(map(int, input().split()))
if a == 0 and b == 0:
break
elif a < b:
print(a, b)
else:
print(b, a) | p02397 |
import sys
input = sys.stdin.readline
from collections import *
def compress(l):
l = list(set(l))
l.sort()
idx = defaultdict(int)
for i in range(len(l)):
idx[l[i]] = i
return idx
class BIT:
def __init__(self, n):
self.n = n
self.bit = [0]*(n+1... | import sys
input = sys.stdin.readline
from collections import *
def compress(l):
l = list(set(l))
l.sort()
idx = defaultdict(int)
for i in range(len(l)):
idx[l[i]] = i
return idx
class BIT:
def __init__(self, n):
self.n = n
self.bit = [0]*(n+1... | p02956 |
import sys
input = sys.stdin.readline
MOD = 998244353
n = int(eval(input()))
xy = []
y_index = dict()
for i in range(n):
xy.append([int(item) for item in input().split()])
xy.sort(key=lambda x: x[1])
for i, (_, y) in enumerate(xy):
y_index[y] = i
xy.sort()
cnt = [0] * (n+1)
def BIT_sum(i):
... | import sys
input = sys.stdin.readline
MOD = 998244353
n = int(eval(input()))
xy = []
y_index = dict()
for i in range(n):
x, y = [int(item) for item in input().split()]
xy.append((x, y))
xy.sort(key=lambda x: x[1])
for i, (_, y) in enumerate(xy):
y_index[y] = i
xy.sort()
cnt = [0] * (n+1)
... | p02956 |
n=int(eval(input()))
l=[list(map(int,input().split())) for i in range(n)]
mod=998244353
from operator import itemgetter
l.sort(key=itemgetter(1))
for i in range(n):
l[i][1]=i
l.sort(key=itemgetter(0))
for i in range(n):
l[i][0]=i
No=2
while No<=n:
No*=2
tree=[0]*(2*No)
def add(k,x):
k... | import sys
input=sys.stdin.readline
n=int(eval(input()))
l=[list(map(int,input().split())) for i in range(n)]
mod=998244353
from operator import itemgetter
l.sort(key=itemgetter(1))
for i in range(n):
l[i][1]=i
l.sort(key=itemgetter(0))
No=2
while No<=n:
No*=2
tree=[0]*(2*No)
def add(k,x):
... | p02956 |
N = int(eval(input()))
XY = []
for _ in range(N):
x, y = list(map(int, input().split()))
XY.append((x, y))
# BITの定義
import math
class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
# index 1からiの値の和を返す
def sum(self, i):
s = 0
... | N = int(eval(input()))
XY = []
for _ in range(N):
x, y = list(map(int, input().split()))
XY.append((x, y))
# BITの定義
class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
# index 1からiの値の和を返す
def sum(self, i):
s = 0
while i > ... | p02956 |
import sys
import array
from operator import itemgetter
def upd(ft,i):
i+=1
while(i<=len(ft)):
ft[i]+=1
i+=i&-i
def get(ft,i):
i+=1
ret=0
while(i!=0):
ret+=ft[i]
i-=i&-i
return ret
def comb(cnt,x):
return cnt[x]-1;
def main():
input = sys.stdin.readline
tl=200100
... | import sys
import array
from operator import itemgetter
def main():
input = sys.stdin.readline
md = 998244353
n = int(eval(input()))
tl=n+1
ft=[0]*tl
xy = [[0]*2 for _ in range(n)]
for i in range(n):
xy[i] = [int(item) for item in input().split()]
xy.sort(key=itemgetter(0))
yx... | p02956 |
from operator import itemgetter
class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
while i <= se... | from operator import itemgetter
class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
while i <= se... | p02956 |
import sys
import io, os
#input = sys.stdin.buffer.readline
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
mod = 998244353
def main():
n = int(eval(input()))
XY = []
X = set()
Y = set()
for i in range(n):
x,y = list(map(int, input().split()))
XY.append((x... | import sys
import io, os
#input = sys.stdin.buffer.readline
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
mod = 998244353
def main():
n = int(eval(input()))
XY = []
X = set()
Y = set()
for i in range(n):
x,y = list(map(int, input().split()))
XY.append((x... | p02956 |
# ref: https://atcoder.jp/contests/abc136/submissions/6696160
# ref: https://atcoder.jp/contests/abc136/submissions/6708692
n = int(eval(input()))
XY = sorted(list(map(int, input().split())) for _ in range(n))
X, Y = list(zip(*XY))
Y_rank = {z: i for i, z in enumerate(sorted(Y), 1)}
mod = 998244353
class... | # ref: https://atcoder.jp/contests/abc136/submissions/6696160
# ref: https://atcoder.jp/contests/abc136/submissions/6708692
import sys
input = sys.stdin.readline
n = int(eval(input()))
XY = sorted(list(map(int, input().split())) for _ in range(n))
X, Y = list(zip(*XY))
Y_rank = {z: i for i, z in enumerate(sort... | p02956 |
import sys
def input():
return sys.stdin.readline()[:-1]
MOD = 998244353
class Rsum():
def __init__(self, size):
#the number of nodes is 2n-1
self.n = 1
while self.n < size:
self.n *= 2
self.node = [0] * (2*self.n-1)
def Access(self, x):
return self.node[x+self.n-1]
def Add(self, x, ... | import sys
def input():
return sys.stdin.readline()[:-1]
MOD = 998244353
class Rsum():
def __init__(self, size):
#the number of nodes is 2n-1
self.n = 1
while self.n < size:
self.n *= 2
self.node = [0] * (2*self.n-1)
def Access(self, x):
return self.node[x+self.n-1]
def Add(self, x, ... | p02956 |
import sys
def input():
return sys.stdin.readline()[:-1]
MOD = 998244353
class Rsum():
def __init__(self, size):
#the number of nodes is 2n-1
self.n = 1
while self.n < size:
self.n *= 2
self.node = [0] * (2*self.n-1)
def Access(self, x):
return self.node[x+self.n-1]
def Add(self, x, ... | import sys
def input():
return sys.stdin.readline()[:-1]
MOD = 998244353
class Rsum():
def __init__(self, size):
#the number of nodes is 2n-1
self.n = 1
while self.n < size:
self.n *= 2
self.node = [0] * (2*self.n-1)
def Access(self, x):
return self.node[x+self.n-1]
def Add(self, x, ... | p02956 |
import sys
def solve():
readline = sys.stdin.readline
write = sys.stdout.write
MOD = 998244353
N = int(readline())
P = [list(map(int, readline().split())) for i in range(N)]
P.sort()
Y = [y for x, y in P]
def compress(X):
*XS, = set(X)
XS.sort()
... | import sys
def solve():
readline = sys.stdin.readline
write = sys.stdout.write
MOD = 998244353
N = int(readline())
P = [list(map(int, readline().split())) for i in range(N)]
P.sort()
Y = [y for x, y in P]
def compress(X):
*XS, = set(X)
XS.sort()
... | p02956 |
import sys
class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
while i <= self.size:
... | import sys
class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
while i <= self.size:
... | p02956 |
import itertools
import os
import sys
from collections import defaultdict
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10 ** 18
MOD = 998244353
class BinaryIndexedTree:
# http://hos.ac/slides/20140319_bit.pdf
def __in... | import itertools
import os
import sys
from collections import defaultdict
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10 ** 18
MOD = 998244353
class BinaryIndexedTree:
# http://hos.ac/slides/20140319_bit.pdf
def __in... | p02956 |
# 解説放送の方針
# 平面走査をし、各点について、左上、左下、右上、右下にある点を数え、計算する。
# 解説放送ではBITを2本使っていたが、座標圧縮の結果を利用してBIT１本で済むようにした
N = int(eval(input()))
xy = [tuple(map(int,input().split())) for _ in range(N)]
mod = 998244353
class BIT:
'''https://tjkendev.github.io/procon-library/python/range_query/bit.html'''
def __init__(self... | # 解説放送の方針
# 平面走査をし、各点について、左上、左下、右上、右下にある点を数え、計算する。
# 解説放送ではBITを2本使っていたが、座標圧縮の結果を利用してBIT１本で済むようにした
N = int(eval(input()))
xy = [tuple(map(int,input().split())) for _ in range(N)]
mod = 998244353
class BIT:
'''https://tjkendev.github.io/procon-library/python/range_query/bit.html'''
def __init__(self... | p02956 |
# 解説放送の方針
# 平面走査をし、各点について、左上、左下、右上、右下にある点を数え、計算する。
# 解説放送ではBITを2本使っていたが、座標圧縮の結果を利用してBIT１本で済むようにした
N = int(eval(input()))
xy = [tuple(map(int,input().split())) for _ in range(N)]
mod = 998244353
class BIT:
'''https://tjkendev.github.io/procon-library/python/range_query/bit.html'''
def __init__(self... | # 解説放送の方針
# 平面走査をし、各点について、左上、左下、右上、右下にある点を数え、計算する。
# 解説放送ではBITを2本使っていたが、座標圧縮の結果を利用してBIT１本で済むようにした
N = int(eval(input()))
xy = [tuple(map(int,input().split())) for _ in range(N)]
mod = 998244353
class BIT:
'''https://tjkendev.github.io/procon-library/python/range_query/bit.html'''
def __init__(self... | p02956 |
import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from co... | import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from co... | p02956 |
class BIT:
ini = 0
def __init__(self, num):
self.N = 1
while self.N <= num:
self.N *= 2
self.T = [self.ini] * self.N
def do(self, l, r):
#合計
return l + r
def set(self, L):
for i in range(len(L)):
self.update(i, L[i])
def update(self, x):
k = x + 1
sel... | class BIT:
ini = 0
def __init__(self, num):
self.N = 1
while self.N <= num:
self.N *= 2
self.T = [self.ini] * self.N
def do(self, l, r):
#合計
return l + r
def set(self, L):
for i in range(len(L)):
self.update(i, L[i])
def update(self, x):
k = x + 1
sel... | p02956 |
import sys
input=sys.stdin.readline
N=int(eval(input()))
p=[]
for i in range(N):
x,y=list(map(int,input().split()))
p.append([x,y])
mod=998244353
pow=[1]
for i in range(N):
pow.append((pow[-1]*2)%mod)
p.sort(key=lambda x:x[1])
for i in range(N):
p[i][1]=i+1
data=[[0 for i in ra... | import sys
input=sys.stdin.readline
N=int(eval(input()))
p=[]
for i in range(N):
x,y=list(map(int,input().split()))
p.append([x,y])
mod=998244353
pow=[1]
for i in range(N):
pow.append((pow[-1]*2)%mod)
p.sort(key=lambda x:x[1])
for i in range(N):
p[i][1]=i+1
data=[[0 for i in ra... | p02956 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
class Seg_sum():
def __init__(self,x):
#####単位元######
self.ide_ele_min = 0
self.func = lambda a,b : a+b
self.n = len(x)
#num_max:n以上の最小の2のべき乗
... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
class Seg_sum():
def __init__(self,x):
#####単位元######
self.ide_ele_min = 0
self.func = lambda a,b : a+b
self.n = len(x)
#num_max:n以上の最小の2のべき乗
... | p02956 |
def main():
mod = 998244353
n = int(eval(input()))
xy = [list(map(int, input().split())) for _ in [0]*n]
ans = 0
pow_2 = [1]
j = 1
for i in range(n):
j = j*2 % mod
pow_2.append(j)
p2 = pow_2[n-1]
xy.sort(key=lambda x: x[1])
xy = [(x, i+1) for i, (x, ... | def main():
from sys import stdin
input = stdin.readline
mod = 998244353
n = int(eval(input()))
xy = [list(map(int, input().split())) for _ in [0]*n]
ans = 0
pow_2 = [1]
j = 1
for i in range(n):
j = j*2 % mod
pow_2.append(j)
p2 = pow_2[n-1]
xy.s... | p02956 |
import sys; input = sys.stdin.buffer.readline
from collections import defaultdict
con = 998244353; INF = float("inf")
def getlist():
return list(map(int, input().split()))
class SegmentTree(object):
def __init__(self, N):
self.N0 = 2 ** (N - 1).bit_length()
self.data = [0] * (2 * self.N0)
def upda... | import sys; input = sys.stdin.buffer.readline
from collections import defaultdict
con = 998244353; INF = float("inf")
def getlist():
return list(map(int, input().split()))
class SegmentTree(object):
def __init__(self, N):
self.N0 = 2 ** (N - 1).bit_length()
self.data = [0] * (2 * self.N0)
def upda... | p02956 |
import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
MOD = 998244353
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
N = NI()
dat = [LI() for _ in range(N)]
dat.sort()
yo = [y for _,y in dat]
yo.sort()... | import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
MOD = 998244353
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
N = NI()
dat = [LI() for _ in range(N)]
dat.sort()
yo = [y for _,y in dat]
yo.sort()... | p02956 |
import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
MOD = 998244353
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
N = NI()
dat = [LI() for _ in range(N)]
dat.sort()
yo = [y for _,y in dat]
yo.sort()... | import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
MOD = 998244353
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
N = NI()
dat = [LI() for _ in range(N)]
dat.sort()
yo = [y for _,y in dat]
yo.sort()... | p02956 |
import sys
input = sys.stdin.readline
mod = 998244353
n = int(eval(input()))
XY = sorted(tuple(map(int, input().split())) for _ in range(n))
X, Y = list(zip(*XY))
L = {y:i+1 for i, y in enumerate(sorted(Y))}
Y = tuple(L[y] for y in Y)
BIT = [0]*(n+1)
def add(i):
while i<=n:
BIT[i] += 1
i += i&-i
... | import sys
input = sys.stdin.readline
mod = 998244353
n = int(eval(input()))
XY = sorted(tuple(map(int, input().split())) for _ in range(n))
X, Y = list(zip(*XY))
L = {y:i+1 for i, y in enumerate(sorted(Y))}
Y = tuple(L[y] for y in Y)
BIT = [0]*(n+1)
def add(i):
while i<=n:
BIT[i] += 1
i += i&-i
... | p02956 |
from operator import itemgetter
mod=998244353
def bit_add(i):
while i<=n:
tree[i]+=1
i+=i&(-i)
def bit_sum(i):
s=0
while i>0:
s+=tree[i]
i-=i&(-i)
return s
n=int(eval(input()))
xy=[[i+1]+list(map(int,input().split())) for i in range(n)]
data=[[] for i ... | from operator import itemgetter
import sys
input=sys.stdin.readline
mod=998244353
def bit_add(i):
while i<=n:
tree[i]+=1
i+=i&(-i)
def bit_sum(i):
s=0
while i>0:
s+=tree[i]
i-=i&(-i)
return s
n=int(eval(input()))
xy=[[i+1]+list(map(int,input()... | p02956 |
I = [int(_) for _ in open(0).read().split()]
N, X, Y = I[0], I[1::2], I[2::2]
mod = 998244353
class SegmentTree():
def __init__(self, array, f, ti):
"""
Parameters
----------
array : list
to construct segment tree from
f : func
binary op... | I = [int(_) for _ in open(0).read().split()]
N, X, Y = I[0], I[1::2], I[2::2]
mod = 998244353
def compress_coord(raw):
i_v = {}
v_i = {}
for i, v in enumerate(sorted(set(raw))):
i_v[i] = v
v_i[v] = i
return v_i, i_v
class BinaryIndexedTree():
def __init__(self, n):... | p02956 |
I = [int(_) for _ in open(0).read().split()]
N, X, Y = I[0], I[1::2], I[2::2]
mod = 998244353
def compress_coord(raw):
i_v = {}
v_i = {}
for i, v in enumerate(sorted(set(raw))):
i_v[i] = v
v_i[v] = i
return v_i, i_v
class BinaryIndexedTree():
def __init__(self, n):... | I = [int(_) for _ in open(0).read().split()]
N, X, Y = I[0], I[1::2], I[2::2]
mod = 998244353
def compress_coord(raw):
#i_v = {}
v_i = {}
for i, v in enumerate(sorted(set(raw))):
#i_v[i] = v
v_i[v] = i
return v_i #, i_v
class BinaryIndexedTree():
def __init__(self... | p02956 |
# coding: utf-8
# Your code here!
"""
Binary indexed tree
0-indexed, 関数は閉区間
0からの区間加算、1点更新
"""
class BIT: #0-indexed
def __init__(self, n):
self.tree = [0]*(n+1)
self.tree[0] = None
# self.element = [0]*(n+1)
def sum(self, i): #a_0 + ... + a_{i} #閉区間
s = 0; i += 1
... | # coding: utf-8
# Your code here!
"""
Binary indexed tree
0-indexed, 関数は閉区間
0からの区間加算、1点更新
"""
class BIT: #0-indexed
def __init__(self, n):
self.tree = [0]*(n+1)
self.tree[0] = None
# self.element = [0]*(n+1)
def sum(self, i): #a_0 + ... + a_{i} #閉区間
s = 0; i += 1
... | p02956 |
def main():
import sys
from operator import itemgetter
input = sys.stdin.readline
class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i... | def main():
import sys
from operator import itemgetter
input = sys.stdin.readline
class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i... | p02956 |
import sys
input = sys.stdin.readline
mod = 998244353
def sub(a, b):
return (a % mod + mod - b % mod) % mod
class SegTree:
def __init__(self, init_val, n, ide_ele, seg_func):
self.segfunc = seg_func
self.num = 2**(n-1).bit_length()
self.ide_ele = ide_ele
self.seg=[s... | class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
while i <= self.size:
self.tree[i] += x
... | p02956 |
class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
while i <= self.size:
self.tree[i] += x
... | import sys
input = sys.stdin.readline
mod = 998244353
def sub(a, b):
return (a % mod + mod - b % mod) % mod
def main():
n, = list(map(int, input().split()))
t = 1
dd = [t]
for _ in range(n):
t=2*t%mod
dd.append(t)
xs, ys = [], []
for _ in range(n):
... | p02956 |
import sys
input=lambda: sys.stdin.readline().rstrip()
n=int(eval(input()))
mod=998244353
from collections import defaultdict
DX=defaultdict(int)
DY=defaultdict(int)
XY,X,Y=[],[],[]
for _ in range(n):
x,y=list(map(int,input().split()))
X.append(x)
Y.append(y)
XY.append((x,y))
X.sort()
Y.sort()
XY... | import sys
input=lambda: sys.stdin.readline().rstrip()
n=int(eval(input()))
mod=998244353
from collections import defaultdict
DX=defaultdict(int)
DY=defaultdict(int)
XY,X,Y=[],[],[]
for _ in range(n):
x,y=list(map(int,input().split()))
X.append(x)
Y.append(y)
XY.append((x,y))
X.sort()
Y.sort()
XY... | p02956 |
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort(reverse=True) # 降順
alice, bob = a[0::2], a[1::2]
print((sum(alice) - sum(bob))) | N = int(eval(input()))
a = list(map(int, input().split()))
a.sort(reverse=True)
ans = 0
for i,ai in enumerate(a):
if i%2==0:
ans += ai
else:
ans -= ai
print(ans)
| p03434 |
eval(input());a,b,c=0,0,sorted(map(int,input().split()))
while c:
a+=c.pop()
b+=c.pop() if c else 0
print((a-b)) | eval(input());a=sorted(map(int,input().split()))[::-1];print((sum(a[::2])-sum(a[1::2]))) | p03434 |
Num = int(eval(input()))
Num_Array = list(map(int,input().split()))
Alice,Bob = 0,0
for i in range ( Num ):
Check_Max = -1
for x in range(len(Num_Array)):
if Num_Array[x] > Check_Max :
Check_Max = Num_Array[x]
check = x
Num_Array.pop(check)
if i % 2 == 0... | Num = int(eval(input()))
Num_Array = sorted(list(map(int,input().split())),reverse=True)
Alice,Bob = 0,0
for i in range(Num):
if i % 2 == 0 :
Alice += Num_Array[i]
else:
Bob += Num_Array[i]
print((Alice - Bob)) | p03434 |
n = int(eval(input()))
cards = [i for i in map(int, input().split())]
alice = []
bob = []
for i in range(n):
if i % 2 == 0:
alice.append(max(cards))
cards.pop(cards.index(max(cards)))
else:
bob.append(max(cards))
cards.pop(cards.index(max(cards)))
print((sum(alice) - s... | n = int(eval(input()))
cards = sorted(list(map(int, input().split())), reverse=True)
alice = []
bob = []
for i in range(0, n, 2):
alice.append(cards[i])
try:
bob.append(cards[i+1])
except:
break
print((sum(alice) - sum(bob))) | p03434 |
num = int(eval(input()))
cards = sorted(list(map(int, input().split())), reverse = True)
alice = 0
bob = 0
for i in range(num):
if i//2*2 == i:
alice += cards[i]
else:
bob += cards[i]
print((alice - bob)) | N = int(eval(input()))
A = list(map(int, input().split()))
A = sorted(A, reverse = True)
dif = sum(A[0::2]) - sum(A[1::2])
print(dif) | p03434 |
# ABC088B - Card Game for Two
n = int(eval(input()))
lst = sorted(list(map(int, input().rstrip().split())), reverse=True)
total = 0
for i in range(n):
if i % 2 == 0:
total += lst[i]
else:
total -= lst[i]
print(total) | # ABC088B - Card Game for Two
import sys
input = sys.stdin.readline
n = int(eval(input()))
lst = sorted(list(map(int, input().rstrip().split())), reverse=True)
total = 0
for i in range(n):
if i % 2 == 0:
total += lst[i]
else:
total -= lst[i]
print(total) | p03434 |
n = int(eval(input()))
a = list(map(int, input().split()))
a_min = min(a)
alice = 0
bob = 0
while max(a) != 0:
alice += max(a)
for i in range(len(a)):
if a[i] == max(a):
a[i] = 0
break
bob += max(a)
for i in range(len(a)):
if a[i] == max(a):
... | n = int(eval(input()))
a = sorted(list(map(int,input().split())), reverse=True)
print((sum(a[::2]) - sum(a[1::2]))) | p03434 |
eval(input())
l=sorted(map(int,input().split()))[::-1]
print((sum(l[::2])-sum(l[1::2]))) | n = int(eval(input()))
a=list(map(int,input().split()))
aa =sorted(a, reverse=True)
alice=sum(aa[0::2])
bob=sum(aa[1::2])
print((alice-bob)) | p03434 |
N = int(eval(input()))
a_input = list(map(int, input().split()))
a = list(a_input)
alice = 0
bob = 0
for i in range(len(a)):
max_i = 0
max_a = 0
for j in range(N):
if a[j] > max_a:
max_a = a[j]
max_i = j
if i%2 == 0:
alice = alice + max_a
else:
... | # B - Card Game for Two
#25min
N = int(eval(input()))
a_input = list(map(int, input().split()))
a = list(a_input)
alice = 0
bob = 0
a.sort(reverse=True)
for i in range(N):
if i%2 == 0:
alice = alice + a[i]
else:
bob = bob + a[i]
print((alice-bob)) | p03434 |
N = int(eval(input()))
l = list(map(int, input().split()))
l.sort(reverse=True)
print((sum([l[i] for i in range(0, len(l), 2)]) - sum([l[i] for i in range(1, len(l), 2)]))) | N = int(eval(input()))
l = list(map(int, input().split()))
l.sort(reverse=True)
print((sum(l[0::2]) - sum(l[1::2]))) | p03434 |
N = int(eval(input()))
a = sorted([int(x) for x in input().split()], reverse=True)
alice = sum(a[0::2])
bob = sum(a[1::2])
print((alice-bob)) | N = int(eval(input()))
a = sorted([int(x) for x in input().split()], reverse=True)
print((sum(a[0::2])-sum(a[1::2]))) | p03434 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.