Facebook Hacker Cup 2019 Round 1

1_graphs_as_a_service.py

T = input()
for t in range(T):
  N, M = map(int, raw_input().split())
  R = []
  for _ in range(M):
    X, Y, Z = map(int, raw_input().split())
    R += [(X-1, Y-1, Z)]

  oo = 999999999
  G = [[oo]*N for _ in range(N)]
  for r in R:
    G[r[0]][r[1]] = r[2]
    G[r[1]][r[0]] = r[2]
  for i in range(N):
    for j in range(N):
      for k in range(N):
        G[j][k] = min(G[j][k], G[j][i]+G[i][k])
  ok = True
  for r in R:
    if G[r[0]][r[1]] != r[2]:
      ok = False
  print "Case #%d:"%(t+1),
  if ok:
    print len(R)
    for r in R:
      print r[0]+1, r[1]+1, r[2]
  else:
    print "Impossible"

2_class_treasurer.py

T = input()
for t in range(T):
  N, K = map(int, raw_input().split())
  V = list(raw_input())
  c = 0
  ans = 0
  for i in xrange(N-1, -1, -1):
    c += 1 if V[i]=="B" else -1
    if c>K:
      ans += 1<<(i+1)
      c -= 2
    c = max(c, 0)
  print "Case #%d: %d" % (t+1, ans%(10**9+7))