takeU

import sys input = sys.stdin.readline m, n = map(int, input().split()) d = {} for _ in range(m): li = list(map(int, input().split())) k = sorted(list(set(li))) i = {k[i]: i for i in range(len(k))} c = str([i[l] for l in li]) d[c] = d.get(c, 0) + 1 print(sum(map(lambda x: x * (x - 1) // 2, d.values()))) 좌표압축

s = input() for i in range(len(s) - 1): if s[i] > s[i + 1] and s[i + 1] = s[i + 1]: s = s[:i + 2][::-1] + s[i + 2:] print(s) 문자열

import sys input = sys.stdin.readline def find_parent(parent, x): if parent[x] != x: return find_parent(parent, parent[x]) return x def union_parent(parent, a, b, c): a = find_parent(parent, a) b = find_parent(parent, b) if a != b: parent[max(a, b)] = min(a, b) else: return c return 0 n, m = map(int, input().split()) parents = list(range(n)) ans = 0 for i in range(1, m + 1): x, y = map(int, inpu..

per = input() n = (len(per) - 9) // 2 + 9 if len(per) > 9 else len(per) check = [0] * (n + 1) ans = [] def bt(p): if sum(check) == n: print(*ans) exit() if len(p) >= 2: cur = int(p[:2]) if cur

import sys input = sys.stdin.readline n = int(input()) stack, ans = [], 0 for _ in range(n): x, y = map(int, input().split()) while stack and stack[-1] > y: ans += 1 stack.pop() if stack and stack[-1] == y: continue stack.append(y) while stack: if stack[-1] > 0: ans += 1 stack.pop() print(ans) 스택

import sys input = sys.stdin.readline INF = int(1e9) n, m = int(input()), int(input()) graph = [[[INF, [i, j]] for j in range(n + 1)] for i in range(n + 1)] for _ in range(m): a, b, c = map(int, input().split()) graph[a][b][0] = min(graph[a][b][0], c) for k in range(1, n + 1): for i in range(1, n + 1): for j in range(1, n + 1): if i == j: graph[i][j][0] = 0 else: if graph[i][j][0] > graph[i][k][..

check = [0] * 26 while True: try: s = input() for c in s: if c != ' ': check[ord(c) - 97] += 1 except: break m = max(check) for i, c in enumerate(check): if c == m: print(chr(i + 97), end='') 구현

n = int(input()) check = [0] * 26 for _ in range(n): s = input().split() i, ans = 0, False for i in range(len(s)): if not check[ord(s[i][0].lower()) - 97]: check[ord(s[i][0].lower()) - 97] = 1 s[i] = '[' + s[i][0] + ']' + s[i][1:] ans = True break if ans: print(' '.join(s)) continue s = ' '.join(s) for i, c in enumerate(s): if c != ' ' and not check[ord(c.lower()) - 97]: check[ord(c.lower()) - 9..

import sys input = sys.stdin.readline from heapq import heappush, heappop n, k = map(int, sys.stdin.readline().split()) jewelry = sorted([list(map(int, input().split())) for _ in range(n)]) bag = sorted([int(input()) for _ in range(k)]) ans, temp = 0, [] for b in bag: while jewelry and b >= jewelry[0][0]: heappush(temp, -jewelry[0][1]) heappop(jewelry) if temp: ans += heappop(temp) elif not jewe..

from bisect import bisect_left, bisect_right t = int(input()) n = int(input()) li_a = list(map(int, input().split())) m = int(input()) li_b = list(map(int, input().split())) def sum_li(li): res = [] for i in range(len(li)): acc = 0 for j in range(i, len(li)): acc += li[j] res.append(acc) return res s_a, s_b = sorted(sum_li(li_a)), sorted(sum_li(li_b)) ans = 0 for s in s_a: left = bisect_left(s_b..