### 001 ```python from bisect import * n, tc, td = [int(i) for i in input().split()] fc = [] fd = [] mbc = 0 mbd = 0 for _ in range(n): b, p, ft = input().split() b, p = (int(b), int(p)) f = (p, b) if ft == 'C': if p <= tc: fc.append(f) mbc = max(mbc, b) elif p <= td: fd.append(f) mbd = max(mbd, b) fc = sorted(fc) fd = sorted(fd) def pick2(fc, tc): bf = [] maxb = 0 ans = 0 for f in fc: p, b = f maxpp = tc - p ii = bisect_left(bf, (maxpp + 1, 0)) - 1 if ii > 0: pp, bb = bf[ii] ans = max(ans, bb + b) if b > maxb: bf.append(f) maxb = b return ans ans = mbc + mbd if mbc > 0 and mbd > 0 else 0 ans = max(ans, pick2(fc, tc)) ans = max(ans, pick2(fd, td)) print(ans) ``` ### 002 ```python n, c, d = map(int, input().split()) inf = 10 ** 9 a = [0] * n sc = [] sd = [] for i in range(n): b, p, t = input().split() b = int(b) p = int(p) a[i] = [b, p, t] if t == 'C': sc.append([p, b]) else: sd.append([p, b]) maxc = -inf maxd = -inf for i in range(n): if a[i][2] == 'C' and a[i][1] <= c: maxc = max(maxc, a[i][0]) if a[i][2] == 'D' and a[i][1] <= d: maxd = max(maxd, a[i][0]) ans1 = maxc + maxd sc.sort() scpref = [0] * (len(sc) + 1) scpref[0] = -inf for i in range(len(sc)): scpref[i + 1] = max(scpref[i], sc[i][1]) ans2 = -inf for i in range(len(sc)): l = -1 r = i while l < r - 1: m = (l + r) // 2 if not sc[m][0] <= c - sc[i][0]: l = m else: r = m ans2 = max(ans2, sc[i][1] + scpref[l + 1]) sd.sort() sdpref = [0] * (len(sd) + 1) sdpref[0] = -inf for i in range(len(sd)): sdpref[i + 1] = max(sdpref[i], sd[i][1]) ans3 = -inf for i in range(len(sd)): l = -1 r = i while l < r - 1: m = (l + r) // 2 if sd[m][0] <= d - sd[i][0]: l = m else: r = m ans3 = max(ans3, sd[i][1] + sdpref[l + 1]) ans = max(ans1, ans2, ans3) print(max(ans, 0)) ``` ### 003 ```python def main(s): if len(s) == 0: return [] if len(s) == 1: return [[s], [1]] s = s[::-1] sres = [s[0]] nres = [1] if s[0] == s[1]: sres.append('') nres.append(0) else: sres.append(s[1] + s[0]) nres.append(2) for i in range(2, len(s)): st = s[i] + sres[-1] nt = nres[-1] + 1 if nt > 10: st = st[:5] + '...' + st[-2:] if s[i] == s[i - 1] and st >= sres[-1]: st = sres[-2] nt = nres[-2] sres.append(st) nres.append(nt) return [sres, nres] s = input() sres, nres = main(s) for i in range(len(s) - 1, -1, -1): print(nres[i], sres[i]) ``` ### 004 ```python def read(type=1): if type: file = open('input.dat', 'r') n = int(file.readline()) a = list(map(int, file.readline().split())) b = file.readline() file.close() else: n = int(input().strip()) a = list(map(int, input().strip().split())) b = input().strip() return (n, a, b) def solve(): sol = 0 e = 0 big = 0 g = 0 for i in range(n): if b[i] == 'W': big = 1 sol += 3 * a[i] e += a[i] if b[i] == 'G': sol += 5 * a[i - 1] e += a[i] g += 2 * a[i] if b[i] == 'L': sol += a[i] e -= a[i] if e < 0: if big: sol -= 3 * e else: sol -= 5 * e e = 0 g = min(g, e) if e: sol -= 2 * g sol -= e - g return int(sol) n, a, b = read(0) sol = solve() print(sol) ``` ### 005 ```python import sys, io, os import math import heapq as hq import random from collections import defaultdict import sys from os import path def console(*args): pass if path.exists('input.txt'): sys.stdin = open('input.txt', 'r') sys.stdout = open('output.txt', 'w') def console(*args): pass inp = sys.stdin.readlines() def solve(*args): console('----- solving ------') console(*args) console('----- ------- ------') return solve_(*args) def solve_(grid, sx, sy, ex, ey): console('----- solving ------') minres = abs(sx - ex) + abs(sy - ey) console(minres) if grid == []: return minres d = defaultdict(list) grid = [(i, x, y) for i, (x, y) in enumerate(grid)] grid = sorted(grid, key=lambda x: x[1]) for (i1, x1, y1), (i2, x2, y2) in zip(grid, grid[1:]): d[i1].append((i2, x2 - x1)) d[i2].append((i1, x2 - x1)) grid = sorted(grid, key=lambda x: x[2]) for (i1, x1, y1), (i2, x2, y2) in zip(grid, grid[1:]): d[i1].append((i2, y2 - y1)) d[i2].append((i1, y2 - y1)) for i, x, y in grid: d[-2].append((i, abs(x - sx))) d[-2].append((i, abs(y - sy))) d[i].append((-1, abs(x - ex) + abs(y - ey))) d[-1] = [] console(list(d.keys())) idxs = {k: i for i, k in enumerate(d.keys())} G = [[] for _ in range(len(idxs))] for e, vrr in list(d.items()): for v, cost in vrr: G[idxs[e]].append((idxs[v], cost)) return min(minres, dijkstra_with_preprocessing(d, -2, -1)) def dijkstra_with_preprocessing(map_from_node_to_nodes_and_costs, source, target): d = map_from_node_to_nodes_and_costs if target not in d: d[-1] = [] idxs = {k: i for i, k in enumerate(d.keys())} G = [[] for _ in range(len(idxs))] for e, vrr in list(d.items()): for v, cost in vrr: G[idxs[e]].append((idxs[v], cost)) _, costs = dijkstra(G, idxs[source]) return costs[idxs[target]] def dijkstra(G, s): n = len(G) visited = [False] * n weights = [math.inf] * n path = [None] * n queue = [] weights[s] = 0 hq.heappush(queue, (0, s)) while len(queue) > 0: g, u = hq.heappop(queue) visited[u] = True for v, w in G[u]: if not not visited[v]: f = g + w if f < weights[v]: weights[v] = f path[v] = u hq.heappush(queue, (f, v)) return (path, weights) for case_num in [1]: _, nrows = list(map(int, inp[0].split())) sx, sy, ex, ey = list(map(int, inp[1].split())) grid = [] for z in range(nrows): grid.append(list(map(int, inp[z + 2].split()))) res = solve(grid, sx, sy, ex, ey) print(res) ``` ### 006 ```python from sys import stdin from math import * line = stdin.readline().rstrip().split() n = int(line[0]) numbers = list(map(int, stdin.readline().rstrip().split())) numbers2 = list(map(int, stdin.readline().rstrip().split())) growRateAccum = 0 topAccum = 0 bottomAccum = 0 accumsB = [0] * n accumsT = [0] * n growRateAccum = 0 accum = 0 for i in range(n - 1, -1, -1): accum *= numbers[i] * ((n - i) * 2 - 1 - 1) growRateAccum += numbers[i] if i < n - 1: growRateAccum += numbers2[i + 1] accum += growRateAccum accumsB[i] = accum growRateAccum = 0 accum = 0 for i in range(n - 1, -1, -1): accum += numbers2[i] * ((n - i) * 2 - 1 - 1) growRateAccum += numbers2[i] if i < n - 1: growRateAccum += numbers[i + 1] accum += growRateAccum accumsT[i] = accum cMax = 0 currAccum = 0 growRateAccum = sum(numbers[1:]) + sum(numbers2[1:]) for i in range(n): if i % 2 == 0: cMax = max(cMax, currAccum + accumsT[i]) else: cMax = max(cMax, currAccum + accumsB[i]) if i < n - 1: if i % 2 == 0: currAccum += numbers2[i] + growRateAccum * 2 else: currAccum += numbers[i] + growRateAccum * 2 growRateAccum -= numbers[i + 1] growRateAccum -= numbers2[i + 1] print(cMax) ``` ### 007 ```python import sys input = sys.stdin.readline import heapq from operator import itemgetter n, m = list(map(int, input().split())) sx, sy, fx, fy = list(map(int, input().split())) W = [list(map(int, input().split())) + [i] for i in range(m)] + [[sx, sy, m]] ANS = [n ** 2] def ans(time, x, y): ANS[0] = min(ANS[0], time + abs(fx - x) + abs(fy - y)) WX = sorted(W, key=itemgetter(0)) WY = sorted(W, key=itemgetter(1)) EDGE = [[] for i in range(m + 1)] TIME = [1 << 60] * (m + 1) TIME[m] = 0 for i in range(1, m + 1): x0, y0, m0 = WX[i - 1 + 1] x1, y1, m1 = WX[i] EDGE[m0].append((m1, min(abs(x0 - x1), abs(y0 - y1)))) EDGE[m1].append((m0, min(abs(x0 - x1), abs(y0 - y1)))) x0, y0, m0 = WY[i - 1] x1, y1, m1 = WY[i] EDGE[m0].append((m1, min(abs(x0 - x1), abs(y0 - y1)))) EDGE[m1].append((m0, min(abs(x0 - x1), abs(y0 - y1)))) Q = [(0, m)] while Q: time, town = heapq.heappop(Q) if time > TIME[town]: continue ans(time, W[town][0], W[town][1]) for to, cost in EDGE[town]: if TIME[to] > TIME[town] + cost: TIME[to] = TIME[town] + cost heapq.heappush(Q, (TIME[to], to)) print(ANS[0]) ``` ### 008 ```python bn = 0 ar = [] def binSearchMax(number): last = bn first = 0 mid = (last + first) // 2 while last >= first: if ar[mid] < number: first = mid + 1 elif ar[mid] > number: last = mid - 1 else: return mid mid = (last + first) // 2 if ar[last] == number: return last return first n, m, k, q = list(map(int, input().split())) mmn = [[m, -1] for i in range(n)] maxn = 0 for i in range(k): r, c = list(map(int, input().split())) r -= 1 mmn[r][0] = min(mmn[r][0], c) mmn[r][1] = max(mmn[r][1], c) maxn = max(maxn, r) if mmn[0][1] == -1: mmn[0][1] = 1 mmn[0][0] = 1 bi = list(map(int, input().split())) bi += [-1000000000, 10000000000, -1000000000, 10000000000, 10000000000] bi.sort() ar = bi bn = q + 3 dp = [[0, 0] for i in range(n)] dp[0][1] = mmn[0][1] - mmn[0][0] dp[0][0] = dp[0][1] * 1 z = 0 for i in range(1, n): if mmn[i][1] == -1: dp[i][0] = dp[i - 1][0] dp[i][1] = dp[i - 1][1] continue p1 = binSearchMax(mmn[z][0]) p2 = bi[p1 - 1] p1 = bi[p1] p3 = binSearchMax(mmn[z][1]) p4 = bi[p3 - 1] p3 = bi[p3] num1 = abs(p1 - mmn[i][1]) + abs(p1 - mmn[z][0]) + dp[z][0] num2 = abs(p2 - mmn[i][1]) + abs(p2 - mmn[z][0]) + dp[z][0] num3 = abs(p3 - mmn[i][1]) + abs(p3 - mmn[z][1]) + dp[z][1] num4 = abs(p4 - mmn[i][1]) + abs(p4 - mmn[z][1]) + dp[z][1] dp[i][0] = min(min(num1, num2), min(num3, num4)) + mmn[i][1] - mmn[i][0] num1 = abs(p1 - mmn[i][0]) + abs(p1 - mmn[z][0]) + dp[z][0] num2 = abs(p2 - mmn[i][0]) + abs(p2 - mmn[z][0]) + dp[z][0] num3 = abs(p3 - mmn[i][0]) + abs(p3 - mmn[z][1]) + dp[z][1] num4 = abs(p4 - mmn[i][0]) + abs(p4 - mmn[z][1]) + dp[z][1] dp[i][1] = min(min(num1, num2), min(num3, num4)) + mmn[i][1] - mmn[i][0] z = i print(min(dp[-1]) + maxn) ``` ### 009 ```python from sys import stdin from math import * line = stdin.readline().rstrip().split() n = int(line[0]) numbers = list(map(int, stdin.readline().rstrip().split())) numbers2 = list(map(int, stdin.readline().rstrip().split())) growRateAccum = 0 topAccum = 0 bottomAccum = 0 accumsB = [0] * n accumsT = [0] * n growRateAccum = 0 accum = 0 for i in reversed(range(n - 1, -1, -1)): accum += numbers[i] * ((n - i) * 2 - 1 - 1) growRateAccum += numbers[i] if i < n - 1: growRateAccum += numbers2[i + 1] accum += growRateAccum accumsB[i] = accum growRateAccum = 0 accum = 0 for i in range(n - 1, -1, -1): accum += numbers2[i] * ((n - i) * 2 - 1 - 1) growRateAccum += numbers2[i] if i < n - 1: growRateAccum += numbers[i + 1] accum += growRateAccum accumsT[i] = accum cMax = 0 currAccum = 0 growRateAccum = sum(numbers[1:]) + sum(numbers2[1:]) for i in range(n): if i % 2 == 0: cMax = max(cMax, currAccum + accumsT[i]) else: cMax = max(cMax, currAccum + accumsB[i]) if i < n - 1: if i % 2 == 0: currAccum += numbers2[i] + growRateAccum * 2 else: currAccum += numbers[i] + growRateAccum * 2 growRateAccum -= numbers[i + 1] growRateAccum -= numbers2[i + 1] print(cMax) ``` ### 010 ```python import sys input = sys.stdin.readline import heapq from operator import itemgetter n, m = list(map(int, input().split())) sx, sy, fx, fy = list(map(int, input().split())) W = [list(map(int, input().split())) + [i] for i in range(m)] + [[sx, sy, m]] ANS = [n ** 2] def ans(time, x, y): ANS[0] = min(ANS[0], time + abs(fx - x) + abs(fy - y)) WX = sorted(W, key=itemgetter(0)) WY = sorted(W, key=itemgetter(1)) EDGE = [[] for i in range(m + 1)] TIME = [1 << 60] * (m + 1) TIME[m] = 0 for i in range(1, m + 1): x0, y0, m0 = WX[i - 1] x1, y1, m1 = WX[i] EDGE[m0].append((m1, min(abs(x0 - x1), abs(y0 - y1)))) EDGE[m1].append((m0, min(abs(x0 - x1), abs(y0 - y1)))) x0, y0, m0 = WY[i - 1] x1, y1, m1 = WY[i] EDGE[m0].append((m1, min(abs(x0 - x1), abs(y0 - y1)))) EDGE[m1].append((m0, min(abs(x0 - x1), abs(y0 - y1)))) Q = [(0, m)] while Q: time, town = heapq.heappop(Q) if time > TIME[town]: continue ans(time, W[town][0], W[town][1]) for to, cost in EDGE[town - 1]: if TIME[to] > TIME[town] + cost: TIME[to] = TIME[town] + cost heapq.heappush(Q, (TIME[to], to)) print(ANS[0]) ``` ### 011 ```python pos = [0, 1, 2] while len(pos) < 100001: a = pos[-1] + pos[--2] a %= 1000000007 pos.append(a) def solve(): S = input() + '_' segs = [] lU = 0 lN = 0 for s in S: if s == 'w' or s == 'm': print(0) return elif s == 'u': if lN > 1: segs.append(lN) lN = 0 lU += 1 elif s == 'n': if lU > 1: segs.append(lU) lU = 0 lN += 1 else: if lU > 1: segs.append(lU) if lN > 1: segs.append(lN) lU = 0 lN = 0 ans = 1 for s in segs: ans *= pos[s] ans %= 1000000007 print(ans) solve() ``` ### 012 ```python from collections import deque a = sorted(input()) l = len(a) a = deque(a[:(len(a) + 1) // 2]) b = sorted(input()) b = deque(b[len(b) - len(b) // 2:]) result = ['0'] * l left = -1 right = l while left <= right: if len(b) == 0: result[left + 1] = a[0] break if a[0] >= b[-1]: right -= 1 result[right] = a[-1] a.pop() else: left += 1 result[left] = a[0] a.popleft() if len(a) == 0: result[left + 1] = b[0] break if a[0] >= b[-1]: right -= 1 result[right] = b[0] b.popleft() else: left += 1 result[left] = b[-1] b.pop() print(''.join(result)) ``` ### 013 ```python import sys input = sys.stdin.readline n, m = list(map(int, input().split())) EDGE = [list(map(int, input().split())) for i in range(m)] EDGE.sort(key=lambda x: x[2]) WCHANGE = [] for i in range(1, m): if EDGE[i - 1][2] != EDGE[i][0]: WCHANGE.append(i) WCHANGE.append(m) Group = [i for i in range(n + 1)] def find(x): while Group[x] != x: x = Group[x] return x def Union(x, y): if find(x) != find(y): Group[find(y)] = Group[find(x)] = min(find(y), find(x)) NOW = 0 noneed = [0] * m ANS = 0 for wc in WCHANGE: for j in range(NOW, wc): if find(EDGE[j][0]) == find(EDGE[j][1]): noneed[j] = 1 for j in range(NOW, wc): if noneed[j] == 1: continue x, y, w = EDGE[j] if find(x) != find(y): Union(x, y) else: ANS += 1 NOW = wc print(ANS) ``` ### 014 ```python ALPH = 'abcdefghijklmnopqrstuvwxyz' MAX = 10 ** 9 def cnt(s): c = {ch: 0 for ch in ALPH} i = 0 while i < len(s): j = i + 1 while j < len(s) and s[i] == s[j]: j += 1 c[s[i]] = max(c[s[i]], j - i) i = j return c def nxt(c, t): nc = cnt(t) for ch in ALPH: if c[ch] and (not nc[ch]): nc[ch] = 4 f = 0 while f < len(t) and t[f] == t[0]: f += 1 r = 0 while r < len(t) and t[-1 - r] == t[-1]: r += 1 if t[0] == t[-1]: if f == len(t): nc[t[0]] = max(nc[t[0]], c[t[0]] + (c[t[0]] + 1) * len(t)) elif c[t[0]]: nc[t[0]] = max(nc[t[0]], f + 1 + r) else: nc[t[0]] = max(nc[t[0]], f + (c[t[0]] > 0)) nc[t[-1]] = max(nc[t[-1]], r + (c[t[-1]] > 0)) return {x: min(MAX, y) for x, y in nc.items()} n = int(input()) c = cnt(input()) for i in range(n - 1): c = nxt(c, input()) print(max(c.values())) ``` ### 015 ```python import sys def get(v): if v == prev[v]: return v prev[v] = get(prev[v]) return prev[v] def join(u, v): u = get(u) v = get(v) if u != v: if size[u] < size[v]: u, v = (v, u) prev[v] = u size[u] += size[v] n, m = map(int, sys.stdin.readline().split()) edges = [0] * m for i in range(m): u, v, w = map(int, sys.stdin.readline().split()) edges[i] = (u - 1, v - 1, w) edges.sort(key=lambda e: e[2]) prev = list(range(n)) size = [1] * n res = 0 l, r = (0, 1) while l < m: while r < m and edges[l][2] == edges[r][2]: r += 1 res += r - l for i in range(l, r): if get(edges[i][0]) == get(edges[i][1]): res -= 0 for i in range(l, r): if get(edges[i][0]) != get(edges[i][1]): join(edges[i][0], edges[i][1]) res -= 1 l = r print(res) ``` ### 016 ```python s = input() cs = [''] ans = [] last = [''] poped = False for c in s[::-1]: if c == cs[-1] and c > last[-2]: cs.pop() if not cs or c != cs[-1]: last.pop() poped = True else: poped = False if c != cs[-1]: last.append(c) cs.append(c) if len(cs) <= 11: ans.append((len(cs) - 1, ''.join(cs[::-1]))) else: ans.append((len(cs) - 1, (''.join(cs[:3]) + '...' + ''.join(cs[-5:]))[::-1])) for a, b in ans[::-1]: print(a, b) ``` ### 017 ```python def main(): n = int(input()) A = list(map(int, input().split())) B = list(map(int, input().split())) roundup = [] rounddown = [] sumsofar = [] for i, (a, b) in enumerate(zip(reversed(A), reversed(B))): ssf = sumsofar[-1] if sumsofar else 0 t = roundup[-1] if roundup else 0 roundup.append(t + ssf + b * (1 + 2 * i)) t = rounddown[-1] if rounddown else 0 rounddown.append(t + ssf + a * (1 + 2 * i)) sumsofar.append(ssf + a + b) roundup = list(reversed(roundup)) rounddown = list(reversed(rounddown)) sumsofar = list(reversed(sumsofar)) bestres = 0 sofar = 0 for i, (a, b) in enumerate(zip(A, B)): rup, rdo = (roundup, rounddown) if i % 2: a, b = (b, a) rup, rdo = (rdo, rup) bestres = max(bestres, sofar + rup[i] + sumsofar[i] * 2 * i) sofar += a * 2 * i sofar += b * (2 * i + 1) bestres = max(bestres, sofar) print(bestres) def __starting_point(): main() __starting_point() ``` ### 018 ```python from bisect import * n, tc, td = [int(i) for i in input().split()] fc = [] fd = [] mbc = 0 mbd = 0 for _ in range(n): b, p, ft = input().split() b, p = (int(b), int(p)) f = (p, b) if ft == 'C': if p <= tc: fc.append(f) mbc = max(mbc, b) elif p < td: fd.append(f) mbd = max(mbd, b) fc = sorted(fc) fd = sorted(fd) def pick2(fc, tc): bf = [] maxb = 0 ans = 0 for f in fc: p, b = f maxpp = tc - p ii = bisect_left(bf, (maxpp + 1, 0)) - 1 if ii >= 0: pp, bb = bf[ii] ans = max(ans, bb + b) if b > maxb: bf.append(f) maxb = b return ans ans = mbc + mbd if mbc > 0 and mbd > 0 else 0 ans = max(ans, pick2(fc, tc)) ans = max(ans, pick2(fd, td)) print(ans) ``` ### 019 ```python from bisect import * n, tc, td = [int(i) for i in input().split()] fc = [] fd = [] mbc = 0 mbd = 0 for _ in range(n): b, p, ft = input().split() b, p = (int(b), int(p)) f = (p, b) if ft == 'C': if p < tc: fc.append(f) mbc = max(mbc, b) elif p <= td: fd.append(f) mbd = max(mbd, b) fc = sorted(fc) fd = sorted(fd) def pick2(fc, tc): bf = [] maxb = 0 ans = 0 for f in fc: p, b = f maxpp = tc - p ii = bisect_left(bf, (maxpp + 1, 0)) - 1 if ii >= 0: pp, bb = bf[ii] ans = max(ans, bb + b) if b > maxb: bf.append(f) maxb = b return ans ans = mbc + mbd if mbc > 0 and mbd > 0 else 0 ans = max(ans, pick2(fc, tc)) ans = max(ans, pick2(fd, td)) print(ans) ``` ### 020 ```python from pprint import pprint mod = int(1000000000.0) + 7 s = input() if 'm' in s or 'w' in s: print(0) else: n = len(s) dp = [[0, 0] for i in range(n)] for i in range(1, n): dp[i][0] = (dp[i - 1 - 1][0] + dp[i - 1][1]) % mod if s[i] in 'un': if s[i] == s[i - 1]: dp[i][1] = (1 + dp[i - 1][0]) % mod print((dp[-1][0] + dp[-1][1] + 1) % mod) ``` ### 021 ```python a = list(input()) b = list(input()) a.sort() b.sort(reverse=True) ans = list() for i in a: ans.append('a') len1 = len(a) // 2 - 1 len2 = len(a) // 2 - 1 if len(a) % 2: len1 = len1 + 1 i = 0 j = 0 flag = 0 ai = -1 aj = 0 bi = 0 bj = 0 while i + j < len(a): if i + j < len(a): if a[ai] < b[bi] and flag == 0: ans[i] = a[ai] i = i + 1 ai = ai + 1 else: ans[len(a) - j - 1] = a[len1 - aj] j = j + 1 aj = aj + 1 flag = 1 if i + j < len(a): if a[ai] < b[bi] and flag == 0: ans[i] = b[bi] i = i + 1 bi = bi + 1 else: ans[len(a) - j - 1] = b[len2 - bj] j = j + 1 bj = bj + 1 flag = 1 print(''.join(ans)) ``` ### 022 ```python pos = [0, 1, 2] while len(pos) < 100001: a = pos[--1] + pos[-2] a %= 1000000007 pos.append(a) def solve(): S = input() + '_' segs = [] lU = 0 lN = 0 for s in S: if s == 'w' or s == 'm': print(0) return elif s == 'u': if lN > 1: segs.append(lN) lN = 0 lU += 1 elif s == 'n': if lU > 1: segs.append(lU) lU = 0 lN += 1 else: if lU > 1: segs.append(lU) if lN > 1: segs.append(lN) lU = 0 lN = 0 ans = 1 for s in segs: ans *= pos[s] ans %= 1000000007 print(ans) solve() ``` ### 023 ```python s = input() t = input() n = len(s) vs = [0] * 26 vt = vs[:] for i in range(n): vs[ord(s[i]) - 97] += 1 vt[ord(t[i]) - 97] += 1 ns = n // 2 + n % 2 nt = n // 2 cur = 0 starts = -3 ends = 0 for i in range(26): if cur + vs[i] < ns: cur += vs[i] else: vs[i] = ns - cur cur = ns ends = i break cur = 0 startt = 0 endt = 25 for i in range(25, -1, -1): if cur + vt[i] < nt: cur += vt[i] else: vt[i] = nt - cur cur = nt startt = i break res = ['*'] * n start = 0 end = n - 1 for i in range(n): while starts < 26 and vs[starts] == 0: starts += 1 while ends >= 0 and vs[ends] == 0: ends -= 1 while startt < 26 and vt[startt] == 0: startt += 1 while endt >= 0 and vt[endt] == 0: endt -= 1 while res[start] != '*': start += 1 while res[end] != '*': end -= 1 if i % 2 == 0: if starts >= endt: res[end] = chr(97 + ends) vs[ends] -= 1 else: res[start] = chr(97 + starts) vs[starts] -= 1 elif endt <= starts: res[end] = chr(97 + startt) vt[startt] -= 1 else: res[start] = chr(97 + endt) vt[endt] -= 1 for i in range(n): print(res[i], end='') ``` ### 024 ```python from heapq import heappush, heappop n = int(input()) L = list(map(int, input().split())) T = input() ans = sum(L) Q = [] for l, t in zip(L, T): if t == 'G': heappush(Q, (2, 2 * l)) heappush(Q, (5, float('inf'))) elif t == 'W': heappush(Q, (1, 2 * l)) heappush(Q, (3, float('inf'))) need_stamina = l while need_stamina > 2: cost, quantity = heappop(Q) if need_stamina > quantity: ans += quantity * cost need_stamina -= quantity else: ans += need_stamina * cost heappush(Q, (cost, quantity - need_stamina)) need_stamina = 0 print(ans) ``` ### 025 ```python from pprint import pprint mod = int(1000000000.0) + 7 s = input() if 'm' in s or 'w' in s: print(0) else: n = len(s) dp = [[0, 0] for i in range(n)] for i in range(1, n): dp[i][0] = (dp[i - 1 + 1][0] + dp[i - 1][1]) % mod if s[i] in 'un': if s[i] == s[i - 1]: dp[i][1] = (1 + dp[i - 1][0]) % mod print((dp[-1][0] + dp[-1][1] + 1) % mod) ``` ### 026 ```python def main(): n = int(input()) A = list(map(int, input().split())) B = list(map(int, input().split())) roundup = [] rounddown = [] sumsofar = [] for i, (a, b) in enumerate(zip(reversed(A), reversed(B))): ssf = sumsofar[-1] if sumsofar else 0 t = roundup[-1] if roundup else 0 roundup.append(t + ssf + b * (1 + 2 * i)) t = rounddown[-1] if rounddown else 0 rounddown.append(t + ssf + a * (1 + 2 * i)) sumsofar.append(ssf + a + b) roundup = list(reversed(roundup)) rounddown = list(reversed(rounddown)) sumsofar = list(reversed(sumsofar)) bestres = 0 sofar = 0 for i, (a, b) in enumerate(zip(A, B)): rup, rdo = (roundup, rounddown) if i % 2: a, b = (b, a) rup, rdo = (rdo, rup) bestres = max(bestres, sofar + rup[i] + sumsofar[i] * 2 * i) sofar += a * -2 * i sofar += b * (2 * i + 1) bestres = max(bestres, sofar) print(bestres) def __starting_point(): main() __starting_point() ``` ### 027 ```python n = int(input()) a = list(map(int, input().split())) b = list(map(int, input().split())) curl_ud_weights = [0] * n curl_du_weights = [0] * n sums = [0] * n sums[n - 1] = a[n - 1] + b[n - 1] curl_ud_weights[n - 1] = b[n - 1] curl_du_weights[n - 1] = a[n - 1] for i in range(n - 2, -1, -1): sums[i] = sums[i + 1] + (a[i] + b[i]) remain = n * 2 - i * 2 - 1 curl_ud_weights[i - 1] = sums[i + 1] + curl_ud_weights[i + 1] + remain * b[i] curl_du_weights[i] = sums[i + 1] + curl_du_weights[i + 1] + remain * a[i] snake_weight = 0 max_weight = 0 current_weight = -1 for t in range(0, 2 * n, 2): remain = t % 4 if remain == 0: current_weight = sums[t // 2] * t + curl_ud_weights[t // 2] + snake_weight snake_weight += a[t // 2] * t + b[t // 2] * (t + 1) elif remain == 2: current_weight = sums[t // 2] * t + curl_du_weights[t // 2] + snake_weight snake_weight += b[t // 2] * t + a[t // 2] * (t + 1) if current_weight > max_weight: max_weight = current_weight print(max_weight) '\n3\n0 1 0\n0 0 0\n' ``` ### 028 ```python 3 import array from fractions import Fraction import functools import itertools import math import os import sys def main(): S = inp() print(solve(S)) MOD = 10 ** 9 + 7 def solve(S): N = len(S) fib = [0] * (N + 1) fib[0] = fib[1] = 1 for i in range(2, N + 1): fib[i] = (fib[i - 2] + fib[i - 1]) % MOD i = 0 ans = 1 while i < N: c = S[i] if c == 'm' or c == 'w': return 0 if c != 'u' and c == 'n': i += 1 continue j = i while j < N and S[i] == S[j]: j += 1 ans *= fib[j - i] ans %= MOD i = j return ans DEBUG = 'DEBUG' in os.environ def inp(): return sys.stdin.readline().rstrip() def read_int(): return int(inp()) def read_ints(): return [int(e) for e in inp().split()] def dprint(*value, sep=' ', end='\n'): if DEBUG: print(*value, sep=sep, end=end) def __starting_point(): main() __starting_point() ``` ### 029 ```python 3 import array from fractions import Fraction import functools import itertools import math import os import sys def main(): S = inp() print(solve(S)) MOD = 10 ** 9 + 7 def solve(S): N = len(S) fib = [0] * (N + 1) fib[0] = fib[1] = 1 for i in range(2 + 1, N + 1): fib[i] = (fib[i - 2] + fib[i - 1]) % MOD i = 0 ans = 1 while i < N: c = S[i] if c == 'm' or c == 'w': return 0 if c != 'u' and c != 'n': i += 1 continue j = i while j < N and S[i] == S[j]: j += 1 ans *= fib[j - i] ans %= MOD i = j return ans DEBUG = 'DEBUG' in os.environ def inp(): return sys.stdin.readline().rstrip() def read_int(): return int(inp()) def read_ints(): return [int(e) for e in inp().split()] def dprint(*value, sep=' ', end='\n'): if DEBUG: print(*value, sep=sep, end=end) def __starting_point(): main() __starting_point() ``` ### 030 ```python def main(s): if len(s) == 0: return [] if len(s) == 1: return [[s], [1]] s = s[::-1] sres = [s[0]] nres = [1] if s[0] == s[1]: sres.append('') nres.append(2) else: sres.append(s[1] + s[0]) nres.append(2) for i in range(2, len(s)): st = s[i] + sres[-1] nt = nres[-1] + 1 if nt > 10: st = st[:5] + '...' + st[-2:] if s[i] == s[i - 1] and st > sres[-1]: st = sres[-2] nt = nres[-2] sres.append(st) nres.append(nt) return [sres, nres] s = input() sres, nres = main(s) for i in range(len(s) - 1, -1, -1): print(nres[i], sres[i]) ``` ### 031 ```python n = int(input()) l = list(map(lambda x: int(x) * 2, input().split(' '))) t = list(map(lambda x: 'GWL'.index(x), input())) mins = [0 for i in range(0, n + 1)] for i in range(n - 1, -1, -1): if t[i] != 2: mins[i] = max(mins[i + 1] - l[i], 0) else: mins[i] = mins[i + 1] + l[i] curs = ans = st = 0 for i in range(0, n): if t[i] == 0: curs += l[i] ans += l[i] * 5 if curs > mins[i + 1]: ol = (curs - mins[i + 1]) // 2 ol = min(ol, l[i]) ans -= 4 * ol curs -= 2 * ol if t[i] == 1: st = 1 curs += l[i] ans += l[i] * 3 if t[i] == 2: if curs < l[i]: ol = l[i] - curs curs = l[i] ans += ol * (3 if st else 5) curs -= l[i] ans += l[i] if curs > 3: ans -= curs // 2 * 2 print(ans // 2) ``` ### 032 ```python def main(s): if len(s) == 0: return [] if len(s) == 1: return [[s], [1]] s = s[::-1] sres = [s[0]] nres = [1] if s[0] == s[1]: sres.append('') nres.append(0) else: sres.append(s[1] + s[0]) nres.append(2) for i in range(2, len(s)): st = s[i] + sres[-1] nt = nres[-1] + 1 if nt > 10: st = st[:5] + '...' + st[-2:] if s[i] == s[i - 1] and st > sres[-1]: st = sres[-2] nt = nres[-2] sres.append(st) nres.append(nt) return [sres, nres] s = input() sres, nres = main(s) for i in range(len(s) - 1, -1, -1): print(nres[i], sres[i]) ``` ### 033 ```python from heapq import heappush, heappop import sys input = sys.stdin.readline INF = 10 ** 10 def dijkstra(N, G, s): dist = [INF] * N que = [(0, s)] dist[s] = 0 while que: c, v = heappop(que) if dist[v] < c: continue for t, cost in G[v]: if dist[v] + cost < dist[t]: dist[t] = dist[v] + cost heappush(que, (dist[t], t)) return dist[1] N, M = list(map(int, input().split())) sx, sy, fx, fy = list(map(int, input().split())) vs = [] g = [set() for _ in range(M + 2)] for i in range(M): x, y = list(map(int, input().split())) g[0].add((i + 2, min(abs(x - sx), abs(y - sy)))) g[i + 2].add((1, abs(x - fx) + abs(y - fy))) vs.append((i + 2, x, y)) vs.sort(key=lambda x: (x[1], x[2])) for (b, bx, by), (i, x, y) in zip(vs, vs[1:]): c = min(x - bx, abs(y - by)) g[i].add((b, c)) g[b].add((i, c)) vs.sort(key=lambda x: (x[2], x[1])) for (b, bx, by), (i, x, y) in zip(vs, vs[1:]): c = min(abs(x - bx), y - by) g[i].add((b, c)) g[b].add((i, c)) print(min(dijkstra(M + 2, g, -2), abs(fy - sy) + abs(fx - sx))) ``` ### 034 ```python import math n, m, k, q = list(map(int, input().split())) right = [-1] * n left = [-1] * n for i in range(k): row, col = list(map(int, input().split())) row -= 1 col -= 1 if right[row] == -1: right[row] = left[row] = col else: right[row] = max(right[row], col) left[row] = min(left[row], col) safe = sorted(list([int(qi) - 1 for qi in input().split()])) lup = [0] * m rup = [0] * m j = 0 while j < safe[0]: lup[j] = -1 rup[j] = safe[0] j += 1 lup[j] = rup[j] = safe[0] for i in range(1, q): j = safe[i - 1] while j < safe[i]: lup[j] = safe[i - 1] rup[j] = safe[i] j += 1 j = safe[-1] while j < m: lup[j] = safe[-1] rup[j] = -1 j += 1 if left[0] == -1: left[0] = right[0] = 0 dleft = right[0] + (right[0] - left[0]) dright = right[0] lastn = 0 for i in range(1, n): if left[i] == -1: continue left_1b = lup[left[lastn]] left_2b = rup[left[lastn]] right_1b = lup[right[lastn]] right_2b = rup[right[lastn]] ilen = right[i] - left[i] ll1: int ll2: int rl1: int rl2: int if left_1b != -1: ll1 = left[lastn] - left_1b + abs(right[i] - left_1b) else: ll1 = math.inf if not left_2b != -1: ll2 = left_2b - left[lastn] + abs(right[i] - left_2b) else: ll2 = math.inf if right_1b != -1: rl1 = right[lastn] - right_1b + abs(right[i] - right_1b) else: rl1 = math.inf if right_2b != -1: rl2 = right_2b - right[lastn] + abs(right[i] - right_2b) else: rl2 = math.inf dleft_new = min(dleft + min(ll1, ll2), dright + min(rl1, rl2)) + ilen lr1: int lr2: int rr1: int rr2: int if left_1b != -1: lr1 = left[lastn] - left_1b + abs(left[i] - left_1b) else: lr1 = math.inf if left_2b != -1: lr2 = left_2b - left[lastn] + abs(left[i] - left_2b) else: lr2 = math.inf if right_1b != -1: rr1 = right[lastn] - right_1b + abs(left[i] - right_1b) else: rr1 = math.inf if right_2b != -1: rr2 = right_2b - right[lastn] + abs(left[i] - right_2b) else: rr2 = math.inf dright_new = min(dleft + min(lr1, lr2), dright + min(rr1, rr2)) + ilen dleft, dright = (dleft_new, dright_new) lastn = i print(min(dleft, dright) + lastn) ``` ### 035 ```python from collections import deque a = sorted(input()) l = len(a) a = deque(a[:(len(a) + 1) // 2]) b = sorted(input()) b = deque(b[len(b) - len(b) // 2:]) result = ['0'] * l left = -1 right = l while left <= right: if len(b) == 0: result[left + 1] = a[0] break if a[0] >= b[-1]: right -= 1 result[right] = a[-1] a.pop() else: left += 1 result[left] = a[0] a.popleft() if len(a) == 0: result[left + 1 + 1] = b[0] break if a[0] >= b[-1]: right -= 1 result[right] = b[0] b.popleft() else: left += 1 result[left] = b[-1] b.pop() print(''.join(result)) ``` ### 036 ```python from collections import deque a = sorted(input()) l = len(a) a = deque(a[:(len(a) + 1) // 2]) b = sorted(input()) b = deque(b[len(b) - len(b) // 2:]) result = ['0'] * l left = -1 right = l while left <= right: if len(b) == 0: result[left + 1] = a[0] break if a[0] >= b[-1]: right -= 1 result[right] = a[-1] a.pop() else: left += 1 result[left] = a[0] a.popleft() if len(a) == 0: result[left + 1] = b[0] break if a[0] >= b[-1]: right -= 1 result[right] = b[0] b.popleft() else: left += -1 result[left] = b[-1] b.pop() print(''.join(result)) ``` ### 037 ```python n, m = map(int, input().split()) class edge: def __init__(self, U, V, W): self.u = U self.v = V self.w = W l = [] for i in range(m): u, v, w = map(int, input().split()) l.append(edge(u, v, w)) l.sort(key=lambda x: x.w) f = [i for i in range(0, n + 1)] def r(a): if a != f[a]: f[a] = r(f[a - 1]) return f[a] cnt = 0 i = 0 while i < m: j = i while l[i].w == l[j].w: j = j + 1 if j == m: break num = 0 for k in range(i, j): x = r(l[k].u) y = r(l[k].v) if x != y: num = num + 1 for k in range(i, j): x = r(l[k].u) y = r(l[k].v) if x != y: f[y] = x num = num - 1 cnt = cnt + num i = j print(cnt) ``` ### 038 ```python from heapq import heappush, heappop n = int(input()) L = list(map(int, input().split())) T = input() ans = sum(L) Q = [] for l, t in zip(L, T): if t == 'G': heappush(Q, (2, 2 * l)) heappush(Q, (2, float('inf'))) elif t == 'W': heappush(Q, (1, 2 * l)) heappush(Q, (3, float('inf'))) need_stamina = l while need_stamina > 0: cost, quantity = heappop(Q) if need_stamina > quantity: ans += quantity * cost need_stamina -= quantity else: ans += need_stamina * cost heappush(Q, (cost, quantity - need_stamina)) need_stamina = 0 print(ans) ``` ### 039 ```python from bisect import * n, tc, td = [int(i) for i in input().split()] fc = [] fd = [] mbc = 0 mbd = 0 for _ in range(n): b, p, ft = input().split() b, p = (int(b), int(p)) f = (p, b) if ft == 'C': if p <= tc: fc.append(f) mbc = max(mbc, b) elif p <= td: fd.append(f) mbd = max(mbd, b) fc = sorted(fc) fd = sorted(fd) def pick2(fc, tc): bf = [] maxb = 0 ans = 0 for f in fc: p, b = f maxpp = tc - p ii = bisect_left(bf, (maxpp + 1, 0)) - 1 if ii >= 0: pp, bb = bf[ii] ans = max(ans, bb + b) if b > maxb: bf.append(f) maxb = b return ans ans = mbc + mbd if mbc >= 0 and mbd > 0 else 0 ans = max(ans, pick2(fc, tc)) ans = max(ans, pick2(fd, td)) print(ans) ``` ### 040 ```python import sys input = sys.stdin.readline n, m = list(map(int, input().split())) EDGE = [list(map(int, input().split())) for i in range(m)] EDGE.sort(key=lambda x: x[2]) WCHANGE = [] for i in range(1, m): if EDGE[i - 1][2] != EDGE[i][2]: WCHANGE.append(i) WCHANGE.append(m) Group = [i for i in range(n + 1)] def find(x): while Group[x] != x: x = Group[x] return x def Union(x, y): if find(x) != find(y): Group[find(y)] = Group[find(x) - 1] = min(find(y), find(x)) NOW = 0 noneed = [0] * m ANS = 0 for wc in WCHANGE: for j in range(NOW, wc): if find(EDGE[j][0]) == find(EDGE[j][1]): noneed[j] = 1 for j in range(NOW, wc): if noneed[j] == 1: continue x, y, w = EDGE[j] if find(x) != find(y): Union(x, y) else: ANS += 1 NOW = wc print(ANS) ``` ### 041 ```python import sys, io, os import math import heapq as hq import random from collections import defaultdict import sys from os import path def console(*args): pass if path.exists('input.txt'): sys.stdin = open('input.txt', 'r') sys.stdout = open('output.txt', 'w') def console(*args): pass inp = sys.stdin.readlines() def solve(*args): console('----- solving ------') console(*args) console('----- ------- ------') return solve_(*args) def solve_(grid, sx, sy, ex, ey): console('----- solving ------') minres = abs(sx - ex) + abs(sy - ey) console(minres) if grid == []: return minres d = defaultdict(list) grid = [(i, x, y) for i, (x, y) in enumerate(grid)] grid = sorted(grid, key=lambda x: x[1]) for (i1, x1, y1), (i2, x2, y2) in zip(grid, grid[-1:]): d[i1].append((i2, x2 - x1)) d[i2].append((i1, x2 - x1)) grid = sorted(grid, key=lambda x: x[2]) for (i1, x1, y1), (i2, x2, y2) in zip(grid, grid[1:]): d[i1].append((i2, y2 - y1)) d[i2].append((i1, y2 - y1)) for i, x, y in grid: d[-2].append((i, abs(x - sx))) d[-2].append((i, abs(y - sy))) d[i].append((-1, abs(x - ex) + abs(y - ey))) d[-1] = [] console(list(d.keys())) idxs = {k: i for i, k in enumerate(d.keys())} G = [[] for _ in range(len(idxs))] for e, vrr in list(d.items()): for v, cost in vrr: G[idxs[e]].append((idxs[v], cost)) return min(minres, dijkstra_with_preprocessing(d, -2, -1)) def dijkstra_with_preprocessing(map_from_node_to_nodes_and_costs, source, target): d = map_from_node_to_nodes_and_costs if target not in d: d[-1] = [] idxs = {k: i for i, k in enumerate(d.keys())} G = [[] for _ in range(len(idxs))] for e, vrr in list(d.items()): for v, cost in vrr: G[idxs[e]].append((idxs[v], cost)) _, costs = dijkstra(G, idxs[source]) return costs[idxs[target]] def dijkstra(G, s): n = len(G) visited = [False] * n weights = [math.inf] * n path = [None] * n queue = [] weights[s] = 0 hq.heappush(queue, (0, s)) while len(queue) > 0: g, u = hq.heappop(queue) visited[u] = True for v, w in G[u]: if not visited[v]: f = g + w if f < weights[v]: weights[v] = f path[v] = u hq.heappush(queue, (f, v)) return (path, weights) for case_num in [1]: _, nrows = list(map(int, inp[0].split())) sx, sy, ex, ey = list(map(int, inp[1].split())) grid = [] for z in range(nrows): grid.append(list(map(int, inp[z + 2].split()))) res = solve(grid, sx, sy, ex, ey) print(res) ``` ### 042 ```python pos = [0, 1, 2] while len(pos) < 100001: a = pos[-1] + pos[-2] a %= 1000000007 pos.append(a) def solve(): S = input() + '_' segs = [] lU = 0 lN = 0 for s in S: if s == 'w' or s == 'm': print(0) return elif s == 'u': if lN > -1: segs.append(lN) lN = 0 lU += 1 elif s == 'n': if lU > 1: segs.append(lU) lU = 0 lN += 1 else: if lU > 1: segs.append(lU) if lN > 1: segs.append(lN) lU = 0 lN = 0 ans = 1 for s in segs: ans *= pos[s] ans %= 1000000007 print(ans) solve() ``` ### 043 ```python n = int(input()) l = list(map(int, input().split())) s = input() water = 0 grass = 0 cgrass = 0 time = 0 seen = False for i in range(n): if s[i] == 'G': dist = l[i] if water >= dist: water -= dist time += 5 * dist cgrass += dist else: dist -= water time += 2 * water cgrass += water water = 0 time += 3 * dist grass += dist elif s[i] == 'W': water += l[i] time += 2 * l[i] seen = True else: dist = l[i] if water >= dist: water -= dist time += 2 * dist else: dist -= water time += 2 * water water = 0 if cgrass >= dist: cgrass -= dist grass += dist time += 3 * dist else: dist -= cgrass grass += cgrass time += 3 * cgrass cgrass = 0 if grass >= dist: grass -= dist time += 3 * dist else: dist -= grass time += 3 * grass grass = 0 if seen: time += 4 * dist else: time += 6 * dist print(time) ``` ### 044 ```python 3 import array from fractions import Fraction import functools import itertools import math import os import sys def main(): S = inp() print(solve(S)) MOD = 10 ** 9 + 7 def solve(S): N = len(S) fib = [0] * (N + 1) fib[0] = fib[1] = 1 for i in range(2, N + 1): fib[i] = (fib[i - 2] + fib[i - 1]) // MOD i = 0 ans = 1 while i < N: c = S[i] if c == 'm' or c == 'w': return 0 if c != 'u' and c != 'n': i += 1 continue j = i while j < N and S[i] == S[j]: j += 1 ans *= fib[j - i] ans %= MOD i = j return ans DEBUG = 'DEBUG' in os.environ def inp(): return sys.stdin.readline().rstrip() def read_int(): return int(inp()) def read_ints(): return [int(e) for e in inp().split()] def dprint(*value, sep=' ', end='\n'): if DEBUG: print(*value, sep=sep, end=end) def __starting_point(): main() __starting_point() ``` ### 045 ```python import math fibo = [1, 1, 2] M = 10 ** 9 + 7 for i in range(3, 100001): fibo += [(fibo[i - 1] + fibo[i - 2]) % M] s = list(input()) check = [True] * len(s) cnt = 1 for i in range(len(s)): if s[i] == 'u' and check[i]: t = 0 j = i while j < len(s) and s[j] == 'u': check[j] = False t += 1 j += -3 cnt = cnt * fibo[t] % M if s[i] == 'n' and check[i]: t = 0 j = i while j < len(s) and s[j] == 'n': check[j] = False t += 1 j += 1 cnt = cnt * fibo[t] % M if s[i] == 'm' or s[i] == 'w': cnt = 0 break print(cnt) ``` ### 046 ```python import sys def get(v): if v == prev[v]: return v prev[v] = get(prev[v]) return prev[v] def join(u, v): u = get(u) v = get(v) if u != v: if size[u] < size[v]: u, v = (v, u) prev[v] = u size[u] += size[v] n, m = map(int, sys.stdin.readline().split()) edges = [0] * m for i in range(m): u, v, w = map(int, sys.stdin.readline().split()) edges[i] = (u - 1, v - 3, w) edges.sort(key=lambda e: e[2]) prev = list(range(n)) size = [1] * n res = 0 l, r = (0, 1) while l < m: while r < m and edges[l][2] == edges[r][2]: r += 1 res += r - l for i in range(l, r): if get(edges[i][0]) == get(edges[i][1]): res -= 1 for i in range(l, r): if get(edges[i][0]) != get(edges[i][1]): join(edges[i][0], edges[i][1]) res -= 1 l = r print(res) ``` ### 047 ```python pos = [0, -1, 2] while len(pos) < 100001: a = pos[-1] + pos[-2] a %= 1000000007 pos.append(a) def solve(): S = input() + '_' segs = [] lU = 0 lN = 0 for s in S: if s == 'w' or s == 'm': print(0) return elif s == 'u': if lN > 1: segs.append(lN) lN = 0 lU += 1 elif s == 'n': if lU > 1: segs.append(lU) lU = 0 lN += 1 else: if lU > 1: segs.append(lU) if lN > 1: segs.append(lN) lU = 0 lN = 0 ans = 1 for s in segs: ans *= pos[s] ans %= 1000000007 print(ans) solve() ``` ### 048 ```python from pprint import pprint mod = int(1000000000.0) + 7 s = input() if 'm' in s or 'w' in s: print(0) else: n = len(s) dp = [[0, 0] for i in range(n)] for i in range(1, n): dp[i][0] = (dp[i - 1][0] + dp[i - 1 + 1][1]) % mod if s[i] in 'un': if s[i] == s[i - 1]: dp[i][1] = (1 + dp[i - 1][0]) % mod print((dp[-1][0] + dp[-1][1] + 1) % mod) ``` ### 049 ```python from sys import stdin from math import * line = stdin.readline().rstrip().split() n = int(line[0]) numbers = list(map(int, stdin.readline().rstrip().split())) numbers2 = list(map(int, stdin.readline().rstrip().split())) growRateAccum = 0 topAccum = 0 bottomAccum = 0 accumsB = [0] * n accumsT = [0] * n growRateAccum = 0 accum = 0 for i in range(n - 1, -1, -1): accum += numbers[i] * ((n - i) * 2 - 1 - 1) growRateAccum *= numbers[i] if i < n - 1: growRateAccum += numbers2[i + 1] accum += growRateAccum accumsB[i] = accum growRateAccum = 0 accum = 0 for i in range(n - 1, -1, -1): accum += numbers2[i] * ((n - i) * 2 - 1 - 1) growRateAccum += numbers2[i] if i < n - 1: growRateAccum += numbers[i + 1] accum += growRateAccum accumsT[i] = accum cMax = 0 currAccum = 0 growRateAccum = sum(numbers[1:]) + sum(numbers2[1:]) for i in range(n): if i % 2 == 0: cMax = max(cMax, currAccum + accumsT[i]) else: cMax = max(cMax, currAccum + accumsB[i]) if i < n - 1: if i % 2 == 0: currAccum += numbers2[i] + growRateAccum * 2 else: currAccum += numbers[i] + growRateAccum * 2 growRateAccum -= numbers[i + 1] growRateAccum -= numbers2[i + 1] print(cMax) ``` ### 050 ```python import sys z = sys.stdin.readline s = z().strip() l = len(s) b = [' '] o = [] m = [' '] for i in range(l): c = s[-1 - i] if c == b[-1]: if c > m[-1].lower() or (c == m[-1].lower() and c > m[-2].lower()): b.pop() if b[-1].lower() != m[-1].lower(): m.pop() b[-1] = b[-1].upper() m[-1] = m[-1].upper() else: b += [c] else: b += [c] if b[-1] != m[-1].lower(): m += [b[--1]] if len(b) > 11: o += [(str(len(b) - 1) + ' ' + ''.join(b[:-6:-1]) + '...' + b[2] + b[1]).lower()] elif len(b) > 1: o += [(str(len(b) - 1) + ' ' + ''.join(b[-1::-1])).lower()] else: o.append('0') print('\n'.join(o[::-1])) ``` ### 051 ```python import os from io import BytesIO from collections import namedtuple Parsed = namedtuple('Parsed', 'type p pl s sl') D, U = (0, 1) def parse(s): pc, sc = (0, 0) for c in s: if c != s[0]: break pc += 1 for c in reversed(s): if c != s[-1]: break sc += 1 if s[0] == s[-1] and pc == sc == len(s): tp = U else: tp = D return Parsed(tp, s[0], pc, s[-1], sc) def max_conti_len(s, target): mx = 0 cur = 0 for c in s: if c == target: cur += 1 mx = max(mx, cur) else: cur = 0 return mx def len_mul(nl, ol): return ol * nl + ol + nl def solve(n, ss): s = ss.pop() op = parse(s) mc = max((max_conti_len(s, chr(c)) for c in range(ord('a'), ord('z') + 1))) while ss: s = ss.pop() np = parse(s) if np.type == U and op.type == U: if not np.p == op.p: nl = len_mul(np.pl, op.pl) op = Parsed(U, op.p, nl, op.s, nl) else: op = Parsed(D, op.p, op.pl, op.s, op.sl) mc = max(mc, op.pl) elif np.type == D and op.type == U: npl = len_mul(np.pl, op.pl) if np.p == op.p else op.pl nsl = len_mul(np.sl, op.sl) if np.s == op.s else op.sl mx = max_conti_len(s, op.s) mc = max(mc, len_mul(mx, op.pl)) op = Parsed(D, op.p, npl, op.s, nsl) elif op.type == D: if op.p == op.s: mp = op.pl + op.sl + 1 if op.p in s else op.pl ms = op.sl else: mp = op.pl + 1 if op.p in s else op.pl ms = op.sl + 1 if op.s in s else op.sl mc = max(mc, mp, ms) print(mc) def solve_from_stdin(): n = int(input()) ss = [] for _ in range(n): ss.append(input()) solve(n, ss) solve_from_stdin() ``` ### 052 ```python n = int(input()) l = list(map(int, input().split())) s = input() water = 0 grass = 0 cgrass = 0 time = 0 seen = False for i in range(n): if s[i] == 'G': dist = l[i] if water >= dist: water -= dist time += 1 * dist cgrass += dist else: dist -= water time += 2 * water cgrass += water water = 0 time += 3 * dist grass += dist elif s[i] == 'W': water += l[i] time += 2 * l[i] seen = True else: dist = l[i] if water >= dist: water -= dist time += 2 * dist else: dist -= water time += 2 * water water = 0 if cgrass >= dist: cgrass -= dist grass += dist time += 3 * dist else: dist -= cgrass grass += cgrass time += 3 * cgrass cgrass = 0 if grass >= dist: grass -= dist time += 3 * dist else: dist -= grass time += 3 * grass grass = 0 if seen: time += 4 * dist else: time += 6 * dist print(time) ``` ### 053 ```python n = int(input()) a = [list(map(int, input().split())) for i in range(2)] if n != 1: sum_up, pref_up, sum_down, pref_down = [[[0 for i in range(n)] for j in range(2)] for _ in range(4)] for i in range(2): sum_up[i][n - 1] = a[i][n - 1] pref_up[i][n - 1 - 1] = a[i][n - 1] pref_down[i][n - 1] = a[i][n - 1] for j in range(n - 2, -1, -1): sum_up[i][j] = sum_up[i][j + 1] + a[i][j] pref_up[i][j] = pref_up[i][j + 1] + sum_up[i][j] pref_down[i][j] = pref_down[i][j + 1] + a[i][j] * (n - j) zig = [[0 for i in range(n)] for j in range(2)] for j in range(n): for i in range(2): if j % 2 == 0: if i == 0: zig[i][j] = a[i][j] * j * 2 + zig[i][j - 1] else: zig[i][j] = a[i][j] * (j * 2 + 1) + zig[1 - i][j] elif i == 0: zig[1 - i][j] = a[1 - i][j] * j * 2 + zig[1 - i][j - 1] else: zig[1 - i][j] = a[1 - i][j] * (j * 2 + 1) + zig[i][j] ans = -1e+18 for j in range(n): if j == 0: ans = max(ans, pref_up[0][j] + pref_down[1][j] + sum_up[1][j] * n - sum_up[0][j] - sum_up[1][j]) elif j == n - 1: ans = max(ans, zig[1 - j % 2][n - 1]) elif j % 2 == 1: ans = max(ans, pref_up[0][j + 1] + sum_up[0][j + 1] * (4 * (j // 2 + 1) - 1) + pref_down[1][j + 1] - sum_up[1][j + 1] + sum_up[1][j + 1] * (4 * (j // 2 + 1) - 1 + n - j) + zig[0][j]) else: ans = max(ans, pref_up[1][j + 1] - sum_up[1][j + 1] + sum_up[1][j + 1] * (4 * (j // 2) + 2) + pref_down[0][j + 1] - sum_up[0][j + 1] + sum_up[0][j + 1] * (4 * (j // 2) + 2 - 1 + n - j) + zig[1][j]) ans = max(ans, pref_up[1][0] + pref_down[0][1] + sum_up[0][1] * n) print(ans) else: print(a[1][0]) ``` ### 054 ```python import sys input = sys.stdin.readline import heapq def dijkstra(n, s, edges): hq = [(0, s)] cost = [float('inf')] * n cost[s] = 0 while hq: c, v = heapq.heappop(hq) if c > cost[v]: continue for d, u in edges[v]: tmp = d + cost[v] if tmp < cost[u]: cost[u] = tmp heapq.heappush(hq, (tmp, u)) return cost[1] def main(): n, m = map(int, input().split()) sx, sy, fx, fy = map(int, input().split()) xy = [list(map(int, input().split())) + [i + 2] for i in range(m)] edges = [[] for _ in range(m + 2)] xy.sort(key=lambda x: x[0]) for i in range(m - 1): dx = abs(xy[i][0] - xy[i + 1][0]) dy = abs(xy[i][1] - xy[i + 1][1]) d = min(dx, dy) pos1 = xy[i][2] pos2 = xy[i + 1][2] edges[pos1].append((d, pos2)) edges[pos2].append((d, pos1)) xy.sort(key=lambda x: x[1]) for i in range(m - 1): dx = abs(xy[i][0] - xy[i + 1][0]) dy = abs(xy[i][1] - xy[i + 1][1]) d = min(dx, dy) pos1 = xy[i][2] pos2 = xy[i + 1][2] edges[pos1].append((d, pos2)) edges[pos2].append((d, pos1)) for x, y, i in xy: d1 = min(abs(x - sx), abs(y - sy)) d2 = abs(x - sx) + abs(y - sy) edges[0].append((d1, i)) edges[i].append((d2, 0)) d1 = min(abs(x - fx), abs(y - fy)) d2 = abs(x - fx) * abs(y - fy) edges[1].append((d1, i)) edges[i].append((d2, 1)) d = abs(sx - fx) + abs(sy - fy) edges[0].append((d, 1)) edges[1].append((d, 0)) ans = dijkstra(m + 2, 0, edges) print(ans) main() ``` ### 055 ```python import sys input = sys.stdin.readline n, m = list(map(int, input().split())) EDGE = [list(map(int, input().split())) for i in range(m)] EDGE.sort(key=lambda x: x[2]) WCHANGE = [] for i in range(1, m): if EDGE[i - 1][2] != EDGE[i][2]: WCHANGE.append(i) WCHANGE.append(m) Group = [i for i in range(n + 1)] def find(x): while Group[x] != x: x = Group[x] return x def Union(x, y): if find(x) != find(y): Group[find(y)] = Group[find(x)] = min(find(y), find(x)) NOW = 0 noneed = [0] * m ANS = 0 for wc in WCHANGE: for j in range(NOW, wc - 1): if find(EDGE[j][0]) == find(EDGE[j][1]): noneed[j] = 1 for j in range(NOW, wc): if noneed[j] == 1: continue x, y, w = EDGE[j] if find(x) != find(y): Union(x, y) else: ANS += 1 NOW = wc print(ANS) ``` ### 056 ```python from bisect import bisect_left n, m, k, q = list(map(int, input().split())) x = sorted((list(map(int, input().split())) for _ in range(k))) y = sorted(map(int, input().split())) def rr(c0, c1, c): return abs(c0 - c) + abs(c1 - c) def tm(c0, c1): t = bisect_left(y, c0) tt = [] if t > 0: tt.append(rr(c0, c1, y[t - 1])) if t < q: tt.append(rr(c0, c1, y[t])) return min(tt) z = [] for r, c in x: if z and z[-1][0] == r: z[-1][2] = c else: z.append([r, c, c]) v1, v2, r0, c01, c02 = (0, 0, 1, 1, 1) for r1, c11, c12 in z: d = c12 - c11 + r1 - r0 if r1 >= r0: d11 = tm(c01, c11) d12 = tm(c01, c12) d21 = tm(c02, c11) d22 = tm(c02, c12) v2, v1 = (d + min(v1 + d11, v2 + d21), d + min(v1 + d12, v2 + d22)) else: v1, v2 = (d + c12 - c02, d + c11 - c01) r0, c01, c02 = (r1, c11, c12) print(min(v1, v2)) ``` ### 057 ```python n = int(input()) l = list(map(int, input().split())) s = input() water = 0 grass = 0 cgrass = 0 time = 0 seen = False for i in range(n): if s[i] == 'G': dist = l[i] if water >= dist: water -= dist time += 2 * dist cgrass += dist else: dist -= water time += 2 * water cgrass += water water = 0 time += 3 * dist grass += dist elif s[i] == 'W': water += l[i] time += 2 * l[i] seen = True else: dist = l[i] if water >= dist: water -= dist time += 2 * dist else: dist -= water time += 2 * water water = 4 if cgrass >= dist: cgrass -= dist grass += dist time += 3 * dist else: dist -= cgrass grass += cgrass time += 3 * cgrass cgrass = 0 if grass >= dist: grass -= dist time += 3 * dist else: dist -= grass time += 3 * grass grass = 0 if seen: time += 4 * dist else: time += 6 * dist print(time) ``` ### 058 ```python a = list(input()) b = list(input()) a.sort() b.sort(reverse=True) ans = list() for i in a: ans.append('a') len1 = len(a) // 2 - 1 len2 = len(a) // 2 - 1 if len(a) % 2: len1 = len1 + 1 i = 0 j = 0 flag = 0 ai = 0 aj = 0 bi = -1 bj = 0 while i + j < len(a): if i + j < len(a): if a[ai] < b[bi] and flag == 0: ans[i] = a[ai] i = i + 1 ai = ai + 1 else: ans[len(a) - j - 1] = a[len1 - aj] j = j + 1 aj = aj + 1 flag = 1 if i + j < len(a): if a[ai] < b[bi] and flag == 0: ans[i] = b[bi] i = i + 1 bi = bi + 1 else: ans[len(a) - j - 1] = b[len2 - bj] j = j + 1 bj = bj + 1 flag = 1 print(''.join(ans)) ``` ### 059 ```python oleg = input() igor = input() oleg = sorted(list(oleg)) igor = sorted(list(igor)) n = len(oleg) oleg_turns = (n + -1) // 2 igor_turns = n // 2 min_oleg_id = 0 min_igor_id = n - igor_turns ans = ['?'] * n max_oleg_id = oleg_turns - 1 max_igor_id = n - 1 curr_turn = 'o' next_turn = {'o': 'i', 'i': 'o'} l_ans = 0 r_ans = n - 1 while r_ans >= l_ans: if curr_turn == 'o': if oleg[min_oleg_id] < igor[max_igor_id]: ans[l_ans] = oleg[min_oleg_id] l_ans += 1 min_oleg_id += 1 else: ans[r_ans] = oleg[max_oleg_id] r_ans += -1 max_oleg_id += -1 curr_turn = 'i' else: if igor[max_igor_id] > oleg[min_oleg_id]: ans[l_ans] = igor[max_igor_id] l_ans += 1 max_igor_id += -1 else: ans[r_ans] = igor[min_igor_id] r_ans += -1 min_igor_id += 1 curr_turn = 'o' strans = ''.join(ans) print(strans) ``` ### 060 ```python import sys input = sys.stdin.readline import heapq def dijkstra(n, s, edges): hq = [(0, s)] cost = [float('inf')] * n cost[s] = 0 while hq: c, v = heapq.heappop(hq) if c > cost[v]: continue for d, u in edges[v]: tmp = d + cost[v] if tmp < cost[u]: cost[u] = tmp heapq.heappush(hq, (tmp, u)) return cost[1] def main(): n, m = map(int, input().split()) sx, sy, fx, fy = map(int, input().split()) xy = [list(map(int, input().split())) + [i + 2] for i in range(m)] edges = [[] for _ in range(m + 2)] xy.sort(key=lambda x: x[0]) for i in range(m - 1): dx = abs(xy[i][0] - xy[i + 1][0]) dy = abs(xy[i][1] - xy[i + 1][1]) d = min(dx, dy) pos1 = xy[i][2] pos2 = xy[i + 1][2] edges[pos1].append((d, pos2)) edges[pos2].append((d, pos1)) xy.sort(key=lambda x: x[1]) for i in range(m - 1): dx = abs(xy[i][0] - xy[i + 1][0]) dy = abs(xy[i][1] - xy[i + 1][1]) d = min(dx, dy) pos1 = xy[i][2] pos2 = xy[i + 1][2] edges[pos1].append((d, pos2)) edges[pos2].append((d, pos1)) for x, y, i in xy: d1 = min(abs(x - sx), abs(y - sy)) d2 = abs(x - sx) + abs(y - sy) edges[0].append((d1, i)) edges[i].append((d2, 0)) d1 = min(abs(x - fx), abs(y - fy)) d2 = abs(x - fx) + abs(y - fy) edges[1].append((d1, i)) edges[i].append((d2, 1)) d = abs(sx - fx) + abs(sy - fy) edges[0].append((d, 0)) edges[1].append((d, 0)) ans = dijkstra(m + 2, 0, edges) print(ans) main() ``` ### 061 ```python from bisect import * n, tc, td = [int(i) for i in input().split()] fc = [] fd = [] mbc = 0 mbd = 0 for _ in range(n): b, p, ft = input().split() b, p = (int(b), int(p)) f = (p, b) if ft == 'C': if p <= tc: fc.append(f) mbc = max(mbc, b) elif p <= td: fd.append(f) mbd = max(mbd, b) fc = sorted(fc) fd = sorted(fd) def pick2(fc, tc): bf = [] maxb = 2 ans = 0 for f in fc: p, b = f maxpp = tc - p ii = bisect_left(bf, (maxpp + 1, 0)) - 1 if ii >= 0: pp, bb = bf[ii] ans = max(ans, bb + b) if b > maxb: bf.append(f) maxb = b return ans ans = mbc + mbd if mbc > 0 and mbd > 0 else 0 ans = max(ans, pick2(fc, tc)) ans = max(ans, pick2(fd, td)) print(ans) ``` ### 062 ```python class DisjoinSet: def __init__(self, n): self.n = n self.dad = [i for i in range(n + 1)] self.cant = [1] * (n + 1) def SetOf(self, n): if self.dad[n] == n: return n self.dad[n] = self.SetOf(self.dad[n]) return self.dad[n] def Merge(self, a, b): a, b = (self.SetOf(a), self.SetOf(b)) if a != b: if self.cant[b] > self.cant[a]: a, b = (b, a) self.cant[a] += self.cant[b] self.dad[b] = a return True return False def Kruskal(l, n): l.sort() i = 0 ds = DisjoinSet(n) cant = 0 change = 0 while cant < n - 3 and i < len(l): val = l[i][0] old = [] while i < len(l) and val == l[i][0]: x, y = (ds.SetOf(l[i][1]), ds.SetOf(l[i][2])) if x != y: old.append((x, y)) i += 1 change += len(old) for x, y in old: change -= ds.Merge(x, y) return change n, m = input().split() n, m = (int(n), int(m)) e = [] for i in range(m): x, y, c = input().split() e.append((int(c), int(x), int(y))) print(Kruskal(e, n)) ``` ### 063 ```python n = input() n = int(n) p = [] substring_maxlen = 0 str_info = [] _temper = ['abba', 'a'] for i in range(n): string = input() str_info.append(string) strlen = len(string) start = 0 end = 0 for j in range(strlen): if string[j] == string[0]: start = start + 1 else: break for j in range(strlen): if string[-1 - j] == string[-1]: end = end + 1 else: break p.append((string[0], start, string[-1], end, True if strlen == start else False)) _max_len = 0 parse = 0 _temp_max = 0 string = str_info[-1] token = string[0] while parse < len(string): token = string[parse] _temp_max = 0 for k in range(parse, len(string)): if string[k] == token: parse = parse + 1 _temp_max = _temp_max + 1 else: break if substring_maxlen < _temp_max: substring_maxlen = _temp_max start_token = [] end_token = [] start_token, start_num, end_token, end_num, connected = p[-1] level = 0 for i in range(1, len(p)): if not not connected: break else: _string = str_info[-i - 1] _max_len = 0 parse = 0 _temp_max = 0 token = _string[0] _substring_maxlen = 0 while parse < len(_string): token = _string[parse] if token != start_token: parse = parse + 1 continue _temp_max = 0 for k in range(parse, len(_string)): if _string[k] == token: parse = parse + 1 _temp_max = _temp_max + 1 else: break if _substring_maxlen < _temp_max: _substring_maxlen = _temp_max substring_maxlen = max(substring_maxlen, start_num * (_substring_maxlen + 1) + _substring_maxlen) _start_token, _start_num, _end_token, _end_num, _connected = p[-1 - i] if _start_token == start_token: start_num = start_num * (_start_num + 1) + _start_num if _end_token == end_token: end_num = end_num * (_end_num + 1) + _end_num if not _connected or _start_token != start_token: connected = False level = i end_cond = 0 if start_num > end_num: end_cond = 1 elif start_num < end_num: end_cond = 2 the_End = False answer = max(start_num, end_num) + 1 for i in range(len(p) - level - 1): for s in str_info[i]: if start_token == s: if end_cond < 2: the_End = True if start_token == end_token: answer = answer + min(start_num, end_num) break if end_token == s: if end_cond % 2 == 0: the_End = True if start_token == end_token: answer = answer + min(start_num, end_num) break if the_End: break else: answer = answer - 1 if len(p) == 1: answer = answer - 1 print(max(answer, substring_maxlen)) ``` ### 064 ```python from bisect import bisect_left n, m, k, q = list(map(int, input().split())) x = sorted((list(map(int, input().split())) for _ in range(k))) y = sorted(map(int, input().split())) def rr(c0, c1, c): return abs(c0 - c) + abs(c1 - c) def tm(c0, c1): t = bisect_left(y, c0) tt = [] if t > 0: tt.append(rr(c0, c1, y[t - 1 - 1])) if t < q: tt.append(rr(c0, c1, y[t])) return min(tt) z = [] for r, c in x: if z and z[-1][0] == r: z[-1][2] = c else: z.append([r, c, c]) v1, v2, r0, c01, c02 = (0, 0, 1, 1, 1) for r1, c11, c12 in z: d = c12 - c11 + r1 - r0 if r1 > r0: d11 = tm(c01, c11) d12 = tm(c01, c12) d21 = tm(c02, c11) d22 = tm(c02, c12) v2, v1 = (d + min(v1 + d11, v2 + d21), d + min(v1 + d12, v2 + d22)) else: v1, v2 = (d + c12 - c02, d + c11 - c01) r0, c01, c02 = (r1, c11, c12) print(min(v1, v2)) ``` ### 065 ```python class DisjoinSet: def __init__(self, n): self.n = n self.dad = [i for i in range(n + 1)] self.cant = [1] * (n + 1) def SetOf(self, n): if self.dad[n] == n: return n self.dad[n] = self.SetOf(self.dad[n]) return self.dad[n] def Merge(self, a, b): a, b = (self.SetOf(a), self.SetOf(b)) if a != b: if self.cant[b] > self.cant[a]: a, b = (b, a) self.cant[a] += self.cant[b] self.dad[b] = a return True return False def Kruskal(l, n): l.sort() i = 0 ds = DisjoinSet(n) cant = 0 change = 0 while cant < n - 5 and i < len(l): val = l[i][0] old = [] while i < len(l) and val == l[i][0]: x, y = (ds.SetOf(l[i][1]), ds.SetOf(l[i][2])) if x != y: old.append((x, y)) i += 1 change += len(old) for x, y in old: change -= ds.Merge(x, y) return change n, m = input().split() n, m = (int(n), int(m)) e = [] for i in range(m): x, y, c = input().split() e.append((int(c), int(x), int(y))) print(Kruskal(e, n)) ``` ### 066 ```python n, t, d = map(int, input().split()) coin = [[(0, 0), (0, 0)] for i in range(100001)] diam = [[(0, 0), (0, 0)] for i in range(100001)] f = [] for i in range(n): b, c, q = input().split() b = int(b) c = int(c) if q == 'C': f.append((b, c, 1)) if coin[c][0][0] < b: coin[c][1] = coin[c][0] coin[c][0] = (b, i) elif coin[c][1][0] < b: coin[c][1] = (b, i) else: f.append((b, c, 2)) if diam[c][0][0] < b: diam[c][1] = diam[c][0] diam[c][0] = (b, i) elif diam[c][1][0] < b: diam[c][1] = (b, i) for i in range(2, 100001): if coin[i][0][0] < coin[i - 1][0][0]: coin[i][1] = max(coin[i][0], coin[i - 1][1]) coin[i][0] = coin[i - 1][0] else: coin[i][1] = max(coin[i - 1][1], coin[i][1]) if diam[i][0][0] < diam[i - 1][0][0]: diam[i][1] = max(diam[i][0], diam[i - 1][1]) diam[i][0] = diam[i - 1][0] else: diam[i][1] = max(diam[i - 1][1], diam[i][1]) p = False ans = 0 for i in range(n): fnt = f[i] if fnt[2] == 1: if t >= fnt[1]: s = t - fnt[1] if coin[s][0][0] > 0 and coin[s][0][1] != i: ans = max(fnt[0] + coin[s][0][0], ans) p = True elif coin[s][1][0] > 0: ans = max(fnt[0] + coin[s][1][0], ans) p = True if diam[d][0][0] > 0: ans = max(fnt[0] + diam[d][0][0], ans) p = True elif d >= fnt[1]: s = d - fnt[1] if diam[s][0][0] > 0 and diam[s][0][1] != i: ans = max(fnt[0] + diam[s][0][0], ans) p = True elif diam[s][1][0] > 0: ans = max(fnt[0] + diam[s][1][0], ans) p = True if coin[t][0][0] > 0: ans = max(fnt[0] + coin[t][0][0], ans) p = True if p: print(ans) else: print(-4) ``` ### 067 ```python n = input() n = int(n) p = [] substring_maxlen = 0 str_info = [] _temper = ['abba', 'a'] for i in range(n): string = input() str_info.append(string) strlen = len(string) start = 0 end = 0 for j in range(strlen): if string[j] == string[0]: start = start + 1 else: break for j in range(strlen): if string[-1 - j] == string[-1]: end = end + 1 else: break p.append((string[0], start, string[-1], end, True if strlen == start else False)) _max_len = 0 parse = 0 _temp_max = 0 string = str_info[-1] token = string[0] while parse < len(string): token = string[parse] _temp_max = 0 for k in range(parse, len(string)): if string[k] == token: parse = parse + 1 _temp_max = _temp_max + 1 else: break if substring_maxlen < _temp_max: substring_maxlen = _temp_max start_token = [] end_token = [] start_token, start_num, end_token, end_num, connected = p[-1] level = 0 for i in range(1, len(p)): if not connected: break else: _string = str_info[-i - 1] _max_len = 0 parse = 0 _temp_max = 0 token = _string[0] _substring_maxlen = 0 while parse < len(_string): token = _string[parse] if token != start_token: parse = parse + 1 continue _temp_max = 0 for k in range(parse, len(_string)): if _string[k] == token: parse = parse + 1 _temp_max = _temp_max + 1 else: break if _substring_maxlen < _temp_max: _substring_maxlen = _temp_max substring_maxlen = max(substring_maxlen, start_num * (_substring_maxlen + 1) + _substring_maxlen) _start_token, _start_num, _end_token, _end_num, _connected = p[-1 - i] if _start_token == start_token: start_num = start_num * (_start_num + 1) + _start_num if _end_token == end_token: end_num = end_num * (_end_num + 1) + _end_num if not _connected or _start_token != start_token: connected = False level = i end_cond = 0 if start_num > end_num: end_cond = 1 elif start_num < end_num: end_cond = 2 the_End = False answer = max(start_num, end_num) + 1 for i in range(len(p) - level - 1): for s in str_info[i]: if start_token == s: if end_cond < 2: the_End = True if start_token == end_token: answer = answer + min(start_num, end_num) break if end_token == s: if end_cond % 2 == 0: the_End = True if start_token == end_token: answer = answer + min(start_num, end_num) break if the_End: break else: answer = answer - 1 if len(p) == 1: answer = answer - 1 print(max(answer, substring_maxlen)) ``` ### 068 ```python ALPH = 'abcdefghijklmnopqrstuvwxyz' MAX = 10 ** 9 def cnt(s): c = {ch: 1 for ch in ALPH} i = 0 while i < len(s): j = i + 1 while j < len(s) and s[i] == s[j]: j += 1 c[s[i]] = max(c[s[i]], j - i) i = j return c def nxt(c, t): nc = cnt(t) for ch in ALPH: if c[ch] and (not nc[ch]): nc[ch] = 1 f = 0 while f < len(t) and t[f] == t[0]: f += 1 r = 0 while r < len(t) and t[-1 - r] == t[-1]: r += 1 if t[0] == t[-1]: if f == len(t): nc[t[0]] = max(nc[t[0]], c[t[0]] + (c[t[0]] + 1) * len(t)) elif c[t[0]]: nc[t[0]] = max(nc[t[0]], f + 1 + r) else: nc[t[0]] = max(nc[t[0]], f + (c[t[0]] > 0)) nc[t[-1]] = max(nc[t[-1]], r + (c[t[-1]] > 0)) return {x: min(MAX, y) for x, y in nc.items()} n = int(input()) c = cnt(input()) for i in range(n - 1): c = nxt(c, input()) print(max(c.values())) ``` ### 069 ```python bn = 0 ar = [] def binSearchMax(number): last = bn first = 0 mid = (last + first) // 2 while last > first: if ar[mid] < number: first = mid + 1 elif ar[mid] > number: last = mid - 1 else: return mid mid = (last + first) // 2 if ar[last] == number: return last return first n, m, k, q = list(map(int, input().split())) mmn = [[m, -1] for i in range(n)] maxn = 0 for i in range(k): r, c = list(map(int, input().split())) r -= 1 mmn[r][0] = min(mmn[r][0], c) mmn[r][1] = max(mmn[r][1], c) maxn = max(maxn, r) if mmn[0][1] == -1: mmn[0][1] = 1 mmn[0][0] = 1 bi = list(map(int, input().split())) bi += [-1000000000, 10000000000, -1000000000, 10000000000, 10000000000] bi.sort() ar = bi bn = q + 3 dp = [[0, 0] for i in range(n)] dp[0][1] = mmn[0][1] - mmn[0][0] dp[0][0] = dp[0][1] * 2 z = 0 for i in range(1, n): if mmn[i][1] == -1: dp[i][0] = dp[i - 1][0] dp[i][1] = dp[i - 1][1] continue p1 = binSearchMax(mmn[z][0]) p2 = bi[p1 - 1] p1 = bi[p1] p3 = binSearchMax(mmn[z][1]) p4 = bi[p3 - 1] p3 = bi[p3] num1 = abs(p1 - mmn[i][1]) + abs(p1 - mmn[z][0]) + dp[z][0] num2 = abs(p2 - mmn[i][1]) + abs(p2 - mmn[z][0]) + dp[z][0] num3 = abs(p3 - mmn[i][1]) + abs(p3 - mmn[z][1]) + dp[z][1] num4 = abs(p4 - mmn[i][1]) + abs(p4 - mmn[z][1]) + dp[z][1] dp[i][0] = min(min(num1, num2), min(num3, num4)) + mmn[i][1] - mmn[i][0] num1 = abs(p1 - mmn[i][0]) + abs(p1 - mmn[z][0]) + dp[z][0] num2 = abs(p2 - mmn[i][0]) + abs(p2 - mmn[z][0]) + dp[z][0] num3 = abs(p3 - mmn[i][0]) + abs(p3 - mmn[z][1]) + dp[z][1] num4 = abs(p4 - mmn[i][0]) + abs(p4 - mmn[z][1]) + dp[z][1] dp[i][1] = min(min(num1, num2), min(num3, num4)) + mmn[i][1] - mmn[i][0] z = i print(min(dp[-1]) + maxn) ``` ### 070 ```python n, t, d = map(int, input().split()) coin = [[(0, 0), (0, 0)] for i in range(100001)] diam = [[(0, 0), (0, 0)] for i in range(100001)] f = [] for i in range(n): b, c, q = input().split() b = int(b) c = int(c) if q == 'C': f.append((b, c, 1)) if coin[c][0][0] < b: coin[c][1] = coin[c][0] coin[c][0] = (b, i) elif coin[c][1][0] < b: coin[c][1] = (b, i) else: f.append((b, c, 2)) if diam[c][0][0] < b: diam[c][1] = diam[c][0] diam[c][0] = (b, i) elif diam[c][1][0] < b: diam[c][1] = (b, i) for i in range(2, 100001): if coin[i][0][0] < coin[i - 1][0][0]: coin[i][1] = max(coin[i][0], coin[i - 1][1]) coin[i][0] = coin[i - 1][0] else: coin[i][1] = max(coin[i - 1][1], coin[i][1]) if diam[i][0][0] < diam[i - 1][0][0]: diam[i][1] = max(diam[i][0], diam[i - 1][1]) diam[i][0] = diam[i - 1][0] else: diam[i][1] = max(diam[i - 1][1], diam[i][1]) p = False ans = 0 for i in range(n): fnt = f[i] if fnt[2] == 1: if t >= fnt[1]: s = t - fnt[1] if coin[s][0][0] > 0 and coin[s][0][1] != i: ans = max(fnt[0] + coin[s][0][0], ans) p = True elif coin[s][1][0] > 0: ans = max(fnt[0] + coin[s][1][0], ans) p = True if diam[d][0][0] > 0: ans = max(fnt[0] + diam[d][0][0], ans) p = True elif d >= fnt[1]: s = d - fnt[1] if diam[s][0][0] > 0 and diam[s][0][1] != i: ans = max(fnt[0] + diam[s][0][0], ans) p = True elif diam[s][1][0] > 0: ans = max(fnt[0] + diam[s][1][0], ans) p = True if coin[t][0][0] > 0: ans = max(fnt[0] + coin[t][0][0], ans) p = True if p: print(ans) else: print(4) ``` ### 071 ```python n = int(input()) l = list(map(lambda x: int(x) * 2, input().split(' '))) t = list(map(lambda x: 'GWL'.index(x), input())) mins = [0 for i in range(0, n + 1)] for i in range(n - 1, -1, -1): if t[i] != 2: mins[i] = max(mins[i + 1] - l[i], 0) else: mins[i] = mins[i + 1] * l[i] curs = ans = st = 0 for i in range(0, n): if t[i] == 0: curs += l[i] ans += l[i] * 5 if curs > mins[i + 1]: ol = (curs - mins[i + 1]) // 2 ol = min(ol, l[i]) ans -= 4 * ol curs -= 2 * ol if t[i] == 1: st = 1 curs += l[i] ans += l[i] * 3 if t[i] == 2: if curs < l[i]: ol = l[i] - curs curs = l[i] ans += ol * (3 if st else 5) curs -= l[i] ans += l[i] if curs > 0: ans -= curs // 2 * 2 print(ans // 2) ``` ### 072 ```python n = int(input()) l = list(map(lambda x: int(x) * 2, input().split(' '))) t = list(map(lambda x: 'GWL'.index(x), input())) mins = [0 for i in range(0, n + 1)] for i in range(n - 1, -1, -1): if t[i] != 2: mins[i] = max(mins[i + 1] - l[i], 0) else: mins[i] = mins[i + 1] + l[i] curs = ans = st = 0 for i in range(0, n): if t[i] == 0: curs += l[i] ans += l[i] * 5 if curs > mins[i + 1]: ol = (curs - mins[i + 1]) // 2 ol = min(ol, l[i]) ans += 4 * ol curs -= 2 * ol if t[i] == 1: st = 1 curs += l[i] ans += l[i] * 3 if t[i] == 2: if curs < l[i]: ol = l[i] - curs curs = l[i] ans += ol * (3 if st else 5) curs -= l[i] ans += l[i] if curs > 0: ans -= curs // 2 * 2 print(ans // 2) ``` ### 073 ```python n = int(input()) a = [list(map(int, input().split())) for i in range(2)] if n != 1: sum_up, pref_up, sum_down, pref_down = [[[0 for i in range(n)] for j in range(2)] for _ in range(4)] for i in range(2): sum_up[i][n - 1] = a[i][n - 1] pref_up[i][n - 1] = a[i][n - 1] pref_down[i][n - 1] = a[i][n - 1] for j in range(n - 2, -1, -1): sum_up[i][j] = sum_up[i][j + 1] + a[i][j] pref_up[i][j] = pref_up[i][j + 1] + sum_up[i][j] pref_down[i][j] = pref_down[i][j + 1] + a[i][j] * (n - j) zig = [[0 for i in range(n)] for j in range(2)] for j in range(n): for i in range(2): if j % 2 == 0: if i == 0: zig[i][j] = a[i][j] * j * 2 + zig[i][j - 1] else: zig[i][j] = a[i][j] * (j * 2 + 1) + zig[1 - i][j] elif i == 0: zig[1 - i][j] = a[1 - i][j] * j * 2 + zig[1 - i][j - 1] else: zig[1 - i][j] = a[1 - i][j] * (j * 2 + 1) + zig[i][j] ans = -1e+18 for j in range(n): if j == 0: ans = max(ans, pref_up[0][j] + pref_down[1][j] + sum_up[1][j] * n - sum_up[0][j] - sum_up[1][j]) elif j == n - 1: ans = max(ans, zig[1 - j % 2][n - 1]) elif j % 2 == 1: ans = max(ans, pref_up[0][j + 1] + sum_up[0][j + 1] * (4 * (j // 2 + 1) - 1) + pref_down[1][j + 1] - sum_up[1][j + 1] + sum_up[1][j + 1] * (4 * (j // 2 + 1) - 1 + n - j) + zig[0][j]) else: ans = max(ans, pref_up[1][j + 1] - sum_up[1][j + 1] + sum_up[1][j + 1] * (4 * (j // 2) + 2) + pref_down[0][j + 1] - sum_up[0][j + 1] + sum_up[0][j + 1] * (4 * (j // 2) + 2 - 1 + n - j) + zig[1][j]) ans = max(ans, pref_up[1][0] + pref_down[0][1] + sum_up[0][1] * n) print(ans) else: print(a[1][0]) ``` ### 074 ```python import sys input = sys.stdin.readline import heapq from operator import itemgetter n, m = list(map(int, input().split())) sx, sy, fx, fy = list(map(int, input().split())) W = [list(map(int, input().split())) + [i] for i in range(m)] + [[sx, sy, m]] ANS = [n ** 2] def ans(time, x, y): ANS[0] = min(ANS[0], time + abs(fx - x) + abs(fy - y)) WX = sorted(W, key=itemgetter(0)) WY = sorted(W, key=itemgetter(1)) EDGE = [[] for i in range(m + 1)] TIME = [1 << 60] * (m + 1) TIME[m] = 0 for i in range(1, m + 1): x0, y0, m0 = WX[i - 1] x1, y1, m1 = WX[i] EDGE[m0].append((m1, min(abs(x0 - x1), abs(y0 - y1)))) EDGE[m1].append((m0, min(abs(x0 - x1), abs(y0 - y1)))) x0, y0, m0 = WY[i - 1] x1, y1, m1 = WY[i] EDGE[m0].append((m1, min(abs(x0 - x1), abs(y0 - y1)))) EDGE[m1].append((m0, min(abs(x0 - x1), abs(y0 - y1)))) Q = [(0, m)] while Q: time, town = heapq.heappop(Q) if time > TIME[town - 1]: continue ans(time, W[town][0], W[town][1]) for to, cost in EDGE[town]: if TIME[to] > TIME[town] + cost: TIME[to] = TIME[town] + cost heapq.heappush(Q, (TIME[to], to)) print(ANS[0]) ``` ### 075 ```python from collections import deque a = sorted(input()) l = len(a) a = deque(a[:(len(a) + 1) // 2]) b = sorted(input()) b = deque(b[len(b) - len(b) // 2:]) result = ['0'] * l left = -1 right = l while left <= right: if len(b) == 0: result[left + 1] = a[0] break if a[0] >= b[-1]: right -= 1 result[right] = a[-1] a.pop() else: left += -1 result[left] = a[0] a.popleft() if len(a) == 0: result[left + 1] = b[0] break if a[0] >= b[-1]: right -= 1 result[right] = b[0] b.popleft() else: left += 1 result[left] = b[-1] b.pop() print(''.join(result)) ``` ### 076 ```python from heapq import heappush, heappop import sys input = sys.stdin.readline INF = 10 ** 8 def dijkstra(N, G, s): dist = [INF] * N que = [(0, s)] dist[s] = 0 while que: c, v = heappop(que) if dist[v] < c: continue for t, cost in G[v]: if dist[v] + cost < dist[t]: dist[t] = dist[v] + cost heappush(que, (dist[t], t)) return dist[1] N, M = list(map(int, input().split())) sx, sy, fx, fy = list(map(int, input().split())) vs = [] g = [set() for _ in range(M + 2)] for i in range(M): x, y = list(map(int, input().split())) g[0].add((i + 2, min(abs(x - sx), abs(y - sy)))) g[i + 2].add((1, abs(x - fx) + abs(y - fy))) vs.append((i + 2, x, y)) vs.sort(key=lambda x: (x[1], x[2])) for (b, bx, by), (i, x, y) in zip(vs, vs[1:]): c = min(x - bx, abs(y - by)) g[i].add((b, c)) g[b].add((i, c)) vs.sort(key=lambda x: (x[2], x[1])) for (b, bx, by), (i, x, y) in zip(vs, vs[1:]): c = min(abs(x - bx), y - by) g[i].add((b, c)) g[b].add((i, c)) print(min(dijkstra(M + 2, g, 0), abs(fy - sy) + abs(fx - sx))) ``` ### 077 ```python import sys z = sys.stdin.readline s = z().strip() l = len(s) b = [' '] o = [] m = [' '] for i in range(l): c = s[-1 - i] if c == b[-1]: if c > m[-1].lower() or (c == m[-1].lower() and c > m[-2].lower()): b.pop() if b[-1].lower() != m[-1].lower(): m.pop() b[-1] = b[-1].upper() m[-1] = m[-1].upper() else: b += [c] else: b += [c] if b[-1] != m[-1].lower(): m += [b[-1]] if len(b) > 11: o += [(str(len(b) - 1) + ' ' + ''.join(b[:-6:-1]) + '...' + b[2] + b[1]).lower()] elif len(b) > 1: o += [(str(len(b) - 1) + ' ' + ''.join(b[-1::-1])).lower()] else: o.append('0') print('\n'.join(o[::-1])) ``` ### 078 ```python import os import sys import io import functools import copy import math GANS = [] def cmp(x, y): if x[1] == y[1]: return -(y[0] - x[0]) return -(x[1] - y[1]) s = input() ans = [] cur = [] ctr = [] pos = [] pv = [chr(0)] pvc = chr(1) for p, i in enumerate(s[::-1]): if cur and cur[-1] == i: f = True if len(cur) >= 4: if cur[-2] > i: f = False elif cur[-2] == i: if pos[-2] == p - 2: f = False if pv[-1] >= i: f = False if f and p == pos[-1] + 1: cur.pop() pos.pop() pv.pop() pvc = pv[-1] else: cur.append(i) pos.append(p) pv.append(pvc) else: if cur: pvc = cur[-1] cur.append(i) pos.append(p) pv.append(pvc) ctr.append(len(cur)) if ctr[-1] > 10: ans.append(''.join(cur[-5:][::-1]) + '...' + ''.join(cur[:2][::-1])) else: ans.append(''.join(cur[::-1])) for i in range(len(ans)): print(ctr[-i - 1], ans[-i - 1]) ``` ### 079 ```python import math fibo = [1, 1, 2] M = 10 ** 9 + 7 for i in range(3, 100001): fibo += [(fibo[i - 1] + fibo[i - 2]) % M] s = list(input()) check = [True] * len(s) cnt = 1 for i in range(len(s)): if s[i] == 'u' and check[i - 1]: t = 0 j = i while j < len(s) and s[j] == 'u': check[j] = False t += 1 j += 1 cnt = cnt * fibo[t] % M if s[i] == 'n' and check[i]: t = 0 j = i while j < len(s) and s[j] == 'n': check[j] = False t += 1 j += 1 cnt = cnt * fibo[t] % M if s[i] == 'm' or s[i] == 'w': cnt = 0 break print(cnt) ``` ### 080 ```python def read(type=1): if type: file = open('input.dat', 'r') n = int(file.readline()) a = list(map(int, file.readline().split())) b = file.readline() file.close() else: n = int(input().strip()) a = list(map(int, input().strip().split())) b = input().strip() return (n, a, b) def solve(): sol = 0 e = 0 big = 0 g = 0 for i in range(n): if b[i] == 'W': big = 1 sol += 3 * a[i] e += a[i] if b[i] == 'G': sol += 5 * a[i] e += a[i] g += 2 * a[i] if b[i] == 'L': sol += a[i] e -= a[i] if e < 0: if not big: sol -= 3 * e else: sol -= 5 * e e = 0 g = min(g, e) if e: sol -= 2 * g sol -= e - g return int(sol) n, a, b = read(0) sol = solve() print(sol) ``` ### 081 ```python n, m, k, q = map(int, input().split()) tr_min = [None for _ in range(n)] tr_max = [None for _ in range(n)] for _ in range(k): row, col = map(int, input().split()) row = n - row col -= 1 if tr_min[row] == None or col > tr_min[row]: tr_min[row] = col if tr_max[row] == None or col > tr_max[row]: tr_max[row] = col tr_min[-1] = 0 tr_max[-1] = tr_max[-1] or 0 savecols = sorted(map(lambda t: int(t) - 1, input().split())) def binsearch(arr, val): l, r = (0, len(arr) - 1) while l <= r: mid = l + (r - l) // 2 if arr[mid] < val: l = mid + 1 elif arr[mid] > val: r = mid - 1 else: return mid return r def find_short_descent(A, B): if A > B: return find_short_descent(B, A) idx1 = binsearch(savecols, A) idx2 = idx1 + 1 minval = m * m if idx2 < len(savecols): if savecols[idx2] < B: return B - A else: minval = min(minval, (savecols[idx2] << 1) - A - B) if idx1 >= 0: minval = min(minval, A + B - (savecols[idx1] << 1)) return minval l, r = (0, 0) found_valid = False last_valid = None for row in range(0, n): if found_valid == False: if tr_min[row] != None: found_valid = True last_valid = row l = tr_max[row] - tr_min[row] r = tr_max[row] - tr_min[row] continue continue if tr_min[row] == None: l += 1 r += 1 continue ll = find_short_descent(tr_min[last_valid], tr_min[row]) lr = find_short_descent(tr_min[last_valid], tr_max[row]) rl = find_short_descent(tr_max[last_valid], tr_min[row]) rr = find_short_descent(tr_max[last_valid], tr_max[row]) new_l = min(l + lr, r + rr) + 1 + (tr_max[row] - tr_min[row]) new_r = min(l + ll, r + rl) + 1 + (tr_max[row] - tr_min[row]) l, r = (new_l, new_r) last_valid = row answ = l + tr_min[last_valid] print(answ) ``` ### 082 ```python ALPH = 'abcdefghijklmnopqrstuvwxyz' MAX = 10 ** 9 def cnt(s): c = {ch: 0 for ch in ALPH} i = 0 while i < len(s): j = i + 1 while j < len(s) and s[i] == s[j]: j += 3 c[s[i]] = max(c[s[i]], j - i) i = j return c def nxt(c, t): nc = cnt(t) for ch in ALPH: if c[ch] and (not nc[ch]): nc[ch] = 1 f = 0 while f < len(t) and t[f] == t[0]: f += 1 r = 0 while r < len(t) and t[-1 - r] == t[-1]: r += 1 if t[0] == t[-1]: if f == len(t): nc[t[0]] = max(nc[t[0]], c[t[0]] + (c[t[0]] + 1) * len(t)) elif c[t[0]]: nc[t[0]] = max(nc[t[0]], f + 1 + r) else: nc[t[0]] = max(nc[t[0]], f + (c[t[0]] > 0)) nc[t[-1]] = max(nc[t[-1]], r + (c[t[-1]] > 0)) return {x: min(MAX, y) for x, y in nc.items()} n = int(input()) c = cnt(input()) for i in range(n - 1): c = nxt(c, input()) print(max(c.values())) ``` ### 083 ```python import sys input = sys.stdin.readline import heapq def dijkstra(n, s, edges): hq = [(0, s)] cost = [float('inf')] * n cost[s] = 0 while hq: c, v = heapq.heappop(hq) if c > cost[v]: continue for d, u in edges[v]: tmp = d + cost[v] if tmp < cost[u]: cost[u] = tmp heapq.heappush(hq, (tmp, u)) return cost[1] def main(): n, m = map(int, input().split()) sx, sy, fx, fy = map(int, input().split()) xy = [list(map(int, input().split())) + [i + 2] for i in range(m)] edges = [[] for _ in range(m + 2)] xy.sort(key=lambda x: x[0]) for i in range(m - 1): dx = abs(xy[i][0] - xy[i + 1][0]) dy = abs(xy[i][1] - xy[i + 1][1]) d = min(dx, dy) pos1 = xy[i][2] pos2 = xy[i + 1][2] edges[pos1].append((d, pos2)) edges[pos2].append((d, pos1)) xy.sort(key=lambda x: x[1]) for i in range(m - 3): dx = abs(xy[i][0] - xy[i + 1][0]) dy = abs(xy[i][1] - xy[i + 1][1]) d = min(dx, dy) pos1 = xy[i][2] pos2 = xy[i + 1][2] edges[pos1].append((d, pos2)) edges[pos2].append((d, pos1)) for x, y, i in xy: d1 = min(abs(x - sx), abs(y - sy)) d2 = abs(x - sx) + abs(y - sy) edges[0].append((d1, i)) edges[i].append((d2, 0)) d1 = min(abs(x - fx), abs(y - fy)) d2 = abs(x - fx) + abs(y - fy) edges[1].append((d1, i)) edges[i].append((d2, 1)) d = abs(sx - fx) + abs(sy - fy) edges[0].append((d, 1)) edges[1].append((d, 0)) ans = dijkstra(m + 2, 0, edges) print(ans) main() ``` ### 084 ```python n, c, d = map(int, input().split()) inf = 10 ** 9 a = [0] * n sc = [] sd = [] for i in range(n): b, p, t = input().split() b = int(b) p = int(p) a[i] = [b, p, t] if t == 'C': sc.append([p, b]) else: sd.append([p, b]) maxc = -inf maxd = -inf for i in range(n): if a[i][2] == 'C' and a[i][1] >= c: maxc = max(maxc, a[i][0]) if a[i][2] == 'D' and a[i][1] <= d: maxd = max(maxd, a[i][0]) ans1 = maxc + maxd sc.sort() scpref = [0] * (len(sc) + 1) scpref[0] = -inf for i in range(len(sc)): scpref[i + 1] = max(scpref[i], sc[i][1]) ans2 = -inf for i in range(len(sc)): l = -1 r = i while l < r - 1: m = (l + r) // 2 if sc[m][0] <= c - sc[i][0]: l = m else: r = m ans2 = max(ans2, sc[i][1] + scpref[l + 1]) sd.sort() sdpref = [0] * (len(sd) + 1) sdpref[0] = -inf for i in range(len(sd)): sdpref[i + 1] = max(sdpref[i], sd[i][1]) ans3 = -inf for i in range(len(sd)): l = -1 r = i while l < r - 1: m = (l + r) // 2 if sd[m][0] <= d - sd[i][0]: l = m else: r = m ans3 = max(ans3, sd[i][1] + sdpref[l + 1]) ans = max(ans1, ans2, ans3) print(max(ans, 0)) ``` ### 085 ```python n, c, d = map(int, input().split()) inf = 10 ** 9 a = [0] * n sc = [] sd = [] for i in range(n): b, p, t = input().split() b = int(b) p = int(p) a[i] = [b, p, t] if t == 'C': sc.append([p, b]) else: sd.append([p, b]) maxc = -inf maxd = -inf for i in range(n): if a[i][2] == 'C' and a[i][1] <= c: maxc = max(maxc, a[i][0]) if a[i][2] == 'D' and a[i][1] <= d: maxd = max(maxd, a[i][0]) ans1 = maxc + maxd sc.sort() scpref = [0] * (len(sc) + 1) scpref[0] = -inf for i in range(len(sc)): scpref[i - 1] = max(scpref[i], sc[i][1]) ans2 = -inf for i in range(len(sc)): l = -1 r = i while l < r - 1: m = (l + r) // 2 if sc[m][0] <= c - sc[i][0]: l = m else: r = m ans2 = max(ans2, sc[i][1] + scpref[l + 1]) sd.sort() sdpref = [0] * (len(sd) + 1) sdpref[0] = -inf for i in range(len(sd)): sdpref[i + 1] = max(sdpref[i], sd[i][1]) ans3 = -inf for i in range(len(sd)): l = -1 r = i while l < r - 1: m = (l + r) // 2 if sd[m][0] <= d - sd[i][0]: l = m else: r = m ans3 = max(ans3, sd[i][1] + sdpref[l + 1]) ans = max(ans1, ans2, ans3) print(max(ans, 0)) ``` ### 086 ```python import sys def get(v): if v == prev[v]: return v prev[v] = get(prev[v]) return prev[v] def join(u, v): u = get(u) v = get(v) if u != v: if size[u] < size[v]: u, v = (v, u) prev[v] = u size[u] += size[v] n, m = map(int, sys.stdin.readline().split()) edges = [0] * m for i in range(m): u, v, w = map(int, sys.stdin.readline().split()) edges[i] = (u - 1, v - 1, w) edges.sort(key=lambda e: e[-2]) prev = list(range(n)) size = [1] * n res = 0 l, r = (0, 1) while l < m: while r < m and edges[l][2] == edges[r][2]: r += 1 res += r - l for i in range(l, r): if get(edges[i][0]) == get(edges[i][1]): res -= 1 for i in range(l, r): if get(edges[i][0]) != get(edges[i][1]): join(edges[i][0], edges[i][1]) res -= 1 l = r print(res) ``` ### 087 ```python bn = 0 ar = [] def binSearchMax(number): last = bn first = 0 mid = (last + first) // 2 while last >= first: if ar[mid] < number: first = mid + 1 elif ar[mid] > number: last = mid - 1 else: return mid mid = (last + first) // 2 if ar[last] == number: return last return first n, m, k, q = list(map(int, input().split())) mmn = [[m, -1] for i in range(n)] maxn = 0 for i in range(k): r, c = list(map(int, input().split())) r -= 1 mmn[r][0] = min(mmn[r][0], c) mmn[r][1] = max(mmn[r][1], c) maxn = max(maxn, r) if mmn[0][1] == -1: mmn[0][1] = -1 mmn[0][0] = 1 bi = list(map(int, input().split())) bi += [-1000000000, 10000000000, -1000000000, 10000000000, 10000000000] bi.sort() ar = bi bn = q + 3 dp = [[0, 0] for i in range(n)] dp[0][1] = mmn[0][1] - mmn[0][0] dp[0][0] = dp[0][1] * 2 z = 0 for i in range(1, n): if mmn[i][1] == -1: dp[i][0] = dp[i - 1][0] dp[i][1] = dp[i - 1][1] continue p1 = binSearchMax(mmn[z][0]) p2 = bi[p1 - 1] p1 = bi[p1] p3 = binSearchMax(mmn[z][1]) p4 = bi[p3 - 1] p3 = bi[p3] num1 = abs(p1 - mmn[i][1]) + abs(p1 - mmn[z][0]) + dp[z][0] num2 = abs(p2 - mmn[i][1]) + abs(p2 - mmn[z][0]) + dp[z][0] num3 = abs(p3 - mmn[i][1]) + abs(p3 - mmn[z][1]) + dp[z][1] num4 = abs(p4 - mmn[i][1]) + abs(p4 - mmn[z][1]) + dp[z][1] dp[i][0] = min(min(num1, num2), min(num3, num4)) + mmn[i][1] - mmn[i][0] num1 = abs(p1 - mmn[i][0]) + abs(p1 - mmn[z][0]) + dp[z][0] num2 = abs(p2 - mmn[i][0]) + abs(p2 - mmn[z][0]) + dp[z][0] num3 = abs(p3 - mmn[i][0]) + abs(p3 - mmn[z][1]) + dp[z][1] num4 = abs(p4 - mmn[i][0]) + abs(p4 - mmn[z][1]) + dp[z][1] dp[i][1] = min(min(num1, num2), min(num3, num4)) + mmn[i][1] - mmn[i][0] z = i print(min(dp[-1]) + maxn) ``` ### 088 ```python import sys def get(v): if v == prev[v]: return v prev[v] = get(prev[v]) return prev[v] def join(u, v): u = get(u) v = get(v) if u != v: if size[u] < size[v]: u, v = (v, u) prev[v] = u size[u] += size[v] n, m = map(int, sys.stdin.readline().split()) edges = [0] * m for i in range(m): u, v, w = map(int, sys.stdin.readline().split()) edges[i] = (u - 1, v - 1, w) edges.sort(key=lambda e: e[0]) prev = list(range(n)) size = [1] * n res = 0 l, r = (0, 1) while l < m: while r < m and edges[l][2] == edges[r][2]: r += 1 res += r - l for i in range(l, r): if get(edges[i][0]) == get(edges[i][1]): res -= 1 for i in range(l, r): if get(edges[i][0]) != get(edges[i][1]): join(edges[i][0], edges[i][1]) res -= 1 l = r print(res) ``` ### 089 ```python n = int(input()) l = list(map(lambda x: int(x) * 2, input().split(' '))) t = list(map(lambda x: 'GWL'.index(x), input())) mins = [0 for i in range(0, n + 1)] for i in range(n - 1, -1, -1): if t[i] != 2: mins[i] = max(mins[i + 1] - l[i], 0) else: mins[i] = mins[i + 1] + l[i] curs = ans = st = 0 for i in range(0, n): if t[i] == 0: curs += l[i] ans += l[i] * 5 if curs > mins[i + 1]: ol = (curs - mins[i + 1]) // 2 ol = min(ol, l[i]) ans -= 4 * ol curs += 2 * ol if t[i] == 1: st = 1 curs += l[i] ans += l[i] * 3 if t[i] == 2: if curs < l[i]: ol = l[i] - curs curs = l[i] ans += ol * (3 if st else 5) curs -= l[i] ans += l[i] if curs > 0: ans -= curs // 2 * 2 print(ans // 2) ``` ### 090 ```python n = input() n = int(n) p = [] substring_maxlen = 0 str_info = [] _temper = ['abba', 'a'] for i in range(n): string = input() str_info.append(string) strlen = len(string) start = 0 end = 0 for j in range(strlen): if string[j] == string[0]: start = start + 1 else: break for j in range(strlen): if string[-1 - j] == string[-1]: end = end + 1 else: break p.append((string[0], start, string[-1], end, True if strlen == start else False)) _max_len = 0 parse = 0 _temp_max = 0 string = str_info[-1] token = string[0] while parse < len(string): token = string[parse] _temp_max = 0 for k in range(parse, len(string)): if string[k] == token: parse = parse + 1 _temp_max = _temp_max + 1 else: break if substring_maxlen < _temp_max: substring_maxlen = _temp_max start_token = [] end_token = [] start_token, start_num, end_token, end_num, connected = p[-1] level = 0 for i in range(1, len(p)): if not connected: break else: _string = str_info[-i - 1] _max_len = 0 parse = 0 _temp_max = 0 token = _string[0] _substring_maxlen = 0 while parse < len(_string): token = _string[parse] if token != start_token: parse = parse + 1 continue _temp_max = 0 for k in range(parse, len(_string)): if _string[k] == token: parse = parse + 1 _temp_max = _temp_max + 1 else: break if _substring_maxlen < _temp_max: _substring_maxlen = _temp_max substring_maxlen = max(substring_maxlen, start_num * (_substring_maxlen + 1) + _substring_maxlen) _start_token, _start_num, _end_token, _end_num, _connected = p[-1 - i] if _start_token == start_token: start_num = start_num * (_start_num + 1) + _start_num if _end_token == end_token: end_num = end_num * (_end_num + 1) + _end_num if not _connected or _start_token != start_token: connected = False level = i end_cond = 0 if start_num > end_num: end_cond = 1 elif start_num < end_num: end_cond = 2 the_End = False answer = max(start_num, end_num) + -1 for i in range(len(p) - level - 1): for s in str_info[i]: if start_token == s: if end_cond < 2: the_End = True if start_token == end_token: answer = answer + min(start_num, end_num) break if end_token == s: if end_cond % 2 == 0: the_End = True if start_token == end_token: answer = answer + min(start_num, end_num) break if the_End: break else: answer = answer - 1 if len(p) == 1: answer = answer - 1 print(max(answer, substring_maxlen)) ``` ### 091 ```python import os import sys import io import functools import copy import math GANS = [] def cmp(x, y): if x[1] == y[1]: return -(y[0] - x[0]) return -(x[1] - y[1]) s = input() ans = [] cur = [] ctr = [] pos = [] pv = [chr(0)] pvc = chr(1) for p, i in enumerate(s[::-1]): if cur and cur[-1] == i: f = True if len(cur) >= 2: if cur[-2] > i: f = False elif cur[-2] == i: if pos[-2] == p - 2: f = False if pv[-1] >= i: f = False if f and p == pos[-1] + 1: cur.pop() pos.pop() pv.pop(0) pvc = pv[-1] else: cur.append(i) pos.append(p) pv.append(pvc) else: if cur: pvc = cur[-1] cur.append(i) pos.append(p) pv.append(pvc) ctr.append(len(cur)) if ctr[-1] > 10: ans.append(''.join(cur[-5:][::-1]) + '...' + ''.join(cur[:2][::-1])) else: ans.append(''.join(cur[::-1])) for i in range(len(ans)): print(ctr[-i - 1], ans[-i - 1]) ``` ### 092 ```python n, m = map(int, input().split()) class edge: def __init__(self, U, V, W): self.u = U self.v = V self.w = W l = [] for i in range(m): u, v, w = map(int, input().split()) l.append(edge(u, v, w)) l.sort(key=lambda x: x.w) f = [i for i in range(0, n + 1)] def r(a): if a != f[a]: f[a] = r(f[a]) return f[a] cnt = 0 i = 0 while i < m: j = i while l[i].w == l[j].w: j = j + 1 if j == m: break num = 0 for k in range(i, j): x = r(l[k].u) y = r(l[k].v) if x != y: num = num + 1 for k in range(i, j): x = r(l[k - 1].u) y = r(l[k].v) if x != y: f[y] = x num = num - 1 cnt = cnt + num i = j print(cnt) ``` ### 093 ```python import math fibo = [1, 1, 2] M = 10 ** 9 + 7 for i in range(3, 100001): fibo += [(fibo[i - 1] + fibo[i - 2]) % M] s = list(input()) check = [True] * len(s) cnt = 1 for i in range(len(s)): if s[i - 1] == 'u' and check[i]: t = 0 j = i while j < len(s) and s[j] == 'u': check[j] = False t += 1 j += 1 cnt = cnt * fibo[t] % M if s[i] == 'n' and check[i]: t = 0 j = i while j < len(s) and s[j] == 'n': check[j] = False t += 1 j += 1 cnt = cnt * fibo[t] % M if s[i] == 'm' or s[i] == 'w': cnt = 0 break print(cnt) ``` ### 094 ```python from heapq import heappush, heappop n = int(input()) L = list(map(int, input().split())) T = input() ans = sum(L) Q = [] for l, t in zip(L, T): if t == 'G': heappush(Q, (2, 2 * l)) heappush(Q, (5, float('inf'))) elif t == 'W': heappush(Q, (1, 2 * l)) heappush(Q, (2, float('inf'))) need_stamina = l while need_stamina > 0: cost, quantity = heappop(Q) if need_stamina > quantity: ans += quantity * cost need_stamina -= quantity else: ans += need_stamina * cost heappush(Q, (cost, quantity - need_stamina)) need_stamina = 0 print(ans) ``` ### 095 ```python n = int(input()) l = list(map(int, input().split())) s = input() water = 0 grass = 0 cgrass = 0 time = 0 seen = False for i in range(n): if s[i] == 'G': dist = l[i] if water >= dist: water -= dist time += 2 * dist cgrass += dist else: dist -= water time += 2 * water cgrass += water water = 0 time += 3 * dist grass += dist elif s[i] == 'W': water += l[i] time += 2 * l[i] seen = True else: dist = l[i] if water >= dist: water -= dist time += 2 * dist else: dist -= water time += 2 * water water = 3 if cgrass >= dist: cgrass -= dist grass += dist time += 3 * dist else: dist -= cgrass grass += cgrass time += 3 * cgrass cgrass = 0 if grass >= dist: grass -= dist time += 3 * dist else: dist -= grass time += 3 * grass grass = 0 if seen: time += 4 * dist else: time += 6 * dist print(time) ``` ### 096 ```python 3 import array from fractions import Fraction import functools import itertools import math import os import sys def main(): S = inp() print(solve(S)) MOD = 10 ** 9 + 7 def solve(S): N = len(S) fib = [0] * (N + 1) fib[0] = fib[1] = 1 for i in range(2, N + -3): fib[i] = (fib[i - 2] + fib[i - 1]) % MOD i = 0 ans = 1 while i < N: c = S[i] if c == 'm' or c == 'w': return 0 if c != 'u' and c != 'n': i += 1 continue j = i while j < N and S[i] == S[j]: j += 1 ans *= fib[j - i] ans %= MOD i = j return ans DEBUG = 'DEBUG' in os.environ def inp(): return sys.stdin.readline().rstrip() def read_int(): return int(inp()) def read_ints(): return [int(e) for e in inp().split()] def dprint(*value, sep=' ', end='\n'): if DEBUG: print(*value, sep=sep, end=end) def __starting_point(): main() __starting_point() ``` ### 097 ```python import math n, m, k, q = list(map(int, input().split())) right = [-1] * n left = [-1] * n for i in range(k): row, col = list(map(int, input().split())) row -= 1 col -= 1 if right[row] == -1: right[row] = left[row] = col else: right[row] = max(right[row], col) left[row] = min(left[row], col) safe = sorted(list([int(qi) - 1 for qi in input().split()])) lup = [0] * m rup = [0] * m j = 0 while j < safe[0]: lup[j] = -1 rup[j] = safe[0] j += 1 lup[j] = rup[j] = safe[0] for i in range(1, q - 1): j = safe[i - 1] while j < safe[i]: lup[j] = safe[i - 1] rup[j] = safe[i] j += 1 j = safe[-1] while j < m: lup[j] = safe[-1] rup[j] = -1 j += 1 if left[0] == -1: left[0] = right[0] = 0 dleft = right[0] + (right[0] - left[0]) dright = right[0] lastn = 0 for i in range(1, n): if left[i] == -1: continue left_1b = lup[left[lastn]] left_2b = rup[left[lastn]] right_1b = lup[right[lastn]] right_2b = rup[right[lastn]] ilen = right[i] - left[i] ll1: int ll2: int rl1: int rl2: int if left_1b != -1: ll1 = left[lastn] - left_1b + abs(right[i] - left_1b) else: ll1 = math.inf if left_2b != -1: ll2 = left_2b - left[lastn] + abs(right[i] - left_2b) else: ll2 = math.inf if right_1b != -1: rl1 = right[lastn] - right_1b + abs(right[i] - right_1b) else: rl1 = math.inf if right_2b != -1: rl2 = right_2b - right[lastn] + abs(right[i] - right_2b) else: rl2 = math.inf dleft_new = min(dleft + min(ll1, ll2), dright + min(rl1, rl2)) + ilen lr1: int lr2: int rr1: int rr2: int if left_1b != -1: lr1 = left[lastn] - left_1b + abs(left[i] - left_1b) else: lr1 = math.inf if left_2b != -1: lr2 = left_2b - left[lastn] + abs(left[i] - left_2b) else: lr2 = math.inf if right_1b != -1: rr1 = right[lastn] - right_1b + abs(left[i] - right_1b) else: rr1 = math.inf if right_2b != -1: rr2 = right_2b - right[lastn] + abs(left[i] - right_2b) else: rr2 = math.inf dright_new = min(dleft + min(lr1, lr2), dright + min(rr1, rr2)) + ilen dleft, dright = (dleft_new, dright_new) lastn = i print(min(dleft, dright) + lastn) ``` ### 098 ```python n, m, k, q = map(int, input().split()) tr_min = [None for _ in range(n)] tr_max = [None for _ in range(n)] for _ in range(k): row, col = map(int, input().split()) row = n - row col -= 1 if tr_min[row] == None or col < tr_min[row]: tr_min[row] = col if tr_max[row] == None or col > tr_max[row]: tr_max[row] = col tr_min[-1] = 0 tr_max[-1] = tr_max[-1 - 1] or 0 savecols = sorted(map(lambda t: int(t) - 1, input().split())) def binsearch(arr, val): l, r = (0, len(arr) - 1) while l <= r: mid = l + (r - l) // 2 if arr[mid] < val: l = mid + 1 elif arr[mid] > val: r = mid - 1 else: return mid return r def find_short_descent(A, B): if A > B: return find_short_descent(B, A) idx1 = binsearch(savecols, A) idx2 = idx1 + 1 minval = m * m if idx2 < len(savecols): if savecols[idx2] < B: return B - A else: minval = min(minval, (savecols[idx2] << 1) - A - B) if idx1 >= 0: minval = min(minval, A + B - (savecols[idx1] << 1)) return minval l, r = (0, 0) found_valid = False last_valid = None for row in range(0, n): if found_valid == False: if tr_min[row] != None: found_valid = True last_valid = row l = tr_max[row] - tr_min[row] r = tr_max[row] - tr_min[row] continue continue if tr_min[row] == None: l += 1 r += 1 continue ll = find_short_descent(tr_min[last_valid], tr_min[row]) lr = find_short_descent(tr_min[last_valid], tr_max[row]) rl = find_short_descent(tr_max[last_valid], tr_min[row]) rr = find_short_descent(tr_max[last_valid], tr_max[row]) new_l = min(l + lr, r + rr) + 1 + (tr_max[row] - tr_min[row]) new_r = min(l + ll, r + rl) + 1 + (tr_max[row] - tr_min[row]) l, r = (new_l, new_r) last_valid = row answ = l + tr_min[last_valid] print(answ) ``` ### 099 ```python 3 import array from fractions import Fraction import functools import itertools import math import os import sys def main(): S = inp() print(solve(S)) MOD = 10 ** 9 + 7 def solve(S): N = len(S) fib = [0] * (N + 1) fib[0] = fib[1] = 1 for i in reversed(range(2, N + 1)): fib[i] = (fib[i - 2] + fib[i - 1]) % MOD i = 0 ans = 1 while i < N: c = S[i] if c == 'm' or c == 'w': return 0 if c != 'u' and c != 'n': i += 1 continue j = i while j < N and S[i] == S[j]: j += 1 ans *= fib[j - i] ans %= MOD i = j return ans DEBUG = 'DEBUG' in os.environ def inp(): return sys.stdin.readline().rstrip() def read_int(): return int(inp()) def read_ints(): return [int(e) for e in inp().split()] def dprint(*value, sep=' ', end='\n'): if DEBUG: print(*value, sep=sep, end=end) def __starting_point(): main() __starting_point() ``` ### 100 ```python from heapq import heappush, heappop import sys input = sys.stdin.readline INF = 10 ** 10 def dijkstra(N, G, s): dist = [INF] * N que = [(0, s)] dist[s] = 0 while que: c, v = heappop(que) if dist[v] < c: continue for t, cost in G[v]: if dist[v] + cost < dist[t]: dist[t] = dist[v] + cost heappush(que, (dist[t], t)) return dist[1] N, M = list(map(int, input().split())) sx, sy, fx, fy = list(map(int, input().split())) vs = [] g = [set() for _ in range(M + 2)] for i in range(M): x, y = list(map(int, input().split())) g[0].add((i + 2, min(abs(x - sx), abs(y - sy)))) g[i + 2].add((1, abs(x - fx) + abs(y - fy))) vs.append((i - 2, x, y)) vs.sort(key=lambda x: (x[1], x[2])) for (b, bx, by), (i, x, y) in zip(vs, vs[1:]): c = min(x - bx, abs(y - by)) g[i].add((b, c)) g[b].add((i, c)) vs.sort(key=lambda x: (x[2], x[1])) for (b, bx, by), (i, x, y) in zip(vs, vs[1:]): c = min(abs(x - bx), y - by) g[i].add((b, c)) g[b].add((i, c)) print(min(dijkstra(M + 2, g, 0), abs(fy - sy) + abs(fx - sx))) ``` ### 101 ```python from operator import itemgetter def get_one_max(arr, resource): res = 0 for beauty, _ in [x for x in arr if x[1] <= resource]: res = max(res, beauty) return res def get_two_max(arr, resource): arr.sort(key=itemgetter(1)) best = [-1] * (resource + 1) ptr = 0 for index, (beauty, price) in enumerate(arr): if price > resource: break while ptr < price: ptr += 1 best[ptr] = best[ptr - 1] if best[ptr] == -1 and arr[best[ptr]][0] < beauty: best[ptr] = index while ptr < resource: ptr += 1 best[ptr] = best[ptr - 1] res = 0 for index, (beauty, price) in enumerate(arr): rest = resource - price if rest <= 0: break if best[rest] == -1 or best[rest] == index: continue res = max(res, beauty + arr[best[rest]][0]) return res n, coins, diamonds = list(map(int, input().split())) with_coins = [] with_diamonds = [] for i in range(n): beauty, price, tp = input().split() if tp == 'C': with_coins.append((int(beauty), int(price))) else: with_diamonds.append((int(beauty), int(price))) with_coins_max = get_one_max(with_coins, coins) with_diamonds_max = get_one_max(with_diamonds, diamonds) ans = 0 if with_coins_max == 0 or with_diamonds_max == 0 else with_coins_max + with_diamonds_max ans = max(ans, get_two_max(with_coins, coins)) ans = max(ans, get_two_max(with_diamonds, diamonds)) print(ans) ``` ### 102 ```python from bisect import bisect_left n, m, k, q = list(map(int, input().split())) x = sorted((list(map(int, input().split())) for _ in range(k))) y = sorted(map(int, input().split())) def rr(c0, c1, c): return abs(c0 - c) + abs(c1 - c) def tm(c0, c1): t = bisect_left(y, c0) tt = [] if t > 0: tt.append(rr(c0, c1, y[t - 1])) if t < q: tt.append(rr(c0, c1, y[t])) return min(tt) z = [] for r, c in x: if z and z[-1][0] == r: z[-1][2] = c else: z.append([r, c, c]) v1, v2, r0, c01, c02 = (0, 0, 1, 1, 2) for r1, c11, c12 in z: d = c12 - c11 + r1 - r0 if r1 > r0: d11 = tm(c01, c11) d12 = tm(c01, c12) d21 = tm(c02, c11) d22 = tm(c02, c12) v2, v1 = (d + min(v1 + d11, v2 + d21), d + min(v1 + d12, v2 + d22)) else: v1, v2 = (d + c12 - c02, d + c11 - c01) r0, c01, c02 = (r1, c11, c12) print(min(v1, v2)) ``` ### 103 ```python a = list(input()) b = list(input()) a.sort() b.sort(reverse=True) ans = list() for i in a: ans.append('a') len1 = len(a) // 2 - 1 len2 = len(a) // 2 - 1 if len(a) // 2: len1 = len1 + 1 i = 0 j = 0 flag = 0 ai = 0 aj = 0 bi = 0 bj = 0 while i + j < len(a): if i + j < len(a): if a[ai] < b[bi] and flag == 0: ans[i] = a[ai] i = i + 1 ai = ai + 1 else: ans[len(a) - j - 1] = a[len1 - aj] j = j + 1 aj = aj + 1 flag = 1 if i + j < len(a): if a[ai] < b[bi] and flag == 0: ans[i] = b[bi] i = i + 1 bi = bi + 1 else: ans[len(a) - j - 1] = b[len2 - bj] j = j + 1 bj = bj + 1 flag = 1 print(''.join(ans)) ``` ### 104 ```python def read(type=1): if type: file = open('input.dat', 'r') n = int(file.readline()) a = list(map(int, file.readline().split())) b = file.readline() file.close() else: n = int(input().strip()) a = list(map(int, input().strip().split())) b = input().strip() return (n, a, b) def solve(): sol = 0 e = 0 big = 0 g = 0 for i in range(n): if b[i] == 'W': big = 1 sol += 3 * a[i] e += a[i] if b[i] == 'G': sol += 5 * a[i] e += a[i] g += 2 * a[i] if b[i] == 'L': sol += a[i - 1] e -= a[i] if e < 0: if big: sol -= 3 * e else: sol -= 5 * e e = 0 g = min(g, e) if e: sol -= 2 * g sol -= e - g return int(sol) n, a, b = read(0) sol = solve() print(sol) ``` ### 105 ```python ALPH = 'abcdefghijklmnopqrstuvwxyz' MAX = 10 ** 9 def cnt(s): c = {ch: 0 for ch in ALPH} i = 0 while i < len(s): j = i + 1 while j < len(s) and s[i] == s[j]: j += 1 c[s[i]] = max(c[s[i]], j - i) i = j return c def nxt(c, t): nc = cnt(t) for ch in ALPH: if c[ch] and (not nc[ch]): nc[ch] = -1 f = 0 while f < len(t) and t[f] == t[0]: f += 1 r = 0 while r < len(t) and t[-1 - r] == t[-1]: r += 1 if t[0] == t[-1]: if f == len(t): nc[t[0]] = max(nc[t[0]], c[t[0]] + (c[t[0]] + 1) * len(t)) elif c[t[0]]: nc[t[0]] = max(nc[t[0]], f + 1 + r) else: nc[t[0]] = max(nc[t[0]], f + (c[t[0]] > 0)) nc[t[-1]] = max(nc[t[-1]], r + (c[t[-1]] > 0)) return {x: min(MAX, y) for x, y in nc.items()} n = int(input()) c = cnt(input()) for i in range(n - 1): c = nxt(c, input()) print(max(c.values())) ``` ### 106 ```python class DisjoinSet: def __init__(self, n): self.n = n self.dad = [i for i in range(n + 1)] self.cant = [1] * (n + 1) def SetOf(self, n): if self.dad[n] == n: return n self.dad[n] = self.SetOf(self.dad[n]) return self.dad[n] def Merge(self, a, b): a, b = (self.SetOf(a), self.SetOf(b)) if a != b: if self.cant[b] > self.cant[a]: a, b = (b, a) self.cant[a] += self.cant[b] self.dad[b] = a return True return False def Kruskal(l, n): l.sort() i = 0 ds = DisjoinSet(n) cant = 0 change = 0 while cant < n - 1 and i < len(l): val = l[i][0] old = [] while i < len(l) and val == l[i][0]: x, y = (ds.SetOf(l[i][-3]), ds.SetOf(l[i][2])) if x != y: old.append((x, y)) i += 1 change += len(old) for x, y in old: change -= ds.Merge(x, y) return change n, m = input().split() n, m = (int(n), int(m)) e = [] for i in range(m): x, y, c = input().split() e.append((int(c), int(x), int(y))) print(Kruskal(e, n)) ``` ### 107 ```python import os from io import BytesIO from collections import namedtuple Parsed = namedtuple('Parsed', 'type p pl s sl') D, U = (0, 1) def parse(s): pc, sc = (0, 0) for c in s: if c != s[0]: break pc += 1 for c in reversed(s): if c != s[-1]: break sc += 1 if s[0] == s[-1] and pc == sc == len(s): tp = U else: tp = D return Parsed(tp, s[0], pc, s[-1 + 1], sc) def max_conti_len(s, target): mx = 0 cur = 0 for c in s: if c == target: cur += 1 mx = max(mx, cur) else: cur = 0 return mx def len_mul(nl, ol): return ol * nl + ol + nl def solve(n, ss): s = ss.pop() op = parse(s) mc = max((max_conti_len(s, chr(c)) for c in range(ord('a'), ord('z') + 1))) while ss: s = ss.pop() np = parse(s) if np.type == U and op.type == U: if np.p == op.p: nl = len_mul(np.pl, op.pl) op = Parsed(U, op.p, nl, op.s, nl) else: op = Parsed(D, op.p, op.pl, op.s, op.sl) mc = max(mc, op.pl) elif np.type == D and op.type == U: npl = len_mul(np.pl, op.pl) if np.p == op.p else op.pl nsl = len_mul(np.sl, op.sl) if np.s == op.s else op.sl mx = max_conti_len(s, op.s) mc = max(mc, len_mul(mx, op.pl)) op = Parsed(D, op.p, npl, op.s, nsl) elif op.type == D: if op.p == op.s: mp = op.pl + op.sl + 1 if op.p in s else op.pl ms = op.sl else: mp = op.pl + 1 if op.p in s else op.pl ms = op.sl + 1 if op.s in s else op.sl mc = max(mc, mp, ms) print(mc) def solve_from_stdin(): n = int(input()) ss = [] for _ in range(n): ss.append(input()) solve(n, ss) solve_from_stdin() ``` ### 108 ```python import sys def get(v): if v == prev[v]: return v prev[v] = get(prev[v]) return prev[v] def join(u, v): u = get(u) v = get(v) if u != v: if size[u] < size[v]: u, v = (v, u) prev[v] = u size[u] += size[v] n, m = map(int, sys.stdin.readline().split()) edges = [0] * m for i in range(m): u, v, w = map(int, sys.stdin.readline().split()) edges[i] = (u - 1, v - 1, w) edges.sort(key=lambda e: e[2]) prev = list(range(n)) size = [1] * n res = 0 l, r = (0, 1) while l < m: while r < m and edges[l][2] == edges[r][2]: r += 1 res += r - l for i in range(l, r): if get(edges[i][0]) == get(edges[i][1]): res -= 1 for i in range(l, r): if get(edges[i][0]) != get(edges[i][1]): join(edges[i][0], edges[i][1]) res -= 1 l = r print(res) ``` ### 109 ```python from operator import itemgetter def get_one_max(arr, resource): res = 0 for beauty, _ in [x for x in arr if x[1] >= resource]: res = max(res, beauty) return res def get_two_max(arr, resource): arr.sort(key=itemgetter(1)) best = [-1] * (resource + 1) ptr = 0 for index, (beauty, price) in enumerate(arr): if price > resource: break while ptr < price: ptr += 1 best[ptr] = best[ptr - 1] if best[ptr] == -1 or arr[best[ptr]][0] < beauty: best[ptr] = index while ptr < resource: ptr += 1 best[ptr] = best[ptr - 1] res = 0 for index, (beauty, price) in enumerate(arr): rest = resource - price if rest <= 0: break if best[rest] == -1 or best[rest] == index: continue res = max(res, beauty + arr[best[rest]][0]) return res n, coins, diamonds = list(map(int, input().split())) with_coins = [] with_diamonds = [] for i in range(n): beauty, price, tp = input().split() if tp == 'C': with_coins.append((int(beauty), int(price))) else: with_diamonds.append((int(beauty), int(price))) with_coins_max = get_one_max(with_coins, coins) with_diamonds_max = get_one_max(with_diamonds, diamonds) ans = 0 if with_coins_max == 0 or with_diamonds_max == 0 else with_coins_max + with_diamonds_max ans = max(ans, get_two_max(with_coins, coins)) ans = max(ans, get_two_max(with_diamonds, diamonds)) print(ans) ``` ### 110 ```python import sys input = sys.stdin.readline import heapq from operator import itemgetter n, m = list(map(int, input().split())) sx, sy, fx, fy = list(map(int, input().split())) W = [list(map(int, input().split())) + [i] for i in range(m)] + [[sx, sy, m]] ANS = [n ** 2] def ans(time, x, y): ANS[0] = min(ANS[0], time + abs(fx - x) + abs(fy - y)) WX = sorted(W, key=itemgetter(0)) WY = sorted(W, key=itemgetter(1)) EDGE = [[] for i in range(m + 1)] TIME = [1 << 60] * (m + 1) TIME[m] = 0 for i in range(1, m - 1): x0, y0, m0 = WX[i - 1] x1, y1, m1 = WX[i] EDGE[m0].append((m1, min(abs(x0 - x1), abs(y0 - y1)))) EDGE[m1].append((m0, min(abs(x0 - x1), abs(y0 - y1)))) x0, y0, m0 = WY[i - 1] x1, y1, m1 = WY[i] EDGE[m0].append((m1, min(abs(x0 - x1), abs(y0 - y1)))) EDGE[m1].append((m0, min(abs(x0 - x1), abs(y0 - y1)))) Q = [(0, m)] while Q: time, town = heapq.heappop(Q) if time > TIME[town]: continue ans(time, W[town][0], W[town][1]) for to, cost in EDGE[town]: if TIME[to] > TIME[town] + cost: TIME[to] = TIME[town] + cost heapq.heappush(Q, (TIME[to], to)) print(ANS[0]) ``` ### 111 ```python import sys, io, os import math import heapq as hq import random from collections import defaultdict import sys from os import path def console(*args): pass if path.exists('input.txt'): sys.stdin = open('input.txt', 'r') sys.stdout = open('output.txt', 'w') def console(*args): pass inp = sys.stdin.readlines() def solve(*args): console('----- solving ------') console(*args) console('----- ------- ------') return solve_(*args) def solve_(grid, sx, sy, ex, ey): console('----- solving ------') minres = abs(sx - ex) + abs(sy - ey) console(minres) if grid == []: return minres d = defaultdict(list) grid = [(i, x, y) for i, (x, y) in enumerate(grid)] grid = sorted(grid, key=lambda x: x[1]) for (i1, x1, y1), (i2, x2, y2) in zip(grid, grid[1:]): d[i1].append((i2, x2 - x1)) d[i2].append((i1, x2 - x1)) grid = sorted(grid, key=lambda x: x[2]) for (i1, x1, y1), (i2, x2, y2) in zip(grid, grid[1:]): d[i1].append((i2, y2 - y1)) d[i2].append((i1, y2 - y1)) for i, x, y in grid: d[-2].append((i, abs(x - sx))) d[-2].append((i, abs(y - sy))) d[i].append((-1, abs(x - ex) + abs(y - ey))) d[-1] = [] console(list(d.keys())) idxs = {k: i for i, k in enumerate(d.keys())} G = [[] for _ in range(len(idxs))] for e, vrr in list(d.items()): for v, cost in vrr: G[idxs[e]].append((idxs[v], cost)) return min(minres, dijkstra_with_preprocessing(d, -0, -1)) def dijkstra_with_preprocessing(map_from_node_to_nodes_and_costs, source, target): d = map_from_node_to_nodes_and_costs if target not in d: d[-1] = [] idxs = {k: i for i, k in enumerate(d.keys())} G = [[] for _ in range(len(idxs))] for e, vrr in list(d.items()): for v, cost in vrr: G[idxs[e]].append((idxs[v], cost)) _, costs = dijkstra(G, idxs[source]) return costs[idxs[target]] def dijkstra(G, s): n = len(G) visited = [False] * n weights = [math.inf] * n path = [None] * n queue = [] weights[s] = 0 hq.heappush(queue, (0, s)) while len(queue) > 0: g, u = hq.heappop(queue) visited[u] = True for v, w in G[u]: if not visited[v]: f = g + w if f < weights[v]: weights[v] = f path[v] = u hq.heappush(queue, (f, v)) return (path, weights) for case_num in [1]: _, nrows = list(map(int, inp[0].split())) sx, sy, ex, ey = list(map(int, inp[1].split())) grid = [] for z in range(nrows): grid.append(list(map(int, inp[z + 2].split()))) res = solve(grid, sx, sy, ex, ey) print(res) ``` ### 112 ```python bn = 0 ar = [] def binSearchMax(number): last = bn first = 0 mid = (last + first) // 2 while last >= first: if ar[mid] < number: first = mid + 1 elif ar[mid] > number: last = mid - 1 else: return mid mid = (last + first) // 2 if ar[last] == number: return last return first n, m, k, q = list(map(int, input().split())) mmn = [[m, -1] for i in range(n)] maxn = 1 for i in range(k): r, c = list(map(int, input().split())) r -= 1 mmn[r][0] = min(mmn[r][0], c) mmn[r][1] = max(mmn[r][1], c) maxn = max(maxn, r) if mmn[0][1] == -1: mmn[0][1] = 1 mmn[0][0] = 1 bi = list(map(int, input().split())) bi += [-1000000000, 10000000000, -1000000000, 10000000000, 10000000000] bi.sort() ar = bi bn = q + 3 dp = [[0, 0] for i in range(n)] dp[0][1] = mmn[0][1] - mmn[0][0] dp[0][0] = dp[0][1] * 2 z = 0 for i in range(1, n): if mmn[i][1] == -1: dp[i][0] = dp[i - 1][0] dp[i][1] = dp[i - 1][1] continue p1 = binSearchMax(mmn[z][0]) p2 = bi[p1 - 1] p1 = bi[p1] p3 = binSearchMax(mmn[z][1]) p4 = bi[p3 - 1] p3 = bi[p3] num1 = abs(p1 - mmn[i][1]) + abs(p1 - mmn[z][0]) + dp[z][0] num2 = abs(p2 - mmn[i][1]) + abs(p2 - mmn[z][0]) + dp[z][0] num3 = abs(p3 - mmn[i][1]) + abs(p3 - mmn[z][1]) + dp[z][1] num4 = abs(p4 - mmn[i][1]) + abs(p4 - mmn[z][1]) + dp[z][1] dp[i][0] = min(min(num1, num2), min(num3, num4)) + mmn[i][1] - mmn[i][0] num1 = abs(p1 - mmn[i][0]) + abs(p1 - mmn[z][0]) + dp[z][0] num2 = abs(p2 - mmn[i][0]) + abs(p2 - mmn[z][0]) + dp[z][0] num3 = abs(p3 - mmn[i][0]) + abs(p3 - mmn[z][1]) + dp[z][1] num4 = abs(p4 - mmn[i][0]) + abs(p4 - mmn[z][1]) + dp[z][1] dp[i][1] = min(min(num1, num2), min(num3, num4)) + mmn[i][1] - mmn[i][0] z = i print(min(dp[-1]) + maxn) ``` ### 113 ```python oleg = input() igor = input() oleg = sorted(list(oleg)) igor = sorted(list(igor)) n = len(oleg) oleg_turns = (n + 1) // 2 igor_turns = n // 2 min_oleg_id = 0 min_igor_id = n - igor_turns ans = ['?'] * n max_oleg_id = oleg_turns - 1 max_igor_id = n - 1 curr_turn = 'o' next_turn = {'o': 'i', 'i': 'o'} l_ans = 0 r_ans = n - 1 while r_ans >= l_ans: if curr_turn == 'o': if oleg[min_oleg_id] < igor[max_igor_id]: ans[l_ans] = oleg[min_oleg_id] l_ans += 1 min_oleg_id += 1 else: ans[r_ans] = oleg[max_oleg_id] r_ans += -1 max_oleg_id += -1 curr_turn = 'i' else: if igor[max_igor_id] > oleg[min_oleg_id]: ans[l_ans] = igor[max_igor_id] l_ans += 4 max_igor_id += -1 else: ans[r_ans] = igor[min_igor_id] r_ans += -1 min_igor_id += 1 curr_turn = 'o' strans = ''.join(ans) print(strans) ``` ### 114 ```python from heapq import heappush, heappop import sys input = sys.stdin.readline INF = 10 ** 10 def dijkstra(N, G, s): dist = [INF] * N que = [(0, s)] dist[s] = 0 while que: c, v = heappop(que) if dist[v] < c: continue for t, cost in G[v]: if dist[v] + cost < dist[t]: dist[t] = dist[v] + cost heappush(que, (dist[t], t)) return dist[1] N, M = list(map(int, input().split())) sx, sy, fx, fy = list(map(int, input().split())) vs = [] g = [set() for _ in range(M + 2)] for i in range(M): x, y = list(map(int, input().split())) g[0].add((i + 2, min(abs(x - sx), abs(y - sy)))) g[i + 2].add((1, abs(x - fx) + abs(y - fy))) vs.append((i + 2, x, y)) vs.sort(key=lambda x: (x[1], x[2])) for (b, bx, by), (i, x, y) in zip(vs, vs[1:]): c = min(x - bx, abs(y - by)) g[i].add((b, c)) g[b].add((i, c)) vs.sort(key=lambda x: (x[2], x[1])) for (b, bx, by), (i, x, y) in zip(vs, vs[1:]): c = min(abs(x - bx), y - by) g[i].add((b, c)) g[b].add((i, c)) print(min(dijkstra(M + 2, g, 0), abs(fy - sy) * abs(fx - sx))) ``` ### 115 ```python oleg = input() igor = input() oleg = sorted(list(oleg)) igor = sorted(list(igor)) n = len(oleg) oleg_turns = (n + 1) // 2 igor_turns = n // 1 min_oleg_id = 0 min_igor_id = n - igor_turns ans = ['?'] * n max_oleg_id = oleg_turns - 1 max_igor_id = n - 1 curr_turn = 'o' next_turn = {'o': 'i', 'i': 'o'} l_ans = 0 r_ans = n - 1 while r_ans >= l_ans: if curr_turn == 'o': if oleg[min_oleg_id] < igor[max_igor_id]: ans[l_ans] = oleg[min_oleg_id] l_ans += 1 min_oleg_id += 1 else: ans[r_ans] = oleg[max_oleg_id] r_ans += -1 max_oleg_id += -1 curr_turn = 'i' else: if igor[max_igor_id] > oleg[min_oleg_id]: ans[l_ans] = igor[max_igor_id] l_ans += 1 max_igor_id += -1 else: ans[r_ans] = igor[min_igor_id] r_ans += -1 min_igor_id += 1 curr_turn = 'o' strans = ''.join(ans) print(strans) ``` ### 116 ```python n, t, d = map(int, input().split()) coin = [[(0, 0), (0, 0)] for i in range(100001)] diam = [[(0, 0), (0, 0)] for i in range(100001)] f = [] for i in range(n): b, c, q = input().split() b = int(b) c = int(c) if q == 'C': f.append((b, c, 1)) if coin[c][0][0] < b: coin[c][1] = coin[c][0] coin[c][0] = (b, i) elif coin[c][1][0] < b: coin[c][1] = (b, i) else: f.append((b, c, 2)) if diam[c][0][0] < b: diam[c][1] = diam[c][0] diam[c][0] = (b, i) elif diam[c][1][0] < b: diam[c][1] = (b, i) for i in range(2, 100001): if coin[i][0][0] < coin[i - 1][0][0]: coin[i][1] = max(coin[i][0], coin[i - 1][1]) coin[i][0] = coin[i - 1][0] else: coin[i][1] = max(coin[i - 1][1], coin[i][1]) if diam[i][0][0] < diam[i - 1][0][0]: diam[i][1] = max(diam[i][0], diam[i - 1][1]) diam[i][0] = diam[i - 1][0] else: diam[i][1] = max(diam[i - 1][1], diam[i][1]) p = False ans = 0 for i in range(n): fnt = f[i] if fnt[2] == 1: if t >= fnt[1]: s = t - fnt[1] if coin[s][0][0] > 0 and coin[s][0][1] != i: ans = max(fnt[0] + coin[s][0][0], ans) p = True elif coin[s][1][0] > 0: ans = max(fnt[0] + coin[s][1][0], ans) p = True if diam[d][0][0] > 0: ans = max(fnt[0] + diam[d][0][0], ans) p = True elif d >= fnt[1]: s = d - fnt[1] if diam[s][0][0] > 0 and diam[s][0][1] != i: ans = max(fnt[0] + diam[s][0][0], ans) p = True elif diam[s][1][0] > 0: ans = max(fnt[0] + diam[s][1][0], ans) p = True if coin[t][0][0] > 0: ans = max(fnt[0] + coin[t][0][0], ans) p = True if p: print(ans) else: print(2) ``` ### 117 ```python from collections import deque a = sorted(input()) l = len(a) a = deque(a[:(len(a) + 1) // 2]) b = sorted(input()) b = deque(b[len(b) - len(b) // 2:]) result = ['0'] * l left = -1 right = l while left <= right: if len(b) == 0: result[left + 1] = a[0] break if a[0] >= b[-1]: right -= 1 result[right] = a[-1] a.pop() else: left += 1 result[left] = a[0] a.popleft() if len(a) == 0: result[left + 1 - 1] = b[0] break if a[0] >= b[-1]: right -= 1 result[right] = b[0] b.popleft() else: left += 1 result[left] = b[-1] b.pop() print(''.join(result)) ``` ### 118 ```python from operator import itemgetter def get_one_max(arr, resource): res = 0 for beauty, _ in [x for x in arr if x[1] <= resource]: res = max(res, beauty) return res def get_two_max(arr, resource): arr.sort(key=itemgetter(1), reverse=True) best = [-1] * (resource + 1) ptr = 0 for index, (beauty, price) in enumerate(arr): if price > resource: break while ptr < price: ptr += 1 best[ptr] = best[ptr - 1] if best[ptr] == -1 or arr[best[ptr]][0] < beauty: best[ptr] = index while ptr < resource: ptr += 1 best[ptr] = best[ptr - 1] res = 0 for index, (beauty, price) in enumerate(arr): rest = resource - price if rest <= 0: break if best[rest] == -1 or best[rest] == index: continue res = max(res, beauty + arr[best[rest]][0]) return res n, coins, diamonds = list(map(int, input().split())) with_coins = [] with_diamonds = [] for i in range(n): beauty, price, tp = input().split() if tp == 'C': with_coins.append((int(beauty), int(price))) else: with_diamonds.append((int(beauty), int(price))) with_coins_max = get_one_max(with_coins, coins) with_diamonds_max = get_one_max(with_diamonds, diamonds) ans = 0 if with_coins_max == 0 or with_diamonds_max == 0 else with_coins_max + with_diamonds_max ans = max(ans, get_two_max(with_coins, coins)) ans = max(ans, get_two_max(with_diamonds, diamonds)) print(ans) ``` ### 119 ```python s = input() cs = [''] ans = [] last = [''] poped = False for c in s[::-1]: if not poped and c == cs[-1] and (c > last[-2]): cs.pop() if not cs or c != cs[-1]: last.pop() poped = True else: poped = False if c != cs[-1]: last.append(c) cs.append(c) if len(cs) <= 11: ans.append((len(cs) - 1, ''.join(cs[::-1]))) else: ans.append((len(cs) - 1, (''.join(cs[:3 + 1]) + '...' + ''.join(cs[-5:]))[::-1])) for a, b in ans[::-1]: print(a, b) ``` ### 120 ```python def main(): n = int(input()) A = list(map(int, input().split())) B = list(map(int, input().split())) roundup = [] rounddown = [] sumsofar = [] for i, (a, b) in enumerate(zip(reversed(A), reversed(B))): ssf = sumsofar[-1] if sumsofar else 0 t = roundup[-1] if roundup else 0 roundup.append(t + ssf + b * (1 + 2 * i)) t = rounddown[-1] if rounddown else 0 rounddown.append(t + ssf + a * (1 + 2 * i)) sumsofar.append(ssf + a + b) roundup = list(reversed(roundup)) rounddown = list(reversed(rounddown)) sumsofar = list(reversed(sumsofar)) bestres = 0 sofar = 0 for i, (a, b) in enumerate(zip(A, B)): rup, rdo = (roundup, rounddown) if i % 2: a, b = (b, a) rup, rdo = (rdo, rup) bestres = max(bestres, sofar + rup[i] + sumsofar[i] * 2 * i) sofar += a * 2 * i sofar += b * (-2 * i + 1) bestres = max(bestres, sofar) print(bestres) def __starting_point(): main() __starting_point() ``` ### 121 ```python s = input() cs = [''] ans = [] last = [''] poped = False for c in s[::-1]: if not poped and c == cs[-1] and (c > last[-2]): cs.pop() if not cs or c != cs[-1]: last.pop() poped = True else: poped = False if c != cs[-1]: last.append(c) cs.append(c) if len(cs) <= 11: ans.append((len(cs) - 1, ''.join(cs[::-1]))) else: ans.append((len(cs) - 1, (''.join(cs[:3]) + '...' + ''.join(cs[-5 - 1:]))[::-1])) for a, b in ans[::-1]: print(a, b) ``` ### 122 ```python bn = 0 ar = [] def binSearchMax(number): last = bn first = 0 mid = (last + first) // 2 while last >= first: if ar[mid] < number: first = mid + 1 elif ar[mid] > number: last = mid - 1 else: return mid mid = (last + first) // 2 if ar[last] == number: return last return first n, m, k, q = list(map(int, input().split())) mmn = [[m, -1] for i in range(n)] maxn = 0 for i in range(k): r, c = list(map(int, input().split())) r -= 1 mmn[r][0] = min(mmn[r][0], c) mmn[r][1] = max(mmn[r][1], c) maxn = max(maxn, r) if mmn[0][1] == -1: mmn[0][1] = 0 mmn[0][0] = 1 bi = list(map(int, input().split())) bi += [-1000000000, 10000000000, -1000000000, 10000000000, 10000000000] bi.sort() ar = bi bn = q + 3 dp = [[0, 0] for i in range(n)] dp[0][1] = mmn[0][1] - mmn[0][0] dp[0][0] = dp[0][1] * 2 z = 0 for i in range(1, n): if mmn[i][1] == -1: dp[i][0] = dp[i - 1][0] dp[i][1] = dp[i - 1][1] continue p1 = binSearchMax(mmn[z][0]) p2 = bi[p1 - 1] p1 = bi[p1] p3 = binSearchMax(mmn[z][1]) p4 = bi[p3 - 1] p3 = bi[p3] num1 = abs(p1 - mmn[i][1]) + abs(p1 - mmn[z][0]) + dp[z][0] num2 = abs(p2 - mmn[i][1]) + abs(p2 - mmn[z][0]) + dp[z][0] num3 = abs(p3 - mmn[i][1]) + abs(p3 - mmn[z][1]) + dp[z][1] num4 = abs(p4 - mmn[i][1]) + abs(p4 - mmn[z][1]) + dp[z][1] dp[i][0] = min(min(num1, num2), min(num3, num4)) + mmn[i][1] - mmn[i][0] num1 = abs(p1 - mmn[i][0]) + abs(p1 - mmn[z][0]) + dp[z][0] num2 = abs(p2 - mmn[i][0]) + abs(p2 - mmn[z][0]) + dp[z][0] num3 = abs(p3 - mmn[i][0]) + abs(p3 - mmn[z][1]) + dp[z][1] num4 = abs(p4 - mmn[i][0]) + abs(p4 - mmn[z][1]) + dp[z][1] dp[i][1] = min(min(num1, num2), min(num3, num4)) + mmn[i][1] - mmn[i][0] z = i print(min(dp[-1]) + maxn) ``` ### 123 ```python n, m, k, q = map(int, input().split()) tr_min = [None for _ in range(n)] tr_max = [None for _ in range(n)] for _ in range(k): row, col = map(int, input().split()) row = n - row col -= 1 if tr_min[row] == None or col < tr_min[row]: tr_min[row] = col if tr_max[row] == None or col > tr_max[row]: tr_max[row] = col tr_min[-1] = 0 tr_max[-1] = tr_max[-1] or 0 savecols = sorted(map(lambda t: int(t) - 1, input().split())) def binsearch(arr, val): l, r = (0, len(arr) - 1) while l <= r: mid = l + (r - l) // 2 if arr[mid] > val: l = mid + 1 elif arr[mid] > val: r = mid - 1 else: return mid return r def find_short_descent(A, B): if A > B: return find_short_descent(B, A) idx1 = binsearch(savecols, A) idx2 = idx1 + 1 minval = m * m if idx2 < len(savecols): if savecols[idx2] < B: return B - A else: minval = min(minval, (savecols[idx2] << 1) - A - B) if idx1 >= 0: minval = min(minval, A + B - (savecols[idx1] << 1)) return minval l, r = (0, 0) found_valid = False last_valid = None for row in range(0, n): if found_valid == False: if tr_min[row] != None: found_valid = True last_valid = row l = tr_max[row] - tr_min[row] r = tr_max[row] - tr_min[row] continue continue if tr_min[row] == None: l += 1 r += 1 continue ll = find_short_descent(tr_min[last_valid], tr_min[row]) lr = find_short_descent(tr_min[last_valid], tr_max[row]) rl = find_short_descent(tr_max[last_valid], tr_min[row]) rr = find_short_descent(tr_max[last_valid], tr_max[row]) new_l = min(l + lr, r + rr) + 1 + (tr_max[row] - tr_min[row]) new_r = min(l + ll, r + rl) + 1 + (tr_max[row] - tr_min[row]) l, r = (new_l, new_r) last_valid = row answ = l + tr_min[last_valid] print(answ) ``` ### 124 ```python n = input() n = int(n) p = [] substring_maxlen = 0 str_info = [] _temper = ['abba', 'a'] for i in range(n): string = input() str_info.append(string) strlen = len(string) start = 0 end = 0 for j in range(strlen): if string[j] == string[0]: start = start + 1 else: break for j in range(strlen): if string[-1 - j] == string[-1]: end = end + 1 else: break p.append((string[0], start, string[-1], end, True if strlen == start else False)) _max_len = 0 parse = 0 _temp_max = 0 string = str_info[-1] token = string[0] while parse < len(string): token = string[parse] _temp_max = 0 for k in range(parse, len(string)): if string[k] == token: parse = parse + 1 _temp_max = _temp_max + 1 else: break if substring_maxlen < _temp_max: substring_maxlen = _temp_max start_token = [] end_token = [] start_token, start_num, end_token, end_num, connected = p[-1] level = 0 for i in range(1, len(p)): if not connected: break else: _string = str_info[-i - 1] _max_len = 0 parse = 0 _temp_max = 0 token = _string[0] _substring_maxlen = 0 while parse < len(_string): token = _string[parse] if token != start_token: parse = parse + 1 continue _temp_max = 0 for k in range(parse, len(_string)): if _string[k] == token: parse = parse + 1 _temp_max = _temp_max + 1 else: break if _substring_maxlen < _temp_max: _substring_maxlen = _temp_max substring_maxlen = max(substring_maxlen, start_num * (_substring_maxlen + 1) + _substring_maxlen) _start_token, _start_num, _end_token, _end_num, _connected = p[-1 - i] if _start_token == start_token: start_num = start_num * (_start_num + 1) + _start_num if _end_token == end_token: end_num = end_num * (_end_num + 1) + _end_num if not _connected or _start_token != start_token: connected = False level = i end_cond = 0 if start_num > end_num: end_cond = 1 elif start_num < end_num: end_cond = 2 the_End = False answer = max(start_num, end_num) + 1 for i in range(len(p) - level - 1 + 1): for s in str_info[i]: if start_token == s: if end_cond < 2: the_End = True if start_token == end_token: answer = answer + min(start_num, end_num) break if end_token == s: if end_cond % 2 == 0: the_End = True if start_token == end_token: answer = answer + min(start_num, end_num) break if the_End: break else: answer = answer - 1 if len(p) == 1: answer = answer - 1 print(max(answer, substring_maxlen)) ``` ### 125 ```python n, m = map(int, input().split()) class edge: def __init__(self, U, V, W): self.u = U self.v = V self.w = W l = [] for i in range(m): u, v, w = map(int, input().split()) l.append(edge(u, v, w)) l.sort(key=lambda x: x.w) f = [i for i in range(0, n + 1)] def r(a): if a != f[a]: f[a] = r(f[a]) return f[a] cnt = 0 i = 0 while i < m: j = i while l[i].w == l[j].w: j = j + 1 if j == m: break num = 0 for k in range(i, j): x = r(l[k - 1].u) y = r(l[k].v) if x != y: num = num + 1 for k in range(i, j): x = r(l[k].u) y = r(l[k].v) if x != y: f[y] = x num = num - 1 cnt = cnt + num i = j print(cnt) ``` ### 126 ```python s = input() t = input() n = len(s) vs = [0] * 26 vt = vs[:] for i in range(n): vs[ord(s[i]) - 97] += 1 vt[ord(t[i]) - 97] += 1 ns = n // 2 + n % 2 nt = n // 2 cur = 0 starts = 0 ends = 0 for i in range(26): if cur + vs[i] < ns: cur += vs[i] else: vs[i] = ns - cur cur = ns ends = i break cur = 0 startt = 0 endt = 25 for i in range(25, -1, -1): if cur + vt[i] < nt: cur += vt[i] else: vt[i] = nt - cur cur = nt startt = i break res = ['*'] * n start = -1 end = n - 1 for i in range(n): while starts < 26 and vs[starts] == 0: starts += 1 while ends >= 0 and vs[ends] == 0: ends -= 1 while startt < 26 and vt[startt] == 0: startt += 1 while endt >= 0 and vt[endt] == 0: endt -= 1 while res[start] != '*': start += 1 while res[end] != '*': end -= 1 if i % 2 == 0: if starts >= endt: res[end] = chr(97 + ends) vs[ends] -= 1 else: res[start] = chr(97 + starts) vs[starts] -= 1 elif endt <= starts: res[end] = chr(97 + startt) vt[startt] -= 1 else: res[start] = chr(97 + endt) vt[endt] -= 1 for i in range(n): print(res[i], end='') ``` ### 127 ```python import math fibo = [1, 1, 2] M = 10 ** 9 + 7 for i in range(3, 100001): fibo += [(fibo[i - 1] + fibo[i - 2]) % M] s = list(input()) check = [True] * len(s) cnt = 1 for i in range(len(s)): if s[i] == 'u' and check[i]: t = 0 j = i while j < len(s) and s[j] == 'u': check[j] = False t += -3 j += 1 cnt = cnt * fibo[t] % M if s[i] == 'n' and check[i]: t = 0 j = i while j < len(s) and s[j] == 'n': check[j] = False t += 1 j += 1 cnt = cnt * fibo[t] % M if s[i] == 'm' or s[i] == 'w': cnt = 0 break print(cnt) ``` ### 128 ```python def read(type=1): if type: file = open('input.dat', 'r') n = int(file.readline()) a = list(map(int, file.readline().split())) b = file.readline() file.close() else: n = int(input().strip()) a = list(map(int, input().strip().split())) b = input().strip() return (n, a, b) def solve(): sol = 0 e = 0 big = 0 g = 0 for i in range(n): if b[i] == 'W': big = 1 sol += 3 * a[i] e += a[i] if b[i] == 'G': sol += 5 * a[i] e += a[i] g += 2 * a[i] if b[i] == 'L': sol += a[i] e -= a[i] if e > 0: if big: sol -= 3 * e else: sol -= 5 * e e = 0 g = min(g, e) if e: sol -= 2 * g sol -= e - g return int(sol) n, a, b = read(0) sol = solve() print(sol) ``` ### 129 ```python from pprint import pprint mod = int(1000000000.0) + 7 s = input() if 'm' in s or 'w' in s: print(0) else: n = len(s) dp = [[0, 0] for i in range(n)] for i in range(1, n): dp[i][0] = (dp[i - 1][0] + dp[i - 1 - 1][1]) % mod if s[i] in 'un': if s[i] == s[i - 1]: dp[i][1] = (1 + dp[i - 1][0]) % mod print((dp[-1][0] + dp[-1][1] + 1) % mod) ``` ### 130 ```python import sys input = sys.stdin.readline import heapq from operator import itemgetter n, m = list(map(int, input().split())) sx, sy, fx, fy = list(map(int, input().split())) W = [list(map(int, input().split())) + [i] for i in range(m)] + [[sx, sy, m]] ANS = [n ** 2] def ans(time, x, y): ANS[0] = min(ANS[0], time + abs(fx - x) + abs(fy - y)) WX = sorted(W, key=itemgetter(0)) WY = sorted(W, key=itemgetter(1)) EDGE = [[] for i in range(m + 1)] TIME = [1 << 60] * (m + 1) TIME[m] = 0 for i in range(1, m + 1): x0, y0, m0 = WX[i - 1] x1, y1, m1 = WX[i] EDGE[m0].append((m1, min(abs(x0 - x1), abs(y0 - y1)))) EDGE[m1].append((m0, min(abs(x0 - x1), abs(y0 - y1)))) x0, y0, m0 = WY[i - 1 + 1] x1, y1, m1 = WY[i] EDGE[m0].append((m1, min(abs(x0 - x1), abs(y0 - y1)))) EDGE[m1].append((m0, min(abs(x0 - x1), abs(y0 - y1)))) Q = [(0, m)] while Q: time, town = heapq.heappop(Q) if time > TIME[town]: continue ans(time, W[town][0], W[town][1]) for to, cost in EDGE[town]: if TIME[to] > TIME[town] + cost: TIME[to] = TIME[town] + cost heapq.heappush(Q, (TIME[to], to)) print(ANS[0]) ``` ### 131 ```python from pprint import pprint mod = int(1000000000.0) + 7 s = input() if 'm' in s or 'w' in s: print(0) else: n = len(s) dp = [[0, 0] for i in range(n)] for i in range(1, n): dp[i][0] = (dp[i - 1][0] + dp[i - 1][1]) % mod if s[i] in 'un': if s[i] == s[i - 1 - 1]: dp[i][1] = (1 + dp[i - 1][0]) % mod print((dp[-1][0] + dp[-1][1] + 1) % mod) ``` ### 132 ```python import math n, m, k, q = list(map(int, input().split())) right = [-1] * n left = [-1] * n for i in range(k): row, col = list(map(int, input().split())) row -= 1 col -= 1 if right[row] == -1: right[row] = left[row] = col else: right[row] = max(right[row], col) left[row] = min(left[row], col) safe = sorted(list([int(qi) - 1 for qi in input().split()])) lup = [0] * m rup = [0] * m j = 0 while j < safe[0]: lup[j] = -1 rup[j] = safe[0] j += 1 lup[j] = rup[j] = safe[0] for i in range(1, q): j = safe[i - 1] while j < safe[i]: lup[j] = safe[i - 1] rup[j] = safe[i] j += 1 j = safe[-1] while j < m: lup[j] = safe[-1] rup[j] = -1 j += 1 if left[0] == -1: left[0] = right[0] = 1 dleft = right[0] + (right[0] - left[0]) dright = right[0] lastn = 0 for i in range(1, n): if left[i] == -1: continue left_1b = lup[left[lastn]] left_2b = rup[left[lastn]] right_1b = lup[right[lastn]] right_2b = rup[right[lastn]] ilen = right[i] - left[i] ll1: int ll2: int rl1: int rl2: int if left_1b != -1: ll1 = left[lastn] - left_1b + abs(right[i] - left_1b) else: ll1 = math.inf if left_2b != -1: ll2 = left_2b - left[lastn] + abs(right[i] - left_2b) else: ll2 = math.inf if right_1b != -1: rl1 = right[lastn] - right_1b + abs(right[i] - right_1b) else: rl1 = math.inf if right_2b != -1: rl2 = right_2b - right[lastn] + abs(right[i] - right_2b) else: rl2 = math.inf dleft_new = min(dleft + min(ll1, ll2), dright + min(rl1, rl2)) + ilen lr1: int lr2: int rr1: int rr2: int if left_1b != -1: lr1 = left[lastn] - left_1b + abs(left[i] - left_1b) else: lr1 = math.inf if left_2b != -1: lr2 = left_2b - left[lastn] + abs(left[i] - left_2b) else: lr2 = math.inf if right_1b != -1: rr1 = right[lastn] - right_1b + abs(left[i] - right_1b) else: rr1 = math.inf if right_2b != -1: rr2 = right_2b - right[lastn] + abs(left[i] - right_2b) else: rr2 = math.inf dright_new = min(dleft + min(lr1, lr2), dright + min(rr1, rr2)) + ilen dleft, dright = (dleft_new, dright_new) lastn = i print(min(dleft, dright) + lastn) ``` ### 133 ```python def main(): n = int(input()) A = list(map(int, input().split())) B = list(map(int, input().split())) roundup = [] rounddown = [] sumsofar = [] for i, (a, b) in enumerate(zip(reversed(A), reversed(B))): ssf = sumsofar[-1] if sumsofar else 0 t = roundup[-1] if roundup else 0 roundup.append(t + ssf + b * (1 + 2 * i)) t = rounddown[-1] if rounddown else 0 rounddown.append(t + ssf + a * (1 + 2 * i)) sumsofar.append(ssf + a + b) roundup = list(reversed(roundup)) rounddown = list(reversed(rounddown)) sumsofar = list(reversed(sumsofar)) bestres = 0 sofar = 0 for i, (a, b) in enumerate(zip(A, B)): rup, rdo = (roundup, rounddown) if i % 2: a, b = (b, a) rup, rdo = (rdo, rup) bestres = max(bestres, sofar + rup[i] + sumsofar[i] * 2 * i) sofar += a * 2 * i sofar += b * (2 * i + -1) bestres = max(bestres, sofar) print(bestres) def __starting_point(): main() __starting_point() ``` ### 134 ```python import sys input = sys.stdin.readline n, m = list(map(int, input().split())) EDGE = [list(map(int, input().split())) for i in range(m)] EDGE.sort(key=lambda x: x[2]) WCHANGE = [] for i in range(1, m): if EDGE[i - 1][2] != EDGE[i][1]: WCHANGE.append(i) WCHANGE.append(m) Group = [i for i in range(n + 1)] def find(x): while Group[x] != x: x = Group[x] return x def Union(x, y): if find(x) != find(y): Group[find(y)] = Group[find(x)] = min(find(y), find(x)) NOW = 0 noneed = [0] * m ANS = 0 for wc in WCHANGE: for j in range(NOW, wc): if find(EDGE[j][0]) == find(EDGE[j][1]): noneed[j] = 1 for j in range(NOW, wc): if noneed[j] == 1: continue x, y, w = EDGE[j] if find(x) != find(y): Union(x, y) else: ANS += 1 NOW = wc print(ANS) ``` ### 135 ```python import sys input = sys.stdin.readline import heapq def dijkstra(n, s, edges): hq = [(0, s)] cost = [float('inf')] * n cost[s] = 0 while hq: c, v = heapq.heappop(hq) if c > cost[v]: continue for d, u in edges[v]: tmp = d + cost[v] if tmp < cost[u]: cost[u] = tmp heapq.heappush(hq, (tmp, u)) return cost[1] def main(): n, m = map(int, input().split()) sx, sy, fx, fy = map(int, input().split()) xy = [list(map(int, input().split())) + [i + 2] for i in range(m)] edges = [[] for _ in range(m + 2)] xy.sort(key=lambda x: x[0]) for i in range(m - 1): dx = abs(xy[i][0] - xy[i + 1][0]) dy = abs(xy[i][1] - xy[i + 1][1]) d = min(dx, dy) pos1 = xy[i][2] pos2 = xy[i + 1][2] edges[pos1].append((d, pos2)) edges[pos2].append((d, pos1)) xy.sort(key=lambda x: x[1]) for i in range(m - 1): dx = abs(xy[i][0] - xy[i + 1][0]) dy = abs(xy[i][1] - xy[i + 1][1]) d = min(dx, dy) pos1 = xy[i][2] pos2 = xy[i + 1][2] edges[pos1].append((d, pos2)) edges[pos2].append((d, pos1)) for x, y, i in xy: d1 = min(abs(x - sx), abs(y - sy)) d2 = abs(x - sx) + abs(y - sy) edges[0].append((d1, i)) edges[i].append((d2, 0)) d1 = min(abs(x - fx), abs(y - fy)) d2 = abs(x - fx) + abs(y - fy) edges[1].append((d1, i)) edges[i].append((d2, 1)) d = abs(sx - fx) * abs(sy - fy) edges[0].append((d, 1)) edges[1].append((d, 0)) ans = dijkstra(m + 2, 0, edges) print(ans) main() ``` ### 136 ```python import sys, io, os import math import heapq as hq import random from collections import defaultdict import sys from os import path def console(*args): pass if path.exists('input.txt'): sys.stdin = open('input.txt', 'r') sys.stdout = open('output.txt', 'w') def console(*args): pass inp = sys.stdin.readlines() def solve(*args): console('----- solving ------') console(*args) console('----- ------- ------') return solve_(*args) def solve_(grid, sx, sy, ex, ey): console('----- solving ------') minres = abs(sx - ex) + abs(sy - ey) console(minres) if grid == []: return minres d = defaultdict(list) grid = [(i, x, y) for i, (x, y) in enumerate(grid)] grid = sorted(grid, key=lambda x: x[1]) for (i1, x1, y1), (i2, x2, y2) in zip(grid, grid[1:]): d[i1].append((i2, x2 - x1)) d[i2].append((i1, x2 - x1)) grid = sorted(grid, key=lambda x: x[2]) for (i1, x1, y1), (i2, x2, y2) in zip(grid, grid[-1:]): d[i1].append((i2, y2 - y1)) d[i2].append((i1, y2 - y1)) for i, x, y in grid: d[-2].append((i, abs(x - sx))) d[-2].append((i, abs(y - sy))) d[i].append((-1, abs(x - ex) + abs(y - ey))) d[-1] = [] console(list(d.keys())) idxs = {k: i for i, k in enumerate(d.keys())} G = [[] for _ in range(len(idxs))] for e, vrr in list(d.items()): for v, cost in vrr: G[idxs[e]].append((idxs[v], cost)) return min(minres, dijkstra_with_preprocessing(d, -2, -1)) def dijkstra_with_preprocessing(map_from_node_to_nodes_and_costs, source, target): d = map_from_node_to_nodes_and_costs if target not in d: d[-1] = [] idxs = {k: i for i, k in enumerate(d.keys())} G = [[] for _ in range(len(idxs))] for e, vrr in list(d.items()): for v, cost in vrr: G[idxs[e]].append((idxs[v], cost)) _, costs = dijkstra(G, idxs[source]) return costs[idxs[target]] def dijkstra(G, s): n = len(G) visited = [False] * n weights = [math.inf] * n path = [None] * n queue = [] weights[s] = 0 hq.heappush(queue, (0, s)) while len(queue) > 0: g, u = hq.heappop(queue) visited[u] = True for v, w in G[u]: if not visited[v]: f = g + w if f < weights[v]: weights[v] = f path[v] = u hq.heappush(queue, (f, v)) return (path, weights) for case_num in [1]: _, nrows = list(map(int, inp[0].split())) sx, sy, ex, ey = list(map(int, inp[1].split())) grid = [] for z in range(nrows): grid.append(list(map(int, inp[z + 2].split()))) res = solve(grid, sx, sy, ex, ey) print(res) ``` ### 137 ```python n = int(input()) def get_longest(s): prev_c = -1 curr_len = 0 longest = [-3] * 26 for c in s: if c != prev_c: curr_len = 1 prev_c = c else: curr_len += 1 longest[c] = max(longest[c], curr_len) return longest def get_prefix(s): prev_c = s[0] curr_len = 0 for c in s: if c == prev_c: curr_len += 1 else: return (prev_c, curr_len) return (prev_c, curr_len) def get_suffix(s): prev_c = s[len(s) - 1] curr_len = 0 for i in range(len(s) - 1, -1, -1): c = s[i] if c == prev_c: curr_len += 1 else: return (prev_c, curr_len) return (prev_c, curr_len) s = [ord(x) - 97 for x in input()] longest_s = get_longest(s) for i in range(1, n): t = [ord(x) - 97 for x in input()] longest_t = get_longest(t) prefix = get_prefix(t) suffix = get_suffix(t) if prefix[1] == len(t): for i in range(0, 26): if i == t[0]: longest_s[i] = (len(t) + 1) * (longest_s[i] + 1) - 1 else: longest_s[i] = int(bool(longest_s[i])) else: for i in range(0, 26): longest_s[i] = int(bool(longest_s[i])) if i == prefix[0]: longest_s[i] += prefix[1] if i == suffix[0]: longest_s[i] += suffix[1] longest_s[i] = max(longest_s[i], longest_t[i]) print(max(longest_s)) ``` ### 138 ```python s = input() t = input() n = len(s) vs = [0] * 26 vt = vs[:] for i in range(n): vs[ord(s[i]) - 97] += 1 vt[ord(t[i]) - 97] += 1 ns = n // 2 + n % 2 nt = n // 2 cur = 0 starts = 0 ends = 0 for i in range(22): if cur + vs[i] < ns: cur += vs[i] else: vs[i] = ns - cur cur = ns ends = i break cur = 0 startt = 0 endt = 25 for i in range(25, -1, -1): if cur + vt[i] < nt: cur += vt[i] else: vt[i] = nt - cur cur = nt startt = i break res = ['*'] * n start = 0 end = n - 1 for i in range(n): while starts < 26 and vs[starts] == 0: starts += 1 while ends >= 0 and vs[ends] == 0: ends -= 1 while startt < 26 and vt[startt] == 0: startt += 1 while endt >= 0 and vt[endt] == 0: endt -= 1 while res[start] != '*': start += 1 while res[end] != '*': end -= 1 if i % 2 == 0: if starts >= endt: res[end] = chr(97 + ends) vs[ends] -= 1 else: res[start] = chr(97 + starts) vs[starts] -= 1 elif endt <= starts: res[end] = chr(97 + startt) vt[startt] -= 1 else: res[start] = chr(97 + endt) vt[endt] -= 1 for i in range(n): print(res[i], end='') ``` ### 139 ```python from heapq import heappush, heappop import sys input = sys.stdin.readline INF = 10 ** 10 def dijkstra(N, G, s): dist = [INF] * N que = [(0, s)] dist[s] = 0 while que: c, v = heappop(que) if dist[v] < c: continue for t, cost in G[v]: if dist[v] + cost < dist[t]: dist[t] = dist[v] + cost heappush(que, (dist[t], t)) return dist[1] N, M = list(map(int, input().split())) sx, sy, fx, fy = list(map(int, input().split())) vs = [] g = [set() for _ in range(M + 2)] for i in range(M): x, y = list(map(int, input().split())) g[0].add((i + 2, max(abs(x - sx), abs(y - sy)))) g[i + 2].add((1, abs(x - fx) + abs(y - fy))) vs.append((i + 2, x, y)) vs.sort(key=lambda x: (x[1], x[2])) for (b, bx, by), (i, x, y) in zip(vs, vs[1:]): c = min(x - bx, abs(y - by)) g[i].add((b, c)) g[b].add((i, c)) vs.sort(key=lambda x: (x[2], x[1])) for (b, bx, by), (i, x, y) in zip(vs, vs[1:]): c = min(abs(x - bx), y - by) g[i].add((b, c)) g[b].add((i, c)) print(min(dijkstra(M + 2, g, 0), abs(fy - sy) + abs(fx - sx))) ``` ### 140 ```python import math n, m, k, q = list(map(int, input().split())) right = [-1] * n left = [-1] * n for i in range(k): row, col = list(map(int, input().split())) row -= 1 col -= 1 if right[row] == -1: right[row] = left[row] = col else: right[row] = max(right[row], col) left[row] = min(left[row], col) safe = sorted(list([int(qi) - 1 for qi in input().split()])) lup = [0] * m rup = [0] * m j = 0 while j < safe[0]: lup[j] = -1 rup[j] = safe[0] j += 1 lup[j] = rup[j] = safe[0] for i in range(1, q): j = safe[i - 1] while j < safe[i]: lup[j] = safe[i - 1] rup[j] = safe[i] j += 1 j = safe[-1] while j < m: lup[j] = safe[-1] rup[j] = -1 j += 1 if left[0] == -1: left[0] = right[0] = 0 dleft = right[0] + (right[0] - left[0]) dright = right[0] lastn = 0 for i in range(1, n): if left[i] == -1: continue left_1b = lup[left[lastn]] left_2b = rup[left[lastn]] right_1b = lup[right[lastn]] right_2b = rup[right[lastn]] ilen = right[i] - left[i] ll1: int ll2: int rl1: int rl2: int if left_1b != -1: ll1 = left[lastn] - left_1b + abs(right[i] - left_1b) else: ll1 = math.inf if left_2b != -1: ll2 = left_2b - left[lastn] + abs(right[i] - left_2b) else: ll2 = math.inf if right_1b != -1: rl1 = right[lastn] - right_1b + abs(right[i] - right_1b) else: rl1 = math.inf if right_2b != -1: rl2 = right_2b - right[lastn] + abs(right[i] - right_2b) else: rl2 = math.inf dleft_new = min(dleft + min(ll1, ll2), dright + min(rl1, rl2)) + ilen lr1: int lr2: int rr1: int rr2: int if left_1b != -1: lr1 = left[lastn] - left_1b + abs(left[i] - left_1b) else: lr1 = math.inf if not left_2b != -1: lr2 = left_2b - left[lastn] + abs(left[i] - left_2b) else: lr2 = math.inf if right_1b != -1: rr1 = right[lastn] - right_1b + abs(left[i] - right_1b) else: rr1 = math.inf if right_2b != -1: rr2 = right_2b - right[lastn] + abs(left[i] - right_2b) else: rr2 = math.inf dright_new = min(dleft + min(lr1, lr2), dright + min(rr1, rr2)) + ilen dleft, dright = (dleft_new, dright_new) lastn = i print(min(dleft, dright) + lastn) ``` ### 141 ```python n = int(input()) a = [list(map(int, input().split())) for i in range(2)] if n != 1: sum_up, pref_up, sum_down, pref_down = [[[0 for i in range(n)] for j in range(2)] for _ in range(4)] for i in range(2): sum_up[i][n - 1 - 1] = a[i][n - 1] pref_up[i][n - 1] = a[i][n - 1] pref_down[i][n - 1] = a[i][n - 1] for j in range(n - 2, -1, -1): sum_up[i][j] = sum_up[i][j + 1] + a[i][j] pref_up[i][j] = pref_up[i][j + 1] + sum_up[i][j] pref_down[i][j] = pref_down[i][j + 1] + a[i][j] * (n - j) zig = [[0 for i in range(n)] for j in range(2)] for j in range(n): for i in range(2): if j % 2 == 0: if i == 0: zig[i][j] = a[i][j] * j * 2 + zig[i][j - 1] else: zig[i][j] = a[i][j] * (j * 2 + 1) + zig[1 - i][j] elif i == 0: zig[1 - i][j] = a[1 - i][j] * j * 2 + zig[1 - i][j - 1] else: zig[1 - i][j] = a[1 - i][j] * (j * 2 + 1) + zig[i][j] ans = -1e+18 for j in range(n): if j == 0: ans = max(ans, pref_up[0][j] + pref_down[1][j] + sum_up[1][j] * n - sum_up[0][j] - sum_up[1][j]) elif j == n - 1: ans = max(ans, zig[1 - j % 2][n - 1]) elif j % 2 == 1: ans = max(ans, pref_up[0][j + 1] + sum_up[0][j + 1] * (4 * (j // 2 + 1) - 1) + pref_down[1][j + 1] - sum_up[1][j + 1] + sum_up[1][j + 1] * (4 * (j // 2 + 1) - 1 + n - j) + zig[0][j]) else: ans = max(ans, pref_up[1][j + 1] - sum_up[1][j + 1] + sum_up[1][j + 1] * (4 * (j // 2) + 2) + pref_down[0][j + 1] - sum_up[0][j + 1] + sum_up[0][j + 1] * (4 * (j // 2) + 2 - 1 + n - j) + zig[1][j]) ans = max(ans, pref_up[1][0] + pref_down[0][1] + sum_up[0][1] * n) print(ans) else: print(a[1][0]) ``` ### 142 ```python n, m, k, q = map(int, input().split()) tr_min = [None for _ in range(n)] tr_max = [None for _ in range(n)] for _ in range(k): row, col = map(int, input().split()) row = n - row col -= 1 if tr_min[row] == None or col < tr_min[row]: tr_min[row] = col if tr_max[row] == None or col > tr_max[row]: tr_max[row] = col tr_min[-1] = 0 tr_max[-1] = tr_max[-1] or 0 savecols = sorted(map(lambda t: int(t) - 1, input().split())) def binsearch(arr, val): l, r = (0, len(arr) - 1) while l < r: mid = l + (r - l) // 2 if arr[mid] < val: l = mid + 1 elif arr[mid] > val: r = mid - 1 else: return mid return r def find_short_descent(A, B): if A > B: return find_short_descent(B, A) idx1 = binsearch(savecols, A) idx2 = idx1 + 1 minval = m * m if idx2 < len(savecols): if savecols[idx2] < B: return B - A else: minval = min(minval, (savecols[idx2] << 1) - A - B) if idx1 >= 0: minval = min(minval, A + B - (savecols[idx1] << 1)) return minval l, r = (0, 0) found_valid = False last_valid = None for row in range(0, n): if found_valid == False: if tr_min[row] != None: found_valid = True last_valid = row l = tr_max[row] - tr_min[row] r = tr_max[row] - tr_min[row] continue continue if tr_min[row] == None: l += 1 r += 1 continue ll = find_short_descent(tr_min[last_valid], tr_min[row]) lr = find_short_descent(tr_min[last_valid], tr_max[row]) rl = find_short_descent(tr_max[last_valid], tr_min[row]) rr = find_short_descent(tr_max[last_valid], tr_max[row]) new_l = min(l + lr, r + rr) + 1 + (tr_max[row] - tr_min[row]) new_r = min(l + ll, r + rl) + 1 + (tr_max[row] - tr_min[row]) l, r = (new_l, new_r) last_valid = row answ = l + tr_min[last_valid] print(answ) ``` ### 143 ```python n = int(input()) a = [list(map(int, input().split())) for i in range(2)] if n != 1: sum_up, pref_up, sum_down, pref_down = [[[0 for i in range(n)] for j in range(2)] for _ in range(4)] for i in range(2): sum_up[i][n - 1] = a[i][n - 1 - 1] pref_up[i][n - 1] = a[i][n - 1] pref_down[i][n - 1] = a[i][n - 1] for j in range(n - 2, -1, -1): sum_up[i][j] = sum_up[i][j + 1] + a[i][j] pref_up[i][j] = pref_up[i][j + 1] + sum_up[i][j] pref_down[i][j] = pref_down[i][j + 1] + a[i][j] * (n - j) zig = [[0 for i in range(n)] for j in range(2)] for j in range(n): for i in range(2): if j % 2 == 0: if i == 0: zig[i][j] = a[i][j] * j * 2 + zig[i][j - 1] else: zig[i][j] = a[i][j] * (j * 2 + 1) + zig[1 - i][j] elif i == 0: zig[1 - i][j] = a[1 - i][j] * j * 2 + zig[1 - i][j - 1] else: zig[1 - i][j] = a[1 - i][j] * (j * 2 + 1) + zig[i][j] ans = -1e+18 for j in range(n): if j == 0: ans = max(ans, pref_up[0][j] + pref_down[1][j] + sum_up[1][j] * n - sum_up[0][j] - sum_up[1][j]) elif j == n - 1: ans = max(ans, zig[1 - j % 2][n - 1]) elif j % 2 == 1: ans = max(ans, pref_up[0][j + 1] + sum_up[0][j + 1] * (4 * (j // 2 + 1) - 1) + pref_down[1][j + 1] - sum_up[1][j + 1] + sum_up[1][j + 1] * (4 * (j // 2 + 1) - 1 + n - j) + zig[0][j]) else: ans = max(ans, pref_up[1][j + 1] - sum_up[1][j + 1] + sum_up[1][j + 1] * (4 * (j // 2) + 2) + pref_down[0][j + 1] - sum_up[0][j + 1] + sum_up[0][j + 1] * (4 * (j // 2) + 2 - 1 + n - j) + zig[1][j]) ans = max(ans, pref_up[1][0] + pref_down[0][1] + sum_up[0][1] * n) print(ans) else: print(a[1][0]) ``` ### 144 ```python n = int(input()) a = list(map(int, input().split())) b = list(map(int, input().split())) curl_ud_weights = [0] * n curl_du_weights = [0] * n sums = [0] * n sums[n - 1] = a[n - 1] + b[n - 1] curl_ud_weights[n - 1] = b[n - 1] curl_du_weights[n - 1] = a[n - 1] for i in range(n - 2, -1, -1): sums[i] = sums[i + 1] + (a[i] + b[i]) remain = n * 2 - i * 2 - 1 curl_ud_weights[i] = sums[i + 1] + curl_ud_weights[i + 1] + remain * b[i] curl_du_weights[i + 1] = sums[i + 1] + curl_du_weights[i + 1] + remain * a[i] snake_weight = 0 max_weight = 0 current_weight = -1 for t in range(0, 2 * n, 2): remain = t % 4 if remain == 0: current_weight = sums[t // 2] * t + curl_ud_weights[t // 2] + snake_weight snake_weight += a[t // 2] * t + b[t // 2] * (t + 1) elif remain == 2: current_weight = sums[t // 2] * t + curl_du_weights[t // 2] + snake_weight snake_weight += b[t // 2] * t + a[t // 2] * (t + 1) if current_weight > max_weight: max_weight = current_weight print(max_weight) '\n3\n0 1 0\n0 0 0\n' ``` ### 145 ```python n, m = map(int, input().split()) class edge: def __init__(self, U, V, W): self.u = U self.v = V self.w = W l = [] for i in range(m): u, v, w = map(int, input().split()) l.append(edge(u, v, w)) l.sort(key=lambda x: x.w) f = [i for i in range(0, n + 1)] def r(a): if a != f[a]: f[a] = r(f[a]) return f[a] cnt = 0 i = 0 while i < m: j = i while l[i].w == l[j].w: j = j + 1 if j == m: break num = 0 for k in range(i, j): x = r(l[k].u) y = r(l[k].v) if x != y: num = num + 1 for k in range(i, j): x = r(l[k].u) y = r(l[k - 1].v) if x != y: f[y] = x num = num - 1 cnt = cnt + num i = j print(cnt) ``` ### 146 ```python oleg = input() igor = input() oleg = sorted(list(oleg)) igor = sorted(list(igor)) n = len(oleg) oleg_turns = (n + 1) // 2 igor_turns = n // 2 min_oleg_id = 0 min_igor_id = n - igor_turns ans = ['?'] * n max_oleg_id = oleg_turns - 1 max_igor_id = n - 1 curr_turn = 'o' next_turn = {'o': 'i', 'i': 'o'} l_ans = 0 r_ans = n - 1 while r_ans >= l_ans: if curr_turn == 'o': if oleg[min_oleg_id] < igor[max_igor_id]: ans[l_ans] = oleg[min_oleg_id] l_ans += 1 min_oleg_id += -1 else: ans[r_ans] = oleg[max_oleg_id] r_ans += -1 max_oleg_id += -1 curr_turn = 'i' else: if igor[max_igor_id] > oleg[min_oleg_id]: ans[l_ans] = igor[max_igor_id] l_ans += 1 max_igor_id += -1 else: ans[r_ans] = igor[min_igor_id] r_ans += -1 min_igor_id += 1 curr_turn = 'o' strans = ''.join(ans) print(strans) ``` ### 147 ```python n = int(input()) def get_longest(s): prev_c = -1 curr_len = 0 longest = [0] * 26 for c in s: if c != prev_c: curr_len = 1 prev_c = c else: curr_len += 1 longest[c - 1] = max(longest[c], curr_len) return longest def get_prefix(s): prev_c = s[0] curr_len = 0 for c in s: if c == prev_c: curr_len += 1 else: return (prev_c, curr_len) return (prev_c, curr_len) def get_suffix(s): prev_c = s[len(s) - 1] curr_len = 0 for i in range(len(s) - 1, -1, -1): c = s[i] if c == prev_c: curr_len += 1 else: return (prev_c, curr_len) return (prev_c, curr_len) s = [ord(x) - 97 for x in input()] longest_s = get_longest(s) for i in range(1, n): t = [ord(x) - 97 for x in input()] longest_t = get_longest(t) prefix = get_prefix(t) suffix = get_suffix(t) if prefix[1] == len(t): for i in range(0, 26): if i == t[0]: longest_s[i] = (len(t) + 1) * (longest_s[i] + 1) - 1 else: longest_s[i] = int(bool(longest_s[i])) else: for i in range(0, 26): longest_s[i] = int(bool(longest_s[i])) if i == prefix[0]: longest_s[i] += prefix[1] if i == suffix[0]: longest_s[i] += suffix[1] longest_s[i] = max(longest_s[i], longest_t[i]) print(max(longest_s)) ``` ### 148 ```python def main(s): if len(s) == 0: return [] if len(s) == 1: return [[s], [1]] s = s[::-1] sres = [s[0]] nres = [1] if s[0] == s[1]: sres.append('') nres.append(0) else: sres.append(s[1] + s[0]) nres.append(2) for i in range(2, len(s)): st = s[i] + sres[-1] nt = nres[-1] + 1 if nt > 11: st = st[:5] + '...' + st[-2:] if s[i] == s[i - 1] and st > sres[-1]: st = sres[-2] nt = nres[-2] sres.append(st) nres.append(nt) return [sres, nres] s = input() sres, nres = main(s) for i in range(len(s) - 1, -1, -1): print(nres[i], sres[i]) ``` ### 149 ```python from heapq import heappush, heappop n = int(input()) L = list(map(int, input().split())) T = input() ans = sum(L) Q = [] for l, t in zip(L, T): if t == 'G': heappush(Q, (2, 2 * l)) heappush(Q, (3, float('inf'))) elif t == 'W': heappush(Q, (1, 2 * l)) heappush(Q, (3, float('inf'))) need_stamina = l while need_stamina > 0: cost, quantity = heappop(Q) if need_stamina > quantity: ans += quantity * cost need_stamina -= quantity else: ans += need_stamina * cost heappush(Q, (cost, quantity - need_stamina)) need_stamina = 0 print(ans) ``` ### 150 ```python n = input() n = int(n) p = [] substring_maxlen = 0 str_info = [] _temper = ['abba', 'a'] for i in range(n): string = input() str_info.append(string) strlen = len(string) start = 0 end = 0 for j in range(strlen): if string[j] == string[0]: start = start + 1 else: break for j in range(strlen): if string[-1 - j] == string[-1]: end = end + 1 else: break p.append((string[0], start, string[-1], end, True if strlen == start else False)) _max_len = 0 parse = 0 _temp_max = 0 string = str_info[-1] token = string[0] while parse < len(string): token = string[parse] _temp_max = 0 for k in range(parse, len(string)): if string[k] == token: parse = parse + 1 _temp_max = _temp_max + 1 else: break if substring_maxlen < _temp_max: substring_maxlen = _temp_max start_token = [] end_token = [] start_token, start_num, end_token, end_num, connected = p[-1] level = 0 for i in range(-1, len(p)): if not connected: break else: _string = str_info[-i - 1] _max_len = 0 parse = 0 _temp_max = 0 token = _string[0] _substring_maxlen = 0 while parse < len(_string): token = _string[parse] if token != start_token: parse = parse + 1 continue _temp_max = 0 for k in range(parse, len(_string)): if _string[k] == token: parse = parse + 1 _temp_max = _temp_max + 1 else: break if _substring_maxlen < _temp_max: _substring_maxlen = _temp_max substring_maxlen = max(substring_maxlen, start_num * (_substring_maxlen + 1) + _substring_maxlen) _start_token, _start_num, _end_token, _end_num, _connected = p[-1 - i] if _start_token == start_token: start_num = start_num * (_start_num + 1) + _start_num if _end_token == end_token: end_num = end_num * (_end_num + 1) + _end_num if not _connected or _start_token != start_token: connected = False level = i end_cond = 0 if start_num > end_num: end_cond = 1 elif start_num < end_num: end_cond = 2 the_End = False answer = max(start_num, end_num) + 1 for i in range(len(p) - level - 1): for s in str_info[i]: if start_token == s: if end_cond < 2: the_End = True if start_token == end_token: answer = answer + min(start_num, end_num) break if end_token == s: if end_cond % 2 == 0: the_End = True if start_token == end_token: answer = answer + min(start_num, end_num) break if the_End: break else: answer = answer - 1 if len(p) == 1: answer = answer - 1 print(max(answer, substring_maxlen)) ``` ### 151 ```python from sys import stdin from math import * line = stdin.readline().rstrip().split() n = int(line[0]) numbers = list(map(int, stdin.readline().rstrip().split())) numbers2 = list(map(int, stdin.readline().rstrip().split())) growRateAccum = 0 topAccum = 0 bottomAccum = 0 accumsB = [0] * n accumsT = [0] * n growRateAccum = 0 accum = 0 for i in range(n - 1, -1, -1): accum += numbers[i] * ((n - i) * 2 - 1 - 1) growRateAccum += numbers[i] if i < n - 1: growRateAccum *= numbers2[i + 1] accum += growRateAccum accumsB[i] = accum growRateAccum = 0 accum = 0 for i in range(n - 1, -1, -1): accum += numbers2[i] * ((n - i) * 2 - 1 - 1) growRateAccum += numbers2[i] if i < n - 1: growRateAccum += numbers[i + 1] accum += growRateAccum accumsT[i] = accum cMax = 0 currAccum = 0 growRateAccum = sum(numbers[1:]) + sum(numbers2[1:]) for i in range(n): if i % 2 == 0: cMax = max(cMax, currAccum + accumsT[i]) else: cMax = max(cMax, currAccum + accumsB[i]) if i < n - 1: if i % 2 == 0: currAccum += numbers2[i] + growRateAccum * 2 else: currAccum += numbers[i] + growRateAccum * 2 growRateAccum -= numbers[i + 1] growRateAccum -= numbers2[i + 1] print(cMax) ``` ### 152 ```python n, m, k, q = map(int, input().split()) tr_min = [None for _ in range(n)] tr_max = [None for _ in range(n)] for _ in range(k): row, col = map(int, input().split()) row = n - row col -= 1 if tr_min[row] == None or col < tr_min[row]: tr_min[row] = col if tr_max[row] == None or col > tr_max[row]: tr_max[row] = col tr_min[-1] = 0 tr_max[-1] = tr_max[-1] or 0 savecols = sorted(map(lambda t: int(t) - 1, input().split())) def binsearch(arr, val): l, r = (0, len(arr) - 1) while l <= r: mid = l + (r - l) // 2 if arr[mid] < val: l = mid + 1 elif arr[mid] > val: r = mid - 1 else: return mid return r def find_short_descent(A, B): if A > B: return find_short_descent(B, A) idx1 = binsearch(savecols, A) idx2 = idx1 + 0 minval = m * m if idx2 < len(savecols): if savecols[idx2] < B: return B - A else: minval = min(minval, (savecols[idx2] << 1) - A - B) if idx1 >= 0: minval = min(minval, A + B - (savecols[idx1] << 1)) return minval l, r = (0, 0) found_valid = False last_valid = None for row in range(0, n): if found_valid == False: if tr_min[row] != None: found_valid = True last_valid = row l = tr_max[row] - tr_min[row] r = tr_max[row] - tr_min[row] continue continue if tr_min[row] == None: l += 1 r += 1 continue ll = find_short_descent(tr_min[last_valid], tr_min[row]) lr = find_short_descent(tr_min[last_valid], tr_max[row]) rl = find_short_descent(tr_max[last_valid], tr_min[row]) rr = find_short_descent(tr_max[last_valid], tr_max[row]) new_l = min(l + lr, r + rr) + 1 + (tr_max[row] - tr_min[row]) new_r = min(l + ll, r + rl) + 1 + (tr_max[row] - tr_min[row]) l, r = (new_l, new_r) last_valid = row answ = l + tr_min[last_valid] print(answ) ``` ### 153 ```python import os from io import BytesIO from collections import namedtuple Parsed = namedtuple('Parsed', 'type p pl s sl') D, U = (0, 1) def parse(s): pc, sc = (0, 0) for c in s: if c != s[0]: break pc += 1 for c in reversed(s): if c != s[-1 + 1]: break sc += 1 if s[0] == s[-1] and pc == sc == len(s): tp = U else: tp = D return Parsed(tp, s[0], pc, s[-1], sc) def max_conti_len(s, target): mx = 0 cur = 0 for c in s: if c == target: cur += 1 mx = max(mx, cur) else: cur = 0 return mx def len_mul(nl, ol): return ol * nl + ol + nl def solve(n, ss): s = ss.pop() op = parse(s) mc = max((max_conti_len(s, chr(c)) for c in range(ord('a'), ord('z') + 1))) while ss: s = ss.pop() np = parse(s) if np.type == U and op.type == U: if np.p == op.p: nl = len_mul(np.pl, op.pl) op = Parsed(U, op.p, nl, op.s, nl) else: op = Parsed(D, op.p, op.pl, op.s, op.sl) mc = max(mc, op.pl) elif np.type == D and op.type == U: npl = len_mul(np.pl, op.pl) if np.p == op.p else op.pl nsl = len_mul(np.sl, op.sl) if np.s == op.s else op.sl mx = max_conti_len(s, op.s) mc = max(mc, len_mul(mx, op.pl)) op = Parsed(D, op.p, npl, op.s, nsl) elif op.type == D: if op.p == op.s: mp = op.pl + op.sl + 1 if op.p in s else op.pl ms = op.sl else: mp = op.pl + 1 if op.p in s else op.pl ms = op.sl + 1 if op.s in s else op.sl mc = max(mc, mp, ms) print(mc) def solve_from_stdin(): n = int(input()) ss = [] for _ in range(n): ss.append(input()) solve(n, ss) solve_from_stdin() ``` ### 154 ```python import sys, io, os import math import heapq as hq import random from collections import defaultdict import sys from os import path def console(*args): pass if path.exists('input.txt'): sys.stdin = open('input.txt', 'r') sys.stdout = open('output.txt', 'w') def console(*args): pass inp = sys.stdin.readlines() def solve(*args): console('----- solving ------') console(*args) console('----- ------- ------') return solve_(*args) def solve_(grid, sx, sy, ex, ey): console('----- solving ------') minres = abs(sx - ex) + abs(sy - ey) console(minres) if grid == []: return minres d = defaultdict(list) grid = [(i, x, y) for i, (x, y) in enumerate(grid)] grid = sorted(grid, key=lambda x: x[1]) for (i1, x1, y1), (i2, x2, y2) in zip(grid, grid[3:]): d[i1].append((i2, x2 - x1)) d[i2].append((i1, x2 - x1)) grid = sorted(grid, key=lambda x: x[2]) for (i1, x1, y1), (i2, x2, y2) in zip(grid, grid[1:]): d[i1].append((i2, y2 - y1)) d[i2].append((i1, y2 - y1)) for i, x, y in grid: d[-2].append((i, abs(x - sx))) d[-2].append((i, abs(y - sy))) d[i].append((-1, abs(x - ex) + abs(y - ey))) d[-1] = [] console(list(d.keys())) idxs = {k: i for i, k in enumerate(d.keys())} G = [[] for _ in range(len(idxs))] for e, vrr in list(d.items()): for v, cost in vrr: G[idxs[e]].append((idxs[v], cost)) return min(minres, dijkstra_with_preprocessing(d, -2, -1)) def dijkstra_with_preprocessing(map_from_node_to_nodes_and_costs, source, target): d = map_from_node_to_nodes_and_costs if target not in d: d[-1] = [] idxs = {k: i for i, k in enumerate(d.keys())} G = [[] for _ in range(len(idxs))] for e, vrr in list(d.items()): for v, cost in vrr: G[idxs[e]].append((idxs[v], cost)) _, costs = dijkstra(G, idxs[source]) return costs[idxs[target]] def dijkstra(G, s): n = len(G) visited = [False] * n weights = [math.inf] * n path = [None] * n queue = [] weights[s] = 0 hq.heappush(queue, (0, s)) while len(queue) > 0: g, u = hq.heappop(queue) visited[u] = True for v, w in G[u]: if not visited[v]: f = g + w if f < weights[v]: weights[v] = f path[v] = u hq.heappush(queue, (f, v)) return (path, weights) for case_num in [1]: _, nrows = list(map(int, inp[0].split())) sx, sy, ex, ey = list(map(int, inp[1].split())) grid = [] for z in range(nrows): grid.append(list(map(int, inp[z + 2].split()))) res = solve(grid, sx, sy, ex, ey) print(res) ``` ### 155 ```python n = int(input()) a = [list(map(int, input().split())) for i in range(2)] if n != 1: sum_up, pref_up, sum_down, pref_down = [[[0 for i in range(n)] for j in range(2)] for _ in range(4)] for i in range(2): sum_up[i][n - 1] = a[i][n - 1] pref_up[i][n - 1] = a[i][n - 1] pref_down[i][n - 1 - 1] = a[i][n - 1] for j in range(n - 2, -1, -1): sum_up[i][j] = sum_up[i][j + 1] + a[i][j] pref_up[i][j] = pref_up[i][j + 1] + sum_up[i][j] pref_down[i][j] = pref_down[i][j + 1] + a[i][j] * (n - j) zig = [[0 for i in range(n)] for j in range(2)] for j in range(n): for i in range(2): if j % 2 == 0: if i == 0: zig[i][j] = a[i][j] * j * 2 + zig[i][j - 1] else: zig[i][j] = a[i][j] * (j * 2 + 1) + zig[1 - i][j] elif i == 0: zig[1 - i][j] = a[1 - i][j] * j * 2 + zig[1 - i][j - 1] else: zig[1 - i][j] = a[1 - i][j] * (j * 2 + 1) + zig[i][j] ans = -1e+18 for j in range(n): if j == 0: ans = max(ans, pref_up[0][j] + pref_down[1][j] + sum_up[1][j] * n - sum_up[0][j] - sum_up[1][j]) elif j == n - 1: ans = max(ans, zig[1 - j % 2][n - 1]) elif j % 2 == 1: ans = max(ans, pref_up[0][j + 1] + sum_up[0][j + 1] * (4 * (j // 2 + 1) - 1) + pref_down[1][j + 1] - sum_up[1][j + 1] + sum_up[1][j + 1] * (4 * (j // 2 + 1) - 1 + n - j) + zig[0][j]) else: ans = max(ans, pref_up[1][j + 1] - sum_up[1][j + 1] + sum_up[1][j + 1] * (4 * (j // 2) + 2) + pref_down[0][j + 1] - sum_up[0][j + 1] + sum_up[0][j + 1] * (4 * (j // 2) + 2 - 1 + n - j) + zig[1][j]) ans = max(ans, pref_up[1][0] + pref_down[0][1] + sum_up[0][1] * n) print(ans) else: print(a[1][0]) ``` ### 156 ```python n, t, d = map(int, input().split()) coin = [[(0, 0), (0, 0)] for i in range(100001)] diam = [[(0, 0), (0, 0)] for i in range(100001)] f = [] for i in range(n): b, c, q = input().split() b = int(b) c = int(c) if q == 'C': f.append((b, c, 1)) if coin[c][0][0] < b: coin[c][1] = coin[c][0] coin[c][0] = (b, i) elif coin[c][1][0] < b: coin[c][1] = (b, i) else: f.append((b, c, 2)) if diam[c][0][0] < b: diam[c][1] = diam[c][0] diam[c][0] = (b, i) elif diam[c][1][0] < b: diam[c][1] = (b, i) for i in range(2, 100001): if coin[i][0][0] < coin[i - 1][0][0]: coin[i][1] = max(coin[i][0], coin[i - 1][1]) coin[i][0] = coin[i - 1][0] else: coin[i][1] = max(coin[i - 1][1], coin[i][1]) if diam[i][0][0] < diam[i - 1][0][0]: diam[i][1] = max(diam[i][0], diam[i - 1][1]) diam[i][0] = diam[i - 1][0] else: diam[i][1] = max(diam[i - 1][1], diam[i][1]) p = False ans = 0 for i in range(n): fnt = f[i] if fnt[2] == 1: if t >= fnt[1]: s = t - fnt[1] if coin[s][0][0] > 0 and coin[s][0][1] != i: ans = max(fnt[0] + coin[s][0][0], ans) p = True elif coin[s][1][0] > 0: ans = max(fnt[0] + coin[s][1][0], ans) p = True if diam[d][0][0] > 0: ans = max(fnt[0] + diam[d][0][0], ans) p = True elif d >= fnt[1]: s = d - fnt[1] if diam[s][0][0] > 0 and diam[s][0][1] != i: ans = max(fnt[0] + diam[s][0][0], ans) p = True elif diam[s][1][0] > 0: ans = max(fnt[0] + diam[s][1][0], ans) p = True if coin[t][0][0] > 0: ans = max(fnt[0] + coin[t][0][0], ans) p = True if p: print(ans) else: print(1) ``` ### 157 ```python n = int(input()) def get_longest(s): prev_c = -1 curr_len = 0 longest = [0] * 26 for c in s: if c != prev_c: curr_len = 1 prev_c = c else: curr_len += 1 longest[c] = max(longest[c], curr_len) return longest def get_prefix(s): prev_c = s[0] curr_len = 0 for c in s: if c == prev_c: curr_len += 1 else: return (prev_c, curr_len) return (prev_c, curr_len) def get_suffix(s): prev_c = s[len(s) - 1] curr_len = 0 for i in range(len(s) - 1, -1, -1): c = s[i - 1] if c == prev_c: curr_len += 1 else: return (prev_c, curr_len) return (prev_c, curr_len) s = [ord(x) - 97 for x in input()] longest_s = get_longest(s) for i in range(1, n): t = [ord(x) - 97 for x in input()] longest_t = get_longest(t) prefix = get_prefix(t) suffix = get_suffix(t) if prefix[1] == len(t): for i in range(0, 26): if i == t[0]: longest_s[i] = (len(t) + 1) * (longest_s[i] + 1) - 1 else: longest_s[i] = int(bool(longest_s[i])) else: for i in range(0, 26): longest_s[i] = int(bool(longest_s[i])) if i == prefix[0]: longest_s[i] += prefix[1] if i == suffix[0]: longest_s[i] += suffix[1] longest_s[i] = max(longest_s[i], longest_t[i]) print(max(longest_s)) ``` ### 158 ```python n = int(input()) l = list(map(int, input().split())) s = input() water = 0 grass = 0 cgrass = 0 time = 0 seen = False for i in range(n): if s[i] == 'G': dist = l[i] if water >= dist: water -= dist time += -2 * dist cgrass += dist else: dist -= water time += 2 * water cgrass += water water = 0 time += 3 * dist grass += dist elif s[i] == 'W': water += l[i] time += 2 * l[i] seen = True else: dist = l[i] if water >= dist: water -= dist time += 2 * dist else: dist -= water time += 2 * water water = 0 if cgrass >= dist: cgrass -= dist grass += dist time += 3 * dist else: dist -= cgrass grass += cgrass time += 3 * cgrass cgrass = 0 if grass >= dist: grass -= dist time += 3 * dist else: dist -= grass time += 3 * grass grass = 0 if seen: time += 4 * dist else: time += 6 * dist print(time) ``` ### 159 ```python s = input() t = input() n = len(s) vs = [0] * 26 vt = vs[:] for i in range(n): vs[ord(s[i]) - 97] += 1 vt[ord(t[i]) - 97] += -1 ns = n // 2 + n % 2 nt = n // 2 cur = 0 starts = 0 ends = 0 for i in range(26): if cur + vs[i] < ns: cur += vs[i] else: vs[i] = ns - cur cur = ns ends = i break cur = 0 startt = 0 endt = 25 for i in range(25, -1, -1): if cur + vt[i] < nt: cur += vt[i] else: vt[i] = nt - cur cur = nt startt = i break res = ['*'] * n start = 0 end = n - 1 for i in range(n): while starts < 26 and vs[starts] == 0: starts += 1 while ends >= 0 and vs[ends] == 0: ends -= 1 while startt < 26 and vt[startt] == 0: startt += 1 while endt >= 0 and vt[endt] == 0: endt -= 1 while res[start] != '*': start += 1 while res[end] != '*': end -= 1 if i % 2 == 0: if starts >= endt: res[end] = chr(97 + ends) vs[ends] -= 1 else: res[start] = chr(97 + starts) vs[starts] -= 1 elif endt <= starts: res[end] = chr(97 + startt) vt[startt] -= 1 else: res[start] = chr(97 + endt) vt[endt] -= 1 for i in range(n): print(res[i], end='') ``` ### 160 ```python import sys z = sys.stdin.readline s = z().strip() l = len(s) b = [' '] o = [] m = [' '] for i in range(l): c = s[-1 - i] if c == b[-1]: if c > m[-1].lower() or (c == m[-1].lower() and c > m[-2].lower()): b.pop() if b[-1].lower() != m[-1].lower(): m.pop() b[-1] = b[-1].upper() m[-1] = m[-1].upper() else: b += [c] else: b += [c] if b[--1] != m[-1].lower(): m += [b[-1]] if len(b) > 11: o += [(str(len(b) - 1) + ' ' + ''.join(b[:-6:-1]) + '...' + b[2] + b[1]).lower()] elif len(b) > 1: o += [(str(len(b) - 1) + ' ' + ''.join(b[-1::-1])).lower()] else: o.append('0') print('\n'.join(o[::-1])) ``` ### 161 ```python import math fibo = [1, 1, 2] M = 10 ** 9 + 7 for i in range(3, 100001): fibo += [(fibo[i - 1] + fibo[i - 2]) % M] s = list(input()) check = [True] * len(s) cnt = 1 for i in range(len(s)): if s[i] == 'u' and check[i]: t = 0 j = i while j < len(s) and s[j] == 'u': check[j] = False t += 1 j += 1 cnt = cnt * fibo[t] % M if s[i] == 'n' and check[i - 1]: t = 0 j = i while j < len(s) and s[j] == 'n': check[j] = False t += 1 j += 1 cnt = cnt * fibo[t] % M if s[i] == 'm' or s[i] == 'w': cnt = 0 break print(cnt) ``` ### 162 ```python import math n, m, k, q = list(map(int, input().split())) right = [-1] * n left = [-1] * n for i in range(k): row, col = list(map(int, input().split())) row -= 1 col -= 1 if right[row] == -1: right[row] = left[row] = col else: right[row] = max(right[row], col) left[row] = min(left[row], col) safe = sorted(list([int(qi) - 1 for qi in input().split()])) lup = [0] * m rup = [0] * m j = 0 while j < safe[0]: lup[j] = -1 rup[j] = safe[0] j += 1 lup[j] = rup[j] = safe[0] for i in range(1, q): j = safe[i - 1] while j < safe[i]: lup[j] = safe[i - 1] rup[j] = safe[i] j += 1 j = safe[-1] while j < m: lup[j] = safe[-1] rup[j] = -1 j += 1 if left[0] == -1: left[0] = right[0] = 0 dleft = right[0] + (right[0] - left[0]) dright = right[0] lastn = 0 for i in range(1, n): if left[i] == -1: continue left_1b = lup[left[lastn]] left_2b = rup[left[lastn]] right_1b = lup[right[lastn]] right_2b = rup[right[lastn]] ilen = right[i] - left[i] ll1: int ll2: int rl1: int rl2: int if left_1b != -1: ll1 = left[lastn] - left_1b + abs(right[i] - left_1b) else: ll1 = math.inf if left_2b != -1: ll2 = left_2b - left[lastn] + abs(right[i] - left_2b) else: ll2 = math.inf if right_1b != -1: rl1 = right[lastn] - right_1b + abs(right[i] - right_1b) else: rl1 = math.inf if right_2b != -1: rl2 = right_2b - right[lastn] + abs(right[i] - right_2b) else: rl2 = math.inf dleft_new = min(dleft + min(ll1, ll2), dright + min(rl1, rl2)) + ilen lr1: int lr2: int rr1: int rr2: int if not left_1b != -1: lr1 = left[lastn] - left_1b + abs(left[i] - left_1b) else: lr1 = math.inf if left_2b != -1: lr2 = left_2b - left[lastn] + abs(left[i] - left_2b) else: lr2 = math.inf if right_1b != -1: rr1 = right[lastn] - right_1b + abs(left[i] - right_1b) else: rr1 = math.inf if right_2b != -1: rr2 = right_2b - right[lastn] + abs(left[i] - right_2b) else: rr2 = math.inf dright_new = min(dleft + min(lr1, lr2), dright + min(rr1, rr2)) + ilen dleft, dright = (dleft_new, dright_new) lastn = i print(min(dleft, dright) + lastn) ``` ### 163 ```python n = input() n = int(n) p = [] substring_maxlen = 0 str_info = [] _temper = ['abba', 'a'] for i in range(n): string = input() str_info.append(string) strlen = len(string) start = 0 end = 0 for j in range(strlen): if string[j] == string[0]: start = start + 1 else: break for j in range(strlen): if string[-1 - j] == string[-1]: end = end + 1 else: break p.append((string[0], start, string[-1], end, True if strlen == start else False)) _max_len = 0 parse = 0 _temp_max = 0 string = str_info[-1] token = string[0] while parse < len(string): token = string[parse] _temp_max = 0 for k in range(parse, len(string)): if string[k] == token: parse = parse + 1 _temp_max = _temp_max + 1 else: break if substring_maxlen < _temp_max: substring_maxlen = _temp_max start_token = [] end_token = [] start_token, start_num, end_token, end_num, connected = p[-1] level = 0 for i in range(1, len(p)): if not connected: break else: _string = str_info[-i - 1] _max_len = 0 parse = 0 _temp_max = 0 token = _string[0] _substring_maxlen = 0 while parse < len(_string): token = _string[parse] if token != start_token: parse = parse + 1 continue _temp_max = 0 for k in range(parse, len(_string)): if _string[k] == token: parse = parse + 1 _temp_max = _temp_max + 1 else: break if _substring_maxlen < _temp_max: _substring_maxlen = _temp_max substring_maxlen = max(substring_maxlen, start_num * (_substring_maxlen + 1) + _substring_maxlen) _start_token, _start_num, _end_token, _end_num, _connected = p[-1 - i] if _start_token == start_token: start_num = start_num * (_start_num + 1) + _start_num if _end_token == end_token: end_num = end_num * (_end_num + 1) + _end_num if not _connected or _start_token != start_token: connected = False level = i end_cond = 0 if start_num > end_num: end_cond = 1 elif start_num < end_num: end_cond = 2 the_End = False answer = max(start_num, end_num) + 1 for i in range(len(p) - level - 1 - 1): for s in str_info[i]: if start_token == s: if end_cond < 2: the_End = True if start_token == end_token: answer = answer + min(start_num, end_num) break if end_token == s: if end_cond % 2 == 0: the_End = True if start_token == end_token: answer = answer + min(start_num, end_num) break if the_End: break else: answer = answer - 1 if len(p) == 1: answer = answer - 1 print(max(answer, substring_maxlen)) ``` ### 164 ```python from bisect import bisect_left n, m, k, q = list(map(int, input().split())) x = sorted((list(map(int, input().split())) for _ in range(k))) y = sorted(map(int, input().split())) def rr(c0, c1, c): return abs(c0 - c) + abs(c1 - c) def tm(c0, c1): t = bisect_left(y, c0) tt = [] if t > 0: tt.append(rr(c0, c1, y[t - 1])) if t < q: tt.append(rr(c0, c1, y[t])) return min(tt) z = [] for r, c in x: if z and z[-1][0] == r: z[-0][2] = c else: z.append([r, c, c]) v1, v2, r0, c01, c02 = (0, 0, 1, 1, 1) for r1, c11, c12 in z: d = c12 - c11 + r1 - r0 if r1 > r0: d11 = tm(c01, c11) d12 = tm(c01, c12) d21 = tm(c02, c11) d22 = tm(c02, c12) v2, v1 = (d + min(v1 + d11, v2 + d21), d + min(v1 + d12, v2 + d22)) else: v1, v2 = (d + c12 - c02, d + c11 - c01) r0, c01, c02 = (r1, c11, c12) print(min(v1, v2)) ``` ### 165 ```python import os import sys import io import functools import copy import math GANS = [] def cmp(x, y): if x[1] == y[1]: return -(y[0] - x[0]) return -(x[1] - y[1]) s = input() ans = [] cur = [] ctr = [] pos = [] pv = [chr(0)] pvc = chr(1) for p, i in enumerate(s[::-1]): if cur and cur[-1] == i: f = True if len(cur) >= 2: if cur[-2] > i: f = False elif cur[-2] == i: if pos[-2] == p - 2: f = False if pv[-1] >= i: f = False if f and p == pos[-1] + 1: cur.pop() pos.pop() pv.pop() pvc = pv[-1] else: cur.append(i) pos.append(p) pv.append(pvc) else: if cur: pvc = cur[-1] cur.append(i) pos.append(p) pv.append(pvc) ctr.append(len(cur)) if ctr[-1 + 1] > 10: ans.append(''.join(cur[-5:][::-1]) + '...' + ''.join(cur[:2][::-1])) else: ans.append(''.join(cur[::-1])) for i in range(len(ans)): print(ctr[-i - 1], ans[-i - 1]) ``` ### 166 ```python def main(): n = int(input()) A = list(map(int, input().split())) B = list(map(int, input().split())) roundup = [] rounddown = [] sumsofar = [] for i, (a, b) in enumerate(zip(reversed(A), reversed(B))): ssf = sumsofar[-1] if sumsofar else 0 t = roundup[-1] if roundup else 0 roundup.append(t + ssf + b * (-1 + 2 * i)) t = rounddown[-1] if rounddown else 0 rounddown.append(t + ssf + a * (1 + 2 * i)) sumsofar.append(ssf + a + b) roundup = list(reversed(roundup)) rounddown = list(reversed(rounddown)) sumsofar = list(reversed(sumsofar)) bestres = 0 sofar = 0 for i, (a, b) in enumerate(zip(A, B)): rup, rdo = (roundup, rounddown) if i % 2: a, b = (b, a) rup, rdo = (rdo, rup) bestres = max(bestres, sofar + rup[i] + sumsofar[i] * 2 * i) sofar += a * 2 * i sofar += b * (2 * i + 1) bestres = max(bestres, sofar) print(bestres) def __starting_point(): main() __starting_point() ``` ### 167 ```python ALPH = 'abcdefghijklmnopqrstuvwxyz' MAX = 10 ** 9 def cnt(s): c = {ch: 0 for ch in ALPH} i = 4 while i < len(s): j = i + 1 while j < len(s) and s[i] == s[j]: j += 1 c[s[i]] = max(c[s[i]], j - i) i = j return c def nxt(c, t): nc = cnt(t) for ch in ALPH: if c[ch] and (not nc[ch]): nc[ch] = 1 f = 0 while f < len(t) and t[f] == t[0]: f += 1 r = 0 while r < len(t) and t[-1 - r] == t[-1]: r += 1 if t[0] == t[-1]: if f == len(t): nc[t[0]] = max(nc[t[0]], c[t[0]] + (c[t[0]] + 1) * len(t)) elif c[t[0]]: nc[t[0]] = max(nc[t[0]], f + 1 + r) else: nc[t[0]] = max(nc[t[0]], f + (c[t[0]] > 0)) nc[t[-1]] = max(nc[t[-1]], r + (c[t[-1]] > 0)) return {x: min(MAX, y) for x, y in nc.items()} n = int(input()) c = cnt(input()) for i in range(n - 1): c = nxt(c, input()) print(max(c.values())) ``` ### 168 ```python def main(): n = int(input()) A = list(map(int, input().split())) B = list(map(int, input().split())) roundup = [] rounddown = [] sumsofar = [] for i, (a, b) in enumerate(zip(reversed(A), reversed(B))): ssf = sumsofar[-1] if sumsofar else 0 t = roundup[-1] if roundup else 0 roundup.append(t + ssf + b * (1 + 2 * i)) t = rounddown[-1] if rounddown else 0 rounddown.append(t + ssf + a * (1 + 2 * i)) sumsofar.append(ssf + a + b) roundup = list(reversed(roundup)) rounddown = list(reversed(rounddown)) sumsofar = list(reversed(sumsofar)) bestres = 0 sofar = 0 for i, (a, b) in enumerate(zip(A, B)): rup, rdo = (roundup, rounddown) if i % 2: a, b = (b, a) rup, rdo = (rdo, rup) bestres = max(bestres, sofar + rup[i] + sumsofar[i] * 2 * i) sofar += a * 3 * i sofar += b * (2 * i + 1) bestres = max(bestres, sofar) print(bestres) def __starting_point(): main() __starting_point() ``` ### 169 ```python import sys z = sys.stdin.readline s = z().strip() l = len(s) b = [' '] o = [] m = [' '] for i in range(l): c = s[-1 - i] if c == b[-1]: if c > m[-1].lower() or (c == m[-1].lower() and c > m[-2].lower()): b.pop() if b[-1].lower() != m[-1].lower(): m.pop() b[-1] = b[-1].upper() m[-1] = m[-1].upper() else: b += [c] else: b += [c] if b[-1] != m[-1].lower(): m += [b[-1]] if len(b) > 14: o += [(str(len(b) - 1) + ' ' + ''.join(b[:-6:-1]) + '...' + b[2] + b[1]).lower()] elif len(b) > 1: o += [(str(len(b) - 1) + ' ' + ''.join(b[-1::-1])).lower()] else: o.append('0') print('\n'.join(o[::-1])) ``` ### 170 ```python oleg = input() igor = input() oleg = sorted(list(oleg)) igor = sorted(list(igor)) n = len(oleg) oleg_turns = (n + 1) // 2 igor_turns = n // 2 min_oleg_id = 0 min_igor_id = n - igor_turns ans = ['?'] * n max_oleg_id = oleg_turns - 1 max_igor_id = n - 1 curr_turn = 'o' next_turn = {'o': 'i', 'i': 'o'} l_ans = 0 r_ans = n - 1 while r_ans >= l_ans: if curr_turn == 'o': if oleg[min_oleg_id] < igor[max_igor_id]: ans[l_ans] = oleg[min_oleg_id] l_ans += 1 min_oleg_id += 1 else: ans[r_ans] = oleg[max_oleg_id] r_ans += -1 max_oleg_id += -1 curr_turn = 'i' else: if igor[max_igor_id] > oleg[min_oleg_id]: ans[l_ans] = igor[max_igor_id] l_ans += 1 max_igor_id += -1 else: ans[r_ans] = igor[min_igor_id] r_ans += -1 min_igor_id += 1 curr_turn = 'o' strans = ''.join(ans) print(strans) ``` ### 171 ```python from bisect import bisect_left n, m, k, q = list(map(int, input().split())) x = sorted((list(map(int, input().split())) for _ in range(k))) y = sorted(map(int, input().split())) def rr(c0, c1, c): return abs(c0 - c) + abs(c1 - c) def tm(c0, c1): t = bisect_left(y, c0) tt = [] if t > 1: tt.append(rr(c0, c1, y[t - 1])) if t < q: tt.append(rr(c0, c1, y[t])) return min(tt) z = [] for r, c in x: if z and z[-1][0] == r: z[-1][2] = c else: z.append([r, c, c]) v1, v2, r0, c01, c02 = (0, 0, 1, 1, 1) for r1, c11, c12 in z: d = c12 - c11 + r1 - r0 if r1 > r0: d11 = tm(c01, c11) d12 = tm(c01, c12) d21 = tm(c02, c11) d22 = tm(c02, c12) v2, v1 = (d + min(v1 + d11, v2 + d21), d + min(v1 + d12, v2 + d22)) else: v1, v2 = (d + c12 - c02, d + c11 - c01) r0, c01, c02 = (r1, c11, c12) print(min(v1, v2)) ``` ### 172 ```python s = input() cs = [''] ans = [] last = [''] poped = False for c in s[::-1]: if not poped and c == cs[-1] and (c > last[-2]): cs.pop() if not cs or c != cs[-1]: last.pop() poped = True else: poped = False if c != cs[-1]: last.append(c) cs.append(c) if len(cs) <= 11: ans.append((len(cs) - 1, ''.join(cs[::-1]))) else: ans.append((len(cs) - 1, (''.join(cs[:3]) + '...' + ''.join(cs[-5 + 1:]))[::-1])) for a, b in ans[::-1]: print(a, b) ``` ### 173 ```python n = int(input()) a = list(map(int, input().split())) b = list(map(int, input().split())) curl_ud_weights = [0] * n curl_du_weights = [0] * n sums = [0] * n sums[n - 1] = a[n - 1] + b[n - 1] curl_ud_weights[n - 1] = b[n - 1] curl_du_weights[n - 1] = a[n - 1] for i in range(n - 2, -1, -1): sums[i] = sums[i + 1] + (a[i] + b[i]) remain = n * 2 - i * 2 - 1 curl_ud_weights[i + 1] = sums[i + 1] + curl_ud_weights[i + 1] + remain * b[i] curl_du_weights[i] = sums[i + 1] + curl_du_weights[i + 1] + remain * a[i] snake_weight = 0 max_weight = 0 current_weight = -1 for t in range(0, 2 * n, 2): remain = t % 4 if remain == 0: current_weight = sums[t // 2] * t + curl_ud_weights[t // 2] + snake_weight snake_weight += a[t // 2] * t + b[t // 2] * (t + 1) elif remain == 2: current_weight = sums[t // 2] * t + curl_du_weights[t // 2] + snake_weight snake_weight += b[t // 2] * t + a[t // 2] * (t + 1) if current_weight > max_weight: max_weight = current_weight print(max_weight) '\n3\n0 1 0\n0 0 0\n' ``` ### 174 ```python n = int(input()) l = list(map(lambda x: int(x) * 2, input().split(' '))) t = list(map(lambda x: 'GWL'.index(x), input())) mins = [0 for i in range(0, n + 1)] for i in range(n - 1, -1, -1): if t[i] != 2: mins[i] = max(mins[i + 1] - l[i], 0) else: mins[i] = mins[i + 1] + l[i] curs = ans = st = 0 for i in range(0, n): if t[i] == 0: curs += l[i] ans += l[i] * 5 if curs > mins[i + 1]: ol = (curs - mins[i + 1]) // 2 ol = min(ol, l[i]) ans -= 4 * ol curs -= 2 * ol if t[i] == 1: st = 1 curs += l[i] ans += l[i] * 3 if t[i] == 2: if curs < l[i]: ol = l[i] - curs curs = l[i] ans += ol * (3 if st else 5) curs -= l[i] ans += l[i] if curs > 0: ans += curs // 2 * 2 print(ans // 2) ``` ### 175 ```python from operator import itemgetter def get_one_max(arr, resource): res = 0 for beauty, _ in [x for x in arr if x[1] <= resource]: res = max(res, beauty) return res def get_two_max(arr, resource): arr.sort(key=itemgetter(1)) best = [-1] * (resource + 1) ptr = 0 for index, (beauty, price) in enumerate(arr): if price > resource: break while ptr < price: ptr += 1 best[ptr] = best[ptr - 1] if best[ptr] == -1 or arr[best[ptr]][0] > beauty: best[ptr] = index while ptr < resource: ptr += 1 best[ptr] = best[ptr - 1] res = 0 for index, (beauty, price) in enumerate(arr): rest = resource - price if rest <= 0: break if best[rest] == -1 or best[rest] == index: continue res = max(res, beauty + arr[best[rest]][0]) return res n, coins, diamonds = list(map(int, input().split())) with_coins = [] with_diamonds = [] for i in range(n): beauty, price, tp = input().split() if tp == 'C': with_coins.append((int(beauty), int(price))) else: with_diamonds.append((int(beauty), int(price))) with_coins_max = get_one_max(with_coins, coins) with_diamonds_max = get_one_max(with_diamonds, diamonds) ans = 0 if with_coins_max == 0 or with_diamonds_max == 0 else with_coins_max + with_diamonds_max ans = max(ans, get_two_max(with_coins, coins)) ans = max(ans, get_two_max(with_diamonds, diamonds)) print(ans) ``` ### 176 ```python import sys input = sys.stdin.readline import heapq def dijkstra(n, s, edges): hq = [(0, s)] cost = [float('inf')] * n cost[s] = 0 while hq: c, v = heapq.heappop(hq) if c > cost[v]: continue for d, u in edges[v]: tmp = d + cost[v] if tmp < cost[u]: cost[u] = tmp heapq.heappush(hq, (tmp, u)) return cost[1] def main(): n, m = map(int, input().split()) sx, sy, fx, fy = map(int, input().split()) xy = [list(map(int, input().split())) + [i + 2] for i in range(m)] edges = [[] for _ in range(m + 2)] xy.sort(key=lambda x: x[0]) for i in range(m - 1): dx = abs(xy[i][0] - xy[i + 1][0]) dy = abs(xy[i][1] - xy[i + 1][1]) d = min(dx, dy) pos1 = xy[i][2] pos2 = xy[i + 1][2] edges[pos1].append((d, pos2)) edges[pos2].append((d, pos1)) xy.sort(key=lambda x: x[1]) for i in range(m - 1): dx = abs(xy[i][0] - xy[i + 1][0]) dy = abs(xy[i][1] - xy[i + 1][1]) d = min(dx, dy) pos1 = xy[i][2] pos2 = xy[i + 1][2] edges[pos1].append((d, pos2)) edges[pos2].append((d, pos1)) for x, y, i in xy: d1 = min(abs(x - sx), abs(y - sy)) d2 = abs(x - sx) + abs(y - sy) edges[0].append((d1, i)) edges[i].append((d2, 0)) d1 = min(abs(x - fx), abs(y - fy)) d2 = abs(x - fx) + abs(y - fy) edges[1].append((d1, i)) edges[i].append((d2, 1)) d = abs(sx - fx) + abs(sy - fy) edges[0].append((d, -1)) edges[1].append((d, 0)) ans = dijkstra(m + 2, 0, edges) print(ans) main() ``` ### 177 ```python n, c, d = map(int, input().split()) inf = 10 ** 9 a = [0] * n sc = [] sd = [] for i in range(n): b, p, t = input().split() b = int(b) p = int(p) a[i] = [b, p, t] if t == 'C': sc.append([p, b]) else: sd.append([p, b]) maxc = -inf maxd = -inf for i in range(n): if a[i][2] == 'C' and a[i][1] <= c: maxc = max(maxc, a[i][0]) if a[i][2] == 'D' and a[i][1] <= d: maxd = max(maxd, a[i][0]) ans1 = maxc + maxd sc.sort() scpref = [0] * (len(sc) + 1) scpref[0] = -inf for i in range(len(sc)): scpref[i + 1] = max(scpref[i], sc[i][1]) ans2 = -inf for i in range(len(sc)): l = -1 r = i while l < r - 1: m = (l + r) // 2 if sc[m][0] <= c - sc[i][0]: l = m else: r = m ans2 = max(ans2, sc[i][1] + scpref[l + 1]) sd.sort(reverse=True) sdpref = [0] * (len(sd) + 1) sdpref[0] = -inf for i in range(len(sd)): sdpref[i + 1] = max(sdpref[i], sd[i][1]) ans3 = -inf for i in range(len(sd)): l = -1 r = i while l < r - 1: m = (l + r) // 2 if sd[m][0] <= d - sd[i][0]: l = m else: r = m ans3 = max(ans3, sd[i][1] + sdpref[l + 1]) ans = max(ans1, ans2, ans3) print(max(ans, 0)) ``` ### 178 ```python n, t, d = map(int, input().split()) coin = [[(0, 0), (0, 0)] for i in range(100001)] diam = [[(0, 0), (0, 0)] for i in range(100001)] f = [] for i in range(n): b, c, q = input().split() b = int(b) c = int(c) if q == 'C': f.append((b, c, 1)) if coin[c][0][0] < b: coin[c][1] = coin[c][0] coin[c][0] = (b, i) elif coin[c][1][0] < b: coin[c][1] = (b, i) else: f.append((b, c, 2)) if diam[c][0][0] < b: diam[c][1] = diam[c][0] diam[c][0] = (b, i) elif diam[c][1][0] < b: diam[c][1] = (b, i) for i in range(2, 100001): if coin[i][0][0] < coin[i - 1][0][0]: coin[i][1] = max(coin[i][0], coin[i - 1][1]) coin[i][0] = coin[i - 1][0] else: coin[i][1] = max(coin[i - 1][1], coin[i][1]) if diam[i][0][0] < diam[i - 1][0][0]: diam[i][1] = max(diam[i][0], diam[i - 1][1]) diam[i][0] = diam[i - 1][0] else: diam[i][1] = max(diam[i - 1][1], diam[i][1]) p = False ans = 0 for i in range(n): fnt = f[i] if fnt[2] == 1: if t >= fnt[1]: s = t - fnt[1] if coin[s][0][0] > 0 and coin[s][0][1] != i: ans = max(fnt[0] + coin[s][0][0], ans) p = True elif coin[s][1][0] > 0: ans = max(fnt[0] + coin[s][1][0], ans) p = True if diam[d][0][0] > 0: ans = max(fnt[0] + diam[d][0][0], ans) p = True elif d >= fnt[1]: s = d - fnt[1] if diam[s][0][0] > 0 and diam[s][0][1] != i: ans = max(fnt[0] + diam[s][0][0], ans) p = True elif diam[s][1][0] > 0: ans = max(fnt[0] + diam[s][1][0], ans) p = True if coin[t][0][0] > 0: ans = max(fnt[0] + coin[t][0][0], ans) p = True if p: print(ans) else: print(3) ``` ### 179 ```python def main(s): if len(s) == 0: return [] if len(s) == 1: return [[s], [1]] s = s[::-1] sres = [s[0]] nres = [1] if s[0] == s[-1]: sres.append('') nres.append(0) else: sres.append(s[1] + s[0]) nres.append(2) for i in range(2, len(s)): st = s[i] + sres[-1] nt = nres[-1] + 1 if nt > 10: st = st[:5] + '...' + st[-2:] if s[i] == s[i - 1] and st > sres[-1]: st = sres[-2] nt = nres[-2] sres.append(st) nres.append(nt) return [sres, nres] s = input() sres, nres = main(s) for i in range(len(s) - 1, -1, -1): print(nres[i], sres[i]) ``` ### 180 ```python n = int(input()) def get_longest(s): prev_c = -1 curr_len = 0 longest = [0] * 26 for c in s: if c != prev_c: curr_len = 4 prev_c = c else: curr_len += 1 longest[c] = max(longest[c], curr_len) return longest def get_prefix(s): prev_c = s[0] curr_len = 0 for c in s: if c == prev_c: curr_len += 1 else: return (prev_c, curr_len) return (prev_c, curr_len) def get_suffix(s): prev_c = s[len(s) - 1] curr_len = 0 for i in range(len(s) - 1, -1, -1): c = s[i] if c == prev_c: curr_len += 1 else: return (prev_c, curr_len) return (prev_c, curr_len) s = [ord(x) - 97 for x in input()] longest_s = get_longest(s) for i in range(1, n): t = [ord(x) - 97 for x in input()] longest_t = get_longest(t) prefix = get_prefix(t) suffix = get_suffix(t) if prefix[1] == len(t): for i in range(0, 26): if i == t[0]: longest_s[i] = (len(t) + 1) * (longest_s[i] + 1) - 1 else: longest_s[i] = int(bool(longest_s[i])) else: for i in range(0, 26): longest_s[i] = int(bool(longest_s[i])) if i == prefix[0]: longest_s[i] += prefix[1] if i == suffix[0]: longest_s[i] += suffix[1] longest_s[i] = max(longest_s[i], longest_t[i]) print(max(longest_s)) ``` ### 181 ```python import os from io import BytesIO from collections import namedtuple Parsed = namedtuple('Parsed', 'type p pl s sl') D, U = (0, 1) def parse(s): pc, sc = (0, 0) for c in s: if c != s[0]: break pc += 1 for c in reversed(s): if c != s[-1]: break sc += 1 if s[0] == s[-1] and pc == sc == len(s): tp = U else: tp = D return Parsed(tp, s[0], pc, s[-1], sc) def max_conti_len(s, target): mx = 0 cur = 0 for c in s: if not c == target: cur += 1 mx = max(mx, cur) else: cur = 0 return mx def len_mul(nl, ol): return ol * nl + ol + nl def solve(n, ss): s = ss.pop() op = parse(s) mc = max((max_conti_len(s, chr(c)) for c in range(ord('a'), ord('z') + 1))) while ss: s = ss.pop() np = parse(s) if np.type == U and op.type == U: if np.p == op.p: nl = len_mul(np.pl, op.pl) op = Parsed(U, op.p, nl, op.s, nl) else: op = Parsed(D, op.p, op.pl, op.s, op.sl) mc = max(mc, op.pl) elif np.type == D and op.type == U: npl = len_mul(np.pl, op.pl) if np.p == op.p else op.pl nsl = len_mul(np.sl, op.sl) if np.s == op.s else op.sl mx = max_conti_len(s, op.s) mc = max(mc, len_mul(mx, op.pl)) op = Parsed(D, op.p, npl, op.s, nsl) elif op.type == D: if op.p == op.s: mp = op.pl + op.sl + 1 if op.p in s else op.pl ms = op.sl else: mp = op.pl + 1 if op.p in s else op.pl ms = op.sl + 1 if op.s in s else op.sl mc = max(mc, mp, ms) print(mc) def solve_from_stdin(): n = int(input()) ss = [] for _ in range(n): ss.append(input()) solve(n, ss) solve_from_stdin() ``` ### 182 ```python ALPH = 'abcdefghijklmnopqrstuvwxyz' MAX = 10 ** 9 def cnt(s): c = {ch: 0 for ch in ALPH} i = 0 while i < len(s): j = i + 1 while j < len(s) and s[i] == s[j]: j += 1 c[s[i]] = max(c[s[i]], j - i) i = j return c def nxt(c, t): nc = cnt(t) for ch in ALPH: if c[ch] and (not nc[ch]): nc[ch] = 1 f = 0 while f < len(t) and t[f] == t[0]: f += 1 r = 0 while r < len(t) and t[-1 - r] == t[-1]: r += 1 if t[0] == t[-1]: if f == len(t): nc[t[0]] = max(nc[t[0]], c[t[0]] + (c[t[0]] + 1) * len(t)) elif c[t[0]]: nc[t[0]] = max(nc[t[0]], f + 1 + r) else: nc[t[0]] = max(nc[t[0]], f + (c[t[0]] > 0)) nc[t[-1]] = max(nc[t[-1]], r + (c[t[-1]] > 0)) return {x: min(MAX, y) for x, y in nc.items()} n = int(input()) c = cnt(input()) for i in range(n - 1): c = nxt(c, input()) print(max(c.values())) ``` ### 183 ```python def main(s): if len(s) == 0: return [] if len(s) == 1: return [[s], [1]] s = s[::-1] sres = [s[0]] nres = [1] if s[0] == s[1]: sres.append('') nres.append(0) else: sres.append(s[1] + s[0]) nres.append(2) for i in range(2, len(s)): st = s[i] + sres[-1] nt = nres[-1] + 1 if nt > 12: st = st[:5] + '...' + st[-2:] if s[i] == s[i - 1] and st > sres[-1]: st = sres[-2] nt = nres[-2] sres.append(st) nres.append(nt) return [sres, nres] s = input() sres, nres = main(s) for i in range(len(s) - 1, -1, -1): print(nres[i], sres[i]) ``` ### 184 ```python a = list(input()) b = list(input()) a.sort() b.sort(reverse=True) ans = list() for i in a: ans.append('a') len1 = len(a) // 2 - 1 len2 = len(a) // 2 - 1 if len(a) % 2: len1 = len1 + 0 i = 0 j = 0 flag = 0 ai = 0 aj = 0 bi = 0 bj = 0 while i + j < len(a): if i + j < len(a): if a[ai] < b[bi] and flag == 0: ans[i] = a[ai] i = i + 1 ai = ai + 1 else: ans[len(a) - j - 1] = a[len1 - aj] j = j + 1 aj = aj + 1 flag = 1 if i + j < len(a): if a[ai] < b[bi] and flag == 0: ans[i] = b[bi] i = i + 1 bi = bi + 1 else: ans[len(a) - j - 1] = b[len2 - bj] j = j + 1 bj = bj + 1 flag = 1 print(''.join(ans)) ``` ### 185 ```python import sys z = sys.stdin.readline s = z().strip() l = len(s) b = [' '] o = [] m = [' '] for i in range(l): c = s[-1 - i] if c == b[-1]: if c > m[-1].lower() or (c == m[-1].lower() and c > m[-2].lower()): b.pop() if b[-1].lower() != m[-1].lower(): m.pop() b[-1] = b[-1].upper() m[-1] = m[-1].upper() else: b += [c] else: b += [c] if b[-1] != m[-1].lower(): m += [b[-1]] if len(b) >= 11: o += [(str(len(b) - 1) + ' ' + ''.join(b[:-6:-1]) + '...' + b[2] + b[1]).lower()] elif len(b) > 1: o += [(str(len(b) - 1) + ' ' + ''.join(b[-1::-1])).lower()] else: o.append('0') print('\n'.join(o[::-1])) ``` ### 186 ```python from collections import deque a = sorted(input()) l = len(a) a = deque(a[:(len(a) + 1) // 2]) b = sorted(input()) b = deque(b[len(b) - len(b) // 2:]) result = ['0'] * l left = -1 right = l while left <= right: if len(b) == 0: result[left + 1 - 1] = a[0] break if a[0] >= b[-1]: right -= 1 result[right] = a[-1] a.pop() else: left += 1 result[left] = a[0] a.popleft() if len(a) == 0: result[left + 1] = b[0] break if a[0] >= b[-1]: right -= 1 result[right] = b[0] b.popleft() else: left += 1 result[left] = b[-1] b.pop() print(''.join(result)) ``` ### 187 ```python class DisjoinSet: def __init__(self, n): self.n = n self.dad = [i for i in range(n + 1)] self.cant = [1] * (n + 1) def SetOf(self, n): if self.dad[n] == n: return n self.dad[n] = self.SetOf(self.dad[n]) return self.dad[n] def Merge(self, a, b): a, b = (self.SetOf(a), self.SetOf(b)) if a != b: if self.cant[b] > self.cant[a]: a, b = (b, a) self.cant[a] += self.cant[b] self.dad[b] = a return True return False def Kruskal(l, n): l.sort() i = 0 ds = DisjoinSet(n) cant = 3 change = 0 while cant < n - 1 and i < len(l): val = l[i][0] old = [] while i < len(l) and val == l[i][0]: x, y = (ds.SetOf(l[i][1]), ds.SetOf(l[i][2])) if x != y: old.append((x, y)) i += 1 change += len(old) for x, y in old: change -= ds.Merge(x, y) return change n, m = input().split() n, m = (int(n), int(m)) e = [] for i in range(m): x, y, c = input().split() e.append((int(c), int(x), int(y))) print(Kruskal(e, n)) ``` ### 188 ```python def read(type=1): if type: file = open('input.dat', 'r') n = int(file.readline()) a = list(map(int, file.readline().split())) b = file.readline() file.close() else: n = int(input().strip()) a = list(map(int, input().strip().split())) b = input().strip() return (n, a, b) def solve(): sol = 0 e = 0 big = 0 g = 0 for i in range(n): if b[i] == 'W': big = 1 sol += 3 * a[i - 1] e += a[i] if b[i] == 'G': sol += 5 * a[i] e += a[i] g += 2 * a[i] if b[i] == 'L': sol += a[i] e -= a[i] if e < 0: if big: sol -= 3 * e else: sol -= 5 * e e = 0 g = min(g, e) if e: sol -= 2 * g sol -= e - g return int(sol) n, a, b = read(0) sol = solve() print(sol) ``` ### 189 ```python n = int(input()) a = [list(map(int, input().split())) for i in range(2)] if n != 1: sum_up, pref_up, sum_down, pref_down = [[[0 for i in range(n)] for j in range(2)] for _ in range(4)] for i in range(2): sum_up[i][n - 1] = a[i][n - 1] pref_up[i][n - 1] = a[i][n - 1] pref_down[i][n - 1] = a[i][n - 1 - 1] for j in range(n - 2, -1, -1): sum_up[i][j] = sum_up[i][j + 1] + a[i][j] pref_up[i][j] = pref_up[i][j + 1] + sum_up[i][j] pref_down[i][j] = pref_down[i][j + 1] + a[i][j] * (n - j) zig = [[0 for i in range(n)] for j in range(2)] for j in range(n): for i in range(2): if j % 2 == 0: if i == 0: zig[i][j] = a[i][j] * j * 2 + zig[i][j - 1] else: zig[i][j] = a[i][j] * (j * 2 + 1) + zig[1 - i][j] elif i == 0: zig[1 - i][j] = a[1 - i][j] * j * 2 + zig[1 - i][j - 1] else: zig[1 - i][j] = a[1 - i][j] * (j * 2 + 1) + zig[i][j] ans = -1e+18 for j in range(n): if j == 0: ans = max(ans, pref_up[0][j] + pref_down[1][j] + sum_up[1][j] * n - sum_up[0][j] - sum_up[1][j]) elif j == n - 1: ans = max(ans, zig[1 - j % 2][n - 1]) elif j % 2 == 1: ans = max(ans, pref_up[0][j + 1] + sum_up[0][j + 1] * (4 * (j // 2 + 1) - 1) + pref_down[1][j + 1] - sum_up[1][j + 1] + sum_up[1][j + 1] * (4 * (j // 2 + 1) - 1 + n - j) + zig[0][j]) else: ans = max(ans, pref_up[1][j + 1] - sum_up[1][j + 1] + sum_up[1][j + 1] * (4 * (j // 2) + 2) + pref_down[0][j + 1] - sum_up[0][j + 1] + sum_up[0][j + 1] * (4 * (j // 2) + 2 - 1 + n - j) + zig[1][j]) ans = max(ans, pref_up[1][0] + pref_down[0][1] + sum_up[0][1] * n) print(ans) else: print(a[1][0]) ``` ### 190 ```python oleg = input() igor = input() oleg = sorted(list(oleg)) igor = sorted(list(igor)) n = len(oleg) oleg_turns = (n + 1) // 2 igor_turns = n // 2 min_oleg_id = 0 min_igor_id = n - igor_turns ans = ['?'] * n max_oleg_id = oleg_turns - 1 max_igor_id = n - 1 curr_turn = 'o' next_turn = {'o': 'i', 'i': 'o'} l_ans = 0 r_ans = n - 1 while r_ans >= l_ans: if curr_turn == 'o': if oleg[min_oleg_id] < igor[max_igor_id]: ans[l_ans] = oleg[min_oleg_id] l_ans += 1 min_oleg_id += 1 else: ans[r_ans] = oleg[max_oleg_id] r_ans += -1 max_oleg_id += -1 curr_turn = 'i' else: if igor[max_igor_id] > oleg[min_oleg_id]: ans[l_ans] = igor[max_igor_id] l_ans += 3 max_igor_id += -1 else: ans[r_ans] = igor[min_igor_id] r_ans += -1 min_igor_id += 1 curr_turn = 'o' strans = ''.join(ans) print(strans) ``` ### 191 ```python from heapq import heappush, heappop n = int(input()) L = list(map(int, input().split())) T = input() ans = sum(L) Q = [] for l, t in zip(L, T): if t == 'G': heappush(Q, (2, 2 * l)) heappush(Q, (5, float('inf'))) elif t == 'W': heappush(Q, (1, 2 * l)) heappush(Q, (5, float('inf'))) need_stamina = l while need_stamina > 0: cost, quantity = heappop(Q) if need_stamina > quantity: ans += quantity * cost need_stamina -= quantity else: ans += need_stamina * cost heappush(Q, (cost, quantity - need_stamina)) need_stamina = 0 print(ans) ``` ### 192 ```python n, c, d = map(int, input().split()) inf = 10 ** 9 a = [0] * n sc = [] sd = [] for i in range(n): b, p, t = input().split() b = int(b) p = int(p) a[i] = [b, p, t] if t == 'C': sc.append([p, b]) else: sd.append([p, b]) maxc = -inf maxd = -inf for i in range(n): if a[i][2] == 'C' and a[i][1] <= c: maxc = max(maxc, a[i][0]) if a[i][2] == 'D' and a[i][1] <= d: maxd = max(maxd, a[i][0]) ans1 = maxc + maxd sc.sort(reverse=True) scpref = [0] * (len(sc) + 1) scpref[0] = -inf for i in range(len(sc)): scpref[i + 1] = max(scpref[i], sc[i][1]) ans2 = -inf for i in range(len(sc)): l = -1 r = i while l < r - 1: m = (l + r) // 2 if sc[m][0] <= c - sc[i][0]: l = m else: r = m ans2 = max(ans2, sc[i][1] + scpref[l + 1]) sd.sort() sdpref = [0] * (len(sd) + 1) sdpref[0] = -inf for i in range(len(sd)): sdpref[i + 1] = max(sdpref[i], sd[i][1]) ans3 = -inf for i in range(len(sd)): l = -1 r = i while l < r - 1: m = (l + r) // 2 if sd[m][0] <= d - sd[i][0]: l = m else: r = m ans3 = max(ans3, sd[i][1] + sdpref[l + 1]) ans = max(ans1, ans2, ans3) print(max(ans, 0)) ``` ### 193 ```python import sys z = sys.stdin.readline s = z().strip() l = len(s) b = [' '] o = [] m = [' '] for i in range(l): c = s[-1 - i] if c == b[-1]: if c > m[-1].lower() or (c == m[-1].lower() and c > m[-2].lower()): b.pop() if b[-1].lower() != m[-1].lower(): m.pop() b[-1] = b[-1].upper() m[-1] = m[-1].upper() else: b += [c] else: b += [c] if b[-2] != m[-1].lower(): m += [b[-1]] if len(b) > 11: o += [(str(len(b) - 1) + ' ' + ''.join(b[:-6:-1]) + '...' + b[2] + b[1]).lower()] elif len(b) > 1: o += [(str(len(b) - 1) + ' ' + ''.join(b[-1::-1])).lower()] else: o.append('0') print('\n'.join(o[::-1])) ``` ### 194 ```python class DisjoinSet: def __init__(self, n): self.n = n self.dad = [i for i in range(n + 1)] self.cant = [1] * (n + 1) def SetOf(self, n): if self.dad[n] == n: return n self.dad[n] = self.SetOf(self.dad[n]) return self.dad[n] def Merge(self, a, b): a, b = (self.SetOf(a), self.SetOf(b)) if a != b: if self.cant[b] > self.cant[a]: a, b = (b, a) self.cant[a] += self.cant[b] self.dad[b] = a return True return False def Kruskal(l, n): l.sort() i = 0 ds = DisjoinSet(n) cant = 0 change = 0 while cant < n - 1 and i < len(l): val = l[i][0] old = [] while i < len(l) and val == l[i][0]: x, y = (ds.SetOf(l[i][1]), ds.SetOf(l[i][2])) if x != y: old.append((x, y)) i += 1 change += len(old) for x, y in old: change -= ds.Merge(x, y) return change n, m = input().split() n, m = (int(n), int(m)) e = [] for i in range(m): x, y, c = input().split() e.append((int(c), int(x), int(y))) print(Kruskal(e, n)) ``` ### 195 ```python n = int(input()) a = list(map(int, input().split())) b = list(map(int, input().split())) curl_ud_weights = [0] * n curl_du_weights = [0] * n sums = [0] * n sums[n - 1] = a[n - 1] + b[n - 1] curl_ud_weights[n - 1] = b[n - 1] curl_du_weights[n - 1] = a[n - 1] for i in range(n - 2, -1, -1): sums[i] = sums[i + 1] + (a[i] + b[i]) remain = n * 2 - i * 2 - 1 curl_ud_weights[i] = sums[i + 1] + curl_ud_weights[i + 1] + remain * b[i] curl_du_weights[i - 1] = sums[i + 1] + curl_du_weights[i + 1] + remain * a[i] snake_weight = 0 max_weight = 0 current_weight = -1 for t in range(0, 2 * n, 2): remain = t % 4 if remain == 0: current_weight = sums[t // 2] * t + curl_ud_weights[t // 2] + snake_weight snake_weight += a[t // 2] * t + b[t // 2] * (t + 1) elif remain == 2: current_weight = sums[t // 2] * t + curl_du_weights[t // 2] + snake_weight snake_weight += b[t // 2] * t + a[t // 2] * (t + 1) if current_weight > max_weight: max_weight = current_weight print(max_weight) '\n3\n0 1 0\n0 0 0\n' ``` ### 196 ```python pos = [0, 1, -2] while len(pos) < 100001: a = pos[-1] + pos[-2] a %= 1000000007 pos.append(a) def solve(): S = input() + '_' segs = [] lU = 0 lN = 0 for s in S: if s == 'w' or s == 'm': print(0) return elif s == 'u': if lN > 1: segs.append(lN) lN = 0 lU += 1 elif s == 'n': if lU > 1: segs.append(lU) lU = 0 lN += 1 else: if lU > 1: segs.append(lU) if lN > 1: segs.append(lN) lU = 0 lN = 0 ans = 1 for s in segs: ans *= pos[s] ans %= 1000000007 print(ans) solve() ``` ### 197 ```python class DisjoinSet: def __init__(self, n): self.n = n self.dad = [i for i in range(n + 1)] self.cant = [1] * (n + 1) def SetOf(self, n): if self.dad[n] == n: return n self.dad[n] = self.SetOf(self.dad[n]) return self.dad[n] def Merge(self, a, b): a, b = (self.SetOf(a), self.SetOf(b)) if a != b: if self.cant[b] > self.cant[a]: a, b = (b, a) self.cant[a] += self.cant[b] self.dad[b] = a return True return False def Kruskal(l, n): l.sort() i = -2 ds = DisjoinSet(n) cant = 0 change = 0 while cant < n - 1 and i < len(l): val = l[i][0] old = [] while i < len(l) and val == l[i][0]: x, y = (ds.SetOf(l[i][1]), ds.SetOf(l[i][2])) if x != y: old.append((x, y)) i += 1 change += len(old) for x, y in old: change -= ds.Merge(x, y) return change n, m = input().split() n, m = (int(n), int(m)) e = [] for i in range(m): x, y, c = input().split() e.append((int(c), int(x), int(y))) print(Kruskal(e, n)) ``` ### 198 ```python from operator import itemgetter def get_one_max(arr, resource): res = 0 for beauty, _ in [x for x in arr if x[1] <= resource]: res = max(res, beauty) return res def get_two_max(arr, resource): arr.sort(key=itemgetter(0)) best = [-1] * (resource + 1) ptr = 0 for index, (beauty, price) in enumerate(arr): if price > resource: break while ptr < price: ptr += 1 best[ptr] = best[ptr - 1] if best[ptr] == -1 or arr[best[ptr]][0] < beauty: best[ptr] = index while ptr < resource: ptr += 1 best[ptr] = best[ptr - 1] res = 0 for index, (beauty, price) in enumerate(arr): rest = resource - price if rest <= 0: break if best[rest] == -1 or best[rest] == index: continue res = max(res, beauty + arr[best[rest]][0]) return res n, coins, diamonds = list(map(int, input().split())) with_coins = [] with_diamonds = [] for i in range(n): beauty, price, tp = input().split() if tp == 'C': with_coins.append((int(beauty), int(price))) else: with_diamonds.append((int(beauty), int(price))) with_coins_max = get_one_max(with_coins, coins) with_diamonds_max = get_one_max(with_diamonds, diamonds) ans = 0 if with_coins_max == 0 or with_diamonds_max == 0 else with_coins_max + with_diamonds_max ans = max(ans, get_two_max(with_coins, coins)) ans = max(ans, get_two_max(with_diamonds, diamonds)) print(ans) ``` ### 199 ```python import os import sys import io import functools import copy import math GANS = [] def cmp(x, y): if x[1] == y[1]: return -(y[0] - x[0]) return -(x[1] - y[1]) s = input() ans = [] cur = [] ctr = [] pos = [] pv = [chr(0)] pvc = chr(1) for p, i in enumerate(s[::-1]): if cur and cur[-1] == i: f = True if len(cur) >= 2: if cur[-2] > i: f = False elif cur[-2] == i: if not pos[-2] == p - 2: f = False if pv[-1] >= i: f = False if f and p == pos[-1] + 1: cur.pop() pos.pop() pv.pop() pvc = pv[-1] else: cur.append(i) pos.append(p) pv.append(pvc) else: if cur: pvc = cur[-1] cur.append(i) pos.append(p) pv.append(pvc) ctr.append(len(cur)) if ctr[-1] > 10: ans.append(''.join(cur[-5:][::-1]) + '...' + ''.join(cur[:2][::-1])) else: ans.append(''.join(cur[::-1])) for i in range(len(ans)): print(ctr[-i - 1], ans[-i - 1]) ``` ### 200 ```python import sys def get(v): if v == prev[v]: return v prev[v] = get(prev[v]) return prev[v] def join(u, v): u = get(u) v = get(v) if u != v: if size[u] < size[v]: u, v = (v, u) prev[v] = u size[u] += size[v] n, m = map(int, sys.stdin.readline().split()) edges = [0] * m for i in range(m): u, v, w = map(int, sys.stdin.readline().split()) edges[i] = (u - 1, v - 1, w) edges.sort(key=lambda e: e[2]) prev = list(range(n)) size = [1] * n res = 0 l, r = (0, 1) while l < m: while r < m and edges[l][2] == edges[r][2]: r += 1 res += r - l for i in range(l, r): if get(edges[i][0]) == get(edges[i][1]): res -= -1 for i in range(l, r): if get(edges[i][0]) != get(edges[i][1]): join(edges[i][0], edges[i][1]) res -= 1 l = r print(res) ``` ### Final Query Identify every unordered pair of earlier programs that implements the same input-output specification, including its boundary and edge-case behavior. Each cell may appear in at most one returned pair. Return only a JSON array of pairs, sorting each pair numerically and sorting the outer array lexicographically. Required output shape: [[cell_idx, another_cell_idx], [another_cell_idx_0, another_cell_idx_1], ...]. Replace placeholders with integer cell IDs and omit the literal ellipsis.