結果
問題 | No.2261 Coffee |
ユーザー |
![]() |
提出日時 | 2023-04-07 21:39:21 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 464 ms / 2,000 ms |
コード長 | 2,094 bytes |
コンパイル時間 | 166 ms |
コンパイル使用メモリ | 82,064 KB |
実行使用メモリ | 104,692 KB |
最終ジャッジ日時 | 2024-10-02 19:12:09 |
合計ジャッジ時間 | 13,554 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 42 |
ソースコード
import os import sys from io import BytesIO, IOBase BUFSIZE = 8192 class FastIO(IOBase): newlines = 0 def __init__(self, file): self._fd = file.fileno() self.buffer = BytesIO() self.writable = "x" in file.mode or "r" not in file.mode self.write = self.buffer.write if self.writable else None def read(self): while True: b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE)) if not b: break ptr = self.buffer.tell() self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr) self.newlines = 0 return 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 -= 1 return 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.flush self.writable = self.buffer.writable self.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") n = int(input()) a = [[0] * n for i in range(5)] for i in range(n): a[0][i], a[1][i], a[2][i], a[3][i], a[4][i] = map(int,input().split()) f = [[0] * n for i in range(16)] for i in range(16): for k in range(n): v = a[0][k] for j in range(4): if i >> j & 1: v += a[j+1][k] else: v -= a[j+1][k] f[i][k] = v mx = [max(f[i]) for i in range(16)] mn = [min(f[i]) for i in range(16)] for k in range(n): ar = 0 for i in range(16): v = a[0][k] for j in range(4): if i >> j & 1: v += a[j+1][k] else: v -= a[j+1][k] ar = max(ar, max(abs(mx[i] - v), abs(v - mn[i]))) print(ar)