結果
問題 | No.2202 贅沢てりたまチキン |
ユーザー |
![]() |
提出日時 | 2023-02-03 21:29:19 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 331 ms / 2,000 ms |
コード長 | 2,177 bytes |
コンパイル時間 | 186 ms |
コンパイル使用メモリ | 82,456 KB |
実行使用メモリ | 84,744 KB |
最終ジャッジ日時 | 2024-07-02 19:12:11 |
合計ジャッジ時間 | 3,735 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 28 |
ソースコード
import osimport sysfrom io import BytesIO, IOBaseBUFSIZE = 8192class FastIO(IOBase):newlines = 0def __init__(self, file):self._fd = file.fileno()self.buffer = BytesIO()self.writable = "x" in file.mode or "r" not in file.modeself.write = self.buffer.write if self.writable else Nonedef read(self):while True:b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))if not b:breakptr = self.buffer.tell()self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)self.newlines = 0return self.buffer.read()def readline(self):while self.newlines == 0:b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))self.newlines = b.count(b"\n")+(not b)ptr = self.buffer.tell()self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)self.newlines -= 1return self.buffer.readline()def flush(self):if self.writable:os.write(self._fd, self.buffer.getvalue())self.buffer.truncate(0), self.buffer.seek(0)class IOWrapper(IOBase):def __init__(self, file):self.buffer = FastIO(file)self.flush = self.buffer.flushself.writable = self.buffer.writableself.write = lambda s:self.buffer.write(s.encode("ascii"))self.read = lambda:self.buffer.read().decode("ascii")self.readline = lambda:self.buffer.readline().decode("ascii")sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)input = lambda:sys.stdin.readline().rstrip("\r\n")class UnionFind:def __init__(self, n):self.n = nself.parents = [-1] * ndef find(self, x):if self.parents[x] < 0:return xelse:self.parents[x] = self.find(self.parents[x])return self.parents[x]def union(self, x, y):x = self.find(x)y = self.find(y)if x == y:returnif self.parents[x] > self.parents[y]:x, y = y, xself.parents[x] += self.parents[y]self.parents[y] = xn,m = map(int,input().split())uf = UnionFind(2 * n)for i in range(m):a, b = map(int,input().split())a-=1; b-=1uf.union(a, b + n)uf.union(a + n, b)mode = 1for i in range(n):if uf.find(i) != uf.find(i+n):mode = 0if mode:print("Yes")else:print("No")