結果
問題 | No.2401 Dirty Shoes and Stairs |
ユーザー | cleantted |
提出日時 | 2023-08-04 21:31:38 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 243 ms / 2,000 ms |
コード長 | 1,562 bytes |
コンパイル時間 | 792 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 154,368 KB |
最終ジャッジ日時 | 2024-10-14 19:29:39 |
合計ジャッジ時間 | 7,698 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 162 ms
90,368 KB |
testcase_01 | AC | 160 ms
90,448 KB |
testcase_02 | AC | 159 ms
90,368 KB |
testcase_03 | AC | 190 ms
107,264 KB |
testcase_04 | AC | 208 ms
120,832 KB |
testcase_05 | AC | 170 ms
97,024 KB |
testcase_06 | AC | 185 ms
106,496 KB |
testcase_07 | AC | 217 ms
134,804 KB |
testcase_08 | AC | 185 ms
102,656 KB |
testcase_09 | AC | 164 ms
90,624 KB |
testcase_10 | AC | 180 ms
100,072 KB |
testcase_11 | AC | 243 ms
154,368 KB |
testcase_12 | AC | 229 ms
146,592 KB |
testcase_13 | AC | 160 ms
90,368 KB |
testcase_14 | AC | 160 ms
90,356 KB |
testcase_15 | AC | 161 ms
90,368 KB |
testcase_16 | AC | 162 ms
90,752 KB |
testcase_17 | AC | 159 ms
90,512 KB |
testcase_18 | AC | 163 ms
90,784 KB |
testcase_19 | AC | 158 ms
90,368 KB |
testcase_20 | AC | 166 ms
90,432 KB |
testcase_21 | AC | 165 ms
90,368 KB |
testcase_22 | AC | 165 ms
90,752 KB |
testcase_23 | AC | 166 ms
90,496 KB |
testcase_24 | AC | 166 ms
90,624 KB |
testcase_25 | AC | 174 ms
90,368 KB |
testcase_26 | AC | 173 ms
90,496 KB |
testcase_27 | AC | 161 ms
90,388 KB |
testcase_28 | AC | 161 ms
90,480 KB |
testcase_29 | AC | 161 ms
90,368 KB |
testcase_30 | AC | 159 ms
90,368 KB |
testcase_31 | AC | 167 ms
90,368 KB |
testcase_32 | AC | 160 ms
90,240 KB |
ソースコード
# import bisect import copy import heapq import itertools import math import operator import random import sys from bisect import bisect, bisect_left, bisect_right, insort from collections import Counter, deque from fractions import Fraction from functools import cmp_to_key, lru_cache, partial from inspect import currentframe from math import ceil, gcd, log10, pi, sqrt from typing import Iterable, Iterator, List, Tuple, TypeVar, Union # import pypyjit # pypyjit.set_param('max_unroll_recursion=-1') # import string # import networkx as nx input = sys.stdin.readline sys.setrecursionlimit(10000000) # mod = 10 ** 9 + 7 mod = 998244353 # mod = 1 << 128 # mod = 10 ** 30 + 1 INF = 1 << 61 DIFF = 10 ** -9 DX = [1, 0, -1, 0, 1, 1, -1, -1] DY = [0, 1, 0, -1, 1, -1, 1, -1] def read_values(): return tuple(map(int, input().split())) def read_index(): return tuple(map(lambda x: int(x) - 1, input().split())) def read_list(): return list(read_values()) def read_lists(N): return [read_list() for _ in range(N)] def dprint(*values): print(*values, file=sys.stderr) def dprint2(*values): names = {id(v): k for k, v in currentframe().f_back.f_locals.items()} dprint(", ".join(f"{names.get(id(value), '???')}={repr(value)}" for value in values)) def main(): N, = read_values() M1 = int(input()) A = read_list() M2 = int(input()) B = read_list() S = set() t = 0 for a in A: S.add(t) t += a for b in B: S.add(t) t -= b print(N + 1 - len(S)) if __name__ == "__main__": main()