結果
問題 |
No.1347 HS Railway
|
ユーザー |
![]() |
提出日時 | 2021-09-07 00:08:27 |
言語 | Python3 (3.13.1 + numpy 2.2.1 + scipy 1.14.1) |
結果 |
AC
|
実行時間 | 716 ms / 2,000 ms |
コード長 | 1,377 bytes |
コンパイル時間 | 246 ms |
コンパイル使用メモリ | 13,056 KB |
実行使用メモリ | 27,892 KB |
最終ジャッジ日時 | 2024-12-22 20:31:18 |
合計ジャッジ時間 | 16,357 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 50 |
ソースコード
import sys # sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() # dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] inf = 10**20 # md = 998244353 md = 10**9+7 n = II() cs = [] lr = [] for i in range(5): l, r, *aa = LI() l, r = l-1, r-1 lr.append((l, r)) s = [0] for a in aa: s.append(s[-1]+a) cs.append(s) ss = [[] for _ in range(5)] for _ in range(II()): i, s = LI() ss[i-1].append(s) for i in range(5):ss[i].sort() ans = 0 for j in range(5): l1, r1 = lr[j] for i in range(j): l0, r0 = lr[i] l = max(l0, l1) r = min(r0, r1) if l>r:continue u = v = 0 d = cs[j][l-l1]-cs[i][l-l0] e = cs[j][r-l1]-cs[i][r-l0] for s in ss[j]: while u < len(ss[i]) and s+d > ss[i][u]: u += 1 if u==len(ss[i]):break while v < len(ss[i]) and s+e >= ss[i][v]: v += 1 ans += v-u print(ans)