input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n = int(eval(input()))
a = list(map(int,input().split()))
a = sorted(a,reverse=True)
for ai in a[1:]:
gen = [a[0]]
gen.append(ai)
for j in range(2,n):
gen.append(gen[j-2]^gen[j-1])
if (set(gen)==set(a)):
print('Yes')
else:
print('No') | n = int(eval(input()))
A = list(map(int,input().split()))
A = sorted(A, reverse=True)
xor = A[0]
for a in A[1:]:
xor ^= a
if (xor == 0):
print('Yes')
else:
print('No') | p02975 |
from itertools import permutations
n=int(eval(input()))
N=list(map(int,input().split()))
ans=[]
for i in list(permutations(N)):
flag=1
i=list(i)
i.insert(0,i[-1])
i.append(i[1])
for j in range(1,n):
if i[j]!=i[j-1]^i[j+1]:
flag=0
break
if flag==1:brea... | N=int(eval(input()))
A = list(map(int,input().split()))
temp = 0
for i in A:
temp = temp ^ i
if(temp == 0):
print('Yes')
else:
print('No') | p02975 |
from collections import Counter
n = int(eval(input()))
a = [int(x) for x in input().split()]
if n % 3:
print(('Yes' if len(set(a)) == 1 else 'No'))
else:
d = Counter()
for x in a:
d[x] += 1
if len(list(d.keys())) == 1:
print(('Yes' if d[0] == n else 'No'))
elif len(list(... | from collections import Counter
n = int(eval(input()))
a = [int(x) for x in input().split()]
d = Counter()
for x in a:
d[x] += 1
if d[0] == n:
print('Yes')
elif len(list(d.keys())) == 2 and d[0] == n//3:
print(('Yes' if d[0] == n//3 else 'No'))
elif len(list(d.keys())) == 3:
p, q, r = lis... | p02975 |
#
n=int(eval(input()))
a=list(map(int,input().split()))
A=set(a[1:])
res=[-1]*n
dct={}
for e in a:
dct[e]=dct.get(e,0)+1
tmp=a[0]
res[0]=tmp
dct[tmp]-=1
for i in range(1,n):
tmp=res[0]^a[i]
if dct.get(tmp,0)>0:
res[1]=a[i]
res[-1]=res[0]^a[i]
dct[res[1]]-=1
... | # ACするけど不正解のやつ
n=int(eval(input()))
a=list(map(int,input().split()))
ans=a[0]
for i in range(1,n):
ans=ans^a[i]
print(('No' if ans else 'Yes')) | p02975 |
N = int(eval(input()))
l = list(map(int,input().split()))
d = l.copy()
count = 0
i = 0
while len(d) != 0:
if count == 0:
a = 0
count += 1
for j in range(N-count):
target = d[i] ^ d[j]
if target in d :
a += 1
i = j
... | N = int(eval(input()))
a = list(map(int, input().split()))
a_unique = list(set(a))
a_unique.sort()
if len(a_unique) == 1 and a[0] == 0:
ans = 'Yes'
elif len(a) % 3 == 0 :
if len(a_unique) == 3:
if bin(a_unique[0]) == bin(a_unique[1] ^ a_unique[2]) and bin(a_unique[1]) == bin(a_unique[0] ^ a_un... | p02975 |
n = int(eval(input()))
a = list(map(int, input().strip().split()))
f = []
for i in range(1,n):
for j in range(1,n):
if not i == j:
if a[0] ^ a[j] == a[i]:
b = [-1] * n
b[0] = a[0]
b[1] = a[i]
b[2] = a[j]
... | n = int(eval(input()))
a = list(map(int, input().strip().split()))
s = []
for i in range(n):
for j in range(n):
if not i == j:
s.append(a[i] ^ a[j])
#print(a)
#print(s)
ans_flag = True
for i in range(n):
sub_flag = False
for j in range(len(s)):
if a[i] == s[j... | p02975 |
from sys import stdin
from collections import defaultdict
def main():
n = int(stdin.readline())
a = list(map(int, stdin.readline().split()))
d = defaultdict(int)
for x in a:
d[x] += 1
s = list(d.keys())
if len(s) == 1:
print('Yes' if s[0] == 0 else 'No')
elif len(s... | from sys import stdin
from collections import defaultdict
def main():
n = int(stdin.readline())
a = list(map(int, stdin.readline().split()))
d = defaultdict(int)
for x in a:
d[x] += 1
s = list(d.keys())
if len(s) == 1:
print('Yes' if s[0] == 0 else 'No')
elif len(s... | p02975 |
import itertools
n = int(eval(input()))
a = list(map(int, input().split()))
ab = list(itertools.permutations(a[1:]))
abc = [[0]*(n+1) for _ in range(len(ab))]
ans = 'No'
for i in range(len(ab)):
abc[i] = list(ab[i])
abc[i].append(a[0])
abc[i].append(a[1])
for j in range(1,n):
if bin(abc[i... | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
n = int(eval(input()))
a = list( map(int, input().split()))
sa = set(a)
sa = list(sa)
if len(sa)>3:
print('No')
exit()
if len(sa)==3:
aa = sa[0]
bb = sa[1]
cc = sa[2]
if a.count(aa) != n/3 or a.count(bb) !... | p02975 |
n=int(eval(input()))
al=list(map(int,input().split()))
t=0
for i in range(n):
t^=al[i]
if t==0:
print('Yes')
else:
print('No') | n=int(eval(input()))
al=list(map(int,input().split()))
t=0
for a in al:
t^=a
print(('Yes' if t==0 else 'No')) | p02975 |
N = int(eval(input()))
A = list(map(int,input().split()))
a = list(set(A))
ans = "No"
if len(a) == 1:
if a == [0]:
ans = "Yes"
elif len(a) == 2:
if N % 3 == 0 and A.count(0) == N//3:
ans = "Yes"
elif len(a) == 3:
if a[0] ^ a[1] ^ a[2] == 0 and N % 3 == 0 and (A.count(a[0]),A... | N = int(eval(input()))
A = list(map(int,input().split()))
a = list(set(A))
ans = "No"
if len(a) == 1:
if a == [0]:
ans = "Yes"
elif len(a) == 2:
if N % 3 == 0 and A.count(0) == N//3:
ans = "Yes"
elif len(a) == 3:
if a[0] ^ a[1] ^ a[2] == 0 and N % 3 == 0 and (A.count(a[0]),A... | p02975 |
N = int(eval(input()))
A = list(map(int,input().split()))
a = list(set(A))
ans = "No"
if a == [0]:
ans = "Yes"
elif len(a) == 2:
if N % 3 == 0 and A.count(0) == N//3:
ans = "Yes"
elif len(a) == 3:
if a[0] ^ a[1] == a[2] and N % 3 == 0 and A.count(a[0]) == A.count(a[1]) == N//3:
... | N = int(eval(input()))
A = list(map(int,input().split()))
a = list(set(A))
ans = "No"
if a == [0]:
ans = "Yes"
elif len(a) == 2:
if (a[0] == 0 or a[1] == 0) and N % 3 == 0 and A.count(0) == N//3:
ans = "Yes"
elif len(a) == 3:
if a[0] ^ a[1] == a[2] and N % 3 == 0 and A.count(a[0]) ==... | p02975 |
N = int(eval(input()))
A = list(map(int, input().split()))
def XOR(x, y):
u, i = 0, 0
while x != 0 or y != 0:
u += ((x + y) % 2) * (2 ** i)
x //= 2
y //= 2
i += 1
return u
Q = []
for i in range(1, len(A)):
M = XOR(A[0], A[i])
L = [A[0], A[i]]
for j in range(len(A)-2):
... | N = int(eval(input()))
A = list(map(int, input().split()))
def xored(a, b):
y = 0
base = 1
while a != 0 or b != 0:
y += ((a + b) % 2) * base
base *= 2
a //= 2
b //= 2
return y
if max(A) == 0:
print("Yes")
else:
if N % 3 != 0:
print("No")
else:
D = {}
for i i... | p02975 |
from heapq import heappop, heappush
n,m,s = list(map(int,input().split()))
e = [[] for _ in range(n)]
for i in range(m):
u,v,a,b = list(map(int,input().split()))
u -= 1
v -= 1
e[u].append((v,a,b))
e[v].append((u,a,b))
c = []
d = []
for i in range(n):
x,y = list(map(int,input().split()))
c.a... | from heapq import heappop, heappush
n,m,s = list(map(int,input().split()))
e = [[] for _ in range(n)]
for i in range(m):
u,v,a,b = list(map(int,input().split()))
u -= 1
v -= 1
e[u].append((v,a,b))
e[v].append((u,a,b))
c = []
d = []
for i in range(n):
x,y = list(map(int,input().split()))
c.a... | p02703 |
import math
n,m,s = list(map(int,input().split()))
road = []
for i in range(m):
u,v,a,b = list(map(int,input().split()))
road.append([u,v,a,b])
change = []
for i in range(n):
c,d = list(map(int,input().split()))
change.append([c,d])
tree = [[] for _ in range(n+1)]
for i in range(m):... | import math
n,m,s = list(map(int,input().split()))
road = []
for i in range(m):
u,v,a,b = list(map(int,input().split()))
road.append([u,v,a,b])
change = []
for i in range(n):
c,d = list(map(int,input().split()))
change.append([c,d])
tree = [[] for _ in range(n+1)]
for i in range(m):... | p02703 |
import heapq
def dijkstra_heap(s):
d=[float("inf")]*n
used=[True]*n
d[s]=0
used[s]=False
edgelist=[]
for e in edge[s]:
heapq.heappush(edgelist,e)
while len(edgelist):
minedge=heapq.heappop(edgelist)
if not used[minedge[1]]:
continue
v=minedge[1]
d[v]=minedge[0]
... | import heapq
import sys
input=sys.stdin.readline
def dijkstra_heap(s):
d=[float("inf")]*n
used=[True]*n
d[s]=0
used[s]=False
edgelist=[]
for e in edge[s]:
heapq.heappush(edgelist,e)
while len(edgelist):
minedge=heapq.heappop(edgelist)
if not used[minedge[1]]:
continue
... | p02703 |
import heapq
N, M, S = list(map(int, input().split()))
Map = [[] for _ in range(N)]
for _ in range(M):
u, v, a, b = list(map(int, input().split()))
u -= 1
v -= 1
Map[u].append((v, a, b))
Map[v].append((u, a, b))
Exchange = [tuple(map(int, input().split())) for _ in range(N)]
Q = []
... | import heapq
N, M, S = list(map(int, input().split()))
Map = [[] for _ in range(N)]
Ans = [[float('inf')] * 2500 for _ in range(N)]
for _ in range(M):
u, v, a, b = list(map(int, input().split()))
u -= 1
v -= 1
Map[u].append((v, a, b))
Map[v].append((u, a, b))
for i in range(N):
c,... | p02703 |
# coding: utf-8
import sys
sysread = sys.stdin.readline
from heapq import heappop, heappush
def run():
# import sys
# A = list(map(int, sys.stdin.readline().split()))
# all = sys.stdin.readlines()
# all = list(map(int, sys.stdin.read().split())
#N, *A = map(int, open(0))
#N = int(inp... | import sys
readline = sys.stdin.readline
read = sys.stdin.read
n,m,s = [int(i) for i in readline().split()]
g = [[] for _ in range(n)]
for i in range(m):
u,v,a,b = [int(i) for i in readline().split()]
u -= 1
v -= 1
g[u].append((v,a,b))
g[v].append((u,a,b))
cd = [int(i) for i in r... | p02703 |
# coding: utf-8
import sys
sysread = sys.stdin.readline
from heapq import heappop, heappush
def run():
N, M, S = list(map(int, sysread().split()))
to = [[] for _ in range(N+1)]
max_m = 2500
for _ in range(M):
u,m,a,b = list(map(int, sysread().split()))
to[u].append((m,b,a))
... | # coding: utf-8
import sys
sysread = sys.stdin.readline
from heapq import heappop, heappush
def run():
# import sys
# A = list(map(int, sys.stdin.readline().split()))
# all = sys.stdin.readlines()
# all = list(map(int, sys.stdin.read().split())
#N, *A = map(int, open(0))
#N = int(inp... | p02703 |
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N, M, S = mapint()
query = [[(-1, -1)]*N for _ in range(N)]
for _ in range(M):
u, v, a, b = mapint()
query[u-1][v-1] = (a, b)
query[v-1][u-1] = (a, b)
exc... | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N, M, S = mapint()
S = min(S, N*50)
query = [[[] for _ in range(N*50+1)] for _ in range(N)]
for _ in range(M):
u, v, a, b = mapint()
for coin in range(a, N*50+... | p02703 |
n,m,s=list(map(int,input().split()))
s=min(s,2500)
edge=[[] for i in range(n*50*51)]
for i in range(m):
u,v,a,b=list(map(int,input().split()))
for j in range(a,2501):
edge[u-1+j*n].append((v-1+(j-a)*n,b))
edge[v-1+j*n].append((u-1+(j-a)*n,b))
for i in range(n):
c,d=list(map(int,inpu... | n,m,s=list(map(int,input().split()))
s=min(s,2500)
edge=[[] for i in range(n*50*51)]
for i in range(m):
u,v,a,b=list(map(int,input().split()))
for j in range(a,2501):
edge[u-1+j*n].append((v-1+(j-a)*n,b))
edge[v-1+j*n].append((u-1+(j-a)*n,b))
for i in range(n):
c,d=list(map(int,inpu... | p02703 |
import heapq
def main():
N, M, S = list(map(int, input().split()))
money_max = 50*N
S = min(S, money_max-1)
dp = [[float("inf")]*(money_max) for _ in range(N)]
dp[0][S] = 0
G = [[] for _ in range(N)]
exchange = [None]*N
for _ in range(M):
u, v, a, b = list(map(int, inpu... | import heapq
def main():
N, M, S = list(map(int, input().split()))
money_max = 50*N
S = min(S, money_max)
dp = [[float("inf")]*(money_max+1) for _ in range(N)]
dp[0][S] = 0
G = [[] for _ in range(N)]
exchange = [None]*N
for _ in range(M):
u, v, a, b = list(map(int, inpu... | p02703 |
import heapq
N, M, init_silver = map(int, input().split())
MAX_COST = 2500
init_silver = min(init_silver, MAX_COST)
G = [[] for _ in range(N)]
for i in range(M):
u, v, silver_cost, time_cost = map(int, input().split())
u, v = u - 1, v - 1
G[u].append([v, silver_cost, time_cost])
G[v].append([... | import heapq
N, M, init_silver = map(int, input().split())
MAX_COST = 2500
init_silver = min(init_silver, MAX_COST)
G = [[] for _ in range(N)]
for i in range(M):
u, v, silver_cost, time_cost = map(int, input().split())
u, v = u - 1, v - 1
G[u].append([v, silver_cost, time_cost])
G[v].append([... | p02703 |
n,m,s = list(map(int,input().split()))
road = [[] for _ in range(n)]
#print(road)
for _ in range(m):
u,v,a,b = list(map(int,input().split()))
u -= 1
v -= 1
road[u].append([v,a,b])
road[v].append([u,a,b])
#print(road)
coin = []
for _ in range(n):
c,d = list(map(int,input().split()))
coin.appen... | n,m,s = list(map(int,input().split()))
road = [[] for _ in range(n)]
#print(road)
for _ in range(m):
u,v,a,b = list(map(int,input().split()))
u -= 1
v -= 1
road[u].append([v,a,b])
road[v].append([u,a,b])
#print(road)
coin = []
for _ in range(n):
c,d = list(map(int,input().split()))
coin.appen... | p02703 |
import math
N,M,S=list(map(int,input().split()))
Us=[0]*M
Vs=[0]*M
As=[0]*M
Bs=[0]*M
for i in range(M):
Us[i],Vs[i],As[i],Bs[i] = list(map(int,input().split()))
# ---
V={}
Ns = max(As)*N
Nv=N*(Ns+1)
cnt=0
for i in range(1,N+1):
for ns in range(Ns+1):
V[(i,ns)]=cnt
cnt+=1
#... | import math
import heapq
N,M,S=list(map(int,input().split()))
Us=[0]*M
Vs=[0]*M
As=[0]*M
Bs=[0]*M
for i in range(M):
Us[i],Vs[i],As[i],Bs[i] = list(map(int,input().split()))
Us[i] -= 1
Vs[i] -= 1
# ---
V={}
Ns = max(As)*N
Nv=N*(Ns+1)
cnt=0
for i in range(N):
for ns in range(Ns+1):... | p02703 |
from heapq import heappush, heappop
import sys
input = sys.stdin.readline
class RMQ:
def __init__(self, size):
n = 1
while n < size:
n <<= 1
self.n = n
self.data = [float('inf')] * (2*n-1)
self.ix = [-1] * (2*n-1)
# change the value of the ith e... | from heapq import heappush, heappop
import sys
input = sys.stdin.readline
def dijkstra(edges, size, source):
distance = [float('inf')] * size
distance[source] = 0
visited = [False] * size
pq = []
heappush(pq, (0, source))
while pq:
dist_v, v = heappop(pq)
visited[v] ... | p02703 |
import heapq
def Dijkstra(edge,start):
d = [float('inf')]*n
d[start] = 0
pq = [(0,start)]
heapq.heapify(pq)
while pq:
dist,p = heapq.heappop(pq)
for to,cost in list(edge[p].items()):
if d[to] <= dist + cost:continue
d[to] = dist + cost
h... | import heapq
def Dijkstra(edge,start):
d = [float('inf')]*(n*(A+1))
d[start] = 0
pq = [(0,start)]
heapq.heapify(pq)
while pq:
dist,p = heapq.heappop(pq)
for to,cost in list(edge[p].items()):
if d[to] <= dist + cost:continue
d[to] = dist + cost
... | p02703 |
n, m, s = map(int,input().split())
adj = [[] for i in range(n)]
for _ in range(m):
u, v, a, b = map(int,input().split())
adj[u - 1].append((v - 1,-a,b))
adj[v - 1].append((u - 1,-a,b))
for i in range(n):
c, d = map(int,input().split())
adj[i].append((i,c,d))
out = [-1] * n
LARGE = 10... | n, m, s = map(int,input().split())
adj = [[] for i in range(n)]
for _ in range(m):
u, v, a, b = map(int,input().split())
adj[u - 1].append((v - 1,-a,b))
adj[v - 1].append((u - 1,-a,b))
for i in range(n):
c, d = map(int,input().split())
adj[i].append((i,c,d))
out = [-1] * n
count = 0
... | p02703 |
import heapq
class Dijkstra(object):
""" 使用例
dik = Dijkstra()
edge = defaultdict(list)
edge[(1, 1)].append([1, (1, 2)])
edge[(1, 2)].append([1, (1, 1)])
edge[(1, 2)].append([2, (2, 1)])
edge[(2, 1)].append([2, (1, 2)])
edge[(2, 1)].append([5, (2, 2)])
edge[(2, 2)].app... | import heapq
import sys
input = sys.stdin.readline
INF = 10 ** 18
class Edge():
def __init__(self, end, cost, time):
self.end = end
self.cost = cost
self.time = time
dp = []
h = []
def push(t, v, x):
if x < 0:
return
if dp[v][x] <= t:
return... | p02703 |
N,M,S=list(map(int,input().split()))
from heapq import heappop,heappush
inf = float('inf')
cost=[[] for _ in range(N)]
exc=[]
for _ in range(M):
u,v,a,b=list(map(int,input().split()))
u,v=u-1,v-1
cost[u].append((v,a,b))
cost[v].append((u,a,b))
for _ in range(N):
c,d=list(map(int,in... | N,M,S=list(map(int,input().split()))
from heapq import heappop,heappush
inf = float('inf')
cost=[[] for _ in range(N)]
exc=[]
for _ in range(M):
u,v,a,b=list(map(int,input().split()))
u,v=u-1,v-1
cost[u].append((v,a,b))
cost[v].append((u,a,b))
for _ in range(N):
c,d=list(map(int,in... | p02703 |
N,M,S=list(map(int,input().split()))
from heapq import heappop,heappush
inf = 10**18
cost=[[] for _ in range(N)]
exc=[]
for _ in range(M):
u,v,a,b=list(map(int,input().split()))
u,v=u-1,v-1
cost[u].append((v,a,b))
cost[v].append((u,a,b))
for _ in range(N):
c,d=list(map(int,input().... | N,M,S=list(map(int,input().split()))
from heapq import heappop,heappush
inf = float('inf')
cost=[[] for _ in range(N)]
exc=[]
for _ in range(M):
u,v,a,b=list(map(int,input().split()))
u,v=u-1,v-1
cost[u].append((v,a,b))
cost[v].append((u,a,b))
for _ in range(N):
c,d=list(map(int,in... | p02703 |
n, m, s = list(map(int, input().split()))
edges = [[] for _ in range(n)]
for _ in range(m):
u, v, a, b = list(map(int, input().split()))
u, v = u-1, v-1
edges[u].append((v, a, b))
edges[v].append((u, a, b))
banks = tuple(tuple(map(int, input().split())) for _ in range(n))
max_s = 50 * (n-1... | n, m, s = list(map(int, input().split()))
edges = [[] for _ in range(n)]
for _ in range(m):
u, v, a, b = list(map(int, input().split()))
u, v = u-1, v-1
edges[u].append((v, a, b))
edges[v].append((u, a, b))
banks = tuple(tuple(map(int, input().split())) for _ in range(n))
max_s = 50 * (n-1... | p02703 |
from heapq import heapify, heappop, heappush
import sys
input = sys.stdin.readline
class Heap():
def __init__(self, ):
self.h = []
def heapify(self, h):
self.h = h
heapify(self.h)
def heappop(self,):
return heappop(self.h)
def heappush(self, x):
... | from heapq import heappop, heappush
import sys
input = sys.stdin.readline
INF = 10**100
MAX = 2500
N, M, S = list(map(int, input().split()))
S = min(S, MAX)
G = [[] for _ in [0]*N]
C = []
for _ in [0]*M:
u, v, a, b = list(map(int, input().split()))
u -= 1
v -= 1
G[v].append((u, a, b))
... | p02703 |
import heapq
def dijkstra_heap():
used = [-1] * (2501*n)
edgelist=[]
d=[0]*n
d[0]=1
f=1
for i in range(0,2501):
if 0<=ss+i*cd[0][0]<=2500:
heapq.heappush(edgelist,[cd[0][1]*i,cd[0][0]*i+ss])
else:
break
while len(edgelist):
minedge... | import heapq
def dijkstra_heap():
used = [-1] * (2451*n)
edgelist=[]
heapq.heappush(edgelist,[0,ss])
while len(edgelist):
#print(len(edgelist))
minedge = heapq.heappop(edgelist)
if used[minedge[1]]!=-1:
continue
v = minedge[1]
kai=minedge[0]... | p02703 |
import sys
sys.setrecursionlimit(700000)
def s_in():
return eval(input())
def n_in():
return int(eval(input()))
def l_in():
return list(map(int, input().split()))
def print_l(l):
print((' '.join(map(str, l))))
class Interval():
def __init__(self, li):
self.li = li
... | import sys
sys.setrecursionlimit(700000)
def s_in():
return eval(input())
def n_in():
return int(eval(input()))
def l_in():
return list(map(int, input().split()))
def print_l(l):
print((' '.join(map(str, l))))
class Interval():
def __init__(self, li):
self.li = li
... | p02703 |
from sys import stdin, setrecursionlimit
input = stdin.buffer.readline
setrecursionlimit(10 ** 7)
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
from collections import deque, defaultdict
from itertools import combinations, permutations, combinations_with_replacement
from iter... | from sys import stdin, setrecursionlimit
input = stdin.buffer.readline
from heapq import heappush, heappop
INF = 10 ** 18
N, M, S = list(map(int, input().split()))
UVAB = [list(map(int, input().split())) for _ in range(M)]
CD = [list(map(int, input().split())) for _ in range(N)]
sumA = 0
for u, v, a, b in... | p02703 |
import heapq
city_num, road_num, init_silver = map(int, input().split())
init_silver = min(2500, init_silver)
G = [[] for _ in range(city_num)]
for _ in range(road_num):
A, B, cost, time_cost = map(int, input().split())
A, B = A-1, B-1
G[B].append([A, cost, time_cost])
G[A].append([B, cost,... | import heapq
N, M, init_silver = map(int, input().split())
MAX_COST = 2500
init_silver = min(init_silver, MAX_COST)
G = [[] for _ in range(N)]
for i in range(M):
u, v, silver_cost, time_cost = map(int, input().split())
u, v = u - 1, v - 1
G[u].append([v, silver_cost, time_cost])
G[v].append([... | p02703 |
import heapq
def inpl():
return list(map(int, input().split()))
N, M, S = inpl()
A = 101 # max A
S = min(S, M * A - 1)
lines = [[] for _ in range(N * (M * A))]
for _ in range(M):
in_s, in_t, cost, time = inpl()
in_s -= 1
in_t -= 1
for n in range(cost, M * A):
s = in_... | import heapq
def inpl():
return list(map(int, input().split()))
N, M, S = inpl()
A = 51 # max A
S = min(S, M * A - 1)
lines = [[] for _ in range(N * (M * A))]
for _ in range(M):
in_s, in_t, cost, time = inpl()
in_s -= 1
in_t -= 1
for n in range(cost, M * A):
s = in_s... | p02703 |
import heapq
def inpl():
return list(map(int, input().split()))
N, M, S = inpl()
A = 51 # max A
S = min(S, M * A - 1)
lines = [[] for _ in range(N * (M * A))]
for _ in range(M):
in_s, in_t, cost, time = inpl()
in_s -= 1
in_t -= 1
for n in range(cost, M * A):
s = in_s... | import heapq
INF = 10**20
A = 50 # max A
def inpl():
return list(map(int, input().split()))
def main():
N, M, S = inpl()
S = min(S, M * A)
lines = [[] for _ in range(N * (M * A + 1))]
for _ in range(M):
in_s, in_t, cost, time = inpl()
in_s -= 1
in_t -... | p02703 |
# -*- coding: utf-8 -*-
import heapq
import sys
from collections import defaultdict
input = sys.stdin.buffer.readline
INF = 2**62-1
def read_int_n():
return list(map(int, input().split()))
def read_str_n():
return list(map(str, input().split()))
def Dijkstra(g, s):
d = defaultdict(l... | # -*- coding: utf-8 -*-
import heapq
import sys
from collections import defaultdict
input = sys.stdin.buffer.readline
INF = 2**62-1
def read_int_n():
return list(map(int, input().split()))
def read_str_n():
return list(map(str, input().split()))
def Dijkstra(g, s):
d = defaultdict(l... | p02703 |
import sys
from heapq import heappop, heappush
n, m, ss = list(map(int, input().split()))
lines = sys.stdin.readlines()
links = [set() for _ in range(n)]
aaa = []
for line in lines[:m]:
u, v, a, b = list(map(int, line.split()))
u -= 1
v -= 1
links[u].add((v, a, b))
links[v].add((u, a, b... | import sys
from heapq import heappop, heappush
n, m, ss = list(map(int, input().split()))
lines = sys.stdin.readlines()
links = [set() for _ in range(n)]
aaa = []
for line in lines[:m]:
u, v, a, b = list(map(int, line.split()))
u -= 1
v -= 1
links[u].add((v, a, b))
links[v].add((u, a, b... | p02703 |
import sys
import heapq
input = sys.stdin.readline
COST_MAX = 2501
TIME_MAX = 10 ** 15
N, M, S = list(map(int, input().split()))
fare_adj = [[COST_MAX] * N for _ in range(N)]
time_adj = [[TIME_MAX] * N for _ in range(N)]
fare_max = 0
for i in range(M):
u, v, a, b = list(map(int, input().split()))
... | import sys
import heapq
input = sys.stdin.readline
NCOSTS = 2501
TIME_MAX = 10 ** 15
N, M, S = list(map(int, input().split()))
adj = [[] for _ in range(N * NCOSTS)]
fare_adj = [[NCOSTS] * N for _ in range(N)]
time_adj = [[TIME_MAX] * N for _ in range(N)]
fare_max = 0
def node(city, silvers):
re... | p02703 |
from heapq import *
import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): r... | from heapq import *
import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): r... | p02703 |
from heapq import heapify, heappop, heappush
DEBUG = False
INF = float('inf')
MAX_N = 50
MAX_A = 50
N, M, S = list(map(int, input().split()))
U = []
V = []
A = []
B = []
C = []
D = []
connect = [[] for _ in range(N)]
for _ in range(M):
u, v, a, b = list(map(int, input().split()))
U.append(u... | from heapq import heapify, heappop, heappush
import sys
input = sys.stdin.readline
DEBUG = False
INF = float('inf')
MAX_N = 50
MAX_A = 50
N, M, S = list(map(int, input().split()))
U = []
V = []
A = []
B = []
C = []
D = []
connect = [[] for _ in range(N)]
for _ in range(M):
u, v, a, b = list(ma... | p02703 |
class Graph:
class Edge:
def __init__(self, to, cost, fare):
"""
:param to: 終点ノード
:param cost: 辺の重み
"""
self.to, self.cost, self.fare = to, cost, fare
def __init__(self, n, directed=False, decrement=True, edges=[]):
self.n =... | class Graph:
class Edge:
def __init__(self, to, cost, fare):
"""
:param to: 終点ノード
:param cost: 辺の重み
"""
self.to, self.cost, self.fare = to, cost, fare
def __init__(self, n, directed=False, decrement=True, edges=[]):
self.n =... | p02703 |
def main():
import heapq
def dijkstra(graph,start,cd,s):
dist = [[float("inf")]*2505 for _ in range(n)]
q = []
dist[start][s] = 0
heapq.heappush(q, (0,start,s))
while q:
cost, cur_node,coin = heapq.heappop(q)
... | def main():
import heapq
def dijkstra(graph,s,cd,c):
dist = [[float("inf")]*2505 for _ in range(n)]
q = []
dist[s][c] = 0
heapq.heappush(q, (0,s,c))
while q:
d, p,c = heapq.heappop(q)
if dist[p][c] < d:
... | p02703 |
import heapq
n, m, s = list(map(int, input().split()))
if s >= 2500:
s = 2499
edges = [[] for _ in range(n)]
for _ in range(m):
from_, to, cost, time = list(map(int, input().split()))
edges[from_-1].append((to-1, cost, time))
edges[to-1].append((from_-1, cost, time))
banks = [(0, 0) for... | import heapq
n, m, s = list(map(int, input().split()))
if s >= 2500:
s = 2499
edges = [[] for _ in range(n)]
for _ in range(m):
from_, to, cost, time = list(map(int, input().split()))
edges[from_-1].append((to-1, cost, time))
edges[to-1].append((from_-1, cost, time))
banks = []
for i i... | p02703 |
def main():
import heapq
n, m, s = list(map(int, input().split()))
if s >= 2500:
s = 2499
edges = [[] for _ in range(n)]
for _ in range(m):
from_, to, cost, time = list(map(int, input().split()))
edges[from_-1].append((to-1, cost, time))
edges... | def main():
import heapq
n, m, s = list(map(int, input().split()))
if s >= 2500:
s = 2499
edges = [[] for _ in range(n)]
for _ in range(m):
from_, to, cost, time = list(map(int, input().split()))
edges[from_-1].append((to-1, cost, time))
edges[to-1].appen... | p02703 |
def main():
import heapq
n, m, s = list(map(int, input().split()))
if s >= 2500:
s = 2499
edges = [[] for _ in range(n)]
for _ in range(m):
from_, to, cost, time = list(map(int, input().split()))
edges[from_-1].append((to-1, cost, time))
edges[to-1].appen... | def main():
import heapq
n, m, s = list(map(int, input().split()))
edges = [[] for _ in range(n)]
max_cost = 0
for _ in range(m):
from_, to, cost, time = list(map(int, input().split()))
edges[from_-1].append((to-1, cost, time))
edges[to-1].append((from_-1, cost, t... | p02703 |
import heapq
import os
from collections import defaultdict
import sys
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353
N, M, S = list(map(int, sys.stdin.buffer.readline().split()))
UVAB... | import heapq
import os
from collections import defaultdict
import sys
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353
N, M, S = list(map(int, sys.stdin.buffer.readline().split()))
UVAB... | p02703 |
from heapq import heappush, heappop
N, M, S = list(map(int, input().split()))
mxCost = 0
edges = [[] for _ in range(N)]
for _ in range(M):
fr, to, cost, dist = list(map(int, input().split()))
mxCost = max(mxCost, cost)
fr -= 1
to -= 1
edges[fr].append((to, dist, cost))
edges[to].ap... | from heapq import heappush, heappop
N, M, S = list(map(int, input().split()))
mxCost = 0
edges = [[] for _ in range(N)]
for _ in range(M):
fr, to, cost, dist = list(map(int, input().split()))
mxCost = max(mxCost, cost)
fr -= 1
to -= 1
edges[fr].append((to, dist, cost))
edges[to].ap... | p02703 |
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
from collections import defaultdict
def resolve():
N, M, S = lr()
uvab = [[] for i in range(N)]
amax = 0
for i in range(M):
u, v, a, b = lr()
uvab[u-1].append... | import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
from collections import defaultdict
from heapq import heappop, heappush
def resolve():
N, M, S = lr()
uvab = [[] for i in range(N)]
amax = 0
for i in range(M):
u, v, ... | p02703 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7 # 998244353
input=lambda:sys.stdin.readline().rstrip()
def resolve():
n, m, s = list(map(int,input().split()))
E = []
S = 1
for _ in range(m):
u, v, a, b = list(map(int,input().split()))
u -= 1; v -= 1
... | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7 # 998244353
input=lambda:sys.stdin.readline().rstrip()
def resolve():
n, m, s = list(map(int,input().split()))
E = [None] * m
S = 0
for i in range(m):
u, v, a, b = list(map(int,input().split()))
S += a
... | p02703 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7 # 998244353
input=lambda:sys.stdin.readline().rstrip()
def resolve():
n, m, s = list(map(int,input().split()))
E = [None] * m
S = 0
for i in range(m):
u, v, a, b = list(map(int,input().split()))
S += a
... | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7 # 998244353
input=lambda:sys.stdin.readline().rstrip()
from heapq import heappop, heappush
def resolve():
n, m, s = list(map(int,input().split()))
S = 0
E = [[] for _ in range(n)]
for _ in range(m):
u, v, a, b =... | p02703 |
import heapq
N, M, S = list(map(int, input().split()))
Cost = [[] for _ in range(N)]
Change = [[0]*2 for _ in range(N)]
A_m = 0
for i in range(M):
u, v, a, b = list(map(int, input().split()))
A_m = max(A_m, a)
Cost[u-1].append([v-1, a, b])
Cost[v-1].append([u-1, a, b])
for i in range(N):
... | import heapq
N, M, S = list(map(int, input().split()))
Cost = [[] for _ in range(N)]
Change = [[0]*2 for _ in range(N)]
A_m = 0
for i in range(M):
u, v, a, b = list(map(int, input().split()))
A_m = max(A_m, a)
Cost[u-1].append([v-1, a, b])
Cost[v-1].append([u-1, a, b])
for i in range(N):
... | p02703 |
from heapq import heappush, heappop
import sys
n, m, s = map(int, input().split())
edges = list()
for _ in range(m):
new_u, new_v, new_a, new_b = map(int, input().split())
edges.append((new_u-1, new_v-1, new_a, new_b))
coins_range = (n-1)*max(edges,key=lambda item:item[2])[2]+1
c, d = list(), list()
for _ ... | from heapq import heappush, heappop
import sys
n, m, s = map(int, input().split())
edges = list()
for _ in range(m):
new_u, new_v, new_a, new_b = map(int, input().split())
edges.append((new_u-1, new_v-1, new_a, new_b))
coins_range = (n-1)*max(edges,key=lambda item:item[2])[2]+1
c, d = list(), list()
for _ ... | p02703 |
n, m, s = list(map(int, input().split()))
uvab = [list(map(int, input().split())) for _ in range(m)]
cd = [list(map(int, input().split())) for _ in range(n)]
import math
M = 50 * n + 1
s = min(s, M - 1)
dp = [[float('inf')] * M for _ in range(n)]
dp[0][s] = 0
c, d = cd[0][0], cd[0][1]
for jj in range... | n, m, s = list(map(int, input().split()))
uvab = [list(map(int, input().split())) for _ in range(m)]
cd = [list(map(int, input().split())) for _ in range(n)]
M = 50 * n + 1
s = min(s, M - 1)
dp = [[float('inf')] * M for _ in range(n)]
import math
dp[0][s] = 0
c, d = cd[0][0], cd[0][1]
for jj in range(M):... | p02703 |
class Dijkstra():
""" ダイクストラ法
重み付きグラフにおける単一始点最短路アルゴリズム
* 使用条件
- 負のコストがないこと
- 有向グラフ、無向グラフともにOK
* 計算量はO(E*log(V))
* ベルマンフォード法より高速なので、負のコストがないならばこちらを使うとよい
"""
class Edge():
""" 重み付き有向辺 """
def __init__(self, _to, _cost):
self.to = _t... | class Dijkstra():
""" ダイクストラ法
重み付きグラフにおける単一始点最短路アルゴリズム
* 使用条件
- 負のコストがないこと
- 有向グラフ、無向グラフともにOK
* 計算量はO(E*log(V))
* ベルマンフォード法より高速なので、負のコストがないならばこちらを使うとよい
"""
class Edge():
""" 重み付き有向辺 """
def __init__(self, _to, _cost):
self.to = _t... | p02703 |
N,M,S = list(map(int,input().split()))
edges = [[] for _ in range(2500*50 + 100)]
def indexer(city,coin):
return 50*coin + city
for _ in range(M):
u,v,a,b = list(map(int,input().split()))
u -= 1
v -= 1
for scoin in range(a,2501):
edges[indexer(u,scoin)].append([b,indexer(v,scoin-a... | N,M,S = list(map(int,input().split()))
edges = [[] for _ in range(2500*50 + 100)]
def indexer(city,coin):
return 50*coin + city
for _ in range(M):
u,v,a,b = list(map(int,input().split()))
u -= 1
v -= 1
for scoin in range(a,2501):
edges[indexer(u,scoin)].append((b,indexer(v,scoin-a... | p02703 |
N,M,S = list(map(int,input().split()))
edges = [[] for _ in range(2500*50 + 100)]
def indexer(city,coin):
return 50*coin + city
for _ in range(M):
u,v,a,b = list(map(int,input().split()))
u -= 1
v -= 1
for scoin in range(a,2501):
edges[indexer(u,scoin)].append((b,indexer(v,scoin-a... | N,M,S = list(map(int,input().split()))
edges = [[] for _ in range(2500*50 + 100)]
def indexer(city,coin):
return 50*coin + city
for _ in range(M):
u,v,a,b = list(map(int,input().split()))
u -= 1
v -= 1
for scoin in range(a,2501):
edges[indexer(u,scoin)].append((b,indexer(v,scoin-a... | p02703 |
import heapq
import sys
input = sys.stdin.readline
inf = 10**13
N,M,S = list(map(int,input().split()))
data = [[] for _ in range(N)]
sumA = 0
for i in range(M):
U,V,A,B = list(map(int,input().split()))
sumA += A
U -= 1
V -= 1
data[U].append((B,V,A))###(距離, 行き先, 費用)
data[... | import heapq
import sys
input = sys.stdin.readline
inf = 10**13
N,M,S = list(map(int,input().split()))
data = [[] for _ in range(N)]
sumA = 0
for i in range(M):
U,V,A,B = list(map(int,input().split()))
sumA += A
U -= 1
V -= 1
data[U].append((B,V,A))###(距離, 行き先, 費用)
data[... | p02703 |
import heapq
n,m,s=list(map(int,input().split()))
#隣接行列[金額,時間]
graph=[[] for i in range(n)]
#銀貨リスト
A=[]
for i in range(m):
u,v,a,b=list(map(int,input().split()))
A.append(a)
graph[u-1].append((v-1,a,b))
graph[v-1].append((u-1,a,b))
change=[]
for i in range(n):
c,d=list(map(int,inp... | import heapq
n,m,s=list(map(int,input().split()))
#隣接行列[金額,時間]
graph=[[] for i in range(n)]
#銀貨リスト
A=[]
for i in range(m):
u,v,a,b=list(map(int,input().split()))
A.append(a)
graph[u-1].append((v-1,a,b))
graph[v-1].append((u-1,a,b))
change=[]
for i in range(n):
c,d=list(map(int,inp... | p02703 |
def main():
import heapq
inf = 10**16
n, m, s = list(map(int, input().split()))
uvab = [list(map(int, input().split())) for _ in [0]*m]
cd = [list(map(int, input().split())) for _ in [0]*n]
g = [[] for _ in [0]*n]
[g[a-1].append([b-1, c, d]) for a, b, c, d in uvab]
[g[b-1].append... | def main():
import heapq
inf = 10**16
n, m, s = list(map(int, input().split()))
uvab = [list(map(int, input().split())) for _ in [0]*m]
cd = [list(map(int, input().split())) for _ in [0]*n]
g = [[] for _ in [0]*n]
[g[a-1].append([b-1, c, d]) for a, b, c, d in uvab]
[g[b-1].append... | p02703 |
import heapq
from collections import defaultdict
h = []
heapq.heapify(h)
n, m, s = list(map(int, input().split()))
a, b = [[None] * m for _ in range(2)]
c, d = [[None] * n for _ in range(2)]
ns = defaultdict(list)
uv2e = {}
for i in range(m):
u,v,a[i],b[i] = list(map(int, input().split()))
ns... |
import heapq
from collections import defaultdict
h = []
heapq.heapify(h)
n, m, s = list(map(int, input().split()))
a, b = [[None] * m for _ in range(2)]
c, d = [[None] * n for _ in range(2)]
ns = defaultdict(list)
uv2e = {}
for i in range(m):
u,v,a[i],b[i] = list(map(int, input().split()))
ns... | p02703 |
import heapq
from collections import defaultdict
h = []
heapq.heapify(h)
n, m, s = list(map(int, input().split()))
a, b = [[None] * m for _ in range(2)]
c, d = [[None] * n for _ in range(2)]
ns = defaultdict(list)
uv2e = {}
for i in range(m):
u,v,a[i],b[i] = list(map(int, input().split()))
ns... |
import sys
input = lambda : sys.stdin.readline().rstrip()
import heapq
from collections import defaultdict
h = []
heapq.heapify(h)
n, m, s = list(map(int, input().split()))
a, b = [[None] * m for _ in range(2)]
c, d = [[None] * n for _ in range(2)]
ns = defaultdict(list)
uv2e = {}
for i in range(m):
... | p02703 |
def main():
import dataclasses
from heapq import heappush, heappop
@dataclasses.dataclass(frozen=True)
class Path:
to: int
fare: int
travel_time: int
@dataclasses.dataclass(frozen=True)
class ExchangeRate:
Ag: int
exchange_time: int
@... | def main():
from heapq import heappush, heappop
INF = 1 << 60
MX_AG = 2500
N, M, S = list(map(int, input().split()))
S = min(S, MX_AG) # それ以上のAgは不要
g = tuple(set() for _ in range(N))
for _ in range(M):
u, v, a, b = list(map(int, input().split()))
u -= 1
... | p02703 |
def main():
from heapq import heappush, heappop
INF = 1 << 60
MX_AG = 2500
N, M, S = list(map(int, input().split()))
S = min(S, MX_AG) # それ以上のAgは不要
g = tuple(set() for _ in range(N))
for _ in range(M):
u, v, a, b = list(map(int, input().split()))
u -= 1
... | # セイウチ
def main():
from heapq import heappush, heappop
INF = 1 << 60
MX_AG = 2500
N, M, S = map(int, input().split())
S = min(S, MX_AG) # それ以上のAgは不要
g = tuple(set() for _ in range(N))
for _ in range(M):
u, v, a, b = map(int, input().split())
u -= 1
... | p02703 |
import heapq
# https://nashidos.hatenablog.com/entry/2020/04/07/100508
def dijkstra(s):
hq = [(0, s)]
heapq.heapify(hq) # リストを優先度付きキューに変換
cost = [float('inf')] * ((maxsilver+1)*n) # 行ったことのないところはinf
cost[s] = 0 # 開始地点は0
while hq:
c, v = heapq.heappop(hq)
if c > cost[v]: # コ... | import heapq
# https://nashidos.hatenablog.com/entry/2020/04/07/100508
def dijkstra(s):
hq = [(0, s)]
heapq.heapify(hq) # リストを優先度付きキューに変換
cost = [float('inf')] * ((maxsilver+1)*n) # 行ったことのないところはinf
cost[s] = 0 # 開始地点は0
while hq:
c, v = heapq.heappop(hq)
if c > cost[v]: # コ... | p02703 |
import sys
input = lambda: sys.stdin.readline().rstrip()
n, m, s = list(map(int, input().split()))
s = min(s, 2500)
from collections import defaultdict
# O(ElogV)
import heapq
def dijkstra(s, x):
# 始点sから各頂点への最短距離
d = defaultdict(lambda: float("inf"))
d[(s, x)] = 0
# 各頂点が訪問済みかどうか
used =... | def main():
import sys
input = lambda: sys.stdin.readline().rstrip()
n, m, s = list(map(int, input().split()))
s = min(s, 2500)
from collections import defaultdict
# O(ElogV)
import heapq
def dijkstra(s, x):
# 始点sから各頂点への最短距離
d = defaultdict(lambda: float("inf... | p02703 |
def main():
import sys
input = lambda: sys.stdin.readline().rstrip()
n, m, s = list(map(int, input().split()))
s = min(s, 2500)
from collections import defaultdict
# O(ElogV)
import heapq
def dijkstra(s, x):
# 始点sから各頂点への最短距離
d = defaultdict(lambda: float("inf... | def main():
import os
import sys
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 fi... | p02703 |
import sys,bisect,string,math,time,functools,random
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
def Golf():*a,=map(int,open(0))
def I():return int(input())
def S_():return input()
def IS():return input().spli... | import sys,bisect,string,math,time,functools,random
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
def Golf():*a,=map(int,open(0))
def I():return int(input())
def S_():return input()
def IS():return input().spli... | p02703 |
def examA():
S, W = LI()
if S<=W:
print("unsafe")
else:
print("safe")
return
def examB():
A, B, C, D = LI()
while(True):
C -= B
if C<=0:
print("Yes")
break
A -= D
if A<=0:
print("No")
... | def examA():
S, W = LI()
if S<=W:
print("unsafe")
else:
print("safe")
return
def examB():
A, B, C, D = LI()
while(True):
C -= B
if C<=0:
print("Yes")
break
A -= D
if A<=0:
print("No")
... | p02703 |
import heapq
from collections import defaultdict
import sys
read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
inputs = sys.stdin.buffer.readlines
n, m, s = list(map(int, input().split()))
connect = defaultdict(list)
for i in range(m):
u, v, a, b = list(map(int, input().split()))
con... | import heapq
from collections import defaultdict
import sys
read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
inputs = sys.stdin.buffer.readlines
n, m, s = list(map(int, input().split()))
connect = defaultdict(list)
for i in range(m):
u, v, a, b = list(map(int, input().split()))
con... | p02703 |
import sys
from collections import defaultdict
from heapq import heappush, heappop, heapify
input = sys.stdin.readline
INF = 10**12
n, m, s = list(map(int, input().split()))
edges = defaultdict(lambda: defaultdict(lambda: [INF, INF]))
cd = []
max_a = 0
for i in range(m):
u, v, a, b = list(map(int, inp... | import sys
from collections import defaultdict
from heapq import heappush, heappop, heapify
input = sys.stdin.readline
INF = 10**19
n, m, s = list(map(int, input().split()))
edges = defaultdict(lambda: defaultdict(lambda: [INF, INF]))
cd = []
max_a = 0
for i in range(m):
u, v, a, b = list(map(int, inp... | p02703 |
from heapq import heappop,heappush
inf = float("inf")
n,m,s = list(map(int,input().split()))
G = [[] for _ in range(n)]
for _ in range(m):
u,v,cost,time = list(map(int,input().split()))
u -= 1
v -= 1
G[u].append((v,cost,time))
G[v].append((u,cost,time))
for i in range(n):
cost,t... | from heapq import heappop,heappush
inf = float("inf")
n,m,s = list(map(int,input().split()))
G = [[] for _ in range(n)]
for _ in range(m):
u,v,cost,time = list(map(int,input().split()))
u -= 1
v -= 1
G[u].append((v,cost,time))
G[v].append((u,cost,time))
for i in range(n):
cost,t... | p02703 |
import heapq
def dijkstra_heap(N,S,edge):
d = [[float('inf')]*(N*100+1) for _ in range(N)] #始点0から各頂点への最短距離
used = [[False]*(N*100+1) for _ in range(N)]
d[0][S] = 0
used[0][S] = True
edgelist = []
#edgelist : [(0,S)からの暫定(未確定)最短時間,頂点,銀貨の枚数]のリスト
#edge[s] : sから出る枝の[重み,頂点,銀貨の枚数]のリスト
for w,v,sil in e... | import heapq
def dijkstra_heap(N,S,Smax,edge):
d = [float('inf')]*(10**4*N) #始点0から各頂点への最短距離
used = [False]*(10**4*N)
d[S] = 0
used[S] = True
edgelist = []
#edgelist : [(0,S)からの暫定(未確定)最短時間,頂点,銀貨の枚数]のリスト
#edge[s] : sから出る枝の[重み,頂点,銀貨の枚数]のリスト
for w,a in edge[0]:
v,sil = a//10**4,a%10**4
if... | p02703 |
# -*- coding:utf-8 -*-
def solve():
import sys
import heapq
MAX_S = 50*50
N, M, S = list(map(int, sys.stdin.readline().split()))
graph = [[] for _ in range(N)]
for _ in range(M):
u, v, a, b = list(map(int, sys.stdin.readline().split()))
u, v = u-1, v-1
gra... | # -*- coding:utf-8 -*-
def solve():
"""解説実装"""
import sys
import heapq
MAX_S = 50*50
N, M, S = list(map(int, sys.stdin.readline().split()))
graph = [[] for _ in range(N)]
for _ in range(M):
u, v, a, b = list(map(int, sys.stdin.readline().split()))
u, v = u-1, ... | p02703 |
import sys
input = sys.stdin.readline
N,M,S=list(map(int,input().split()))
E=[[] for i in range(N+1)]
for i in range(M):
u,v,a,b=list(map(int,input().split()))
E[u].append((v,a,b))
E[v].append((u,a,b))
C=[(0,0)]+[tuple(map(int,input().split())) for i in range(N)]
DP=[[1<<64]*5001 for i in range... | import sys
input = sys.stdin.readline
N,M,S=list(map(int,input().split()))
E=[[] for i in range(N+1)]
for i in range(M):
u,v,a,b=list(map(int,input().split()))
E[u].append((v,a,b))
E[v].append((u,a,b))
C=[(0,0)]+[tuple(map(int,input().split())) for i in range(N)]
DP=[[1<<60]*5001 for i in range... | p02703 |
import sys
input = sys.stdin.readline
def main():
n,m,s=map(int,input().split())
uvab=[list(map(int,input().split())) for _ in range(m)]
cd=[list(map(int,input().split())) for _ in range(n)]
g=[[]for _ in range(n)]
for u,v,a,b in uvab:
g[u-1].append([v-1,a,b])
g[v-1].append([u-1,a,b])
impo... | import sys
input = sys.stdin.readline
def main():
n,m,s=map(int,input().split())
uvab=[list(map(int,input().split())) for _ in range(m)]
cd=[list(map(int,input().split())) for _ in range(n)]
g=[[]for _ in range(n)]
for u,v,a,b in uvab:
g[u-1].append((v-1,a,b))
g[v-1].append((u-1,a,b))
impo... | p02703 |
n,m,s=list(map(int,input().split()))
uvab=[list(map(int,input().split())) for _ in range(m)]
cd=[list(map(int,input().split())) for _ in range(n)]
g=[[] for _ in range(n)]
for u,v,a,b in uvab:
u,v=u-1,v-1
g[u].append([v,a,b])
g[v].append([u,a,b])
#「現在いる頂点、現在持っている銀貨枚数」を頂点とし、ダイクストラ法でとく。
from heapq ... | n,m,s=list(map(int,input().split()))
uvab=[list(map(int,input().split())) for _ in range(m)]
cd=[list(map(int,input().split())) for _ in range(n)]
g=[[] for _ in range(n)]
maxs=0
for u,v,a,b in uvab:
u,v=u-1,v-1
g[u].append([v,a,b])
g[v].append([u,a,b])
maxs+=a
#「現在いる頂点、現在持っている銀貨枚数」を頂点とし、ダイク... | p02703 |
from heapq import heappop, heappush
import sys
def input():return sys.stdin.readline().strip()
def main():
N, M, S = list(map(int, input().split()))
to = [{} for _ in range(N)]
for _ in range(M):
u, v, a, b = list(map(int, input().split()))
u -= 1
v -= 1
to[u][... | from heapq import heappop, heappush
import sys
def input():return sys.stdin.readline().strip()
def main():
N, M, S = list(map(int, input().split()))
to = [{} for _ in range(N)]
for _ in range(M):
u, v, a, b = list(map(int, input().split()))
u -= 1
v -= 1
to[u][... | p02703 |
import heapq
INF = 10**20
N, M, S = list(map(int, input().split()))
adj = [[] for _ in range(N)]
for m in range(M):
u,v,a,b = list(map(int, input().split()))
u -= 1
v -= 1
adj[u].append((v,a,b))
adj[v].append((u,a,b))
C = []
D = []
for n in range(N):
c, d = list(map(int, input()... | import heapq
INF = 10**20
N, M, S = list(map(int, input().split()))
adj = [[] for _ in range(N)]
for m in range(M):
u,v,a,b = list(map(int, input().split()))
u -= 1
v -= 1
adj[u].append((v,a,b))
adj[v].append((u,a,b))
C = []
D = []
for n in range(N):
c, d = list(map(int, input()... | p02703 |
from heapq import*
(n,m,s),*t=[list(map(int,t.split()))for t in open(0)]
*e,=eval('[],'*8**6)
for u,v,a,b in t[:m]:
for i in range(2501-a):
e[(i+a)*51+u]+=(b,i*51+v),
e[(i+a)*51+v]+=(b,i*51+u),
for i,(c,d)in enumerate(t[m:],1):
for j in range(2501-c):
e[j*51+i]+=(d,(j+c)*51+i),
... | def main():
from heapq import heappush,heappop
(n,m,s),*t=[list(map(int,r.split()))for r in open(0)]
e=[[]for _ in range(8**6)]
for u,v,a,b in t[:m]:
for i in range(2501-a):
e[(i+a)*51+u]+=(b,i*51+v),
e[(i+a)*51+v]+=(b,i*51+u),
for i,(c,d)in enumerate(t[m:],1)... | p02703 |
import heapq
N, M, S = list(map(int, input().strip().split()))
graph = [[] for _ in range(N)]
for _ in range(M):
u, v, A, B = list(map(int, input().strip().split()))
u -= 1
v -= 1
graph[u].append((v, A, B))
graph[v].append((u, A, B))
exchanges = []
for _ in range(N):
C, D = list(map(int, input().... | import heapq
N, M, S = list(map(int, input().strip().split()))
graph = [[] for _ in range(N)]
for _ in range(M):
u, v, A, B = list(map(int, input().strip().split()))
u -= 1
v -= 1
graph[u].append((v, A, B))
graph[v].append((u, A, B))
exchanges = []
for _ in range(N):
C, D = list(map(int, input().... | p02703 |
def solve():
N,M,S = map(int,input().split())
UVAB = [tuple(map(int,input().split())) for i in range(M)]
CD = [tuple(map(int,input().split())) for i in range(N)]
es = [[] for _ in range(N)]
for u,v,a,b in UVAB:
u,v = u-1,v-1
es[u].append((v,a,b))
es[v].append((u,a,b... | def solve():
N,M,S = map(int,input().split())
UVAB = [tuple(map(int,input().split())) for i in range(M)]
CD = [tuple(map(int,input().split())) for i in range(N)]
es = [[] for _ in range(N)]
for u,v,a,b in UVAB:
u,v = u-1,v-1
es[u].append((v,a,b))
es[v].append((u,a,b... | p02703 |
def solve():
import sys
input = sys.stdin.readline
N,M,S = map(int,input().split())
UVAB = [tuple(map(int,input().split())) for i in range(M)]
CD = [tuple(map(int,input().split())) for i in range(N)]
es = [[] for _ in range(N)]
for u,v,a,b in UVAB:
u,v = u-1,v-1
es... | def solve():
import sys
input = sys.stdin.readline
N,M,S = map(int,input().split())
UVAB = [tuple(map(int,input().split())) for i in range(M)]
CD = [tuple(map(int,input().split())) for i in range(N)]
es = [[] for _ in range(N)]
for u,v,a,b in UVAB:
u,v = u-1,v-1
es... | p02703 |
import heapq
n, m, s = list(map(int, input().split()))
info = [list(map(int, input().split())) for i in range(m)]
change = [list(map(int, input().split())) for i in range(n)]
INF = 10 ** 18
graph = [[] for i in range(n)]
for u, v, cost, time in info:
u -= 1
v -= 1
graph[u].append((v, cost, ti... | import heapq
n, m, s = list(map(int, input().split()))
info = [list(map(int, input().split())) for i in range(m)]
change = [list(map(int, input().split())) for i in range(n)]
INF = 10 ** 18
MAX_ = 2600
graph = [[] for i in range(n)]
for u, v, cost, time in info:
u -= 1
v -= 1
graph[u].append... | p02703 |
class RangeMinimumQuery:
def __init__(self, n, F=min, e=float("inf"), fill=None):
self.n0 = 2**(n-1).bit_length()
self.F = F
self.e = e
if fill is None:
fill = e
self.data = [fill]*(2*self.n0)
def query(self, l,r):
l += self.n0
r +=... | max_s = 2500
n,m,s = list(map(int, input().split()))
s = min(s, max_s)
conv = lambda i,j : i*10000+j
G = [[] for i in range(conv(n-1, max_s)+1)]
for i in range(m):
u,v,a,b = list(map(int, input().split()))
u,v = u-1, v-1
for j in range(max_s+1):
if j-a >= 0:
G[conv(u,j)].ap... | p02703 |
import heapq
N, M, S = map(int, input().split())
uvab = [list(map(int, input().split())) for _ in range(M)]
cd = [list(map(int, input().split())) for _ in range(N)]
for i in range(M):
uvab[i][0] -= 1
uvab[i][1] -= 1
railways = [[] for _ in range(N)]
max_a = 0
for u, v, a, b in uvab:
railwa... | import heapq
N, M, S = map(int, input().split())
uvab = [list(map(int, input().split())) for _ in range(M)]
cd = [list(map(int, input().split())) for _ in range(N)]
for i in range(M):
uvab[i][0] -= 1
uvab[i][1] -= 1
railways = [[] for _ in range(N)]
max_a = 0
for u, v, a, b in uvab:
railwa... | p02703 |
from queue import PriorityQueue
from collections import defaultdict
n, m, s = list(map(int, input().split()))
graph = defaultdict(dict)
for i in range(m):
u, v, a, b = list(map(int, input().split()))
graph[u][v] = (a, b)
graph[v][u] = (a, b)
town = [None]*(n+1)
for i in range(n):
c, d = li... | from queue import PriorityQueue
from collections import defaultdict
from heapq import heappush, heappop
n, m, s = list(map(int, input().split()))
graph = defaultdict(dict)
for i in range(m):
u, v, a, b = list(map(int, input().split()))
graph[u][v] = (a, b)
graph[v][u] = (a, b)
town = [None]*(n+... | p02703 |
import heapq
def main():
N, M, S = list(map(int, input().split()))
AB = [[] for _ in range(N)]
maxA = 0
for _ in range(M):
u, v, a, b = list(map(int, input().split()))
AB[u - 1].append((a, b, v - 1))
AB[v - 1].append((a, b, u - 1))
maxA = max(maxA, a)
for ... | import heapq
def main():
N, M, S = list(map(int, input().split()))
AB = [[] for _ in range(N)]
maxA = 0
for _ in range(M):
u, v, a, b = list(map(int, input().split()))
AB[u - 1].append((a, b, v - 1))
AB[v - 1].append((a, b, u - 1))
maxA = max(maxA, a)
for ... | p02703 |
import heapq
def main():
N, M, S = list(map(int, input().split()))
AB = [[] for _ in range(N)]
maxA = 0
for _ in range(M):
u, v, a, b = list(map(int, input().split()))
AB[u - 1].append((a, b, v - 1))
AB[v - 1].append((a, b, u - 1))
maxA = max(maxA, a)
for ... | import heapq
def main():
N, M, S = list(map(int, input().split()))
AB = [[] for _ in range(N)]
maxA = 0
for _ in range(M):
u, v, a, b = list(map(int, input().split()))
AB[u - 1].append((a, b, v - 1))
AB[v - 1].append((a, b, u - 1))
maxA = max(maxA, a)
for ... | p02703 |
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush... |
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappu... | p02703 |
# 解説と提出#12551970を参考に作成
# 今いる都市と銀貨の所持数を状態として、
# ①その都市から移動可能な別の都市に移動する
# ②金貨を銀貨に交換する
# のどちらかを行い、実施後の(同都市・同所持銀貨枚数での)最小時間を計測していく。
# 最小時間が更新された場合、さらにその状態から①・②を行う。
# これによって全都市・全銀貨所持枚数毎の最小時間を割り出す。
# 都市の銀貨所持枚数毎の最小時間の中での最小時間がその都市へ行くための最小時間になる。
# ※1: 都市への移動は移動可能な枚数の銀貨を持っている場合のみ可能
# ※2: 銀貨の最大所持枚数は (N - 1) * max(A... | # 解説と提出#12551970を参考に作成
# 今いる都市と銀貨の所持数を状態として、
# ①その都市から移動可能な別の都市に移動する
# ②金貨を銀貨に交換する
# のどちらかを行い、実施後の(同都市・同所持銀貨枚数での)最小時間を計測していく。
# 最小時間が更新された場合、さらにその状態から①・②を行う。
# これによって全都市・全銀貨所持枚数毎の最小時間を割り出す。
# 都市の銀貨所持枚数毎の最小時間の中での最小時間がその都市へ行くための最小時間になる。
# ※1: 都市への移動は移動可能な枚数の銀貨を持っている場合のみ可能
# ※2: 銀貨の最大所持枚数は (N - 1) * max(A... | p02703 |
# ABC 164 E 草案
import sys
sys.setrecursionlimit(10**6)
n,m,s= list(map(int, input().split()))
g= [list(map(int, input().split())) for i in range(m)]
# 両替所
c= [list(map(int, input().split())) for i in range(n)]
x=2501
# 作るグラフ (点,所有銀貨,必要時間)
gg=[[[] for i in range(x)] for i in range(n)]
for i in range(n):
... | # ABC 164 E 草案
import sys
sys.setrecursionlimit(10**6)
n,m,s= list(map(int, input().split()))
g= [list(map(int, input().split())) for i in range(m)]
# 両替所
c= [list(map(int, input().split())) for i in range(n)]
x=2501
# 作るグラフ (点,所有銀貨,必要時間)
gg=[[[] for i in range(x)] for i in range(n)]
for i in range(n):
... | p02703 |
from heapq import heappush, heappop
infi = 10 ** 20
n, m, s = map(int, input().split())
s = min(s, 2500)
edges = [[] for _ in range(51 * 2501 + 1)]
# edge:1-50, max silver=0-2500
for _ in range(m):
u, v, a, b = map(int, input().split())
for i in range(a, 2501):
edges[v + 50 * i].append(... | # snuke解説板
from heapq import heappush, heappop
infi = 10 ** 20
n, m, s = map(int, input().split())
s = min(s, n * 50)
edges = [[] for _ in range(n + 1)]
# edge:1-50, max silver=0-2500
for _ in range(m): # a円, b分
u, v, a, b = map(int, input().split())
edges[v].append((u, a, b))
edges[u].ap... | p02703 |
while int(eval(input())) > 0:
s = sorted(map(int, input().split()))
print((min(abs(a - b) for (a, b) in zip(s, s[1:])))) | while True:
if int(eval(input())) == 0:
break
s = sorted(map(int, input().split()))
r = min(abs(x - y) for (x, y) in zip(s, s[1:]))
print(r) | p01093 |
while True:
n = int(eval(input()))
if n==0: break
l = list(map(int,input().split()))
r = []
for i in range(n):
for j in range(i+1,n):
r += [abs(l[i]-l[j])]
print((min(r))) | while True:
n = int(eval(input()))
if n==0: break
l = sorted(list(map(int,input().split())))
r = []
for i in range(n-1):
r += [l[i+1]-l[i]]
print((min(r))) | p01093 |
def f(x,y):
global B
B[y][x]^=1
if y>0: B[y-1][x]^=1
if y<9: B[y+1][x]^=1
if x>0: B[y][x-1]^=1
if x<9: B[y][x+1]^=1
return (x,y)
R=list(range(10))
n=eval(input())
for _ in [0]*n:
A=[list(map(int,input().split())) for _ in R]
for p in range(1024):
B=[e[:] for e in A]
x=[]
for... | def f(x,y):
global B
B[y][x]^=1
if y>0: B[y-1][x]^=1
if y<9: B[y+1][x]^=1
if x>0: B[y][x-1]^=1
if x<9: B[y][x+1]^=1
return (x,y)
R=list(range(10))
n=eval(input())
for _ in [0]*n:
A=[list(map(int,input().split())) for _ in R]
for p in range(1024):
B=[e[:] for e in A]
x=[]
for... | p00131 |
N = int(eval(input()))
A = list(map(int,input().split()))
ans = 0
for a in A:
ans ^= a
M = 2**60-1
b = M^ans
for i in range(N):
A[i] &= b
A.sort(reverse=True)
for i in range(min(60,N)):
a = A[i]
if a == 0:
break
l = len(bin(a))
for j in range(N):
if j==i:
... | N = int(eval(input()))
A = list(map(int,input().split()))
ans = 0
for a in A:
ans ^= a
M = 2**60-1
b = M^ans
for i in range(N):
A[i] &= b
A.sort(reverse=True)
for i in range(min(60,N)):
a = A[i]
if a == 0:
break
l = len(bin(a))-3
for j in range(N):
if j==i:
... | p02914 |
N=int(eval(input()))
alist=list(map(int,input().split()))
max_digit=60
mat=[]
sum_digit=[0]*max_digit
for a in alist:
array=[]
for j in range(max_digit):
m=a&1
array.append(m)
sum_digit[max_digit-1-j]+=m
a>>=1
array.reverse()
mat.append(array)
#print(mat)
#print(sum_di... | N=int(eval(input()))
alist=list(map(int,input().split()))
alist.sort(reverse=True)
max_digit=60
mat=[]
sum_digit=[0]*max_digit
for a in alist:
array=[]
for j in range(max_digit):
m=a&1
array.append(m)
sum_digit[max_digit-1-j]+=m
a>>=1
array.reverse()
mat.append(array)
... | p02914 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.