結果
問題 |
No.2740 Old Maid
|
ユーザー |
![]() |
提出日時 | 2025-03-04 02:58:07 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 297 ms / 2,000 ms |
コード長 | 2,102 bytes |
コンパイル時間 | 668 ms |
コンパイル使用メモリ | 82,344 KB |
実行使用メモリ | 176,888 KB |
最終ジャッジ日時 | 2025-03-04 02:58:26 |
合計ジャッジ時間 | 15,738 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 62 |
ソースコード
class Node: def __init__(self, val): self.val = val self.left = None self.right = None class LinkedList: def __init__(self): self.head = None self.tail = None self.size = 0 def __len__(self): return self.size def __iter__(self): if self.head is None: return node = self.head while node: yield node.val node = node.right @staticmethod def _connect(a: Node, b: Node): """a と b を接合する""" a.right = b b.left = a def append(self, val) -> Node: node = Node(val) if self.head is None: self.head = self.tail = node else: LinkedList._connect(self.tail, node) self.tail = node self.size += 1 return node def appendleft(self, val) -> Node: node = Node(val) if self.head is None: self.head = self.tail = node else: LinkedList._connect(node, self.head) self.head = node self.size += 1 return node def remove(self, node: Node): assert node is not None assert self.size > 0 if node is self.head: self.head = self.head.right if self.head: self.head.left = None elif node is self.tail: self.tail = self.tail.left if self.tail: self.tail.right = None else: left = node.left right = node.right left.right = right right.left = left self.size -= 1 N = int(input()) P = list(map(lambda x: int(x)-1, input().split())) p2node = {} ll = LinkedList() for p in P: node = ll.append(p) p2node[p] = node used = set() ans = [] for i in range(N): if i in used: continue node = p2node[i] if node.right is None: continue ans.append(node.val) ans.append(node.right.val) ll.remove(node) ll.remove(node.right) used.add(ans[-1]) used.add(ans[-2]) print(*[x+1 for x in ans])