結果

問題 No.2630 Colorful Vertices and Cheapest Paths
ユーザー katonyonko
提出日時 2024-02-16 22:34:21
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 2,428 ms / 2,500 ms
コード長 3,346 bytes
コンパイル時間 247 ms
コンパイル使用メモリ 82,672 KB
実行使用メモリ 170,912 KB
最終ジャッジ日時 2024-09-28 21:10:02
合計ジャッジ時間 33,449 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

diff # 

import io
import sys
from collections import defaultdict, deque, Counter
from itertools import permutations, combinations, accumulate
from heapq import heappush, heappop
from bisect import bisect_right, bisect_left
from math import gcd
import math

_INPUT = """\
6
4 4
1 2
2 3
3 4
4 1
1 1 2 3
1 2 3 4 5 6 7 8 9 10
3
1 2
1 3
1 4
2 0
1 1
1 100 100 100 100 100 100 100 100 100
1
1 2
5 5
1 2
2 3
2 3
3 4
4 5
1 4 5 9 10
1000000000 1 1 1000000000 1000000000 1 1 1 1000000000 1000000000
4
1 5
2 3
1 2
1 5
"""

class UnionFind():
  def __init__(self, n):
    self.n = n
    self.parents = [-1] * n
  def find(self, x):
    if self.parents[x] < 0:
      return x
    else:
      self.parents[x] = self.find(self.parents[x])
      return self.parents[x]
  def union(self, x, y):
    x = self.find(x)
    y = self.find(y)
    if x == y:
      return
    if self.parents[x] > self.parents[y]:
       x, y = y, x
    self.parents[x] += self.parents[y]
    self.parents[y] = x
  def size(self, x):
    return -self.parents[self.find(x)]
  def same(self, x, y):
    return self.find(x) == self.find(y)
  def members(self, x):
    root = self.find(x)
    return [i for i in range(self.n) if self.find(i) == root]
  def roots(self):
    return [i for i, x in enumerate(self.parents) if x < 0]
  def group_count(self):
    return len(self.roots())
  def all_group_members(self):
    return {r: self.members(r) for r in self.roots()}
  def __str__(self):
    return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

def input():
  return sys.stdin.readline()[:-1]


def solve(test):
  N,M=map(int, input().split())
  G=[[] for _ in range(N)]
  for _ in range(M):
    a,b=map(lambda x:int(x)-1, input().split())
    G[a].append(b)
    G[b].append(a)
  C=list(map(lambda x:int(x)-1, input().split()))
  W=list(map(int,input().split()))
  tmp=[UnionFind(N) for _ in range(1<<10)]
  cost=[sum(W[i] for i in range(10) if (_>>i)&1) for _ in range(1<<10)]
  for i in range(1<<10):
    c=[1 if (i>>j)&1 else 0 for j in range(10)]
    used=[0]*N
    parent=[-1]*N
    for j in range(N):
      if used[j]==1: continue
      st=[j]
      while st:
        v=st.pop()
        if used[v]==1: continue
        used[v]=1
        if c[C[v]]==0: continue
        for u in G[v]:
          if u==parent[v] or c[C[u]]==0: continue
          parent[u]=v
          tmp[i].union(v,u)
          st.append(u)
  Q=int(input())
  for _ in range(Q):
    u,v=map(lambda x:int(x)-1, input().split())
    ans=1<<40
    for i in range(1<<10):
      if tmp[i].same(u,v):
        ans=min(ans,cost[i])
    if ans==1<<40: ans=-1
    print(ans)

def random_input():
  from random import randint,shuffle
  N=randint(1,10)
  M=randint(1,N)
  A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)]
  shuffle(A)
  return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3

def simple_solve():
  return []

def main(test):
  if test==0:
    solve(0)
  elif test==1:
    sys.stdin = io.StringIO(_INPUT)
    case_no=int(input())
    for _ in range(case_no):
      solve(0)
  else:
    for i in range(1000):
      sys.stdin = io.StringIO(random_input())
      x=solve(1)
      y=simple_solve()
      if x!=y:
        print(i,x,y)
        print(*[line for line in sys.stdin],sep='')
        break

#0:提出用、1:与えられたテスト用、2:ストレステスト用
main(0)
0