node_ids
listlengths 4
1.4k
| edge_index
listlengths 1
2.22k
| text
listlengths 4
1.4k
| source
stringlengths 14
427k
|
|---|---|---|---|
[
7,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
0,
13,
13,
14,
2,
13,
17,
4,
13,
2,
13,
17,
4,
18,
13,
13,
0,
13,
17,
0,
13,
2,
18,
13,
17,
17,
0,
13,
17,
28,
13,
4,
13,
17,
13,
0,
13,
18,
13,
13,
4,
13,
4,
13,
2,
13,
13,
17,
10,
4,
13,
10,
17,
13,
10,
18,
13,
10,
2,
13,
10,
13,
13,
10,
4,
13
] |
[
[
88,
2
],
[
88,
11
],
[
15,
14
],
[
14,
23
],
[
85,
25
],
[
74,
29
],
[
89,
34
],
[
86,
38
],
[
42,
41
],
[
82,
44
],
[
86,
47
],
[
76,
51
],
[
55,
54
],
[
74,
58
],
[
79,
60
],
[
86,
62
],
[
54,
63
],
[
83,
69
],
[
80,
70
],
[
77,
70
],
[
88,
74
],
[
76,
77
],
[
79,
80
],
[
82,
83
],
[
85,
86
],
[
88,
89
]
] |
[
"k, t = map(int, input().split())\na = [int(_) for _ in input().split()]\n\nif t == 1:\n print(k-1)\nelse:\n a.sort(reverse=True)\n num = a[0] - 1\n cnt = 0\n for i in range(1, t):\n cnt += a[i]\n print(max(num-cnt, 0))",
"k, t = map(int, input().split())",
"k",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"t",
"int(_) for _ in input().split()",
"for _ in input().split()",
"_",
"input().split()",
"().split",
"()",
"input",
"split",
"for _ in input().split()",
"int(_)",
"int",
"_",
"a = [int(_) for _ in input().split()]",
"a",
"[int(_) for _ in input().split()]",
"if t == 1:\n print(k-1)\nelse:\n a.sort(reverse=True)\n num = a[0] - 1\n cnt = 0\n for i in range(1, t):\n cnt += a[i]\n print(max(num-cnt, 0))",
"t == 1",
"t",
"1",
"print(k-1)",
"print",
"k-1",
"k",
"1",
"a.sort(reverse=True)",
"a.sort",
"a",
"sort",
"reverse=True",
"reverse",
"True",
"num = a[0] - 1",
"num",
"a[0] - 1",
"a[0]",
"a",
"0",
"1",
"cnt = 0",
"cnt",
"0",
"for i in range(1, t):\n cnt += a[i]\n ",
"i",
"range(1, t)",
"range",
"1",
"t",
"cnt += a[i]",
"cnt",
"a[i]",
"a",
"i",
"print(max(num-cnt, 0))",
"print",
"max(num-cnt, 0)",
"max",
"num-cnt",
"num",
"cnt",
"0",
"t = map(int, input().split())",
"map(int, input().split())",
"t",
"cnt = 0",
"0",
"cnt",
"cnt += a[i]",
"a[i]",
"cnt",
"num = a[0] - 1",
"a[0] - 1",
"num",
"a = [int(_) for _ in input().split()]",
"[int(_) for _ in input().split()]",
"a",
"k, t = map(int, input().split())",
"map(int, input().split())",
"k"
] |
k, t = map(int, input().split())
a = [int(_) for _ in input().split()]
if t == 1:
print(k-1)
else:
a.sort(reverse=True)
num = a[0] - 1
cnt = 0
for i in range(1, t):
cnt += a[i]
print(max(num-cnt, 0))
|
[
7,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
4,
18,
13,
13,
4,
13,
4,
13,
2,
2,
18,
13,
17,
4,
13,
18,
13,
39,
17,
17,
17,
10,
4,
13,
10,
4,
13,
10,
4,
13
] |
[
[
49,
2
],
[
49,
11
],
[
52,
13
],
[
53,
26
],
[
53,
35
],
[
53,
40
],
[
49,
47
],
[
49,
50
],
[
52,
53
]
] |
[
"K, T = map(int, input().split())\nA = list(map(int, input().split()))\n\nA.sort()\nprint(max(A[-1]-sum(A[:-1])-1, 0))",
"K, T = map(int, input().split())",
"K",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"T",
"A = list(map(int, input().split()))",
"A",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"A.sort()",
"A.sort",
"A",
"sort",
"print(max(A[-1]-sum(A[:-1])-1, 0))",
"print",
"max(A[-1]-sum(A[:-1])-1, 0)",
"max",
"A[-1]-sum(A[:-1])-1",
"A[-1]-sum(A[:-1])",
"A[-1]",
"A",
"-1",
"sum(A[:-1])",
"sum",
"A[:-1]",
"A",
":-1",
"-1",
"1",
"0",
"K, T = map(int, input().split())",
"map(int, input().split())",
"K",
"T = map(int, input().split())",
"map(int, input().split())",
"T",
"A = list(map(int, input().split()))",
"list(map(int, input().split()))",
"A"
] |
K, T = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
print(max(A[-1]-sum(A[:-1])-1, 0))
|
[
7,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
13,
4,
13,
4,
13,
2,
2,
13,
17,
2,
13,
13,
17,
10,
4,
13,
10,
4,
13,
10,
4,
13,
10,
4,
13
] |
[
[
45,
2
],
[
45,
11
],
[
48,
13
],
[
51,
25
],
[
49,
28
],
[
52,
35
],
[
46,
38
],
[
52,
39
],
[
45,
43
],
[
45,
46
],
[
48,
49
],
[
51,
52
]
] |
[
"K,T=map(int,input().split())\na=list(map(int,input().split()))\nt=max(a)\nprint(max(t-1-(K-t),0))",
"K,T=map(int,input().split())",
"K",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"T",
"a=list(map(int,input().split()))",
"a",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"t=max(a)",
"t",
"max(a)",
"max",
"a",
"print(max(t-1-(K-t),0))",
"print",
"max(t-1-(K-t),0)",
"max",
"t-1-(K-t)",
"t-1",
"t",
"1",
"K-t",
"K",
"t",
"0",
"T=map(int,input().split())",
"map(int,input().split())",
"T",
"K,T=map(int,input().split())",
"map(int,input().split())",
"K",
"a=list(map(int,input().split()))",
"list(map(int,input().split()))",
"a",
"t=max(a)",
"max(a)",
"t"
] |
K,T=map(int,input().split())
a=list(map(int,input().split()))
t=max(a)
print(max(t-1-(K-t),0))
|
[
7,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
4,
18,
13,
13,
0,
13,
18,
13,
17,
0,
13,
4,
13,
18,
13,
39,
17,
14,
2,
13,
17,
4,
13,
2,
13,
17,
4,
13,
4,
13,
4,
13,
17,
2,
2,
13,
13,
17,
10,
4,
13,
10,
4,
13,
10,
4,
13,
10,
4,
13,
10,
18,
13
] |
[
[
66,
2
],
[
66,
11
],
[
72,
13
],
[
73,
26
],
[
75,
29
],
[
73,
31
],
[
69,
34
],
[
73,
38
],
[
67,
43
],
[
64,
48
],
[
76,
59
],
[
70,
60
],
[
66,
64
],
[
66,
67
],
[
69,
70
],
[
72,
73
],
[
75,
76
]
] |
[
"k, t = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\ns = a[-1]\nb = sum(a[:-1])\nif t == 1:\n print (k-1)\n exit()\nprint (max(0,s-b-1))",
"k, t = map(int, input().split())",
"k",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"t",
"a = list(map(int, input().split()))",
"a",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"a.sort()",
"a.sort",
"a",
"sort",
"s = a[-1]",
"s",
"a[-1]",
"a",
"-1",
"b = sum(a[:-1])",
"b",
"sum(a[:-1])",
"sum",
"a[:-1]",
"a",
":-1",
"-1",
"if t == 1:\n print (k-1)\n exit()",
"t == 1",
"t",
"1",
"print (k-1)",
"print",
"k-1",
"k",
"1",
"exit()",
"exit",
"print (max(0,s-b-1))",
"print",
"max(0,s-b-1)",
"max",
"0",
"s-b-1",
"s-b",
"s",
"b",
"1",
"k, t = map(int, input().split())",
"map(int, input().split())",
"k",
"t = map(int, input().split())",
"map(int, input().split())",
"t",
"b = sum(a[:-1])",
"sum(a[:-1])",
"b",
"a = list(map(int, input().split()))",
"list(map(int, input().split()))",
"a",
"s = a[-1]",
"a[-1]",
"s"
] |
k, t = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
s = a[-1]
b = sum(a[:-1])
if t == 1:
print (k-1)
exit()
print (max(0,s-b-1))
|
[
7,
15,
13,
0,
13,
39,
4,
18,
13,
13,
13,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
28,
13,
13,
4,
18,
13,
13,
13,
40,
13,
0,
13,
17,
0,
13,
17,
42,
17,
14,
2,
40,
13,
2,
4,
13,
13,
17,
3,
14,
2,
4,
13,
13,
17,
0,
13,
4,
13,
13,
3,
0,
13,
4,
18,
13,
13,
13,
14,
13,
4,
18,
13,
13,
13,
13,
14,
2,
13,
17,
0,
13,
17,
0,
13,
17,
0,
13,
13,
4,
13,
13,
10,
4,
13,
10,
39,
13,
10,
4,
13,
10,
17,
13,
10,
4,
13,
10,
4,
13,
10,
17,
13,
10,
4,
13,
10,
13,
13,
10,
17,
13,
10,
17,
13
] |
[
[
109,
4
],
[
110,
10
],
[
121,
12
],
[
121,
21
],
[
106,
23
],
[
36,
35
],
[
107,
35
],
[
110,
41
],
[
35,
43
],
[
136,
45
],
[
133,
48
],
[
134,
55
],
[
131,
55
],
[
116,
55
],
[
110,
59
],
[
110,
66
],
[
118,
69
],
[
134,
72
],
[
131,
72
],
[
116,
72
],
[
127,
75
],
[
110,
80
],
[
110,
87
],
[
134,
88
],
[
131,
88
],
[
116,
88
],
[
128,
91
],
[
125,
91
],
[
115,
94
],
[
124,
97
],
[
130,
100
],
[
125,
101
],
[
128,
101
],
[
119,
104
],
[
137,
104
],
[
106,
107
],
[
109,
110
],
[
121,
113
],
[
115,
116
],
[
118,
119
],
[
121,
122
],
[
124,
125
],
[
127,
128
],
[
125,
130
],
[
128,
130
],
[
130,
131
],
[
133,
134
],
[
136,
137
]
] |
[
"import heapq\n\nbuf = []\nheapq.heapify(buf)\n\nk,t = map(int,input().split())\narr = list(map(int,input().split()))\n\nfor a in arr:\n heapq.heappush(buf,-a)\n\nans = 0\n\nbef = None\nwhile True:\n if not bef and len(buf) == 0:\n break\n if len(buf) == 0:\n ans += abs(bef)\n break\n else:\n top = heapq.heappop(buf)\n if bef:\n heapq.heappush(buf,bef)\n\n if top == -1:\n bef = None\n else:\n top += 1\n bef = top\n\n\n\n\n # print(buf,bef)\n\n\nprint(ans)",
"import heapq",
"heapq",
"buf = []",
"buf",
"[]",
"heapq.heapify(buf)",
"heapq.heapify",
"heapq",
"heapify",
"buf",
"k,t = map(int,input().split())",
"k",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"t",
"arr = list(map(int,input().split()))",
"arr",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"for a in arr:\n heapq.heappush(buf,-a)",
"a",
"arr",
"heapq.heappush(buf,-a)",
"heapq.heappush",
"heapq",
"heappush",
"buf",
"-a",
"a",
"ans = 0",
"ans",
"0",
"bef = None",
"bef",
"None",
"while True:\n if not bef and len(buf) == 0:\n break\n if len(buf) == 0:\n ans += abs(bef)\n break\n else:\n top = heapq.heappop(buf)\n if bef:\n heapq.heappush(buf,bef)\n\n if top == -1:\n bef = None\n else:\n top += 1\n bef = top\n\n\n\n\n # print(buf,bef)",
"True",
"if not bef and len(buf) == 0:\n break\n ",
"not bef and len(buf) == 0",
"not bef",
"bef",
"len(buf) == 0",
"len(buf)",
"len",
"buf",
"0",
"break",
"if len(buf) == 0:\n ans += abs(bef)\n break\n else:\n top = heapq.heappop(buf)\n if bef:\n heapq.heappush(buf,bef)\n\n if top == -1:\n bef = None\n else:\n top += 1\n bef = top\n\n\n\n\n # print(buf,bef)",
"len(buf) == 0",
"len(buf)",
"len",
"buf",
"0",
"ans += abs(bef)",
"ans",
"abs(bef)",
"abs",
"bef",
"break",
"top = heapq.heappop(buf)",
"top",
"heapq.heappop(buf)",
"heapq.heappop",
"heapq",
"heappop",
"buf",
"if bef:\n heapq.heappush(buf,bef)\n\n ",
"bef",
"heapq.heappush(buf,bef)",
"heapq.heappush",
"heapq",
"heappush",
"buf",
"bef",
"if top == -1:\n bef = None\n else:\n top += 1\n bef = top\n\n\n\n\n # print(buf,bef)",
"top == -1",
"top",
"-1",
"bef = None",
"bef",
"None",
"top += 1",
"top",
"1",
"bef = top",
"bef",
"top",
"print(ans)",
"print",
"ans",
"arr = list(map(int,input().split()))",
"list(map(int,input().split()))",
"arr",
"buf = []",
"[]",
"buf",
"k,t = map(int,input().split())",
"map(int,input().split())",
"k",
"bef = None",
"None",
"bef",
"ans += abs(bef)",
"abs(bef)",
"ans",
"t = map(int,input().split())",
"map(int,input().split())",
"t",
"top += 1",
"1",
"top",
"top = heapq.heappop(buf)",
"heapq.heappop(buf)",
"top",
"bef = top",
"top",
"bef",
"bef = None",
"None",
"bef",
"ans = 0",
"0",
"ans"
] |
import heapq
buf = []
heapq.heapify(buf)
k,t = map(int,input().split())
arr = list(map(int,input().split()))
for a in arr:
heapq.heappush(buf,-a)
ans = 0
bef = None
while True:
if not bef and len(buf) == 0:
break
if len(buf) == 0:
ans += abs(bef)
break
else:
top = heapq.heappop(buf)
if bef:
heapq.heappush(buf,bef)
if top == -1:
bef = None
else:
top += 1
bef = top
# print(buf,bef)
print(ans)
|
[
7,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
4,
18,
13,
13,
14,
2,
13,
17,
4,
13,
2,
18,
13,
17,
17,
4,
13,
4,
13,
17,
2,
18,
13,
17,
2,
2,
13,
18,
13,
17,
17,
10,
4,
13,
10,
4,
13,
10,
4,
13
] |
[
[
62,
2
],
[
62,
11
],
[
59,
13
],
[
60,
26
],
[
57,
30
],
[
60,
36
],
[
60,
46
],
[
63,
50
],
[
60,
52
],
[
62,
57
],
[
59,
60
],
[
62,
63
]
] |
[
"K,T = map(int, input().split())\nA = list(map(int, input().split()))\n\nA.sort()\nif T == 1:\n print(A[0] - 1)\nelse:\n print(max(0, A[-1] - (K - A[-1] + 1)))",
"K,T = map(int, input().split())",
"K",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"T",
"A = list(map(int, input().split()))",
"A",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"A.sort()",
"A.sort",
"A",
"sort",
"if T == 1:\n print(A[0] - 1)\nelse:\n print(max(0, A[-1] - (K - A[-1] + 1)))",
"T == 1",
"T",
"1",
"print(A[0] - 1)",
"print",
"A[0] - 1",
"A[0]",
"A",
"0",
"1",
"print(max(0, A[-1] - (K - A[-1] + 1)))",
"print",
"max(0, A[-1] - (K - A[-1] + 1))",
"max",
"0",
"A[-1] - (K - A[-1] + 1)",
"A[-1]",
"A",
"-1",
"K - A[-1] + 1",
"K - A[-1]",
"K",
"A[-1]",
"A",
"-1",
"1",
"T = map(int, input().split())",
"map(int, input().split())",
"T",
"A = list(map(int, input().split()))",
"list(map(int, input().split()))",
"A",
"K,T = map(int, input().split())",
"map(int, input().split())",
"K"
] |
K,T = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
if T == 1:
print(A[0] - 1)
else:
print(max(0, A[-1] - (K - A[-1] + 1)))
|
[
7,
15,
13,
4,
18,
13,
13,
2,
17,
17,
15,
15,
15,
15,
15,
15,
15,
15,
0,
13,
2,
2,
17,
17,
17,
0,
13,
4,
13,
17,
0,
13,
40,
4,
13,
17,
12,
13,
12,
13,
12,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
12,
13,
23,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
12,
13,
23,
13,
12,
13,
12,
13,
12,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
12,
13,
23,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
12,
13,
23,
13,
0,
13,
4,
13,
13,
0,
13,
4,
13,
4,
13,
0,
13,
17,
14,
2,
13,
17,
4,
13,
2,
13,
17,
4,
13,
14,
40,
2,
18,
13,
17,
17,
4,
13,
18,
13,
39,
17,
4,
13,
17,
4,
13,
2,
2,
18,
13,
17,
4,
13,
18,
13,
39,
17,
17,
10,
12,
13,
10,
12,
13,
10,
12,
13,
10,
4,
13,
10,
12,
13,
10,
4,
13,
10,
2,
13,
10,
12,
13,
10,
4,
13,
10,
12,
13,
10,
4,
13,
10,
12,
13,
10,
12,
13,
10,
12,
13,
10,
12,
13,
10,
40,
13
] |
[
[
174,
19
],
[
180,
26
],
[
201,
31
],
[
45,
44
],
[
196,
50
],
[
54,
54
],
[
58,
57
],
[
178,
63
],
[
67,
67
],
[
77,
76
],
[
184,
82
],
[
86,
86
],
[
90,
89
],
[
190,
95
],
[
99,
99
],
[
186,
101
],
[
199,
103
],
[
186,
104
],
[
171,
106
],
[
178,
110
],
[
113,
112
],
[
187,
116
],
[
166,
121
],
[
172,
129
],
[
172,
135
],
[
172,
146
],
[
172,
151
],
[
186,
166
],
[
171,
172
],
[
174,
175
],
[
180,
181
],
[
186,
187
],
[
201,
202
]
] |
[
"import sys\nsys.setrecursionlimit(10**6)\nfrom math import floor,ceil,sqrt,factorial,log\nfrom heapq import heappop, heappush, heappushpop\nfrom collections import Counter,defaultdict,deque\nfrom itertools import accumulate,permutations,combinations,product,combinations_with_replacement\nfrom bisect import bisect_left,bisect_right\nfrom copy import deepcopy\nfrom operator import itemgetter\nfrom fractions import gcd\nmod = 10 ** 9 + 7\ninf = float('inf')\nninf = -float('inf')\n \n#整数input\ndef ii(): return int(sys.stdin.readline().rstrip()) #int(input())\ndef mii(): return map(int,sys.stdin.readline().rstrip().split())\ndef limii(): return list(mii()) #list(map(int,input().split()))\ndef lin(n:int): return [ii() for _ in range(n)]\ndef llint(n: int): return [limii() for _ in range(n)]\n#文字列input\ndef ss(): return sys.stdin.readline().rstrip() #input()\ndef mss(): return sys.stdin.readline().rstrip().split()\ndef limss(): return list(mss()) #list(input().split())\ndef lst(n:int): return [ss() for _ in range(n)]\ndef llstr(n: int): return [limss() for _ in range(n)]\n\n#本当に貪欲法か？ DP法では？？\n#本当に貪欲法か？ DP法では？？\n#本当に貪欲法か？ DP法では？？\nk,t=mii()\narr=sorted(limii(),reverse=True)\n\nif t==1:\n print(k-1)\n exit()\nif arr[0]-1 <=sum(arr[1:]):\n print(0)\nelse:\n print(arr[0]-sum(arr[1:])-1)",
"import sys",
"sys",
"sys.setrecursionlimit(10**6)",
"sys.setrecursionlimit",
"sys",
"setrecursionlimit",
"10**6",
"10",
"6",
"from math import floor,ceil,sqrt,factorial,log",
"from heapq import heappop, heappush, heappushpop",
"from collections import Counter,defaultdict,deque",
"from itertools import accumulate,permutations,combinations,product,combinations_with_replacement",
"from bisect import bisect_left,bisect_right",
"from copy import deepcopy",
"from operator import itemgetter",
"from fractions import gcd",
"mod = 10 ** 9 + 7",
"mod",
"10 ** 9 + 7",
"10 ** 9",
"10",
"9",
"7",
"inf = float('inf')",
"inf",
"float('inf')",
"float",
"'inf'",
"ninf = -float('inf')",
"ninf",
"-float('inf')",
"float('inf')",
"float",
"'inf'",
"def ii(): return int(sys.stdin.readline().rstrip()) #int(input())",
"ii",
"def mii(): return map(int,sys.stdin.readline().rstrip().split())",
"mii",
"def limii(): return list(mii()) #list(map(int,input().split()))",
"limii",
"ii() for _ in range(n)",
"for _ in range(n)",
"_",
"range(n)",
"range",
"n",
"for _ in range(n)",
"ii()",
"ii",
"def lin(n:int): return [ii() for _ in range(n)]",
"lin",
"n:int",
"n",
"limii() for _ in range(n)",
"for _ in range(n)",
"_",
"range(n)",
"range",
"n",
"for _ in range(n)",
"limii()",
"limii",
"def llint(n: int): return [limii() for _ in range(n)]\n#文字列input",
"llint",
"n: int",
"n",
"def ss(): return sys.stdin.readline().rstrip() #input()",
"ss",
"def mss(): return sys.stdin.readline().rstrip().split()",
"mss",
"def limss(): return list(mss()) #list(input().split())",
"limss",
"ss() for _ in range(n)",
"for _ in range(n)",
"_",
"range(n)",
"range",
"n",
"for _ in range(n)",
"ss()",
"ss",
"def lst(n:int): return [ss() for _ in range(n)]",
"lst",
"n:int",
"n",
"limss() for _ in range(n)",
"for _ in range(n)",
"_",
"range(n)",
"range",
"n",
"for _ in range(n)",
"limss()",
"limss",
"def llstr(n: int): return [limss() for _ in range(n)]\n\n#本当に貪欲法か？ DP法では？？\n#本当に貪欲法か？ DP法では？？\n#本当に貪欲法か？ DP法では？？",
"llstr",
"n: int",
"n",
"k,t=mii()",
"k",
"mii()",
"mii",
"t",
"arr=sorted(limii(),reverse=True)",
"arr",
"sorted(limii(),reverse=True)",
"sorted",
"limii()",
"limii",
"reverse=True",
"reverse",
"True",
"if t==1:\n print(k-1)\n exit()",
"t==1",
"t",
"1",
"print(k-1)",
"print",
"k-1",
"k",
"1",
"exit()",
"exit",
"if arr[0]-1 <=sum(arr[1:]):\n print(0)\nelse:\n print(arr[0]-sum(arr[1:])-1)",
"arr[0]-1 <=sum(arr[1:])",
"arr[0]-1",
"arr[0]",
"arr",
"0",
"1",
"sum(arr[1:])",
"sum",
"arr[1:]",
"arr",
"1:",
"1",
"print(0)",
"print",
"0",
"print(arr[0]-sum(arr[1:])-1)",
"print",
"arr[0]-sum(arr[1:])-1",
"arr[0]-sum(arr[1:])",
"arr[0]",
"arr",
"0",
"sum(arr[1:])",
"sum",
"arr[1:]",
"arr",
"1:",
"1",
"1",
"def llint(n: int): return [limii() for _ in range(n)]\n#文字列input",
"def llint(n: int): return [limii() for _ in range(n)]\n#文字列input",
"llint",
"def lst(n:int): return [ss() for _ in range(n)]",
"def lst(n:int): return [ss() for _ in range(n)]",
"lst",
"def mss(): return sys.stdin.readline().rstrip().split()",
"def mss(): return sys.stdin.readline().rstrip().split()",
"mss",
"k,t=mii()",
"mii()",
"k",
"def llstr(n: int): return [limss() for _ in range(n)]\n\n#本当に貪欲法か？ DP法では？？\n#本当に貪欲法か？ DP法では？？\n#本当に貪欲法か？ DP法では？？",
"def llstr(n: int): return [limss() for _ in range(n)]\n\n#本当に貪欲法か？ DP法では？？\n#本当に貪欲法か？ DP法では？？\n#本当に貪欲法か？ DP法では？？",
"llstr",
"arr=sorted(limii(),reverse=True)",
"sorted(limii(),reverse=True)",
"arr",
"mod = 10 ** 9 + 7",
"10 ** 9 + 7",
"mod",
"def limii(): return list(mii()) #list(map(int,input().split()))",
"def limii(): return list(mii()) #list(map(int,input().split()))",
"limii",
"inf = float('inf')",
"float('inf')",
"inf",
"def ss(): return sys.stdin.readline().rstrip() #input()",
"def ss(): return sys.stdin.readline().rstrip() #input()",
"ss",
"t=mii()",
"mii()",
"t",
"def limss(): return list(mss()) #list(input().split())",
"def limss(): return list(mss()) #list(input().split())",
"limss",
"def lin(n:int): return [ii() for _ in range(n)]",
"def lin(n:int): return [ii() for _ in range(n)]",
"lin",
"def ii(): return int(sys.stdin.readline().rstrip()) #int(input())",
"def ii(): return int(sys.stdin.readline().rstrip()) #int(input())",
"ii",
"def mii(): return map(int,sys.stdin.readline().rstrip().split())",
"def mii(): return map(int,sys.stdin.readline().rstrip().split())",
"mii",
"ninf = -float('inf')",
"-float('inf')",
"ninf"
] |
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
mod = 10 ** 9 + 7
inf = float('inf')
ninf = -float('inf')
#整数input
def ii(): return int(sys.stdin.readline().rstrip()) #int(input())
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) #list(map(int,input().split()))
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]
#文字列input
def ss(): return sys.stdin.readline().rstrip() #input()
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) #list(input().split())
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]
#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？
k,t=mii()
arr=sorted(limii(),reverse=True)
if t==1:
print(k-1)
exit()
if arr[0]-1 <=sum(arr[1:]):
print(0)
else:
print(arr[0]-sum(arr[1:])-1)
|
[
7,
15,
13,
0,
13,
18,
18,
13,
13,
13,
12,
13,
29,
4,
13,
4,
13,
12,
13,
29,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
12,
13,
0,
13,
4,
13,
29,
4,
13,
18,
13,
39,
2,
4,
13,
13,
17,
12,
13,
29,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
13,
0,
13,
4,
13,
4,
13,
4,
13,
0,
13,
4,
13,
18,
13,
39,
17,
14,
2,
13,
18,
13,
17,
4,
13,
17,
4,
13,
2,
2,
18,
13,
17,
13,
17,
10,
18,
13,
10,
12,
13,
10,
4,
13,
10,
4,
13,
10,
12,
13,
10,
12,
13,
10,
4,
13,
10,
12,
13,
10,
4,
13
] |
[
[
98,
4
],
[
99,
16
],
[
99,
28
],
[
34,
33
],
[
99,
35
],
[
33,
40
],
[
33,
45
],
[
99,
56
],
[
122,
59
],
[
102,
61
],
[
122,
62
],
[
104,
64
],
[
102,
70
],
[
107,
72
],
[
105,
76
],
[
108,
81
],
[
105,
83
],
[
105,
93
],
[
108,
95
],
[
98,
99
],
[
104,
105
],
[
107,
108
],
[
122,
117
],
[
122,
123
]
] |
[
"import sys\ninput = sys.stdin.readline\n\n############ ---- Input Functions ---- ############\ndef inp():\n return(int(input()))\ndef inlt():\n return(list(map(int,input().split())))\ndef insr():\n s = input()\n return(list(s[:len(s) - 1]))\ndef invr():\n return(map(int,input().split()))\n \nk, t = invr()\nips = sorted(list(invr()))\nrest_sum = sum(ips[:-1])\nif rest_sum > ips[-1]:\n print(0)\nelse :\n print(ips[-1]-rest_sum-1)",
"import sys",
"sys",
"input = sys.stdin.readline",
"input",
"sys.stdin.readline",
"sys.stdin",
"sys",
"stdin",
"readline",
"def inp():\n return(int(input()))",
"inp",
"return(int(input()))",
"int(input())",
"int",
"input()",
"input",
"def inlt():\n return(list(map(int,input().split())))",
"inlt",
"return(list(map(int,input().split())))",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"def insr():\n s = input()\n return(list(s[:len(s) - 1]))",
"insr",
"s = input()",
"s",
"input()",
"input",
"return(list(s[:len(s) - 1]))",
"list(s[:len(s) - 1])",
"list",
"s[:len(s) - 1]",
"s",
":len(s) - 1",
"len(s) - 1",
"len(s)",
"len",
"s",
"1",
"def invr():\n return(map(int,input().split()))\n ",
"invr",
"return(map(int,input().split()))",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"k, t = invr()",
"k",
"invr()",
"invr",
"t",
"ips = sorted(list(invr()))",
"ips",
"sorted(list(invr()))",
"sorted",
"list(invr())",
"list",
"invr()",
"invr",
"rest_sum = sum(ips[:-1])",
"rest_sum",
"sum(ips[:-1])",
"sum",
"ips[:-1]",
"ips",
":-1",
"-1",
"if rest_sum > ips[-1]:\n print(0)\nelse :\n print(ips[-1]-rest_sum-1)",
"rest_sum > ips[-1]",
"rest_sum",
"ips[-1]",
"ips",
"-1",
"print(0)",
"print",
"0",
"print(ips[-1]-rest_sum-1)",
"print",
"ips[-1]-rest_sum-1",
"ips[-1]-rest_sum",
"ips[-1]",
"ips",
"-1",
"rest_sum",
"1",
"input = sys.stdin.readline",
"sys.stdin.readline",
"input",
"def invr():\n return(map(int,input().split()))\n ",
"def invr():\n return(map(int,input().split()))\n ",
"invr",
"ips = sorted(list(invr()))",
"sorted(list(invr()))",
"ips",
"rest_sum = sum(ips[:-1])",
"sum(ips[:-1])",
"rest_sum",
"def inp():\n return(int(input()))",
"def inp():\n return(int(input()))",
"inp",
"def inlt():\n return(list(map(int,input().split())))",
"def inlt():\n return(list(map(int,input().split())))",
"inlt",
"k, t = invr()",
"invr()",
"k",
"def insr():\n s = input()\n return(list(s[:len(s) - 1]))",
"def insr():\n s = input()\n return(list(s[:len(s) - 1]))",
"insr",
"t = invr()",
"invr()",
"t"
] |
import sys
input = sys.stdin.readline
############ ---- Input Functions ---- ############
def inp():
return(int(input()))
def inlt():
return(list(map(int,input().split())))
def insr():
s = input()
return(list(s[:len(s) - 1]))
def invr():
return(map(int,input().split()))
k, t = invr()
ips = sorted(list(invr()))
rest_sum = sum(ips[:-1])
if rest_sum > ips[-1]:
print(0)
else :
print(ips[-1]-rest_sum-1)
|
[
7,
12,
13,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
4,
13,
13,
2,
2,
2,
17,
18,
13,
13,
17,
13,
4,
13,
13,
14,
2,
13,
17,
4,
13,
10,
12,
13
] |
[
[
5,
4
],
[
5,
13
],
[
16,
15
],
[
28,
27
],
[
31,
30
],
[
13,
33
],
[
36,
35
],
[
27,
38
],
[
35,
38
],
[
15,
44
],
[
30,
45
],
[
4,
47
],
[
35,
50
],
[
27,
50
],
[
59,
56
]
] |
[
"def main():\n K,T = map(int,input().split())\n A = list(map(int,input().split()))\n ans = 0\n for i in range(T):\n ans = max(ans,2*A[i]-1-K)\n print(ans)\n\nif __name__ == \"__main__\":\n main()",
"def main():\n K,T = map(int,input().split())\n A = list(map(int,input().split()))\n ans = 0\n for i in range(T):\n ans = max(ans,2*A[i]-1-K)\n print(ans)",
"main",
"K,T = map(int,input().split())",
"K",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"T",
"A = list(map(int,input().split()))",
"A",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"ans = 0",
"ans",
"0",
"for i in range(T):\n ans = max(ans,2*A[i]-1-K)\n ",
"i",
"range(T)",
"range",
"T",
"ans = max(ans,2*A[i]-1-K)",
"ans",
"max(ans,2*A[i]-1-K)",
"max",
"ans",
"2*A[i]-1-K",
"2*A[i]-1",
"2*A[i]",
"2",
"A[i]",
"A",
"i",
"1",
"K",
"print(ans)",
"print",
"ans",
"if __name__ == \"__main__\":\n main()",
"__name__ == \"__main__\"",
"__name__",
"\"__main__\"",
"main()",
"main",
"def main():\n K,T = map(int,input().split())\n A = list(map(int,input().split()))\n ans = 0\n for i in range(T):\n ans = max(ans,2*A[i]-1-K)\n print(ans)",
"def main():\n K,T = map(int,input().split())\n A = list(map(int,input().split()))\n ans = 0\n for i in range(T):\n ans = max(ans,2*A[i]-1-K)\n print(ans)",
"main"
] |
def main():
K,T = map(int,input().split())
A = list(map(int,input().split()))
ans = 0
for i in range(T):
ans = max(ans,2*A[i]-1-K)
print(ans)
if __name__ == "__main__":
main()
|
[
7,
15,
13,
15,
13,
0,
13,
4,
13,
13,
4,
18,
4,
18,
4,
18,
18,
13,
13,
13,
13,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
18,
4,
18,
18,
13,
13,
13,
13,
13,
4,
18,
13,
13,
0,
13,
17,
0,
13,
2,
18,
13,
17,
17,
28,
13,
18,
13,
39,
17,
0,
13,
4,
13,
17,
2,
13,
13,
4,
13,
13,
10,
4,
13,
10,
4,
13,
10,
4,
13,
10,
4,
13,
10,
2,
13
] |
[
[
80,
6
],
[
80,
22
],
[
77,
24
],
[
78,
44
],
[
48,
47
],
[
86,
50
],
[
78,
53
],
[
58,
57
],
[
78,
59
],
[
83,
63
],
[
87,
68
],
[
84,
68
],
[
57,
69
],
[
84,
72
],
[
87,
72
],
[
80,
75
],
[
77,
78
],
[
80,
81
],
[
83,
84
],
[
86,
87
]
] |
[
"import sys\nimport numpy as np\nK, T = map(int, sys.stdin.readline().rstrip().split())\nA = list(map(int, sys.stdin.readline().rstrip().split()))\nA.sort(reverse=True)\nans = A[0] - 1\nfor a in A[1:]:\n ans = max(0, ans - a)\nprint(ans)",
"import sys",
"sys",
"import numpy as np",
"numpy",
"K, T = map(int, sys.stdin.readline().rstrip().split())",
"K",
"map(int, sys.stdin.readline().rstrip().split())",
"map",
"int",
"sys.stdin.readline().rstrip().split()",
"sys.stdin.readline().rstrip().split",
"sys.stdin.readline().rstrip()",
"sys.stdin.readline().rstrip",
"sys.stdin.readline()",
"sys.stdin.readline",
"sys.stdin",
"sys",
"stdin",
"readline",
"rstrip",
"split",
"T",
"A = list(map(int, sys.stdin.readline().rstrip().split()))",
"A",
"list(map(int, sys.stdin.readline().rstrip().split()))",
"list",
"map(int, sys.stdin.readline().rstrip().split())",
"map",
"int",
"sys.stdin.readline().rstrip().split()",
"sys.stdin.readline().rstrip().split",
"sys.stdin.readline().rstrip()",
"sys.stdin.readline().rstrip",
"sys.stdin.readline()",
"sys.stdin.readline",
"sys.stdin",
"sys",
"stdin",
"readline",
"rstrip",
"split",
"A.sort(reverse=True)",
"A.sort",
"A",
"sort",
"reverse=True",
"reverse",
"True",
"ans = A[0] - 1",
"ans",
"A[0] - 1",
"A[0]",
"A",
"0",
"1",
"for a in A[1:]:\n ans = max(0, ans - a)",
"a",
"A[1:]",
"A",
"1:",
"1",
"ans = max(0, ans - a)",
"ans",
"max(0, ans - a)",
"max",
"0",
"ans - a",
"ans",
"a",
"print(ans)",
"print",
"ans",
"K, T = map(int, sys.stdin.readline().rstrip().split())",
"map(int, sys.stdin.readline().rstrip().split())",
"K",
"A = list(map(int, sys.stdin.readline().rstrip().split()))",
"list(map(int, sys.stdin.readline().rstrip().split()))",
"A",
"T = map(int, sys.stdin.readline().rstrip().split())",
"map(int, sys.stdin.readline().rstrip().split())",
"T",
"ans = max(0, ans - a)",
"max(0, ans - a)",
"ans",
"ans = A[0] - 1",
"A[0] - 1",
"ans"
] |
import sys
import numpy as np
K, T = map(int, sys.stdin.readline().rstrip().split())
A = list(map(int, sys.stdin.readline().rstrip().split()))
A.sort(reverse=True)
ans = A[0] - 1
for a in A[1:]:
ans = max(0, ans - a)
print(ans)
|
[
7,
15,
13,
15,
13,
15,
13,
15,
13,
15,
13,
15,
15,
15,
12,
13,
29,
18,
4,
18,
18,
13,
13,
13,
39,
17,
12,
13,
29,
2,
39,
17,
4,
13,
4,
13,
13,
23,
13,
4,
18,
13,
13,
17,
0,
13,
2,
4,
13,
17,
17,
17,
41,
28,
13,
4,
13,
17,
4,
4,
13,
2,
4,
13,
17,
13,
0,
13,
13,
0,
13,
39,
39,
17,
17,
39,
17,
17,
39,
17,
17,
39,
17,
17,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
39,
28,
13,
4,
13,
13,
4,
18,
13,
13,
39,
40,
18,
13,
13,
13,
4,
18,
13,
13,
13,
0,
13,
39,
17,
17,
42,
13,
0,
13,
4,
18,
13,
13,
13,
13,
0,
13,
17,
14,
40,
18,
13,
17,
17,
4,
18,
13,
13,
13,
13,
0,
13,
39,
13,
13,
4,
13,
40,
18,
13,
17,
10,
39,
13,
10,
12,
13,
10,
39,
13,
10,
39,
13,
10,
39,
13,
10,
4,
13,
10,
13,
13,
10,
4,
13,
10,
4,
13,
10,
17,
13,
10,
4,
13,
10,
12,
13,
10,
2,
13,
10,
4,
13
] |
[
[
38,
36
],
[
38,
38
],
[
208,
45
],
[
55,
54
],
[
54,
65
],
[
190,
67
],
[
178,
70
],
[
211,
85
],
[
176,
92
],
[
211,
94
],
[
196,
96
],
[
176,
105
],
[
181,
108
],
[
112,
111
],
[
194,
114
],
[
182,
117
],
[
197,
122
],
[
111,
123
],
[
182,
129
],
[
184,
131
],
[
202,
138
],
[
182,
143
],
[
202,
144
],
[
199,
146
],
[
185,
151
],
[
173,
151
],
[
182,
158
],
[
185,
159
],
[
173,
159
],
[
172,
161
],
[
173,
169
],
[
185,
169
],
[
172,
173
],
[
178,
179
],
[
181,
182
],
[
184,
185
],
[
202,
188
],
[
190,
191
],
[
211,
194
],
[
196,
197
],
[
199,
200
],
[
202,
203
],
[
208,
209
],
[
211,
212
]
] |
[
"import bisect\nimport copy\nimport heapq\nimport math\nimport sys\nfrom collections import *\nfrom functools import lru_cache\nfrom itertools import accumulate, combinations, permutations, product\ndef input():\n return sys.stdin.readline()[:-1]\ndef ruiseki(lst):\n return [0]+list(accumulate(lst))\nsys.setrecursionlimit(500000)\nmod=pow(10,9)+7\nal=[chr(ord('a') + i) for i in range(26)]\ndirection=[[1,0],[0,1],[-1,0],[0,-1]]\n\nk,t=map(int,input().split())\na=list(map(int,input().split()))\n\nlst=[]\nfor i in range(t):\n lst.append([-a[i],i])\nheapq.heapify(lst)\n\nmae=[0,-1]\nwhile lst:\n now,id=heapq.heappop(lst)\n now+=1\n if mae[0]!=0:\n heapq.heappush(lst,mae)\n mae=[now,id]\nprint(-mae[0])",
"import bisect",
"bisect",
"import copy",
"copy",
"import heapq",
"heapq",
"import math",
"math",
"import sys",
"sys",
"from collections import *",
"from functools import lru_cache",
"from itertools import accumulate, combinations, permutations, product",
"def input():\n return sys.stdin.readline()[:-1]",
"input",
"return sys.stdin.readline()[:-1]",
"sys.stdin.readline()[:-1]",
"sys.stdin.readline()",
"sys.stdin.readline",
"sys.stdin",
"sys",
"stdin",
"readline",
":-1",
"-1",
"def ruiseki(lst):\n return [0]+list(accumulate(lst))",
"ruiseki",
"return [0]+list(accumulate(lst))",
"[0]+list(accumulate(lst))",
"[0]",
"0",
"list(accumulate(lst))",
"list",
"accumulate(lst)",
"accumulate",
"lst",
"lst",
"lst",
"sys.setrecursionlimit(500000)",
"sys.setrecursionlimit",
"sys",
"setrecursionlimit",
"500000",
"mod=pow(10,9)+7",
"mod",
"pow(10,9)+7",
"pow(10,9)",
"pow",
"10",
"9",
"7",
"chr(ord('a') + i) for i in range(26)",
"for i in range(26)",
"i",
"range(26)",
"range",
"26",
"for i in range(26)",
"chr(ord('a') + i)",
"chr",
"ord('a') + i",
"ord('a')",
"ord",
"'a'",
"i",
"al=[chr(ord('a') + i) for i in range(26)]",
"al",
"[chr(ord('a') + i) for i in range(26)]",
"direction=[[1,0],[0,1],[-1,0],[0,-1]]",
"direction",
"[[1,0],[0,1],[-1,0],[0,-1]]",
"[1,0]",
"1",
"0",
"[0,1]",
"0",
"1",
"[-1,0]",
"-1",
"0",
"[0,-1]",
"0",
"-1",
"k,t=map(int,input().split())",
"k",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"t",
"a=list(map(int,input().split()))",
"a",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"lst=[]",
"lst",
"[]",
"for i in range(t):\n lst.append([-a[i],i])",
"i",
"range(t)",
"range",
"t",
"lst.append([-a[i],i])",
"lst.append",
"lst",
"append",
"[-a[i],i]",
"-a[i]",
"a[i]",
"a",
"i",
"i",
"heapq.heapify(lst)",
"heapq.heapify",
"heapq",
"heapify",
"lst",
"mae=[0,-1]",
"mae",
"[0,-1]",
"0",
"-1",
"while lst:\n now,id=heapq.heappop(lst)\n now+=1\n if mae[0]!=0:\n heapq.heappush(lst,mae)\n mae=[now,id]",
"lst",
"now,id=heapq.heappop(lst)",
"now",
"heapq.heappop(lst)",
"heapq.heappop",
"heapq",
"heappop",
"lst",
"id",
"now+=1",
"now",
"1",
"if mae[0]!=0:\n heapq.heappush(lst,mae)\n ",
"mae[0]!=0",
"mae[0]",
"mae",
"0",
"0",
"heapq.heappush(lst,mae)",
"heapq.heappush",
"heapq",
"heappush",
"lst",
"mae",
"mae=[now,id]",
"mae",
"[now,id]",
"now",
"id",
"print(-mae[0])",
"print",
"-mae[0]",
"mae[0]",
"mae",
"0",
"mae=[now,id]",
"[now,id]",
"mae",
"def input():\n return sys.stdin.readline()[:-1]",
"def input():\n return sys.stdin.readline()[:-1]",
"input",
"direction=[[1,0],[0,1],[-1,0],[0,-1]]",
"[[1,0],[0,1],[-1,0],[0,-1]]",
"direction",
"lst=[]",
"[]",
"lst",
"mae=[0,-1]",
"[0,-1]",
"mae",
"now,id=heapq.heappop(lst)",
"heapq.heappop(lst)",
"now",
"al=[chr(ord('a') + i) for i in range(26)]",
"[chr(ord('a') + i) for i in range(26)]",
"al",
"t=map(int,input().split())",
"map(int,input().split())",
"t",
"a=list(map(int,input().split()))",
"list(map(int,input().split()))",
"a",
"now+=1",
"1",
"now",
"id=heapq.heappop(lst)",
"heapq.heappop(lst)",
"id",
"def ruiseki(lst):\n return [0]+list(accumulate(lst))",
"def ruiseki(lst):\n return [0]+list(accumulate(lst))",
"ruiseki",
"mod=pow(10,9)+7",
"pow(10,9)+7",
"mod",
"k,t=map(int,input().split())",
"map(int,input().split())",
"k"
] |
import bisect
import copy
import heapq
import math
import sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
return sys.stdin.readline()[:-1]
def ruiseki(lst):
return [0]+list(accumulate(lst))
sys.setrecursionlimit(500000)
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]
direction=[[1,0],[0,1],[-1,0],[0,-1]]
k,t=map(int,input().split())
a=list(map(int,input().split()))
lst=[]
for i in range(t):
lst.append([-a[i],i])
heapq.heapify(lst)
mae=[0,-1]
while lst:
now,id=heapq.heappop(lst)
now+=1
if mae[0]!=0:
heapq.heappush(lst,mae)
mae=[now,id]
print(-mae[0])
|
[
7,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
0,
13,
13,
4,
18,
13,
13,
0,
13,
17,
0,
13,
17,
0,
13,
4,
13,
13,
0,
13,
4,
13,
17,
28,
13,
4,
13,
13,
0,
13,
18,
13,
13,
0,
13,
2,
13,
13,
0,
13,
4,
13,
13,
2,
4,
13,
2,
13,
13,
17,
14,
40,
13,
17,
4,
13,
17,
4,
13,
13,
10,
2,
13,
10,
17,
13,
10,
4,
13,
10,
17,
13,
10,
4,
13,
10,
18,
13,
10,
4,
13,
10,
4,
13,
10,
4,
13,
10,
13,
13
] |
[
[
109,
2
],
[
109,
11
],
[
15,
14
],
[
14,
23
],
[
112,
25
],
[
113,
29
],
[
88,
32
],
[
94,
35
],
[
97,
38
],
[
113,
41
],
[
106,
43
],
[
49,
48
],
[
104,
51
],
[
100,
53
],
[
113,
55
],
[
48,
56
],
[
85,
58
],
[
98,
60
],
[
101,
61
],
[
89,
61
],
[
91,
63
],
[
107,
66
],
[
92,
66
],
[
101,
71
],
[
89,
71
],
[
86,
72
],
[
95,
72
],
[
92,
76
],
[
107,
76
],
[
92,
83
],
[
107,
83
],
[
85,
86
],
[
88,
89
],
[
91,
92
],
[
94,
95
],
[
97,
98
],
[
100,
101
],
[
109,
104
],
[
106,
107
],
[
109,
110
],
[
112,
113
]
] |
[
"k,t=map(int,input().split())\na=[int(x) for x in input().split()]\na.sort()\nnow1=0\nnow2=0\nal=sum(a)\nans=float('inf')\nfor i in range(t):\n now1+=a[i]\n now2=al-now1\n ans=min(ans,abs(now1-now2)-1)\n\nif ans<=0:\n print(0)\nelse:\n print(ans)",
"k,t=map(int,input().split())",
"k",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"t",
"int(x) for x in input().split()",
"for x in input().split()",
"x",
"input().split()",
"().split",
"()",
"input",
"split",
"for x in input().split()",
"int(x)",
"int",
"x",
"a=[int(x) for x in input().split()]",
"a",
"[int(x) for x in input().split()]",
"a.sort()",
"a.sort",
"a",
"sort",
"now1=0",
"now1",
"0",
"now2=0",
"now2",
"0",
"al=sum(a)",
"al",
"sum(a)",
"sum",
"a",
"ans=float('inf')",
"ans",
"float('inf')",
"float",
"'inf'",
"for i in range(t):\n now1+=a[i]\n now2=al-now1\n ans=min(ans,abs(now1-now2)-1)",
"i",
"range(t)",
"range",
"t",
"now1+=a[i]",
"now1",
"a[i]",
"a",
"i",
"now2=al-now1",
"now2",
"al-now1",
"al",
"now1",
"ans=min(ans,abs(now1-now2)-1)",
"ans",
"min(ans,abs(now1-now2)-1)",
"min",
"ans",
"abs(now1-now2)-1",
"abs(now1-now2)",
"abs",
"now1-now2",
"now1",
"now2",
"1",
"if ans<=0:\n print(0)\nelse:\n print(ans)",
"ans<=0",
"ans",
"0",
"print(0)",
"print",
"0",
"print(ans)",
"print",
"ans",
"now2=al-now1",
"al-now1",
"now2",
"now1=0",
"0",
"now1",
"ans=min(ans,abs(now1-now2)-1)",
"min(ans,abs(now1-now2)-1)",
"ans",
"now2=0",
"0",
"now2",
"al=sum(a)",
"sum(a)",
"al",
"now1+=a[i]",
"a[i]",
"now1",
"t=map(int,input().split())",
"map(int,input().split())",
"t",
"ans=float('inf')",
"float('inf')",
"ans",
"k,t=map(int,input().split())",
"map(int,input().split())",
"k",
"a=[int(x) for x in input().split()]",
"[int(x) for x in input().split()]",
"a"
] |
k,t=map(int,input().split())
a=[int(x) for x in input().split()]
a.sort()
now1=0
now2=0
al=sum(a)
ans=float('inf')
for i in range(t):
now1+=a[i]
now2=al-now1
ans=min(ans,abs(now1-now2)-1)
if ans<=0:
print(0)
else:
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
17,
28,
13,
4,
13,
13,
14,
2,
2,
18,
13,
13,
18,
13,
2,
13,
17,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
13,
17,
14,
2,
13,
17,
4,
13,
17,
0,
13,
4,
13,
17,
2,
13,
17,
0,
13,
2,
2,
17,
17,
17,
0,
13,
4,
13,
18,
13,
2,
13,
17,
13,
13,
15,
0,
13,
4,
13,
13,
28,
13,
4,
18,
13,
13,
14,
40,
13,
18,
13,
2,
13,
17,
0,
13,
4,
13,
13,
2,
18,
13,
13,
17,
13,
0,
13,
13,
0,
13,
4,
13,
13,
28,
13,
4,
18,
13,
13,
14,
40,
13,
18,
13,
2,
13,
17,
0,
13,
4,
13,
13,
2,
18,
13,
13,
17,
13,
0,
13,
13,
4,
13,
13,
10,
4,
13,
10,
4,
13,
10,
4,
13,
10,
4,
13,
10,
17,
13,
10,
4,
13,
10,
13,
13,
10,
13,
13,
10,
4,
13,
10,
4,
13,
10,
4,
13,
10,
4,
13,
10,
2,
13,
10,
17,
13
] |
[
[
196,
2
],
[
175,
8
],
[
166,
20
],
[
178,
32
],
[
36,
35
],
[
197,
38
],
[
167,
43
],
[
35,
44
],
[
176,
46
],
[
197,
48
],
[
176,
52
],
[
35,
53
],
[
176,
55
],
[
197,
57
],
[
205,
60
],
[
206,
64
],
[
179,
64
],
[
181,
70
],
[
206,
75
],
[
179,
75
],
[
202,
78
],
[
190,
85
],
[
176,
89
],
[
197,
91
],
[
182,
93
],
[
206,
93
],
[
179,
93
],
[
203,
94
],
[
169,
97
],
[
176,
100
],
[
103,
102
],
[
170,
105
],
[
102,
109
],
[
176,
111
],
[
197,
113
],
[
199,
116
],
[
102,
119
],
[
170,
122
],
[
102,
123
],
[
203,
125
],
[
184,
127
],
[
203,
128
],
[
172,
130
],
[
167,
133
],
[
136,
135
],
[
173,
138
],
[
135,
142
],
[
176,
144
],
[
197,
146
],
[
193,
149
],
[
135,
152
],
[
173,
155
],
[
135,
156
],
[
203,
158
],
[
187,
160
],
[
203,
161
],
[
188,
164
],
[
194,
164
],
[
185,
164
],
[
200,
164
],
[
191,
164
],
[
166,
167
],
[
169,
170
],
[
172,
173
],
[
175,
176
],
[
178,
179
],
[
181,
182
],
[
203,
184
],
[
184,
185
],
[
203,
187
],
[
187,
188
],
[
190,
191
],
[
193,
194
],
[
196,
197
],
[
199,
200
],
[
202,
203
],
[
205,
206
]
] |
[
"N=int(input())\n\nT = list(map(int,input().split()))\nA = list(map(int,input().split()))\n\ncount=0\nfor i in range(N):\n if A[i]==T[N-1] and T[i]==T[N-1]:\n count+=1\n\n\nif count==0:\n print(0)\nelse:\n count=max(0,count-2)\n\n mod = 10**9+7\n d = pow(T[N-1],count,mod)\n\n from collections import Counter\n\n tc=Counter(T)\n\n for key in tc.keys():\n if key!=T[N-1]:\n d*=pow(key,tc[key]-1,mod)\n d%=mod\n\n ac=Counter(A)\n\n for key in ac.keys():\n if key!=T[N-1]:\n d*=pow(key,ac[key]-1,mod)\n d%=mod\n\n print(d)",
"N=int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"T = list(map(int,input().split()))",
"T",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"A = list(map(int,input().split()))",
"A",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"count=0",
"count",
"0",
"for i in range(N):\n if A[i]==T[N-1] and T[i]==T[N-1]:\n count+=1",
"i",
"range(N)",
"range",
"N",
"if A[i]==T[N-1] and T[i]==T[N-1]:\n count+=1",
"A[i]==T[N-1] and T[i]==T[N-1]",
"A[i]==T[N-1]",
"A[i]",
"A",
"i",
"T[N-1]",
"T",
"N-1",
"N",
"1",
"T[i]==T[N-1]",
"T[i]",
"T",
"i",
"T[N-1]",
"T",
"N-1",
"N",
"1",
"count+=1",
"count",
"1",
"if count==0:\n print(0)\nelse:\n count=max(0,count-2)\n\n mod = 10**9+7\n d = pow(T[N-1],count,mod)\n\n from collections import Counter\n\n tc=Counter(T)\n\n for key in tc.keys():\n if key!=T[N-1]:\n d*=pow(key,tc[key]-1,mod)\n d%=mod\n\n ac=Counter(A)\n\n for key in ac.keys():\n if key!=T[N-1]:\n d*=pow(key,ac[key]-1,mod)\n d%=mod\n\n print(d)",
"count==0",
"count",
"0",
"print(0)",
"print",
"0",
"count=max(0,count-2)",
"count",
"max(0,count-2)",
"max",
"0",
"count-2",
"count",
"2",
"mod = 10**9+7",
"mod",
"10**9+7",
"10**9",
"10",
"9",
"7",
"d = pow(T[N-1],count,mod)",
"d",
"pow(T[N-1],count,mod)",
"pow",
"T[N-1]",
"T",
"N-1",
"N",
"1",
"count",
"mod",
"from collections import Counter",
"tc=Counter(T)",
"tc",
"Counter(T)",
"Counter",
"T",
"for key in tc.keys():\n if key!=T[N-1]:\n d*=pow(key,tc[key]-1,mod)\n d%=mod\n\n ",
"key",
"tc.keys()",
"tc.keys",
"tc",
"keys",
"if key!=T[N-1]:\n d*=pow(key,tc[key]-1,mod)\n d%=mod\n\n ",
"key!=T[N-1]",
"key",
"T[N-1]",
"T",
"N-1",
"N",
"1",
"d*=pow(key,tc[key]-1,mod)",
"d",
"pow(key,tc[key]-1,mod)",
"pow",
"key",
"tc[key]-1",
"tc[key]",
"tc",
"key",
"1",
"mod",
"d%=mod",
"d",
"mod",
"ac=Counter(A)",
"ac",
"Counter(A)",
"Counter",
"A",
"for key in ac.keys():\n if key!=T[N-1]:\n d*=pow(key,ac[key]-1,mod)\n d%=mod\n\n ",
"key",
"ac.keys()",
"ac.keys",
"ac",
"keys",
"if key!=T[N-1]:\n d*=pow(key,ac[key]-1,mod)\n d%=mod\n\n ",
"key!=T[N-1]",
"key",
"T[N-1]",
"T",
"N-1",
"N",
"1",
"d*=pow(key,ac[key]-1,mod)",
"d",
"pow(key,ac[key]-1,mod)",
"pow",
"key",
"ac[key]-1",
"ac[key]",
"ac",
"key",
"1",
"mod",
"d%=mod",
"d",
"mod",
"print(d)",
"print",
"d",
"A = list(map(int,input().split()))",
"list(map(int,input().split()))",
"A",
"tc=Counter(T)",
"Counter(T)",
"tc",
"ac=Counter(A)",
"Counter(A)",
"ac",
"T = list(map(int,input().split()))",
"list(map(int,input().split()))",
"T",
"count=0",
"0",
"count",
"count=max(0,count-2)",
"max(0,count-2)",
"count",
"d%=mod",
"mod",
"d",
"d%=mod",
"mod",
"d",
"d = pow(T[N-1],count,mod)",
"pow(T[N-1],count,mod)",
"d",
"d*=pow(key,ac[key]-1,mod)",
"pow(key,ac[key]-1,mod)",
"d",
"N=int(input())",
"int(input())",
"N",
"d*=pow(key,tc[key]-1,mod)",
"pow(key,tc[key]-1,mod)",
"d",
"mod = 10**9+7",
"10**9+7",
"mod",
"count+=1",
"1",
"count"
] |
N=int(input())
T = list(map(int,input().split()))
A = list(map(int,input().split()))
count=0
for i in range(N):
if A[i]==T[N-1] and T[i]==T[N-1]:
count+=1
if count==0:
print(0)
else:
count=max(0,count-2)
mod = 10**9+7
d = pow(T[N-1],count,mod)
from collections import Counter
tc=Counter(T)
for key in tc.keys():
if key!=T[N-1]:
d*=pow(key,tc[key]-1,mod)
d%=mod
ac=Counter(A)
for key in ac.keys():
if key!=T[N-1]:
d*=pow(key,ac[key]-1,mod)
d%=mod
print(d)
|
[
7,
0,
13,
2,
2,
17,
17,
17,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
39,
0,
13,
39,
4,
18,
13,
13,
39,
17,
18,
13,
17,
18,
13,
17,
4,
18,
13,
13,
39,
2,
13,
17,
18,
13,
17,
18,
13,
17,
14,
2,
13,
17,
28,
13,
4,
13,
17,
13,
4,
18,
13,
13,
39,
13,
18,
13,
13,
8,
2,
18,
13,
13,
18,
13,
2,
13,
17,
18,
13,
13,
17,
28,
13,
4,
13,
2,
13,
17,
17,
17,
4,
18,
13,
13,
39,
13,
18,
13,
13,
8,
2,
18,
13,
13,
18,
13,
2,
13,
17,
18,
13,
13,
17,
4,
18,
13,
13,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
2,
2,
4,
13,
18,
18,
13,
13,
17,
18,
18,
13,
13,
17,
4,
13,
18,
18,
13,
13,
17,
18,
18,
13,
13,
17,
17,
0,
13,
8,
40,
13,
17,
13,
17,
0,
13,
13,
4,
13,
13,
10,
4,
13,
10,
8,
13,
10,
4,
13,
10,
17,
13,
10,
13,
13,
10,
2,
13,
10,
4,
13,
10,
2,
13,
10,
39,
13,
10,
39,
13
] |
[
[
206,
2
],
[
191,
9
],
[
209,
15
],
[
197,
27
],
[
218,
39
],
[
215,
42
],
[
219,
46
],
[
210,
51
],
[
210,
54
],
[
216,
58
],
[
192,
62
],
[
198,
65
],
[
198,
68
],
[
192,
72
],
[
76,
75
],
[
192,
79
],
[
219,
82
],
[
210,
87
],
[
75,
88
],
[
210,
92
],
[
75,
93
],
[
210,
95
],
[
75,
97
],
[
210,
100
],
[
75,
101
],
[
105,
104
],
[
192,
108
],
[
216,
114
],
[
198,
119
],
[
104,
120
],
[
198,
124
],
[
104,
125
],
[
198,
127
],
[
104,
129
],
[
198,
132
],
[
104,
133
],
[
216,
137
],
[
200,
140
],
[
144,
143
],
[
192,
146
],
[
212,
148
],
[
219,
155
],
[
143,
156
],
[
216,
160
],
[
143,
161
],
[
219,
167
],
[
143,
168
],
[
216,
172
],
[
143,
173
],
[
194,
177
],
[
213,
180
],
[
213,
182
],
[
203,
185
],
[
207,
186
],
[
204,
189
],
[
195,
189
],
[
201,
189
],
[
191,
192
],
[
194,
195
],
[
197,
198
],
[
200,
201
],
[
207,
203
],
[
203,
204
],
[
206,
207
],
[
209,
210
],
[
212,
213
],
[
215,
216
],
[
218,
219
]
] |
[
"mod=10**9+7\n\nN=int(input())\nT=list(map(int,input().split()))\nA=list(map(int,input().split()))\n\nB=[]\nC=[]\nB.append([0,T[0],T[0]])\nC.append([N-1,A[-1],A[-1]])\n\nif N>1:\n for i in range(1,N):\n B.append([i,T[i],T[i] if T[i]>T[i-1] else 1])\n for i in range(N-2,-1,-1):\n C.append([i,A[i],A[i] if A[i]>A[i+1] else 1])\nC.sort()\n#print(B)\n#print(C)\n\nans=1\nfor i in range(N):\n d=min(B[i][1],C[i][1])-max(B[i][2],C[i][2])+1\n ans*=d if d>=0 else 0\n ans%=mod\nprint(ans)",
"mod=10**9+7",
"mod",
"10**9+7",
"10**9",
"10",
"9",
"7",
"N=int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"T=list(map(int,input().split()))",
"T",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"A=list(map(int,input().split()))",
"A",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"B=[]",
"B",
"[]",
"C=[]",
"C",
"[]",
"B.append([0,T[0],T[0]])",
"B.append",
"B",
"append",
"[0,T[0],T[0]]",
"0",
"T[0]",
"T",
"0",
"T[0]",
"T",
"0",
"C.append([N-1,A[-1],A[-1]])",
"C.append",
"C",
"append",
"[N-1,A[-1],A[-1]]",
"N-1",
"N",
"1",
"A[-1]",
"A",
"-1",
"A[-1]",
"A",
"-1",
"if N>1:\n for i in range(1,N):\n B.append([i,T[i],T[i] if T[i]>T[i-1] else 1])\n for i in range(N-2,-1,-1):\n C.append([i,A[i],A[i] if A[i]>A[i+1] else 1])",
"N>1",
"N",
"1",
"for i in range(1,N):\n B.append([i,T[i],T[i] if T[i]>T[i-1] else 1])\n ",
"i",
"range(1,N)",
"range",
"1",
"N",
"B.append([i,T[i],T[i] if T[i]>T[i-1] else 1])",
"B.append",
"B",
"append",
"[i,T[i],T[i] if T[i]>T[i-1] else 1]",
"i",
"T[i]",
"T",
"i",
"T[i] if T[i]>T[i-1] else 1",
"T[i]>T[i-1]",
"T[i]",
"T",
"i",
"T[i-1]",
"T",
"i-1",
"i",
"1",
"T[i]",
"T",
"i",
"1",
"for i in range(N-2,-1,-1):\n C.append([i,A[i],A[i] if A[i]>A[i+1] else 1])",
"i",
"range(N-2,-1,-1)",
"range",
"N-2",
"N",
"2",
"-1",
"-1",
"C.append([i,A[i],A[i] if A[i]>A[i+1] else 1])",
"C.append",
"C",
"append",
"[i,A[i],A[i] if A[i]>A[i+1] else 1]",
"i",
"A[i]",
"A",
"i",
"A[i] if A[i]>A[i+1] else 1",
"A[i]>A[i+1]",
"A[i]",
"A",
"i",
"A[i+1]",
"A",
"i+1",
"i",
"1",
"A[i]",
"A",
"i",
"1",
"C.sort()",
"C.sort",
"C",
"sort",
"ans=1",
"ans",
"1",
"for i in range(N):\n d=min(B[i][1],C[i][1])-max(B[i][2],C[i][2])+1\n ans*=d if d>=0 else 0\n ans%=mod",
"i",
"range(N)",
"range",
"N",
"d=min(B[i][1],C[i][1])-max(B[i][2],C[i][2])+1",
"d",
"min(B[i][1],C[i][1])-max(B[i][2],C[i][2])+1",
"min(B[i][1],C[i][1])-max(B[i][2],C[i][2])",
"min(B[i][1],C[i][1])",
"min",
"B[i][1]",
"[i]",
"B",
"i",
"1",
"C[i][1]",
"[i]",
"C",
"i",
"1",
"max(B[i][2],C[i][2])",
"max",
"B[i][2]",
"[i]",
"B",
"i",
"2",
"C[i][2]",
"[i]",
"C",
"i",
"2",
"1",
"ans*=d if d>=0 else 0",
"ans",
"d if d>=0 else 0",
"d>=0",
"d",
"0",
"d",
"0",
"ans%=mod",
"ans",
"mod",
"print(ans)",
"print",
"ans",
"N=int(input())",
"int(input())",
"N",
"ans*=d if d>=0 else 0",
"d if d>=0 else 0",
"ans",
"A=list(map(int,input().split()))",
"list(map(int,input().split()))",
"A",
"ans=1",
"1",
"ans",
"ans%=mod",
"mod",
"ans",
"mod=10**9+7",
"10**9+7",
"mod",
"T=list(map(int,input().split()))",
"list(map(int,input().split()))",
"T",
"d=min(B[i][1],C[i][1])-max(B[i][2],C[i][2])+1",
"min(B[i][1],C[i][1])-max(B[i][2],C[i][2])+1",
"d",
"C=[]",
"[]",
"C",
"B=[]",
"[]",
"B"
] |
mod=10**9+7
N=int(input())
T=list(map(int,input().split()))
A=list(map(int,input().split()))
B=[]
C=[]
B.append([0,T[0],T[0]])
C.append([N-1,A[-1],A[-1]])
if N>1:
for i in range(1,N):
B.append([i,T[i],T[i] if T[i]>T[i-1] else 1])
for i in range(N-2,-1,-1):
C.append([i,A[i],A[i] if A[i]>A[i+1] else 1])
C.sort()
#print(B)
#print(C)
ans=1
for i in range(N):
d=min(B[i][1],C[i][1])-max(B[i][2],C[i][2])+1
ans*=d if d>=0 else 0
ans%=mod
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
2,
2,
17,
17,
17,
0,
13,
2,
39,
17,
13,
0,
13,
2,
39,
17,
13,
0,
18,
13,
17,
39,
17,
18,
13,
17,
0,
18,
13,
2,
13,
17,
39,
17,
18,
13,
2,
13,
17,
28,
13,
4,
13,
17,
13,
14,
2,
18,
13,
13,
18,
18,
13,
2,
13,
17,
17,
0,
18,
13,
13,
39,
17,
18,
13,
13,
0,
18,
13,
13,
39,
17,
18,
13,
13,
14,
2,
18,
13,
2,
2,
13,
13,
17,
18,
18,
13,
2,
13,
13,
17,
0,
18,
13,
2,
2,
13,
13,
17,
39,
17,
18,
13,
2,
2,
13,
13,
17,
0,
18,
13,
2,
2,
13,
13,
17,
39,
17,
18,
13,
2,
2,
13,
13,
17,
14,
40,
18,
13,
17,
18,
13,
17,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
17,
13,
0,
13,
18,
13,
13,
13,
0,
13,
18,
13,
13,
13,
14,
2,
2,
13,
13,
17,
0,
13,
2,
2,
13,
4,
13,
13,
13,
13,
14,
2,
2,
2,
13,
17,
2,
13,
17,
2,
13,
13,
0,
13,
17,
14,
2,
2,
2,
13,
17,
2,
13,
17,
2,
13,
13,
0,
13,
17,
14,
2,
2,
2,
13,
17,
2,
13,
17,
40,
13,
13,
0,
13,
17,
4,
13,
13,
10,
2,
13,
10,
17,
13,
10,
4,
13,
10,
2,
13,
10,
17,
13,
10,
18,
13,
10,
18,
13,
10,
2,
13,
10,
4,
13,
10,
2,
13,
10,
17,
13,
10,
17,
13,
10,
18,
13,
10,
17,
13,
10,
4,
13,
10,
18,
13
] |
[
[
297,
2
],
[
261,
8
],
[
279,
20
],
[
282,
32
],
[
264,
39
],
[
298,
43
],
[
255,
45
],
[
298,
49
],
[
54,
51
],
[
265,
52
],
[
262,
57
],
[
65,
60
],
[
256,
61
],
[
298,
63
],
[
280,
68
],
[
298,
70
],
[
74,
73
],
[
298,
77
],
[
262,
81
],
[
73,
82
],
[
265,
85
],
[
73,
87
],
[
94,
91
],
[
265,
92
],
[
73,
93
],
[
262,
97
],
[
73,
98
],
[
103,
100
],
[
265,
101
],
[
73,
102
],
[
262,
106
],
[
73,
107
],
[
280,
111
],
[
298,
114
],
[
73,
115
],
[
256,
119
],
[
298,
121
],
[
73,
122
],
[
132,
125
],
[
256,
126
],
[
298,
129
],
[
73,
130
],
[
280,
135
],
[
298,
138
],
[
73,
139
],
[
149,
142
],
[
256,
143
],
[
298,
146
],
[
73,
147
],
[
280,
152
],
[
298,
155
],
[
73,
156
],
[
265,
161
],
[
256,
164
],
[
267,
167
],
[
285,
170
],
[
174,
173
],
[
298,
177
],
[
273,
179
],
[
100,
180
],
[
91,
180
],
[
265,
181
],
[
173,
182
],
[
273,
183
],
[
300,
185
],
[
256,
187
],
[
173,
188
],
[
300,
189
],
[
271,
193
],
[
292,
194
],
[
276,
197
],
[
286,
200
],
[
268,
200
],
[
289,
200
],
[
295,
200
],
[
259,
200
],
[
277,
200
],
[
274,
203
],
[
301,
204
],
[
283,
205
],
[
271,
210
],
[
292,
213
],
[
274,
216
],
[
301,
217
],
[
258,
219
],
[
271,
225
],
[
292,
228
],
[
274,
231
],
[
301,
232
],
[
294,
234
],
[
271,
240
],
[
292,
243
],
[
274,
246
],
[
301,
247
],
[
288,
249
],
[
289,
253
],
[
295,
253
],
[
259,
253
],
[
277,
253
],
[
286,
253
],
[
268,
253
],
[
255,
256
],
[
258,
259
],
[
261,
262
],
[
264,
265
],
[
267,
268
],
[
100,
270
],
[
91,
270
],
[
273,
271
],
[
100,
273
],
[
91,
273
],
[
273,
274
],
[
276,
277
],
[
279,
280
],
[
282,
283
],
[
285,
286
],
[
288,
289
],
[
300,
292
],
[
294,
295
],
[
297,
298
],
[
300,
301
]
] |
[
"N=int(input())\nT=list(map(int,input().split()))\nA=list(map(int,input().split()))\nmod=10**9+7\nTres=[0]*N\nAres=[0]*N\nTres[0]=(0,T[0])\nAres[N-1]=(0,A[N-1])\nfor i in range(1,N):\n if T[i]>Tres[i-1][1]:\n Tres[i]=(0,T[i])\n else:\n Tres[i]=(1,T[i])\n if A[N-i-1]>Ares[N-i][1]:\n Ares[N-i-1]=(0,A[N-i-1])\n else:\n Ares[N-i-1]=(1,A[N-i-1])\nif Tres[0]<=Ares[0]:\n ans=1\nelse:\n ans=0\nfor i in range(1,N):\n x,t=Tres[i]\n y,a=Ares[i]\n if x==y==1:\n ans=ans*min(t,a)%mod\n elif x==1 and y==0 and t<a:\n ans=0\n elif x==0 and y==1 and t>a:\n ans=0\n elif x==0 and y==0 and t!=a:\n ans=0\nprint(ans)",
"N=int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"T=list(map(int,input().split()))",
"T",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"A=list(map(int,input().split()))",
"A",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"mod=10**9+7",
"mod",
"10**9+7",
"10**9",
"10",
"9",
"7",
"Tres=[0]*N",
"Tres",
"[0]*N",
"[0]",
"0",
"N",
"Ares=[0]*N",
"Ares",
"[0]*N",
"[0]",
"0",
"N",
"Tres[0]=(0,T[0])",
"Tres[0]",
"Tres",
"0",
"(0,T[0])",
"0",
"T[0]",
"T",
"0",
"Ares[N-1]=(0,A[N-1])",
"Ares[N-1]",
"Ares",
"N-1",
"N",
"1",
"(0,A[N-1])",
"0",
"A[N-1]",
"A",
"N-1",
"N",
"1",
"for i in range(1,N):\n if T[i]>Tres[i-1][1]:\n Tres[i]=(0,T[i])\n else:\n Tres[i]=(1,T[i])\n if A[N-i-1]>Ares[N-i][1]:\n Ares[N-i-1]=(0,A[N-i-1])\n else:\n Ares[N-i-1]=(1,A[N-i-1])",
"i",
"range(1,N)",
"range",
"1",
"N",
"if T[i]>Tres[i-1][1]:\n Tres[i]=(0,T[i])\n else:\n Tres[i]=(1,T[i])\n ",
"T[i]>Tres[i-1][1]",
"T[i]",
"T",
"i",
"Tres[i-1][1]",
"[i-1]",
"Tres",
"i-1",
"i",
"1",
"1",
"Tres[i]=(0,T[i])",
"Tres[i]",
"Tres",
"i",
"(0,T[i])",
"0",
"T[i]",
"T",
"i",
"Tres[i]=(1,T[i])",
"Tres[i]",
"Tres",
"i",
"(1,T[i])",
"1",
"T[i]",
"T",
"i",
"if A[N-i-1]>Ares[N-i][1]:\n Ares[N-i-1]=(0,A[N-i-1])\n else:\n Ares[N-i-1]=(1,A[N-i-1])",
"A[N-i-1]>Ares[N-i][1]",
"A[N-i-1]",
"A",
"N-i-1",
"N-i",
"N",
"i",
"1",
"Ares[N-i][1]",
"[N-i]",
"Ares",
"N-i",
"N",
"i",
"1",
"Ares[N-i-1]=(0,A[N-i-1])",
"Ares[N-i-1]",
"Ares",
"N-i-1",
"N-i",
"N",
"i",
"1",
"(0,A[N-i-1])",
"0",
"A[N-i-1]",
"A",
"N-i-1",
"N-i",
"N",
"i",
"1",
"Ares[N-i-1]=(1,A[N-i-1])",
"Ares[N-i-1]",
"Ares",
"N-i-1",
"N-i",
"N",
"i",
"1",
"(1,A[N-i-1])",
"1",
"A[N-i-1]",
"A",
"N-i-1",
"N-i",
"N",
"i",
"1",
"if Tres[0]<=Ares[0]:\n ans=1\nelse:\n ans=0",
"Tres[0]<=Ares[0]",
"Tres[0]",
"Tres",
"0",
"Ares[0]",
"Ares",
"0",
"ans=1",
"ans",
"1",
"ans=0",
"ans",
"0",
"for i in range(1,N):\n x,t=Tres[i]\n y,a=Ares[i]\n if x==y==1:\n ans=ans*min(t,a)%mod\n elif x==1 and y==0 and t<a:\n ans=0\n elif x==0 and y==1 and t>a:\n ans=0\n elif x==0 and y==0 and t!=a:\n ans=0",
"i",
"range(1,N)",
"range",
"1",
"N",
"x,t=Tres[i]",
"x",
"Tres[i]",
"Tres",
"i",
"t",
"y,a=Ares[i]",
"y",
"Ares[i]",
"Ares",
"i",
"a",
"if x==y==1:\n ans=ans*min(t,a)%mod\n elif x==1 and y==0 and t<a:\n ans=0\n elif x==0 and y==1 and t>a:\n ans=0\n elif x==0 and y==0 and t!=a:\n ans=0",
"x==y==1",
"x==y",
"x",
"y",
"1",
"ans=ans*min(t,a)%mod",
"ans",
"ans*min(t,a)%mod",
"ans*min(t,a)",
"ans",
"min(t,a)",
"min",
"t",
"a",
"mod",
"elif x==1 and y==0 and t<a:\n ans=0\n ",
"x==1 and y==0 and t<a",
"x==1 and y==0",
"x==1",
"x",
"1",
"y==0",
"y",
"0",
"t<a",
"t",
"a",
"ans=0",
"ans",
"0",
"elif x==0 and y==1 and t>a:\n ans=0\n ",
"x==0 and y==1 and t>a",
"x==0 and y==1",
"x==0",
"x",
"0",
"y==1",
"y",
"1",
"t>a",
"t",
"a",
"ans=0",
"ans",
"0",
"elif x==0 and y==0 and t!=a:\n ans=0",
"x==0 and y==0 and t!=a",
"x==0 and y==0",
"x==0",
"x",
"0",
"y==0",
"y",
"0",
"t!=a",
"t",
"a",
"ans=0",
"ans",
"0",
"print(ans)",
"print",
"ans",
"Ares=[0]*N",
"[0]*N",
"Ares",
"ans=0",
"0",
"ans",
"T=list(map(int,input().split()))",
"list(map(int,input().split()))",
"T",
"Tres=[0]*N",
"[0]*N",
"Tres",
"ans=1",
"1",
"ans",
"x,t=Tres[i]",
"Tres[i]",
"x",
"t=Tres[i]",
"Tres[i]",
"t",
"ans=ans*min(t,a)%mod",
"ans*min(t,a)%mod",
"ans",
"A=list(map(int,input().split()))",
"list(map(int,input().split()))",
"A",
"mod=10**9+7",
"10**9+7",
"mod",
"ans=0",
"0",
"ans",
"ans=0",
"0",
"ans",
"y,a=Ares[i]",
"Ares[i]",
"y",
"ans=0",
"0",
"ans",
"N=int(input())",
"int(input())",
"N",
"a=Ares[i]",
"Ares[i]",
"a"
] |
N=int(input())
T=list(map(int,input().split()))
A=list(map(int,input().split()))
mod=10**9+7
Tres=[0]*N
Ares=[0]*N
Tres[0]=(0,T[0])
Ares[N-1]=(0,A[N-1])
for i in range(1,N):
if T[i]>Tres[i-1][1]:
Tres[i]=(0,T[i])
else:
Tres[i]=(1,T[i])
if A[N-i-1]>Ares[N-i][1]:
Ares[N-i-1]=(0,A[N-i-1])
else:
Ares[N-i-1]=(1,A[N-i-1])
if Tres[0]<=Ares[0]:
ans=1
else:
ans=0
for i in range(1,N):
x,t=Tres[i]
y,a=Ares[i]
if x==y==1:
ans=ans*min(t,a)%mod
elif x==1 and y==0 and t<a:
ans=0
elif x==0 and y==1 and t>a:
ans=0
elif x==0 and y==0 and t!=a:
ans=0
print(ans)
|
[
7,
12,
13,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
2,
2,
17,
17,
17,
0,
13,
2,
39,
17,
13,
0,
13,
2,
39,
17,
13,
0,
13,
17,
28,
13,
4,
13,
13,
14,
2,
13,
18,
13,
13,
0,
13,
18,
13,
13,
0,
18,
13,
13,
17,
0,
18,
13,
13,
18,
13,
13,
0,
18,
13,
13,
18,
13,
13,
0,
18,
13,
13,
18,
13,
13,
0,
13,
17,
28,
13,
4,
13,
2,
13,
17,
17,
17,
14,
2,
13,
18,
13,
13,
0,
13,
18,
13,
13,
0,
18,
13,
13,
4,
13,
18,
13,
13,
17,
0,
18,
13,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
18,
13,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
18,
13,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
4,
13,
13,
18,
13,
13,
14,
40,
13,
18,
13,
13,
4,
13,
17,
4,
13,
0,
13,
17,
28,
13,
4,
13,
2,
13,
17,
17,
17,
0,
13,
4,
13,
13,
18,
13,
13,
14,
40,
13,
18,
13,
13,
4,
13,
17,
4,
13,
0,
13,
17,
28,
13,
13,
0,
13,
13,
0,
13,
13,
4,
13,
13,
14,
2,
13,
17,
4,
13,
10,
12,
13
] |
[
[
5,
4
],
[
11,
10
],
[
23,
22
],
[
35,
34
],
[
42,
41
],
[
4,
45
],
[
48,
47
],
[
4,
51
],
[
54,
53
],
[
57,
56
],
[
4,
59
],
[
53,
62
],
[
67,
62
],
[
10,
64
],
[
56,
65
],
[
68,
67
],
[
10,
69
],
[
56,
70
],
[
75,
72
],
[
41,
73
],
[
56,
74
],
[
80,
77
],
[
47,
78
],
[
56,
79
],
[
10,
81
],
[
56,
82
],
[
87,
84
],
[
41,
85
],
[
56,
86
],
[
10,
88
],
[
56,
89
],
[
94,
91
],
[
47,
92
],
[
56,
93
],
[
10,
95
],
[
56,
96
],
[
99,
98
],
[
102,
101
],
[
4,
105
],
[
98,
111
],
[
67,
111
],
[
53,
111
],
[
116,
111
],
[
22,
113
],
[
101,
114
],
[
117,
116
],
[
22,
118
],
[
101,
119
],
[
124,
121
],
[
41,
122
],
[
101,
123
],
[
84,
126
],
[
72,
126
],
[
143,
126
],
[
121,
126
],
[
41,
127
],
[
101,
128
],
[
134,
131
],
[
47,
132
],
[
101,
133
],
[
91,
136
],
[
77,
136
],
[
155,
136
],
[
131,
136
],
[
47,
137
],
[
101,
138
],
[
22,
140
],
[
101,
141
],
[
146,
143
],
[
41,
144
],
[
101,
145
],
[
22,
149
],
[
101,
150
],
[
84,
151
],
[
72,
151
],
[
143,
151
],
[
121,
151
],
[
41,
152
],
[
101,
153
],
[
158,
155
],
[
47,
156
],
[
101,
157
],
[
91,
160
],
[
77,
160
],
[
155,
160
],
[
131,
160
],
[
47,
161
],
[
101,
162
],
[
22,
164
],
[
101,
165
],
[
168,
167
],
[
171,
170
],
[
4,
173
],
[
176,
175
],
[
167,
178
],
[
116,
178
],
[
98,
178
],
[
67,
178
],
[
53,
178
],
[
175,
178
],
[
155,
179
],
[
131,
179
],
[
91,
179
],
[
77,
179
],
[
47,
180
],
[
170,
181
],
[
175,
184
],
[
167,
184
],
[
116,
184
],
[
98,
184
],
[
67,
184
],
[
53,
184
],
[
10,
186
],
[
170,
187
],
[
195,
194
],
[
198,
197
],
[
4,
201
],
[
207,
206
],
[
194,
209
],
[
175,
209
],
[
167,
209
],
[
116,
209
],
[
98,
209
],
[
67,
209
],
[
53,
209
],
[
206,
209
],
[
155,
210
],
[
131,
210
],
[
91,
210
],
[
77,
210
],
[
47,
211
],
[
197,
212
],
[
206,
215
],
[
194,
215
],
[
175,
215
],
[
167,
215
],
[
116,
215
],
[
98,
215
],
[
67,
215
],
[
53,
215
],
[
22,
217
],
[
197,
218
],
[
226,
225
],
[
229,
228
],
[
41,
228
],
[
232,
231
],
[
228,
232
],
[
235,
234
],
[
34,
235
],
[
234,
238
],
[
231,
238
],
[
225,
238
],
[
247,
244
]
] |
[
"def main():\n N = int(input())\n T = list(map(int, input().split()))\n A = list(map(int, input().split()))\n MOD = 10 ** 9 + 7\n\n ans = [0] * N\n H = [0] * N\n tmp = 0\n for i in range(N):\n if tmp < T[i]:\n tmp = T[i]\n ans[i] = 1\n H[i] = T[i]\n else:\n ans[i] = T[i]\n H[i] = T[i]\n\n tmp = 0\n for i in range(N-1,-1,-1):\n if tmp < A[i]:\n tmp = A[i]\n ans[i] = min(ans[i],1)\n H[i] = min(H[i],A[i])\n else:\n ans[i] = min(A[i],ans[i])\n H[i] = min(H[i],A[i])\n\n tmp = 0\n for i in range(N):\n tmp = max(tmp, H[i])\n if tmp != T[i]:\n print(0)\n exit()\n\n tmp = 0\n for i in range(N-1,-1,-1):\n tmp = max(tmp, H[i])\n if tmp != A[i]:\n print(0)\n exit()\n \n\n cnt = 1\n for i in ans:\n cnt *= i\n cnt %= MOD\n \n print(cnt)\n\nif __name__ == \"__main__\":\n main()",
"def main():\n N = int(input())\n T = list(map(int, input().split()))\n A = list(map(int, input().split()))\n MOD = 10 ** 9 + 7\n\n ans = [0] * N\n H = [0] * N\n tmp = 0\n for i in range(N):\n if tmp < T[i]:\n tmp = T[i]\n ans[i] = 1\n H[i] = T[i]\n else:\n ans[i] = T[i]\n H[i] = T[i]\n\n tmp = 0\n for i in range(N-1,-1,-1):\n if tmp < A[i]:\n tmp = A[i]\n ans[i] = min(ans[i],1)\n H[i] = min(H[i],A[i])\n else:\n ans[i] = min(A[i],ans[i])\n H[i] = min(H[i],A[i])\n\n tmp = 0\n for i in range(N):\n tmp = max(tmp, H[i])\n if tmp != T[i]:\n print(0)\n exit()\n\n tmp = 0\n for i in range(N-1,-1,-1):\n tmp = max(tmp, H[i])\n if tmp != A[i]:\n print(0)\n exit()\n \n\n cnt = 1\n for i in ans:\n cnt *= i\n cnt %= MOD\n \n print(cnt)",
"main",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"T = list(map(int, input().split()))",
"T",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"A = list(map(int, input().split()))",
"A",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"MOD = 10 ** 9 + 7",
"MOD",
"10 ** 9 + 7",
"10 ** 9",
"10",
"9",
"7",
"ans = [0] * N",
"ans",
"[0] * N",
"[0]",
"0",
"N",
"H = [0] * N",
"H",
"[0] * N",
"[0]",
"0",
"N",
"tmp = 0",
"tmp",
"0",
"for i in range(N):\n if tmp < T[i]:\n tmp = T[i]\n ans[i] = 1\n H[i] = T[i]\n else:\n ans[i] = T[i]\n H[i] = T[i]\n\n ",
"i",
"range(N)",
"range",
"N",
"if tmp < T[i]:\n tmp = T[i]\n ans[i] = 1\n H[i] = T[i]\n else:\n ans[i] = T[i]\n H[i] = T[i]\n\n ",
"tmp < T[i]",
"tmp",
"T[i]",
"T",
"i",
"tmp = T[i]",
"tmp",
"T[i]",
"T",
"i",
"ans[i] = 1",
"ans[i]",
"ans",
"i",
"1",
"H[i] = T[i]",
"H[i]",
"H",
"i",
"T[i]",
"T",
"i",
"ans[i] = T[i]",
"ans[i]",
"ans",
"i",
"T[i]",
"T",
"i",
"H[i] = T[i]",
"H[i]",
"H",
"i",
"T[i]",
"T",
"i",
"tmp = 0",
"tmp",
"0",
"for i in range(N-1,-1,-1):\n if tmp < A[i]:\n tmp = A[i]\n ans[i] = min(ans[i],1)\n H[i] = min(H[i],A[i])\n else:\n ans[i] = min(A[i],ans[i])\n H[i] = min(H[i],A[i])\n\n ",
"i",
"range(N-1,-1,-1)",
"range",
"N-1",
"N",
"1",
"-1",
"-1",
"if tmp < A[i]:\n tmp = A[i]\n ans[i] = min(ans[i],1)\n H[i] = min(H[i],A[i])\n else:\n ans[i] = min(A[i],ans[i])\n H[i] = min(H[i],A[i])\n\n ",
"tmp < A[i]",
"tmp",
"A[i]",
"A",
"i",
"tmp = A[i]",
"tmp",
"A[i]",
"A",
"i",
"ans[i] = min(ans[i],1)",
"ans[i]",
"ans",
"i",
"min(ans[i],1)",
"min",
"ans[i]",
"ans",
"i",
"1",
"H[i] = min(H[i],A[i])",
"H[i]",
"H",
"i",
"min(H[i],A[i])",
"min",
"H[i]",
"H",
"i",
"A[i]",
"A",
"i",
"ans[i] = min(A[i],ans[i])",
"ans[i]",
"ans",
"i",
"min(A[i],ans[i])",
"min",
"A[i]",
"A",
"i",
"ans[i]",
"ans",
"i",
"H[i] = min(H[i],A[i])",
"H[i]",
"H",
"i",
"min(H[i],A[i])",
"min",
"H[i]",
"H",
"i",
"A[i]",
"A",
"i",
"tmp = 0",
"tmp",
"0",
"for i in range(N):\n tmp = max(tmp, H[i])\n if tmp != T[i]:\n print(0)\n exit()\n\n ",
"i",
"range(N)",
"range",
"N",
"tmp = max(tmp, H[i])",
"tmp",
"max(tmp, H[i])",
"max",
"tmp",
"H[i]",
"H",
"i",
"if tmp != T[i]:\n print(0)\n exit()\n\n ",
"tmp != T[i]",
"tmp",
"T[i]",
"T",
"i",
"print(0)",
"print",
"0",
"exit()",
"exit",
"tmp = 0",
"tmp",
"0",
"for i in range(N-1,-1,-1):\n tmp = max(tmp, H[i])\n if tmp != A[i]:\n print(0)\n exit()\n \n\n ",
"i",
"range(N-1,-1,-1)",
"range",
"N-1",
"N",
"1",
"-1",
"-1",
"tmp = max(tmp, H[i])",
"tmp",
"max(tmp, H[i])",
"max",
"tmp",
"H[i]",
"H",
"i",
"if tmp != A[i]:\n print(0)\n exit()\n \n\n ",
"tmp != A[i]",
"tmp",
"A[i]",
"A",
"i",
"print(0)",
"print",
"0",
"exit()",
"exit",
"cnt = 1",
"cnt",
"1",
"for i in ans:\n cnt *= i\n cnt %= MOD\n \n ",
"i",
"ans",
"cnt *= i",
"cnt",
"i",
"cnt %= MOD",
"cnt",
"MOD",
"print(cnt)",
"print",
"cnt",
"if __name__ == \"__main__\":\n main()",
"__name__ == \"__main__\"",
"__name__",
"\"__main__\"",
"main()",
"main",
"def main():\n N = int(input())\n T = list(map(int, input().split()))\n A = list(map(int, input().split()))\n MOD = 10 ** 9 + 7\n\n ans = [0] * N\n H = [0] * N\n tmp = 0\n for i in range(N):\n if tmp < T[i]:\n tmp = T[i]\n ans[i] = 1\n H[i] = T[i]\n else:\n ans[i] = T[i]\n H[i] = T[i]\n\n tmp = 0\n for i in range(N-1,-1,-1):\n if tmp < A[i]:\n tmp = A[i]\n ans[i] = min(ans[i],1)\n H[i] = min(H[i],A[i])\n else:\n ans[i] = min(A[i],ans[i])\n H[i] = min(H[i],A[i])\n\n tmp = 0\n for i in range(N):\n tmp = max(tmp, H[i])\n if tmp != T[i]:\n print(0)\n exit()\n\n tmp = 0\n for i in range(N-1,-1,-1):\n tmp = max(tmp, H[i])\n if tmp != A[i]:\n print(0)\n exit()\n \n\n cnt = 1\n for i in ans:\n cnt *= i\n cnt %= MOD\n \n print(cnt)",
"def main():\n N = int(input())\n T = list(map(int, input().split()))\n A = list(map(int, input().split()))\n MOD = 10 ** 9 + 7\n\n ans = [0] * N\n H = [0] * N\n tmp = 0\n for i in range(N):\n if tmp < T[i]:\n tmp = T[i]\n ans[i] = 1\n H[i] = T[i]\n else:\n ans[i] = T[i]\n H[i] = T[i]\n\n tmp = 0\n for i in range(N-1,-1,-1):\n if tmp < A[i]:\n tmp = A[i]\n ans[i] = min(ans[i],1)\n H[i] = min(H[i],A[i])\n else:\n ans[i] = min(A[i],ans[i])\n H[i] = min(H[i],A[i])\n\n tmp = 0\n for i in range(N):\n tmp = max(tmp, H[i])\n if tmp != T[i]:\n print(0)\n exit()\n\n tmp = 0\n for i in range(N-1,-1,-1):\n tmp = max(tmp, H[i])\n if tmp != A[i]:\n print(0)\n exit()\n \n\n cnt = 1\n for i in ans:\n cnt *= i\n cnt %= MOD\n \n print(cnt)",
"main"
] |
def main():
N = int(input())
T = list(map(int, input().split()))
A = list(map(int, input().split()))
MOD = 10 ** 9 + 7
ans = [0] * N
H = [0] * N
tmp = 0
for i in range(N):
if tmp < T[i]:
tmp = T[i]
ans[i] = 1
H[i] = T[i]
else:
ans[i] = T[i]
H[i] = T[i]
tmp = 0
for i in range(N-1,-1,-1):
if tmp < A[i]:
tmp = A[i]
ans[i] = min(ans[i],1)
H[i] = min(H[i],A[i])
else:
ans[i] = min(A[i],ans[i])
H[i] = min(H[i],A[i])
tmp = 0
for i in range(N):
tmp = max(tmp, H[i])
if tmp != T[i]:
print(0)
exit()
tmp = 0
for i in range(N-1,-1,-1):
tmp = max(tmp, H[i])
if tmp != A[i]:
print(0)
exit()
cnt = 1
for i in ans:
cnt *= i
cnt %= MOD
print(cnt)
if __name__ == "__main__":
main()
|
[
7,
15,
13,
0,
13,
18,
18,
13,
13,
13,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
2,
39,
17,
13,
14,
2,
2,
18,
13,
17,
18,
13,
17,
2,
18,
13,
17,
18,
13,
17,
4,
13,
17,
4,
13,
0,
18,
13,
17,
40,
18,
13,
17,
28,
13,
4,
13,
17,
13,
14,
2,
18,
13,
2,
13,
17,
18,
13,
13,
0,
18,
13,
13,
18,
13,
13,
0,
18,
13,
13,
40,
18,
13,
13,
0,
18,
13,
17,
40,
18,
13,
17,
28,
13,
18,
4,
13,
2,
13,
17,
39,
17,
14,
2,
18,
13,
13,
17,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
18,
13,
13,
4,
13,
18,
13,
13,
18,
13,
13,
14,
2,
18,
13,
13,
18,
13,
13,
4,
13,
17,
4,
13,
0,
18,
13,
13,
40,
18,
13,
13,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
14,
2,
40,
18,
13,
13,
18,
13,
13,
4,
13,
17,
4,
13,
14,
40,
40,
18,
13,
13,
18,
13,
13,
4,
13,
17,
4,
13,
0,
13,
17,
0,
13,
2,
2,
17,
17,
17,
28,
13,
4,
13,
13,
14,
2,
18,
13,
13,
17,
0,
13,
2,
2,
13,
18,
13,
13,
13,
4,
13,
13,
10,
17,
13,
10,
2,
13,
10,
2,
13,
10,
4,
13,
10,
4,
13,
10,
2,
13,
10,
4,
13,
10,
18,
13
] |
[
[
266,
4
],
[
263,
11
],
[
267,
15
],
[
257,
17
],
[
267,
26
],
[
254,
29
],
[
267,
38
],
[
251,
41
],
[
264,
45
],
[
258,
50
],
[
255,
53
],
[
258,
57
],
[
255,
60
],
[
71,
68
],
[
252,
69
],
[
258,
73
],
[
77,
76
],
[
264,
80
],
[
258,
84
],
[
76,
86
],
[
258,
89
],
[
76,
90
],
[
95,
92
],
[
252,
93
],
[
76,
94
],
[
258,
96
],
[
76,
97
],
[
102,
99
],
[
252,
100
],
[
76,
101
],
[
258,
104
],
[
76,
105
],
[
110,
107
],
[
252,
108
],
[
255,
112
],
[
116,
115
],
[
264,
120
],
[
99,
126
],
[
92,
126
],
[
166,
126
],
[
141,
126
],
[
252,
127
],
[
115,
128
],
[
255,
133
],
[
115,
134
],
[
255,
136
],
[
115,
138
],
[
144,
141
],
[
252,
142
],
[
115,
143
],
[
99,
146
],
[
92,
146
],
[
166,
146
],
[
141,
146
],
[
252,
147
],
[
115,
148
],
[
255,
150
],
[
115,
151
],
[
99,
154
],
[
92,
154
],
[
166,
154
],
[
141,
154
],
[
252,
155
],
[
115,
156
],
[
255,
158
],
[
115,
159
],
[
169,
166
],
[
252,
167
],
[
115,
168
],
[
255,
171
],
[
115,
172
],
[
255,
176
],
[
115,
177
],
[
255,
179
],
[
115,
181
],
[
99,
186
],
[
92,
186
],
[
166,
186
],
[
141,
186
],
[
252,
187
],
[
115,
188
],
[
255,
190
],
[
115,
191
],
[
99,
200
],
[
92,
200
],
[
166,
200
],
[
141,
200
],
[
252,
201
],
[
115,
202
],
[
255,
204
],
[
115,
205
],
[
245,
212
],
[
260,
215
],
[
223,
222
],
[
264,
225
],
[
166,
228
],
[
141,
228
],
[
99,
228
],
[
92,
228
],
[
252,
229
],
[
222,
230
],
[
248,
233
],
[
246,
236
],
[
249,
236
],
[
166,
237
],
[
141,
237
],
[
99,
237
],
[
92,
237
],
[
252,
238
],
[
222,
239
],
[
261,
240
],
[
249,
243
],
[
246,
243
],
[
245,
246
],
[
248,
249
],
[
251,
252
],
[
254,
255
],
[
257,
258
],
[
260,
261
],
[
263,
264
],
[
266,
267
]
] |
[
"import sys\ninput = sys.stdin.readline\n\nN = int(input())\nT = list(map(int, input().split()))\nA = list(map(int, input().split()))\nmaxh = [0] * N\nif T[0] > A[0] or T[-1] < A[-1]:\n print(0)\n exit()\n\nmaxh[0] = -T[0]\nfor i in range(1, N):\n if T[i-1] == T[i]:\n maxh[i] = T[i]\n else:\n maxh[i] = -T[i]\n\nmaxh[-1] = -A[-1]\nfor i in range(N-1)[::-1]:\n if maxh[i] > 0:\n if A[i] == A[i+1]:\n maxh[i] = min(maxh[i], A[i])\n else:\n if maxh[i] < A[i]:\n print(0)\n exit()\n else:\n maxh[i] = -A[i]\n else:\n if A[i] == A[i+1]:\n if -maxh[i] > A[i]:\n print(0)\n exit()\n else:\n if -maxh[i] != A[i]:\n print(0)\n exit()\n\nans = 1\nmod = 10**9+7\nfor i in range(N):\n if maxh[i] > 0:\n ans = ans * maxh[i] % mod\nprint(ans)",
"import sys",
"sys",
"input = sys.stdin.readline",
"input",
"sys.stdin.readline",
"sys.stdin",
"sys",
"stdin",
"readline",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"T = list(map(int, input().split()))",
"T",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"A = list(map(int, input().split()))",
"A",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"maxh = [0] * N",
"maxh",
"[0] * N",
"[0]",
"0",
"N",
"if T[0] > A[0] or T[-1] < A[-1]:\n print(0)\n exit()",
"T[0] > A[0] or T[-1] < A[-1]",
"T[0] > A[0]",
"T[0]",
"T",
"0",
"A[0]",
"A",
"0",
"T[-1] < A[-1]",
"T[-1]",
"T",
"-1",
"A[-1]",
"A",
"-1",
"print(0)",
"print",
"0",
"exit()",
"exit",
"maxh[0] = -T[0]",
"maxh[0]",
"maxh",
"0",
"-T[0]",
"T[0]",
"T",
"0",
"for i in range(1, N):\n if T[i-1] == T[i]:\n maxh[i] = T[i]\n else:\n maxh[i] = -T[i]",
"i",
"range(1, N)",
"range",
"1",
"N",
"if T[i-1] == T[i]:\n maxh[i] = T[i]\n else:\n maxh[i] = -T[i]",
"T[i-1] == T[i]",
"T[i-1]",
"T",
"i-1",
"i",
"1",
"T[i]",
"T",
"i",
"maxh[i] = T[i]",
"maxh[i]",
"maxh",
"i",
"T[i]",
"T",
"i",
"maxh[i] = -T[i]",
"maxh[i]",
"maxh",
"i",
"-T[i]",
"T[i]",
"T",
"i",
"maxh[-1] = -A[-1]",
"maxh[-1]",
"maxh",
"-1",
"-A[-1]",
"A[-1]",
"A",
"-1",
"for i in range(N-1)[::-1]:\n if maxh[i] > 0:\n if A[i] == A[i+1]:\n maxh[i] = min(maxh[i], A[i])\n else:\n if maxh[i] < A[i]:\n print(0)\n exit()\n else:\n maxh[i] = -A[i]\n else:\n if A[i] == A[i+1]:\n if -maxh[i] > A[i]:\n print(0)\n exit()\n else:\n if -maxh[i] != A[i]:\n print(0)\n exit()",
"i",
"range(N-1)[::-1]",
"(N-1)",
"range",
"N-1",
"N",
"1",
"::-1",
"-1",
"if maxh[i] > 0:\n if A[i] == A[i+1]:\n maxh[i] = min(maxh[i], A[i])\n else:\n if maxh[i] < A[i]:\n print(0)\n exit()\n else:\n maxh[i] = -A[i]\n else:\n if A[i] == A[i+1]:\n if -maxh[i] > A[i]:\n print(0)\n exit()\n else:\n if -maxh[i] != A[i]:\n print(0)\n exit()",
"maxh[i] > 0",
"maxh[i]",
"maxh",
"i",
"0",
"if A[i] == A[i+1]:\n maxh[i] = min(maxh[i], A[i])\n else:\n if maxh[i] < A[i]:\n print(0)\n exit()\n else:\n maxh[i] = -A[i]\n ",
"A[i] == A[i+1]",
"A[i]",
"A",
"i",
"A[i+1]",
"A",
"i+1",
"i",
"1",
"maxh[i] = min(maxh[i], A[i])",
"maxh[i]",
"maxh",
"i",
"min(maxh[i], A[i])",
"min",
"maxh[i]",
"maxh",
"i",
"A[i]",
"A",
"i",
"if maxh[i] < A[i]:\n print(0)\n exit()\n else:\n maxh[i] = -A[i]\n ",
"maxh[i] < A[i]",
"maxh[i]",
"maxh",
"i",
"A[i]",
"A",
"i",
"print(0)",
"print",
"0",
"exit()",
"exit",
"maxh[i] = -A[i]",
"maxh[i]",
"maxh",
"i",
"-A[i]",
"A[i]",
"A",
"i",
"if A[i] == A[i+1]:\n if -maxh[i] > A[i]:\n print(0)\n exit()\n else:\n if -maxh[i] != A[i]:\n print(0)\n exit()",
"A[i] == A[i+1]",
"A[i]",
"A",
"i",
"A[i+1]",
"A",
"i+1",
"i",
"1",
"if -maxh[i] > A[i]:\n print(0)\n exit()\n ",
"-maxh[i] > A[i]",
"-maxh[i]",
"maxh[i]",
"maxh",
"i",
"A[i]",
"A",
"i",
"print(0)",
"print",
"0",
"exit()",
"exit",
"if -maxh[i] != A[i]:\n print(0)\n exit()",
"-maxh[i] != A[i]",
"-maxh[i]",
"maxh[i]",
"maxh",
"i",
"A[i]",
"A",
"i",
"print(0)",
"print",
"0",
"exit()",
"exit",
"ans = 1",
"ans",
"1",
"mod = 10**9+7",
"mod",
"10**9+7",
"10**9",
"10",
"9",
"7",
"for i in range(N):\n if maxh[i] > 0:\n ans = ans * maxh[i] % mod",
"i",
"range(N)",
"range",
"N",
"if maxh[i] > 0:\n ans = ans * maxh[i] % mod",
"maxh[i] > 0",
"maxh[i]",
"maxh",
"i",
"0",
"ans = ans * maxh[i] % mod",
"ans",
"ans * maxh[i] % mod",
"ans * maxh[i]",
"ans",
"maxh[i]",
"maxh",
"i",
"mod",
"print(ans)",
"print",
"ans",
"ans = 1",
"1",
"ans",
"ans = ans * maxh[i] % mod",
"ans * maxh[i] % mod",
"ans",
"maxh = [0] * N",
"[0] * N",
"maxh",
"A = list(map(int, input().split()))",
"list(map(int, input().split()))",
"A",
"T = list(map(int, input().split()))",
"list(map(int, input().split()))",
"T",
"mod = 10**9+7",
"10**9+7",
"mod",
"N = int(input())",
"int(input())",
"N",
"input = sys.stdin.readline",
"sys.stdin.readline",
"input"
] |
import sys
input = sys.stdin.readline
N = int(input())
T = list(map(int, input().split()))
A = list(map(int, input().split()))
maxh = [0] * N
if T[0] > A[0] or T[-1] < A[-1]:
print(0)
exit()
maxh[0] = -T[0]
for i in range(1, N):
if T[i-1] == T[i]:
maxh[i] = T[i]
else:
maxh[i] = -T[i]
maxh[-1] = -A[-1]
for i in range(N-1)[::-1]:
if maxh[i] > 0:
if A[i] == A[i+1]:
maxh[i] = min(maxh[i], A[i])
else:
if maxh[i] < A[i]:
print(0)
exit()
else:
maxh[i] = -A[i]
else:
if A[i] == A[i+1]:
if -maxh[i] > A[i]:
print(0)
exit()
else:
if -maxh[i] != A[i]:
print(0)
exit()
ans = 1
mod = 10**9+7
for i in range(N):
if maxh[i] > 0:
ans = ans * maxh[i] % mod
print(ans)
|
[
7,
12,
13,
0,
13,
2,
2,
17,
17,
17,
0,
13,
4,
13,
4,
13,
0,
31,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
31,
13,
4,
13,
13,
4,
18,
4,
13,
13,
14,
40,
18,
13,
17,
18,
13,
17,
4,
13,
17,
29,
0,
13,
17,
28,
13,
4,
13,
13,
14,
2,
13,
17,
0,
13,
18,
13,
13,
0,
13,
18,
14,
2,
18,
13,
2,
13,
17,
18,
13,
13,
0,
13,
18,
13,
13,
0,
13,
18,
14,
2,
18,
13,
2,
13,
17,
18,
13,
13,
0,
13,
17,
0,
13,
18,
13,
13,
4,
13,
17,
29,
14,
2,
13,
2,
13,
17,
0,
13,
4,
13,
13,
18,
13,
13,
0,
13,
4,
13,
13,
18,
13,
13,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
13,
4,
13,
13,
18,
13,
13,
0,
13,
4,
13,
13,
18,
13,
13,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
13,
4,
13,
13,
17,
0,
13,
4,
13,
13,
18,
13,
13,
4,
13,
17,
29,
14,
2,
13,
13,
4,
13,
17,
29,
0,
13,
2,
2,
13,
2,
2,
13,
13,
17,
13,
4,
13,
13,
14,
2,
13,
17,
4,
13,
10,
12,
13
] |
[
[
5,
4
],
[
12,
11
],
[
19,
17
],
[
30,
28
],
[
52,
51
],
[
55,
54
],
[
11,
57
],
[
54,
60
],
[
69,
63
],
[
54,
66
],
[
69,
68
],
[
54,
75
],
[
54,
79
],
[
87,
81
],
[
54,
84
],
[
87,
86
],
[
54,
93
],
[
54,
97
],
[
100,
99
],
[
103,
102
],
[
54,
105
],
[
54,
112
],
[
11,
114
],
[
118,
117
],
[
99,
120
],
[
81,
120
],
[
63,
120
],
[
169,
120
],
[
143,
120
],
[
117,
120
],
[
54,
123
],
[
126,
125
],
[
102,
128
],
[
86,
128
],
[
68,
128
],
[
175,
128
],
[
151,
128
],
[
125,
128
],
[
54,
131
],
[
54,
136
],
[
54,
140
],
[
144,
143
],
[
99,
146
],
[
81,
146
],
[
63,
146
],
[
169,
146
],
[
143,
146
],
[
117,
146
],
[
54,
149
],
[
152,
151
],
[
102,
154
],
[
86,
154
],
[
68,
154
],
[
175,
154
],
[
151,
154
],
[
125,
154
],
[
54,
157
],
[
54,
162
],
[
54,
166
],
[
170,
169
],
[
99,
172
],
[
81,
172
],
[
63,
172
],
[
169,
172
],
[
143,
172
],
[
117,
172
],
[
176,
175
],
[
102,
178
],
[
86,
178
],
[
68,
178
],
[
175,
178
],
[
151,
178
],
[
125,
178
],
[
54,
181
],
[
169,
188
],
[
143,
188
],
[
117,
188
],
[
99,
188
],
[
81,
188
],
[
63,
188
],
[
175,
189
],
[
151,
189
],
[
125,
189
],
[
102,
189
],
[
86,
189
],
[
68,
189
],
[
196,
195
],
[
51,
198
],
[
195,
198
],
[
175,
201
],
[
151,
201
],
[
125,
201
],
[
102,
201
],
[
86,
201
],
[
68,
201
],
[
169,
202
],
[
143,
202
],
[
117,
202
],
[
99,
202
],
[
81,
202
],
[
63,
202
],
[
4,
204
],
[
195,
207
],
[
51,
207
],
[
216,
213
]
] |
[
"def main():\n mod = 10 ** 9 + 7\n\n n = int(input())\n *t, = map(int, input().split())\n *a, = map(int, input().split())\n\n if t[-1] != a[0]:\n # 高橋と青木の見た山の高さの最大値が一致しない\n print(0)\n return\n\n ret = 1\n\n # [lo,hi]\n for i in range(n):\n if i == 0:\n lo = hi = t[i]\n else:\n if t[i - 1] < t[i]:\n # 山iの高さは一意に定まる\n lo = hi = t[i]\n elif t[i - 1] == t[i]:\n # [1,t[i]]の範囲で自由に選べる\n lo = 1\n hi = t[i]\n else:\n # t[i - 1] > t[i]:\n print(0)\n return\n\n if i == n - 1:\n lo = max(lo, a[i])\n hi = min(hi, a[i])\n else:\n if a[i] > a[i + 1]:\n # 山iの高さは一意に定まる\n lo = max(lo, a[i])\n hi = min(hi, a[i])\n elif a[i] == a[i + 1]:\n # [1,a[i]]の範囲で自由に選べる\n lo = max(lo, 1)\n hi = min(hi, a[i])\n else:\n # a[i] < a[i + 1]:\n print(0)\n return\n\n if lo > hi:\n print(0)\n return\n\n ret = ret * (hi - lo + 1) % mod\n\n print(ret)\n\n\nif __name__ == '__main__':\n main()",
"def main():\n mod = 10 ** 9 + 7\n\n n = int(input())\n *t, = map(int, input().split())\n *a, = map(int, input().split())\n\n if t[-1] != a[0]:\n # 高橋と青木の見た山の高さの最大値が一致しない\n print(0)\n return\n\n ret = 1\n\n # [lo,hi]\n for i in range(n):\n if i == 0:\n lo = hi = t[i]\n else:\n if t[i - 1] < t[i]:\n # 山iの高さは一意に定まる\n lo = hi = t[i]\n elif t[i - 1] == t[i]:\n # [1,t[i]]の範囲で自由に選べる\n lo = 1\n hi = t[i]\n else:\n # t[i - 1] > t[i]:\n print(0)\n return\n\n if i == n - 1:\n lo = max(lo, a[i])\n hi = min(hi, a[i])\n else:\n if a[i] > a[i + 1]:\n # 山iの高さは一意に定まる\n lo = max(lo, a[i])\n hi = min(hi, a[i])\n elif a[i] == a[i + 1]:\n # [1,a[i]]の範囲で自由に選べる\n lo = max(lo, 1)\n hi = min(hi, a[i])\n else:\n # a[i] < a[i + 1]:\n print(0)\n return\n\n if lo > hi:\n print(0)\n return\n\n ret = ret * (hi - lo + 1) % mod\n\n print(ret)",
"main",
"mod = 10 ** 9 + 7",
"mod",
"10 ** 9 + 7",
"10 ** 9",
"10",
"9",
"7",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"*t, = map(int, input().split())",
"*t",
"t",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"*a, = map(int, input().split())",
"*a",
"a",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"if t[-1] != a[0]:\n # 高橋と青木の見た山の高さの最大値が一致しない\n print(0)\n return\n\n ",
"t[-1] != a[0]",
"t[-1]",
"t",
"-1",
"a[0]",
"a",
"0",
"print(0)",
"print",
"0",
"return",
"ret = 1",
"ret",
"1",
"for i in range(n):\n if i == 0:\n lo = hi = t[i]\n else:\n if t[i - 1] < t[i]:\n # 山iの高さは一意に定まる\n lo = hi = t[i]\n elif t[i - 1] == t[i]:\n # [1,t[i]]の範囲で自由に選べる\n lo = 1\n hi = t[i]\n else:\n # t[i - 1] > t[i]:\n print(0)\n return\n\n if i == n - 1:\n lo = max(lo, a[i])\n hi = min(hi, a[i])\n else:\n if a[i] > a[i + 1]:\n # 山iの高さは一意に定まる\n lo = max(lo, a[i])\n hi = min(hi, a[i])\n elif a[i] == a[i + 1]:\n # [1,a[i]]の範囲で自由に選べる\n lo = max(lo, 1)\n hi = min(hi, a[i])\n else:\n # a[i] < a[i + 1]:\n print(0)\n return\n\n if lo > hi:\n print(0)\n return\n\n ret = ret * (hi - lo + 1) % mod\n\n ",
"i",
"range(n)",
"range",
"n",
"if i == 0:\n lo = hi = t[i]\n else:\n if t[i - 1] < t[i]:\n # 山iの高さは一意に定まる\n lo = hi = t[i]\n elif t[i - 1] == t[i]:\n # [1,t[i]]の範囲で自由に選べる\n lo = 1\n hi = t[i]\n else:\n # t[i - 1] > t[i]:\n print(0)\n return\n\n ",
"i == 0",
"i",
"0",
"lo = hi = t[i]",
"lo",
"t[i]",
"t",
"i",
"= hi = t[i]",
"hi",
"t[i]",
"if t[i - 1] < t[i]:\n # 山iの高さは一意に定まる\n lo = hi = t[i]\n elif t[i - 1] == t[i]:\n # [1,t[i]]の範囲で自由に選べる\n lo = 1\n hi = t[i]\n else:\n # t[i - 1] > t[i]:\n print(0)\n return\n\n ",
"t[i - 1] < t[i]",
"t[i - 1]",
"t",
"i - 1",
"i",
"1",
"t[i]",
"t",
"i",
"lo = hi = t[i]",
"lo",
"t[i]",
"t",
"i",
"= hi = t[i]",
"hi",
"t[i]",
"elif t[i - 1] == t[i]:\n # [1,t[i]]の範囲で自由に選べる\n lo = 1\n hi = t[i]\n ",
"t[i - 1] == t[i]",
"t[i - 1]",
"t",
"i - 1",
"i",
"1",
"t[i]",
"t",
"i",
"lo = 1",
"lo",
"1",
"hi = t[i]",
"hi",
"t[i]",
"t",
"i",
"print(0)",
"print",
"0",
"return",
"if i == n - 1:\n lo = max(lo, a[i])\n hi = min(hi, a[i])\n else:\n if a[i] > a[i + 1]:\n # 山iの高さは一意に定まる\n lo = max(lo, a[i])\n hi = min(hi, a[i])\n elif a[i] == a[i + 1]:\n # [1,a[i]]の範囲で自由に選べる\n lo = max(lo, 1)\n hi = min(hi, a[i])\n else:\n # a[i] < a[i + 1]:\n print(0)\n return\n\n ",
"i == n - 1",
"i",
"n - 1",
"n",
"1",
"lo = max(lo, a[i])",
"lo",
"max(lo, a[i])",
"max",
"lo",
"a[i]",
"a",
"i",
"hi = min(hi, a[i])",
"hi",
"min(hi, a[i])",
"min",
"hi",
"a[i]",
"a",
"i",
"if a[i] > a[i + 1]:\n # 山iの高さは一意に定まる\n lo = max(lo, a[i])\n hi = min(hi, a[i])\n elif a[i] == a[i + 1]:\n # [1,a[i]]の範囲で自由に選べる\n lo = max(lo, 1)\n hi = min(hi, a[i])\n else:\n # a[i] < a[i + 1]:\n print(0)\n return\n\n ",
"a[i] > a[i + 1]",
"a[i]",
"a",
"i",
"a[i + 1]",
"a",
"i + 1",
"i",
"1",
"lo = max(lo, a[i])",
"lo",
"max(lo, a[i])",
"max",
"lo",
"a[i]",
"a",
"i",
"hi = min(hi, a[i])",
"hi",
"min(hi, a[i])",
"min",
"hi",
"a[i]",
"a",
"i",
"elif a[i] == a[i + 1]:\n # [1,a[i]]の範囲で自由に選べる\n lo = max(lo, 1)\n hi = min(hi, a[i])\n ",
"a[i] == a[i + 1]",
"a[i]",
"a",
"i",
"a[i + 1]",
"a",
"i + 1",
"i",
"1",
"lo = max(lo, 1)",
"lo",
"max(lo, 1)",
"max",
"lo",
"1",
"hi = min(hi, a[i])",
"hi",
"min(hi, a[i])",
"min",
"hi",
"a[i]",
"a",
"i",
"print(0)",
"print",
"0",
"return",
"if lo > hi:\n print(0)\n return\n\n ",
"lo > hi",
"lo",
"hi",
"print(0)",
"print",
"0",
"return",
"ret = ret * (hi - lo + 1) % mod",
"ret",
"ret * (hi - lo + 1) % mod",
"ret * (hi - lo + 1)",
"ret",
"hi - lo + 1",
"hi - lo",
"hi",
"lo",
"1",
"mod",
"print(ret)",
"print",
"ret",
"if __name__ == '__main__':\n main()",
"__name__ == '__main__'",
"__name__",
"'__main__'",
"main()",
"main",
"def main():\n mod = 10 ** 9 + 7\n\n n = int(input())\n *t, = map(int, input().split())\n *a, = map(int, input().split())\n\n if t[-1] != a[0]:\n # 高橋と青木の見た山の高さの最大値が一致しない\n print(0)\n return\n\n ret = 1\n\n # [lo,hi]\n for i in range(n):\n if i == 0:\n lo = hi = t[i]\n else:\n if t[i - 1] < t[i]:\n # 山iの高さは一意に定まる\n lo = hi = t[i]\n elif t[i - 1] == t[i]:\n # [1,t[i]]の範囲で自由に選べる\n lo = 1\n hi = t[i]\n else:\n # t[i - 1] > t[i]:\n print(0)\n return\n\n if i == n - 1:\n lo = max(lo, a[i])\n hi = min(hi, a[i])\n else:\n if a[i] > a[i + 1]:\n # 山iの高さは一意に定まる\n lo = max(lo, a[i])\n hi = min(hi, a[i])\n elif a[i] == a[i + 1]:\n # [1,a[i]]の範囲で自由に選べる\n lo = max(lo, 1)\n hi = min(hi, a[i])\n else:\n # a[i] < a[i + 1]:\n print(0)\n return\n\n if lo > hi:\n print(0)\n return\n\n ret = ret * (hi - lo + 1) % mod\n\n print(ret)",
"def main():\n mod = 10 ** 9 + 7\n\n n = int(input())\n *t, = map(int, input().split())\n *a, = map(int, input().split())\n\n if t[-1] != a[0]:\n # 高橋と青木の見た山の高さの最大値が一致しない\n print(0)\n return\n\n ret = 1\n\n # [lo,hi]\n for i in range(n):\n if i == 0:\n lo = hi = t[i]\n else:\n if t[i - 1] < t[i]:\n # 山iの高さは一意に定まる\n lo = hi = t[i]\n elif t[i - 1] == t[i]:\n # [1,t[i]]の範囲で自由に選べる\n lo = 1\n hi = t[i]\n else:\n # t[i - 1] > t[i]:\n print(0)\n return\n\n if i == n - 1:\n lo = max(lo, a[i])\n hi = min(hi, a[i])\n else:\n if a[i] > a[i + 1]:\n # 山iの高さは一意に定まる\n lo = max(lo, a[i])\n hi = min(hi, a[i])\n elif a[i] == a[i + 1]:\n # [1,a[i]]の範囲で自由に選べる\n lo = max(lo, 1)\n hi = min(hi, a[i])\n else:\n # a[i] < a[i + 1]:\n print(0)\n return\n\n if lo > hi:\n print(0)\n return\n\n ret = ret * (hi - lo + 1) % mod\n\n print(ret)",
"main"
] |
def main():
mod = 10 ** 9 + 7
n = int(input())
*t, = map(int, input().split())
*a, = map(int, input().split())
if t[-1] != a[0]:
# 高橋と青木の見た山の高さの最大値が一致しない
print(0)
return
ret = 1
# [lo,hi]
for i in range(n):
if i == 0:
lo = hi = t[i]
else:
if t[i - 1] < t[i]:
# 山iの高さは一意に定まる
lo = hi = t[i]
elif t[i - 1] == t[i]:
# [1,t[i]]の範囲で自由に選べる
lo = 1
hi = t[i]
else:
# t[i - 1] > t[i]:
print(0)
return
if i == n - 1:
lo = max(lo, a[i])
hi = min(hi, a[i])
else:
if a[i] > a[i + 1]:
# 山iの高さは一意に定まる
lo = max(lo, a[i])
hi = min(hi, a[i])
elif a[i] == a[i + 1]:
# [1,a[i]]の範囲で自由に選べる
lo = max(lo, 1)
hi = min(hi, a[i])
else:
# a[i] < a[i + 1]:
print(0)
return
if lo > hi:
print(0)
return
ret = ret * (hi - lo + 1) % mod
print(ret)
if __name__ == '__main__':
main()
|
[
7,
0,
13,
2,
2,
17,
17,
17,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
0,
13,
13,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
0,
13,
13,
12,
13,
14,
2,
13,
13,
29,
39,
13,
13,
14,
2,
13,
13,
29,
39,
17,
13,
23,
13,
23,
13,
0,
13,
39,
39,
18,
13,
17,
18,
13,
17,
0,
13,
39,
39,
18,
13,
17,
18,
13,
17,
28,
13,
4,
13,
2,
13,
17,
0,
13,
18,
13,
13,
13,
18,
13,
2,
13,
17,
4,
18,
13,
13,
4,
13,
13,
13,
0,
13,
18,
13,
2,
2,
13,
13,
17,
13,
18,
13,
2,
2,
13,
13,
17,
4,
18,
13,
13,
4,
13,
13,
13,
0,
13,
18,
13,
39,
17,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
18,
13,
13,
13,
0,
13,
18,
13,
13,
13,
0,
13,
4,
13,
13,
13,
0,
13,
4,
13,
13,
13,
0,
13,
4,
13,
2,
2,
13,
13,
17,
17,
0,
13,
13,
4,
13,
13,
10,
18,
13,
10,
4,
13,
10,
18,
13,
10,
39,
13,
10,
4,
13,
10,
4,
13,
10,
13,
13,
10,
18,
13,
10,
4,
13,
10,
13,
13,
10,
18,
13,
10,
18,
13,
10,
13,
13,
10,
12,
13,
10,
39,
13,
10,
18,
13,
10,
18,
13,
10,
18,
13,
10,
17,
13,
10,
18,
13,
10,
2,
13
] |
[
[
252,
2
],
[
195,
9
],
[
17,
16
],
[
16,
25
],
[
219,
27
],
[
32,
31
],
[
31,
40
],
[
210,
42
],
[
65,
48
],
[
63,
49
],
[
65,
56
],
[
63,
57
],
[
63,
63
],
[
65,
65
],
[
201,
67
],
[
220,
71
],
[
220,
74
],
[
234,
77
],
[
211,
81
],
[
211,
84
],
[
88,
87
],
[
196,
91
],
[
225,
94
],
[
220,
96
],
[
87,
97
],
[
222,
98
],
[
220,
100
],
[
87,
102
],
[
202,
106
],
[
232,
109
],
[
226,
110
],
[
193,
110
],
[
223,
111
],
[
241,
111
],
[
192,
113
],
[
211,
115
],
[
196,
118
],
[
87,
119
],
[
240,
121
],
[
211,
123
],
[
196,
126
],
[
87,
127
],
[
235,
131
],
[
232,
134
],
[
193,
135
],
[
226,
135
],
[
241,
136
],
[
223,
136
],
[
198,
138
],
[
235,
140
],
[
246,
144
],
[
148,
147
],
[
196,
150
],
[
249,
152
],
[
202,
154
],
[
147,
155
],
[
249,
156
],
[
237,
158
],
[
199,
160
],
[
235,
160
],
[
147,
161
],
[
237,
162
],
[
216,
164
],
[
250,
167
],
[
238,
168
],
[
207,
170
],
[
244,
173
],
[
214,
174
],
[
204,
176
],
[
208,
181
],
[
241,
181
],
[
223,
181
],
[
217,
182
],
[
193,
182
],
[
226,
182
],
[
228,
186
],
[
253,
187
],
[
229,
190
],
[
205,
190
],
[
247,
190
],
[
192,
193
],
[
195,
196
],
[
198,
199
],
[
201,
202
],
[
204,
205
],
[
207,
208
],
[
210,
211
],
[
237,
214
],
[
216,
217
],
[
219,
220
],
[
222,
223
],
[
225,
226
],
[
253,
228
],
[
228,
229
],
[
234,
235
],
[
237,
238
],
[
240,
241
],
[
249,
244
],
[
246,
247
],
[
249,
250
],
[
252,
253
]
] |
[
"DIV = 10**9 + 7\n\nN = int(input())\nT = [int(x) for x in input().split()]\nA = [int(x) for x in input().split()]\n\n\ndef get_range(a, b):\n if b > a:\n return b, b\n if b == a:\n return (1, b)\n\n\nleft = [(T[0], T[0])]\nright = [(A[-1], A[-1])]\nfor i in range(N - 1):\n a, b = T[i], T[i + 1]\n left.append(get_range(a, b))\n a, b = A[N - i - 1], A[N - i - 2]\n right.append(get_range(a, b))\nright = right[::-1]\n\n\nans = 1\nfor i in range(N):\n a1, b1 = left[i]\n a2, b2 = right[i]\n\n a = max(a1, a2)\n b = min(b1, b2)\n\n ans *= max((b - a + 1), 0)\n ans %= DIV\n\n\nprint(ans)",
"DIV = 10**9 + 7",
"DIV",
"10**9 + 7",
"10**9",
"10",
"9",
"7",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"int(x) for x in input().split()",
"for x in input().split()",
"x",
"input().split()",
"().split",
"()",
"input",
"split",
"for x in input().split()",
"int(x)",
"int",
"x",
"T = [int(x) for x in input().split()]",
"T",
"[int(x) for x in input().split()]",
"int(x) for x in input().split()",
"for x in input().split()",
"x",
"input().split()",
"().split",
"()",
"input",
"split",
"for x in input().split()",
"int(x)",
"int",
"x",
"A = [int(x) for x in input().split()]",
"A",
"[int(x) for x in input().split()]",
"def get_range(a, b):\n if b > a:\n return b, b\n if b == a:\n return (1, b)",
"get_range",
"if b > a:\n return b, b\n ",
"b > a",
"b",
"a",
"return b, b",
"return b, b",
"b",
"b",
"if b == a:\n return (1, b)",
"b == a",
"b",
"a",
"return (1, b)",
"(1, b)",
"1",
"b",
"a",
"a",
"b",
"b",
"left = [(T[0], T[0])]",
"left",
"[(T[0], T[0])]",
"(T[0], T[0])",
"T[0]",
"T",
"0",
"T[0]",
"T",
"0",
"right = [(A[-1], A[-1])]",
"right",
"[(A[-1], A[-1])]",
"(A[-1], A[-1])",
"A[-1]",
"A",
"-1",
"A[-1]",
"A",
"-1",
"for i in range(N - 1):\n a, b = T[i], T[i + 1]\n left.append(get_range(a, b))\n a, b = A[N - i - 1], A[N - i - 2]\n right.append(get_range(a, b))",
"i",
"range(N - 1)",
"range",
"N - 1",
"N",
"1",
"a, b = T[i], T[i + 1]",
"a",
"T[i]",
"T",
"i",
"b",
"T[i + 1]",
"T",
"i + 1",
"i",
"1",
"left.append(get_range(a, b))",
"left.append",
"left",
"append",
"get_range(a, b)",
"get_range",
"a",
"b",
"a, b = A[N - i - 1], A[N - i - 2]",
"a",
"A[N - i - 1]",
"A",
"N - i - 1",
"N - i",
"N",
"i",
"1",
"b",
"A[N - i - 2]",
"A",
"N - i - 2",
"N - i",
"N",
"i",
"2",
"right.append(get_range(a, b))",
"right.append",
"right",
"append",
"get_range(a, b)",
"get_range",
"a",
"b",
"right = right[::-1]",
"right",
"right[::-1]",
"right",
"::-1",
"-1",
"ans = 1",
"ans",
"1",
"for i in range(N):\n a1, b1 = left[i]\n a2, b2 = right[i]\n\n a = max(a1, a2)\n b = min(b1, b2)\n\n ans *= max((b - a + 1), 0)\n ans %= DIV",
"i",
"range(N)",
"range",
"N",
"a1, b1 = left[i]",
"a1",
"left[i]",
"left",
"i",
"b1",
"a2, b2 = right[i]",
"a2",
"right[i]",
"right",
"i",
"b2",
"a = max(a1, a2)",
"a",
"max(a1, a2)",
"max",
"a1",
"a2",
"b = min(b1, b2)",
"b",
"min(b1, b2)",
"min",
"b1",
"b2",
"ans *= max((b - a + 1), 0)",
"ans",
"max((b - a + 1), 0)",
"max",
"b - a + 1",
"b - a",
"b",
"a",
"1",
"0",
"ans %= DIV",
"ans",
"DIV",
"print(ans)",
"print",
"ans",
"a, b = A[N - i - 1], A[N - i - 2]",
"A[N - i - 1]",
"a",
"N = int(input())",
"int(input())",
"N",
"right = right[::-1]",
"right[::-1]",
"right",
"left = [(T[0], T[0])]",
"[(T[0], T[0])]",
"left",
"ans *= max((b - a + 1), 0)",
"max((b - a + 1), 0)",
"ans",
"b = min(b1, b2)",
"min(b1, b2)",
"b",
"A = [int(x) for x in input().split()]",
"[int(x) for x in input().split()]",
"A",
"b2 = right[i]",
"right[i]",
"b2",
"a = max(a1, a2)",
"max(a1, a2)",
"a",
"T = [int(x) for x in input().split()]",
"[int(x) for x in input().split()]",
"T",
"b = T[i], T[i + 1]",
"T[i + 1]",
"b",
"a, b = T[i], T[i + 1]",
"T[i]",
"a",
"ans %= DIV",
"DIV",
"ans",
"def get_range(a, b):\n if b > a:\n return b, b\n if b == a:\n return (1, b)",
"def get_range(a, b):\n if b > a:\n return b, b\n if b == a:\n return (1, b)",
"get_range",
"right = [(A[-1], A[-1])]",
"[(A[-1], A[-1])]",
"right",
"a2, b2 = right[i]",
"right[i]",
"a2",
"b = A[N - i - 1], A[N - i - 2]",
"A[N - i - 2]",
"b",
"b1 = left[i]",
"left[i]",
"b1",
"ans = 1",
"1",
"ans",
"a1, b1 = left[i]",
"left[i]",
"a1",
"DIV = 10**9 + 7",
"10**9 + 7",
"DIV"
] |
DIV = 10**9 + 7
N = int(input())
T = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
def get_range(a, b):
if b > a:
return b, b
if b == a:
return (1, b)
left = [(T[0], T[0])]
right = [(A[-1], A[-1])]
for i in range(N - 1):
a, b = T[i], T[i + 1]
left.append(get_range(a, b))
a, b = A[N - i - 1], A[N - i - 2]
right.append(get_range(a, b))
right = right[::-1]
ans = 1
for i in range(N):
a1, b1 = left[i]
a2, b2 = right[i]
a = max(a1, a2)
b = min(b1, b2)
ans *= max((b - a + 1), 0)
ans %= DIV
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
17,
0,
13,
17,
0,
13,
17,
0,
13,
17,
0,
13,
17,
28,
13,
13,
4,
13,
13,
14,
2,
13,
13,
0,
18,
13,
13,
13,
14,
40,
13,
13,
0,
18,
13,
13,
13,
0,
13,
13,
0,
13,
17,
28,
13,
13,
4,
13,
4,
13,
13,
0,
13,
2,
2,
13,
17,
13,
14,
2,
13,
13,
0,
18,
13,
13,
13,
14,
40,
13,
13,
0,
18,
13,
13,
13,
0,
13,
13,
14,
40,
4,
13,
13,
4,
13,
13,
4,
13,
17,
0,
13,
17,
28,
13,
13,
4,
18,
13,
13,
14,
40,
13,
13,
9,
14,
40,
13,
18,
13,
13,
0,
13,
17,
3,
14,
2,
2,
13,
13,
2,
13,
18,
13,
13,
0,
13,
17,
3,
28,
13,
13,
4,
18,
13,
13,
14,
40,
13,
13,
9,
14,
2,
13,
18,
13,
13,
0,
13,
17,
3,
14,
2,
13,
17,
0,
13,
17,
28,
13,
13,
4,
18,
13,
13,
14,
40,
13,
13,
9,
0,
13,
4,
13,
13,
18,
13,
13,
0,
13,
2,
2,
17,
17,
17,
4,
13,
13,
4,
13,
17,
10,
17,
13,
10,
4,
13,
10,
17,
13,
10,
17,
13,
10,
4,
13,
10,
17,
13,
10,
17,
13,
10,
17,
13,
10,
2,
13,
10,
17,
13,
10,
17,
13,
10,
17,
13,
10,
13,
13,
10,
17,
13,
10,
13,
13,
10,
4,
13,
10,
4,
13,
10,
17,
13,
10,
2,
13
] |
[
[
237,
2
],
[
270,
8
],
[
273,
20
],
[
246,
32
],
[
258,
35
],
[
264,
38
],
[
243,
41
],
[
234,
44
],
[
271,
51
],
[
235,
54
],
[
268,
54
],
[
60,
57
],
[
247,
58
],
[
247,
64
],
[
69,
66
],
[
259,
67
],
[
267,
71
],
[
255,
74
],
[
274,
83
],
[
249,
85
],
[
238,
88
],
[
256,
93
],
[
268,
93
],
[
235,
93
],
[
262,
93
],
[
99,
96
],
[
265,
97
],
[
250,
98
],
[
250,
102
],
[
265,
103
],
[
108,
105
],
[
244,
106
],
[
250,
107
],
[
261,
110
],
[
274,
116
],
[
271,
119
],
[
276,
124
],
[
247,
131
],
[
265,
136
],
[
265,
142
],
[
240,
145
],
[
244,
152
],
[
244,
156
],
[
231,
159
],
[
259,
167
],
[
265,
172
],
[
265,
178
],
[
252,
181
],
[
253,
186
],
[
232,
186
],
[
241,
186
],
[
277,
186
],
[
225,
189
],
[
259,
196
],
[
244,
201
],
[
228,
204
],
[
244,
209
],
[
279,
212
],
[
280,
220
],
[
229,
220
],
[
226,
220
],
[
225,
226
],
[
228,
229
],
[
231,
232
],
[
234,
235
],
[
237,
238
],
[
240,
241
],
[
243,
244
],
[
246,
247
],
[
249,
250
],
[
252,
253
],
[
255,
256
],
[
258,
259
],
[
261,
262
],
[
264,
265
],
[
267,
268
],
[
270,
271
],
[
273,
274
],
[
276,
277
],
[
279,
280
]
] |
[
"N = int(input())\nT = list(map(int, input().split()))\nA = list(map(int, input().split()))\n\nfixed_peek_t = {}\nunfixed_peek_t = {}\nfixed_peek_a = {}\nunfixed_peek_a = {}\n\nlp = 0\nfor idx, height in enumerate(T):\n if lp < height:\n fixed_peek_t[idx] = height\n elif idx not in fixed_peek_t:\n unfixed_peek_t[idx] = height\n lp = height\n\nlp = 0\nfor _idx, height in enumerate(reversed(A)):\n idx = N-1 - _idx\n if lp < height:\n fixed_peek_a[idx] = height\n elif idx not in fixed_peek_a:\n unfixed_peek_a[idx] = height\n lp = height\n\n# print(unfixed_peek_t)\n# print(fixed_peek_t)\n# print(unfixed_peek_a)\n# print(fixed_peek_a)\n\nif max(A) != max(T):\n print(0)\nelse:\n failflag = 0\n for k,v in fixed_peek_t.items():\n if k not in fixed_peek_a:\n continue\n if v != fixed_peek_a[k]:\n failflag = 1\n break\n if k in unfixed_peek_a and v > unfixed_peek_a[k]:\n failflag = 1\n break\n for k,v in unfixed_peek_t.items():\n if k not in fixed_peek_a:\n continue\n if v < fixed_peek_a[k]:\n failflag = 1\n break\n if failflag == 0:\n cnt = 1\n for k,v in unfixed_peek_t.items():\n if k not in unfixed_peek_a:\n continue\n cnt *= min(v, unfixed_peek_a[k])\n cnt %= 10**9 + 7\n\n print(cnt)\n else:\n print(0)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"T = list(map(int, input().split()))",
"T",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"A = list(map(int, input().split()))",
"A",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"fixed_peek_t = {}",
"fixed_peek_t",
"{}",
"unfixed_peek_t = {}",
"unfixed_peek_t",
"{}",
"fixed_peek_a = {}",
"fixed_peek_a",
"{}",
"unfixed_peek_a = {}",
"unfixed_peek_a",
"{}",
"lp = 0",
"lp",
"0",
"for idx, height in enumerate(T):\n if lp < height:\n fixed_peek_t[idx] = height\n elif idx not in fixed_peek_t:\n unfixed_peek_t[idx] = height\n lp = height",
"idx",
"height",
"enumerate(T)",
"enumerate",
"T",
"if lp < height:\n fixed_peek_t[idx] = height\n elif idx not in fixed_peek_t:\n unfixed_peek_t[idx] = height\n ",
"lp < height",
"lp",
"height",
"fixed_peek_t[idx] = height",
"fixed_peek_t[idx]",
"fixed_peek_t",
"idx",
"height",
"elif idx not in fixed_peek_t:\n unfixed_peek_t[idx] = height\n ",
"idx not in fixed_peek_t",
"idx",
"fixed_peek_t",
"unfixed_peek_t[idx] = height",
"unfixed_peek_t[idx]",
"unfixed_peek_t",
"idx",
"height",
"lp = height",
"lp",
"height",
"lp = 0",
"lp",
"0",
"for _idx, height in enumerate(reversed(A)):\n idx = N-1 - _idx\n if lp < height:\n fixed_peek_a[idx] = height\n elif idx not in fixed_peek_a:\n unfixed_peek_a[idx] = height\n lp = height\n\n# print(unfixed_peek_t)\n# print(fixed_peek_t)\n# print(unfixed_peek_a)\n# print(fixed_peek_a)",
"_idx",
"height",
"enumerate(reversed(A))",
"enumerate",
"reversed(A)",
"reversed",
"A",
"idx = N-1 - _idx",
"idx",
"N-1 - _idx",
"N-1",
"N",
"1",
"_idx",
"if lp < height:\n fixed_peek_a[idx] = height\n elif idx not in fixed_peek_a:\n unfixed_peek_a[idx] = height\n ",
"lp < height",
"lp",
"height",
"fixed_peek_a[idx] = height",
"fixed_peek_a[idx]",
"fixed_peek_a",
"idx",
"height",
"elif idx not in fixed_peek_a:\n unfixed_peek_a[idx] = height\n ",
"idx not in fixed_peek_a",
"idx",
"fixed_peek_a",
"unfixed_peek_a[idx] = height",
"unfixed_peek_a[idx]",
"unfixed_peek_a",
"idx",
"height",
"lp = height",
"lp",
"height",
"if max(A) != max(T):\n print(0)\nelse:\n failflag = 0\n for k,v in fixed_peek_t.items():\n if k not in fixed_peek_a:\n continue\n if v != fixed_peek_a[k]:\n failflag = 1\n break\n if k in unfixed_peek_a and v > unfixed_peek_a[k]:\n failflag = 1\n break\n for k,v in unfixed_peek_t.items():\n if k not in fixed_peek_a:\n continue\n if v < fixed_peek_a[k]:\n failflag = 1\n break\n if failflag == 0:\n cnt = 1\n for k,v in unfixed_peek_t.items():\n if k not in unfixed_peek_a:\n continue\n cnt *= min(v, unfixed_peek_a[k])\n cnt %= 10**9 + 7\n\n print(cnt)\n else:\n print(0)",
"max(A) != max(T)",
"max(A)",
"max",
"A",
"max(T)",
"max",
"T",
"print(0)",
"print",
"0",
"failflag = 0",
"failflag",
"0",
"for k,v in fixed_peek_t.items():\n if k not in fixed_peek_a:\n continue\n if v != fixed_peek_a[k]:\n failflag = 1\n break\n if k in unfixed_peek_a and v > unfixed_peek_a[k]:\n failflag = 1\n break\n ",
"k",
"v",
"fixed_peek_t.items()",
"fixed_peek_t.items",
"fixed_peek_t",
"items",
"if k not in fixed_peek_a:\n continue\n ",
"k not in fixed_peek_a",
"k",
"fixed_peek_a",
"continue",
"if v != fixed_peek_a[k]:\n failflag = 1\n break\n ",
"v != fixed_peek_a[k]",
"v",
"fixed_peek_a[k]",
"fixed_peek_a",
"k",
"failflag = 1",
"failflag",
"1",
"break",
"if k in unfixed_peek_a and v > unfixed_peek_a[k]:\n failflag = 1\n break\n ",
"k in unfixed_peek_a and v > unfixed_peek_a[k]",
"k in unfixed_peek_a",
"k",
"unfixed_peek_a",
"v > unfixed_peek_a[k]",
"v",
"unfixed_peek_a[k]",
"unfixed_peek_a",
"k",
"failflag = 1",
"failflag",
"1",
"break",
"for k,v in unfixed_peek_t.items():\n if k not in fixed_peek_a:\n continue\n if v < fixed_peek_a[k]:\n failflag = 1\n break\n ",
"k",
"v",
"unfixed_peek_t.items()",
"unfixed_peek_t.items",
"unfixed_peek_t",
"items",
"if k not in fixed_peek_a:\n continue\n ",
"k not in fixed_peek_a",
"k",
"fixed_peek_a",
"continue",
"if v < fixed_peek_a[k]:\n failflag = 1\n break\n ",
"v < fixed_peek_a[k]",
"v",
"fixed_peek_a[k]",
"fixed_peek_a",
"k",
"failflag = 1",
"failflag",
"1",
"break",
"if failflag == 0:\n cnt = 1\n for k,v in unfixed_peek_t.items():\n if k not in unfixed_peek_a:\n continue\n cnt *= min(v, unfixed_peek_a[k])\n cnt %= 10**9 + 7\n\n print(cnt)\n else:\n print(0)",
"failflag == 0",
"failflag",
"0",
"cnt = 1",
"cnt",
"1",
"for k,v in unfixed_peek_t.items():\n if k not in unfixed_peek_a:\n continue\n cnt *= min(v, unfixed_peek_a[k])\n cnt %= 10**9 + 7\n\n ",
"k",
"v",
"unfixed_peek_t.items()",
"unfixed_peek_t.items",
"unfixed_peek_t",
"items",
"if k not in unfixed_peek_a:\n continue\n ",
"k not in unfixed_peek_a",
"k",
"unfixed_peek_a",
"continue",
"cnt *= min(v, unfixed_peek_a[k])",
"cnt",
"min(v, unfixed_peek_a[k])",
"min",
"v",
"unfixed_peek_a[k]",
"unfixed_peek_a",
"k",
"cnt %= 10**9 + 7",
"cnt",
"10**9 + 7",
"10**9",
"10",
"9",
"7",
"print(cnt)",
"print",
"cnt",
"print(0)",
"print",
"0",
"cnt = 1",
"1",
"cnt",
"cnt *= min(v, unfixed_peek_a[k])",
"min(v, unfixed_peek_a[k])",
"cnt",
"failflag = 1",
"1",
"failflag",
"lp = 0",
"0",
"lp",
"N = int(input())",
"int(input())",
"N",
"failflag = 1",
"1",
"failflag",
"unfixed_peek_a = {}",
"{}",
"unfixed_peek_a",
"fixed_peek_t = {}",
"{}",
"fixed_peek_t",
"idx = N-1 - _idx",
"N-1 - _idx",
"idx",
"failflag = 1",
"1",
"failflag",
"lp = 0",
"0",
"lp",
"unfixed_peek_t = {}",
"{}",
"unfixed_peek_t",
"lp = height",
"height",
"lp",
"fixed_peek_a = {}",
"{}",
"fixed_peek_a",
"lp = height",
"height",
"lp",
"T = list(map(int, input().split()))",
"list(map(int, input().split()))",
"T",
"A = list(map(int, input().split()))",
"list(map(int, input().split()))",
"A",
"failflag = 0",
"0",
"failflag",
"cnt %= 10**9 + 7",
"10**9 + 7",
"cnt"
] |
N = int(input())
T = list(map(int, input().split()))
A = list(map(int, input().split()))
fixed_peek_t = {}
unfixed_peek_t = {}
fixed_peek_a = {}
unfixed_peek_a = {}
lp = 0
for idx, height in enumerate(T):
if lp < height:
fixed_peek_t[idx] = height
elif idx not in fixed_peek_t:
unfixed_peek_t[idx] = height
lp = height
lp = 0
for _idx, height in enumerate(reversed(A)):
idx = N-1 - _idx
if lp < height:
fixed_peek_a[idx] = height
elif idx not in fixed_peek_a:
unfixed_peek_a[idx] = height
lp = height
# print(unfixed_peek_t)
# print(fixed_peek_t)
# print(unfixed_peek_a)
# print(fixed_peek_a)
if max(A) != max(T):
print(0)
else:
failflag = 0
for k,v in fixed_peek_t.items():
if k not in fixed_peek_a:
continue
if v != fixed_peek_a[k]:
failflag = 1
break
if k in unfixed_peek_a and v > unfixed_peek_a[k]:
failflag = 1
break
for k,v in unfixed_peek_t.items():
if k not in fixed_peek_a:
continue
if v < fixed_peek_a[k]:
failflag = 1
break
if failflag == 0:
cnt = 1
for k,v in unfixed_peek_t.items():
if k not in unfixed_peek_a:
continue
cnt *= min(v, unfixed_peek_a[k])
cnt %= 10**9 + 7
print(cnt)
else:
print(0)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
2,
39,
17,
13,
0,
13,
2,
39,
17,
13,
0,
13,
2,
39,
17,
13,
0,
18,
13,
17,
18,
13,
17,
0,
18,
13,
17,
18,
13,
17,
28,
13,
4,
13,
17,
13,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
18,
13,
13,
18,
13,
13,
28,
13,
4,
13,
2,
13,
17,
17,
17,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
18,
13,
13,
18,
13,
13,
0,
13,
17,
0,
13,
2,
39,
17,
13,
28,
13,
4,
13,
13,
14,
2,
2,
40,
18,
13,
13,
18,
13,
13,
40,
18,
13,
13,
17,
40,
18,
13,
13,
17,
4,
13,
17,
4,
13,
14,
2,
2,
18,
13,
13,
17,
2,
18,
13,
13,
17,
0,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
13,
2,
2,
17,
17,
17,
0,
18,
13,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
4,
13,
13,
18,
13,
13,
14,
40,
13,
18,
13,
13,
4,
13,
17,
4,
13,
0,
13,
17,
28,
13,
4,
13,
2,
13,
17,
17,
17,
0,
13,
4,
13,
13,
18,
13,
13,
14,
40,
13,
18,
13,
13,
4,
13,
17,
4,
13,
4,
13,
13,
10,
2,
13,
10,
2,
13,
10,
17,
13,
10,
4,
13,
10,
2,
13,
10,
2,
13,
10,
4,
13,
10,
4,
13,
10,
4,
13,
10,
2,
13,
10,
4,
13,
10,
4,
13,
10,
17,
13,
10,
17,
13
] |
[
[
278,
2
],
[
287,
8
],
[
284,
20
],
[
281,
32
],
[
279,
36
],
[
257,
38
],
[
279,
42
],
[
266,
44
],
[
279,
48
],
[
53,
50
],
[
282,
51
],
[
288,
54
],
[
60,
57
],
[
258,
58
],
[
285,
61
],
[
65,
64
],
[
279,
68
],
[
288,
72
],
[
64,
73
],
[
288,
75
],
[
64,
77
],
[
83,
80
],
[
282,
81
],
[
64,
82
],
[
288,
84
],
[
64,
85
],
[
88,
87
],
[
279,
91
],
[
285,
98
],
[
87,
99
],
[
285,
101
],
[
87,
103
],
[
109,
106
],
[
258,
107
],
[
87,
108
],
[
285,
110
],
[
87,
111
],
[
293,
113
],
[
269,
116
],
[
279,
120
],
[
123,
122
],
[
279,
125
],
[
80,
130
],
[
282,
131
],
[
122,
132
],
[
106,
133
],
[
258,
134
],
[
122,
135
],
[
80,
137
],
[
282,
138
],
[
122,
139
],
[
106,
142
],
[
258,
143
],
[
122,
144
],
[
80,
154
],
[
282,
155
],
[
122,
156
],
[
106,
159
],
[
258,
160
],
[
122,
161
],
[
272,
164
],
[
288,
168
],
[
122,
169
],
[
285,
171
],
[
122,
172
],
[
254,
174
],
[
184,
181
],
[
270,
182
],
[
267,
182
],
[
122,
183
],
[
80,
186
],
[
282,
187
],
[
122,
188
],
[
106,
189
],
[
258,
190
],
[
122,
191
],
[
290,
193
],
[
197,
196
],
[
279,
199
],
[
275,
201
],
[
291,
204
],
[
276,
204
],
[
181,
205
],
[
270,
206
],
[
267,
206
],
[
196,
207
],
[
276,
210
],
[
291,
210
],
[
288,
212
],
[
196,
213
],
[
260,
220
],
[
224,
223
],
[
279,
227
],
[
263,
232
],
[
261,
235
],
[
276,
235
],
[
291,
235
],
[
264,
235
],
[
181,
236
],
[
270,
237
],
[
267,
237
],
[
223,
238
],
[
264,
241
],
[
261,
241
],
[
276,
241
],
[
291,
241
],
[
285,
243
],
[
223,
244
],
[
255,
252
],
[
273,
252
],
[
294,
252
],
[
254,
255
],
[
257,
258
],
[
260,
261
],
[
263,
264
],
[
266,
267
],
[
269,
270
],
[
272,
273
],
[
275,
276
],
[
278,
279
],
[
281,
282
],
[
284,
285
],
[
287,
288
],
[
290,
291
],
[
293,
294
]
] |
[
"n = int(input())\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\nai = [-1] * n\nbi = [-1] * n\nr = [-1] * n\nai[0]=a[0]\nbi[-1]=b[-1]\nfor i in range(1,n):\n if a[i] > a[i-1]:\n ai[i] = a[i]\nfor i in range(n-2,-1,-1):\n if b[i] > b[i+1]:\n bi[i] = b[i]\nret = 1\nr = [0] * n\nfor i in range(n):\n if ai[i]!=bi[i] and ai[i]!=-1 and bi[i]!=-1:\n print(0)\n exit()\n elif ai[i]==-1 and bi[i]==-1:\n ret *= min(a[i], b[i])\n ret %= 10**9+7\n else:\n r[i]=max(ai[i], bi[i])\nx = 0\nfor i in range(n):\n x = max(x, r[i])\n if x!=a[i]:\n print(0)\n exit()\nx = 0\nfor i in range(n-1, -1, -1):\n x = max(x, r[i])\n if x!=b[i]:\n print(0)\n exit()\nprint(ret)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"a = list(map(int,input().split()))",
"a",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"b = list(map(int,input().split()))",
"b",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"ai = [-1] * n",
"ai",
"[-1] * n",
"[-1]",
"-1",
"n",
"bi = [-1] * n",
"bi",
"[-1] * n",
"[-1]",
"-1",
"n",
"r = [-1] * n",
"r",
"[-1] * n",
"[-1]",
"-1",
"n",
"ai[0]=a[0]",
"ai[0]",
"ai",
"0",
"a[0]",
"a",
"0",
"bi[-1]=b[-1]",
"bi[-1]",
"bi",
"-1",
"b[-1]",
"b",
"-1",
"for i in range(1,n):\n if a[i] > a[i-1]:\n ai[i] = a[i]",
"i",
"range(1,n)",
"range",
"1",
"n",
"if a[i] > a[i-1]:\n ai[i] = a[i]",
"a[i] > a[i-1]",
"a[i]",
"a",
"i",
"a[i-1]",
"a",
"i-1",
"i",
"1",
"ai[i] = a[i]",
"ai[i]",
"ai",
"i",
"a[i]",
"a",
"i",
"for i in range(n-2,-1,-1):\n if b[i] > b[i+1]:\n bi[i] = b[i]",
"i",
"range(n-2,-1,-1)",
"range",
"n-2",
"n",
"2",
"-1",
"-1",
"if b[i] > b[i+1]:\n bi[i] = b[i]",
"b[i] > b[i+1]",
"b[i]",
"b",
"i",
"b[i+1]",
"b",
"i+1",
"i",
"1",
"bi[i] = b[i]",
"bi[i]",
"bi",
"i",
"b[i]",
"b",
"i",
"ret = 1",
"ret",
"1",
"r = [0] * n",
"r",
"[0] * n",
"[0]",
"0",
"n",
"for i in range(n):\n if ai[i]!=bi[i] and ai[i]!=-1 and bi[i]!=-1:\n print(0)\n exit()\n elif ai[i]==-1 and bi[i]==-1:\n ret *= min(a[i], b[i])\n ret %= 10**9+7\n else:\n r[i]=max(ai[i], bi[i])",
"i",
"range(n)",
"range",
"n",
"if ai[i]!=bi[i] and ai[i]!=-1 and bi[i]!=-1:\n print(0)\n exit()\n elif ai[i]==-1 and bi[i]==-1:\n ret *= min(a[i], b[i])\n ret %= 10**9+7\n else:\n r[i]=max(ai[i], bi[i])",
"ai[i]!=bi[i] and ai[i]!=-1 and bi[i]!=-1",
"ai[i]!=bi[i] and ai[i]!=-1",
"ai[i]!=bi[i]",
"ai[i]",
"ai",
"i",
"bi[i]",
"bi",
"i",
"ai[i]!=-1",
"ai[i]",
"ai",
"i",
"-1",
"bi[i]!=-1",
"bi[i]",
"bi",
"i",
"-1",
"print(0)",
"print",
"0",
"exit()",
"exit",
"elif ai[i]==-1 and bi[i]==-1:\n ret *= min(a[i], b[i])\n ret %= 10**9+7\n ",
"ai[i]==-1 and bi[i]==-1",
"ai[i]==-1",
"ai[i]",
"ai",
"i",
"-1",
"bi[i]==-1",
"bi[i]",
"bi",
"i",
"-1",
"ret *= min(a[i], b[i])",
"ret",
"min(a[i], b[i])",
"min",
"a[i]",
"a",
"i",
"b[i]",
"b",
"i",
"ret %= 10**9+7",
"ret",
"10**9+7",
"10**9",
"10",
"9",
"7",
"r[i]=max(ai[i], bi[i])",
"r[i]",
"r",
"i",
"max(ai[i], bi[i])",
"max",
"ai[i]",
"ai",
"i",
"bi[i]",
"bi",
"i",
"x = 0",
"x",
"0",
"for i in range(n):\n x = max(x, r[i])\n if x!=a[i]:\n print(0)\n exit()",
"i",
"range(n)",
"range",
"n",
"x = max(x, r[i])",
"x",
"max(x, r[i])",
"max",
"x",
"r[i]",
"r",
"i",
"if x!=a[i]:\n print(0)\n exit()",
"x!=a[i]",
"x",
"a[i]",
"a",
"i",
"print(0)",
"print",
"0",
"exit()",
"exit",
"x = 0",
"x",
"0",
"for i in range(n-1, -1, -1):\n x = max(x, r[i])\n if x!=b[i]:\n print(0)\n exit()",
"i",
"range(n-1, -1, -1)",
"range",
"n-1",
"n",
"1",
"-1",
"-1",
"x = max(x, r[i])",
"x",
"max(x, r[i])",
"max",
"x",
"r[i]",
"r",
"i",
"if x!=b[i]:\n print(0)\n exit()",
"x!=b[i]",
"x",
"b[i]",
"b",
"i",
"print(0)",
"print",
"0",
"exit()",
"exit",
"print(ret)",
"print",
"ret",
"ret %= 10**9+7",
"10**9+7",
"ret",
"bi = [-1] * n",
"[-1] * n",
"bi",
"x = 0",
"0",
"x",
"x = max(x, r[i])",
"max(x, r[i])",
"x",
"r = [-1] * n",
"[-1] * n",
"r",
"r = [0] * n",
"[0] * n",
"r",
"ret *= min(a[i], b[i])",
"min(a[i], b[i])",
"ret",
"x = max(x, r[i])",
"max(x, r[i])",
"x",
"n = int(input())",
"int(input())",
"n",
"ai = [-1] * n",
"[-1] * n",
"ai",
"b = list(map(int,input().split()))",
"list(map(int,input().split()))",
"b",
"a = list(map(int,input().split()))",
"list(map(int,input().split()))",
"a",
"x = 0",
"0",
"x",
"ret = 1",
"1",
"ret"
] |
n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
ai = [-1] * n
bi = [-1] * n
r = [-1] * n
ai[0]=a[0]
bi[-1]=b[-1]
for i in range(1,n):
if a[i] > a[i-1]:
ai[i] = a[i]
for i in range(n-2,-1,-1):
if b[i] > b[i+1]:
bi[i] = b[i]
ret = 1
r = [0] * n
for i in range(n):
if ai[i]!=bi[i] and ai[i]!=-1 and bi[i]!=-1:
print(0)
exit()
elif ai[i]==-1 and bi[i]==-1:
ret *= min(a[i], b[i])
ret %= 10**9+7
else:
r[i]=max(ai[i], bi[i])
x = 0
for i in range(n):
x = max(x, r[i])
if x!=a[i]:
print(0)
exit()
x = 0
for i in range(n-1, -1, -1):
x = max(x, r[i])
if x!=b[i]:
print(0)
exit()
print(ret)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
2,
17,
17,
0,
13,
2,
39,
17,
13,
0,
18,
13,
17,
17,
0,
13,
4,
13,
13,
0,
13,
17,
13,
17,
0,
13,
4,
13,
13,
28,
13,
4,
13,
13,
14,
2,
13,
18,
13,
13,
0,
13,
13,
3,
28,
13,
4,
13,
2,
13,
17,
17,
17,
14,
2,
13,
18,
13,
13,
0,
13,
13,
3,
14,
2,
13,
13,
4,
13,
17,
4,
13,
17,
14,
40,
18,
13,
17,
18,
13,
17,
4,
13,
17,
4,
13,
17,
28,
13,
4,
13,
17,
2,
13,
17,
14,
2,
2,
18,
13,
2,
13,
17,
18,
13,
13,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
18,
13,
13,
18,
13,
2,
13,
17,
0,
18,
13,
13,
2,
2,
18,
13,
2,
13,
17,
4,
13,
18,
13,
13,
18,
13,
13,
13,
4,
13,
18,
13,
2,
13,
17,
10,
4,
13,
10,
17,
13,
10,
4,
13,
10,
13,
13,
10,
4,
13,
10,
4,
13,
10,
4,
13,
10,
13,
13,
10,
2,
13,
10,
4,
13,
10,
17,
13
] |
[
[
205,
2
],
[
193,
8
],
[
199,
20
],
[
202,
32
],
[
211,
39
],
[
206,
43
],
[
48,
45
],
[
212,
46
],
[
214,
50
],
[
194,
53
],
[
190,
55
],
[
217,
57
],
[
187,
60
],
[
200,
63
],
[
66,
65
],
[
206,
68
],
[
215,
71
],
[
194,
73
],
[
65,
74
],
[
208,
76
],
[
65,
77
],
[
81,
80
],
[
206,
84
],
[
188,
90
],
[
200,
92
],
[
80,
93
],
[
196,
95
],
[
80,
96
],
[
209,
100
],
[
191,
100
],
[
197,
101
],
[
218,
101
],
[
194,
111
],
[
200,
114
],
[
124,
123
],
[
206,
128
],
[
194,
134
],
[
123,
136
],
[
194,
139
],
[
123,
140
],
[
200,
143
],
[
123,
144
],
[
200,
146
],
[
123,
148
],
[
154,
151
],
[
212,
152
],
[
123,
153
],
[
212,
155
],
[
123,
157
],
[
163,
160
],
[
212,
161
],
[
123,
162
],
[
212,
166
],
[
123,
168
],
[
194,
173
],
[
123,
174
],
[
200,
176
],
[
123,
177
],
[
203,
178
],
[
212,
182
],
[
206,
184
],
[
187,
188
],
[
190,
191
],
[
193,
194
],
[
80,
196
],
[
196,
197
],
[
199,
200
],
[
202,
203
],
[
205,
206
],
[
65,
208
],
[
208,
209
],
[
211,
212
],
[
214,
215
],
[
217,
218
]
] |
[
"N = int(input())\nA = list(map(int, input().split()))\nT = list(map(int, input().split()))\n\nmod = int(1e9+7)\n\ndp = [0] * (N)\ndp[0] = 1\n# dp[i] : i番目までの通り数\n\nAmax = max(A)\nAleft, Tright = -1, -1\nTmax = max(T)\nfor i in range(N):\n if Amax == A[i]:\n Aleft = i\n break\nfor i in range(N-1,-1,-1):\n if Tmax == T[i]:\n Tright = i\n break\nif Aleft > Tright:\n print(0)\n exit(0)\nif A[-1] != T[0]:\n print(0)\n exit(0)\n \nfor i in range(1,N-1):\n if A[i-1] < A[i] or T[i] > T[i+1]:\n dp[i] = dp[i-1]\n else:\n dp[i] = dp[i-1] * min(A[i], T[i]) % mod\n \nprint(dp[N-2])",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"A = list(map(int, input().split()))",
"A",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"T = list(map(int, input().split()))",
"T",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"mod = int(1e9+7)",
"mod",
"int(1e9+7)",
"int",
"1e9+7",
"1e9",
"7",
"dp = [0] * (N)",
"dp",
"[0] * (N)",
"[0]",
"0",
"N",
"dp[0] = 1",
"dp[0]",
"dp",
"0",
"1",
"Amax = max(A)",
"Amax",
"max(A)",
"max",
"A",
"Aleft, Tright = -1, -1",
"Aleft",
"-1",
"Tright",
"-1",
"Tmax = max(T)",
"Tmax",
"max(T)",
"max",
"T",
"for i in range(N):\n if Amax == A[i]:\n Aleft = i\n break",
"i",
"range(N)",
"range",
"N",
"if Amax == A[i]:\n Aleft = i\n break",
"Amax == A[i]",
"Amax",
"A[i]",
"A",
"i",
"Aleft = i",
"Aleft",
"i",
"break",
"for i in range(N-1,-1,-1):\n if Tmax == T[i]:\n Tright = i\n break",
"i",
"range(N-1,-1,-1)",
"range",
"N-1",
"N",
"1",
"-1",
"-1",
"if Tmax == T[i]:\n Tright = i\n break",
"Tmax == T[i]",
"Tmax",
"T[i]",
"T",
"i",
"Tright = i",
"Tright",
"i",
"break",
"if Aleft > Tright:\n print(0)\n exit(0)",
"Aleft > Tright",
"Aleft",
"Tright",
"print(0)",
"print",
"0",
"exit(0)",
"exit",
"0",
"if A[-1] != T[0]:\n print(0)\n exit(0)\n ",
"A[-1] != T[0]",
"A[-1]",
"A",
"-1",
"T[0]",
"T",
"0",
"print(0)",
"print",
"0",
"exit(0)",
"exit",
"0",
"for i in range(1,N-1):\n if A[i-1] < A[i] or T[i] > T[i+1]:\n dp[i] = dp[i-1]\n else:\n dp[i] = dp[i-1] * min(A[i], T[i]) % mod\n ",
"i",
"range(1,N-1)",
"range",
"1",
"N-1",
"N",
"1",
"if A[i-1] < A[i] or T[i] > T[i+1]:\n dp[i] = dp[i-1]\n else:\n dp[i] = dp[i-1] * min(A[i], T[i]) % mod\n ",
"A[i-1] < A[i] or T[i] > T[i+1]",
"A[i-1] < A[i]",
"A[i-1]",
"A",
"i-1",
"i",
"1",
"A[i]",
"A",
"i",
"T[i] > T[i+1]",
"T[i]",
"T",
"i",
"T[i+1]",
"T",
"i+1",
"i",
"1",
"dp[i] = dp[i-1]",
"dp[i]",
"dp",
"i",
"dp[i-1]",
"dp",
"i-1",
"i",
"1",
"dp[i] = dp[i-1] * min(A[i], T[i]) % mod",
"dp[i]",
"dp",
"i",
"dp[i-1] * min(A[i], T[i]) % mod",
"dp[i-1] * min(A[i], T[i])",
"dp[i-1]",
"dp",
"i-1",
"i",
"1",
"min(A[i], T[i])",
"min",
"A[i]",
"A",
"i",
"T[i]",
"T",
"i",
"mod",
"print(dp[N-2])",
"print",
"dp[N-2]",
"dp",
"N-2",
"N",
"2",
"Tmax = max(T)",
"max(T)",
"Tmax",
"Aleft, Tright = -1, -1",
"-1",
"Aleft",
"A = list(map(int, input().split()))",
"list(map(int, input().split()))",
"A",
"Tright = i",
"i",
"Tright",
"T = list(map(int, input().split()))",
"list(map(int, input().split()))",
"T",
"mod = int(1e9+7)",
"int(1e9+7)",
"mod",
"N = int(input())",
"int(input())",
"N",
"Aleft = i",
"i",
"Aleft",
"dp = [0] * (N)",
"[0] * (N)",
"dp",
"Amax = max(A)",
"max(A)",
"Amax",
"Tright = -1, -1",
"-1",
"Tright"
] |
N = int(input())
A = list(map(int, input().split()))
T = list(map(int, input().split()))
mod = int(1e9+7)
dp = [0] * (N)
dp[0] = 1
# dp[i] : i番目までの通り数
Amax = max(A)
Aleft, Tright = -1, -1
Tmax = max(T)
for i in range(N):
if Amax == A[i]:
Aleft = i
break
for i in range(N-1,-1,-1):
if Tmax == T[i]:
Tright = i
break
if Aleft > Tright:
print(0)
exit(0)
if A[-1] != T[0]:
print(0)
exit(0)
for i in range(1,N-1):
if A[i-1] < A[i] or T[i] > T[i+1]:
dp[i] = dp[i-1]
else:
dp[i] = dp[i-1] * min(A[i], T[i]) % mod
print(dp[N-2])
|
[
7,
15,
13,
0,
13,
18,
18,
13,
13,
13,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
2,
2,
17,
17,
17,
41,
28,
13,
4,
13,
13,
4,
2,
17,
17,
0,
13,
13,
0,
18,
13,
17,
18,
13,
17,
0,
18,
13,
17,
18,
13,
17,
0,
13,
4,
13,
4,
18,
13,
13,
17,
4,
18,
13,
13,
2,
13,
17,
14,
2,
2,
18,
13,
17,
18,
13,
17,
2,
18,
13,
17,
18,
13,
17,
4,
13,
17,
4,
13,
17,
14,
40,
18,
13,
17,
18,
13,
17,
4,
13,
17,
4,
13,
17,
28,
13,
4,
13,
2,
13,
17,
14,
2,
18,
13,
2,
13,
17,
18,
13,
13,
14,
2,
2,
18,
13,
2,
13,
17,
17,
2,
18,
13,
2,
13,
17,
4,
13,
18,
13,
2,
13,
17,
4,
13,
17,
4,
13,
17,
4,
18,
13,
13,
2,
13,
17,
0,
18,
13,
2,
13,
17,
18,
13,
2,
13,
17,
28,
13,
4,
13,
2,
13,
17,
17,
17,
14,
2,
18,
13,
2,
13,
17,
18,
13,
13,
14,
2,
2,
18,
13,
2,
13,
17,
17,
2,
18,
13,
2,
13,
17,
4,
13,
18,
13,
2,
13,
17,
4,
13,
17,
4,
13,
17,
4,
18,
13,
13,
2,
13,
17,
0,
18,
13,
2,
13,
17,
18,
13,
2,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
14,
2,
13,
13,
0,
13,
18,
13,
13,
0,
13,
13,
4,
13,
13,
10,
17,
13,
10,
18,
13,
10,
13,
13,
10,
4,
13,
10,
4,
13,
10,
2,
13,
10,
18,
13,
10,
13,
13,
10,
4,
13,
10,
4,
13
] |
[
[
296,
4
],
[
290,
11
],
[
297,
15
],
[
302,
17
],
[
297,
26
],
[
305,
29
],
[
297,
38
],
[
293,
41
],
[
50,
49
],
[
291,
52
],
[
299,
58
],
[
64,
61
],
[
300,
62
],
[
303,
65
],
[
71,
68
],
[
300,
69
],
[
306,
72
],
[
287,
75
],
[
288,
80
],
[
288,
85
],
[
291,
88
],
[
303,
94
],
[
306,
97
],
[
303,
101
],
[
306,
104
],
[
303,
115
],
[
306,
118
],
[
128,
127
],
[
291,
131
],
[
303,
136
],
[
127,
138
],
[
303,
141
],
[
127,
142
],
[
300,
147
],
[
127,
149
],
[
300,
154
],
[
127,
156
],
[
303,
161
],
[
127,
163
],
[
288,
173
],
[
127,
176
],
[
184,
179
],
[
300,
180
],
[
127,
182
],
[
303,
185
],
[
127,
187
],
[
191,
190
],
[
291,
194
],
[
306,
201
],
[
190,
203
],
[
306,
206
],
[
190,
207
],
[
300,
212
],
[
190,
214
],
[
300,
219
],
[
190,
221
],
[
306,
226
],
[
190,
228
],
[
288,
238
],
[
190,
241
],
[
249,
244
],
[
300,
245
],
[
190,
247
],
[
306,
250
],
[
190,
252
],
[
278,
255
],
[
259,
258
],
[
291,
261
],
[
258,
264
],
[
288,
265
],
[
281,
267
],
[
300,
269
],
[
258,
270
],
[
284,
272
],
[
294,
273
],
[
285,
276
],
[
282,
276
],
[
279,
276
],
[
278,
279
],
[
281,
282
],
[
294,
284
],
[
284,
285
],
[
287,
288
],
[
290,
291
],
[
293,
294
],
[
296,
297
],
[
299,
300
],
[
302,
303
],
[
305,
306
]
] |
[
"import sys\ninput = sys.stdin.readline\nN = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nmod = 10 ** 9 + 7\nt = [10 ** 10 for _ in range(N)]\nt[0] = a[0]\nt[-1] = b[-1]\ns = set()\ns.add(0)\ns.add(N - 1)\nif a[0] > b[0] or (a[-1] < b[-1]):\n print(0)\n exit(0)\nif a[-1] != b[0]:\n print(0)\n exit(0)\nfor i in range(N - 1):\n if a[i + 1] > a[i]:\n if t[i + 1] > 0 and (t[i + 1] in range(a[i + 1])):\n print(0)\n exit(0)\n s.add(i + 1)\n t[i + 1] = a[i + 1]\n else: t[i + 1] = min(t[i + 1], t[i])\n#print(t)\nfor i in range(N - 1, 0, -1):\n if b[i - 1] > b[i]:\n if t[i - 1] > 0 and (t[i - 1] in range(b[i - 1])):\n print(0)\n exit(0)\n s.add(i - 1)\n t[i - 1] = b[i - 1]\n else: t[i - 1] = min(t[i - 1], t[i])\n#print(t)\nres = 1\nfor i in range(N):\n if i in s: continue\n res *= t[i]\n res %= mod\nprint(res)",
"import sys",
"sys",
"input = sys.stdin.readline",
"input",
"sys.stdin.readline",
"sys.stdin",
"sys",
"stdin",
"readline",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"a = list(map(int, input().split()))",
"a",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"b = list(map(int, input().split()))",
"b",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"mod = 10 ** 9 + 7",
"mod",
"10 ** 9 + 7",
"10 ** 9",
"10",
"9",
"7",
"10 ** 10 for _ in range(N)",
"for _ in range(N)",
"_",
"range(N)",
"range",
"N",
"for _ in range(N)",
"10 ** 10",
"10",
"10",
"t = [10 ** 10 for _ in range(N)]",
"t",
"[10 ** 10 for _ in range(N)]",
"t[0] = a[0]",
"t[0]",
"t",
"0",
"a[0]",
"a",
"0",
"t[-1] = b[-1]",
"t[-1]",
"t",
"-1",
"b[-1]",
"b",
"-1",
"s = set()",
"s",
"set()",
"set",
"s.add(0)",
"s.add",
"s",
"add",
"0",
"s.add(N - 1)",
"s.add",
"s",
"add",
"N - 1",
"N",
"1",
"if a[0] > b[0] or (a[-1] < b[-1]):\n print(0)\n exit(0)",
"a[0] > b[0] or (a[-1] < b[-1])",
"a[0] > b[0]",
"a[0]",
"a",
"0",
"b[0]",
"b",
"0",
"a[-1] < b[-1]",
"a[-1]",
"a",
"-1",
"b[-1]",
"b",
"-1",
"print(0)",
"print",
"0",
"exit(0)",
"exit",
"0",
"if a[-1] != b[0]:\n print(0)\n exit(0)",
"a[-1] != b[0]",
"a[-1]",
"a",
"-1",
"b[0]",
"b",
"0",
"print(0)",
"print",
"0",
"exit(0)",
"exit",
"0",
"for i in range(N - 1):\n if a[i + 1] > a[i]:\n if t[i + 1] > 0 and (t[i + 1] in range(a[i + 1])):\n print(0)\n exit(0)\n s.add(i + 1)\n t[i + 1] = a[i + 1]\n else: t[i + 1] = min(t[i + 1], t[i])\n#print(t)",
"i",
"range(N - 1)",
"range",
"N - 1",
"N",
"1",
"if a[i + 1] > a[i]:\n if t[i + 1] > 0 and (t[i + 1] in range(a[i + 1])):\n print(0)\n exit(0)\n s.add(i + 1)\n t[i + 1] = a[i + 1]\n else: t[i + 1] = min(t[i + 1], t[i])\n#print(t)",
"a[i + 1] > a[i]",
"a[i + 1]",
"a",
"i + 1",
"i",
"1",
"a[i]",
"a",
"i",
"if t[i + 1] > 0 and (t[i + 1] in range(a[i + 1])):\n print(0)\n exit(0)\n ",
"t[i + 1] > 0 and (t[i + 1] in range(a[i + 1]))",
"t[i + 1] > 0",
"t[i + 1]",
"t",
"i + 1",
"i",
"1",
"0",
"t[i + 1] in range(a[i + 1])",
"t[i + 1]",
"t",
"i + 1",
"i",
"1",
"range(a[i + 1])",
"range",
"a[i + 1]",
"a",
"i + 1",
"i",
"1",
"print(0)",
"print",
"0",
"exit(0)",
"exit",
"0",
"s.add(i + 1)",
"s.add",
"s",
"add",
"i + 1",
"i",
"1",
"t[i + 1] = a[i + 1]",
"t[i + 1]",
"t",
"i + 1",
"i",
"1",
"a[i + 1]",
"a",
"i + 1",
"i",
"1",
"for i in range(N - 1, 0, -1):\n if b[i - 1] > b[i]:\n if t[i - 1] > 0 and (t[i - 1] in range(b[i - 1])):\n print(0)\n exit(0)\n s.add(i - 1)\n t[i - 1] = b[i - 1]\n else: t[i - 1] = min(t[i - 1], t[i])\n#print(t)",
"i",
"range(N - 1, 0, -1)",
"range",
"N - 1",
"N",
"1",
"0",
"-1",
"if b[i - 1] > b[i]:\n if t[i - 1] > 0 and (t[i - 1] in range(b[i - 1])):\n print(0)\n exit(0)\n s.add(i - 1)\n t[i - 1] = b[i - 1]\n else: t[i - 1] = min(t[i - 1], t[i])\n#print(t)",
"b[i - 1] > b[i]",
"b[i - 1]",
"b",
"i - 1",
"i",
"1",
"b[i]",
"b",
"i",
"if t[i - 1] > 0 and (t[i - 1] in range(b[i - 1])):\n print(0)\n exit(0)\n ",
"t[i - 1] > 0 and (t[i - 1] in range(b[i - 1]))",
"t[i - 1] > 0",
"t[i - 1]",
"t",
"i - 1",
"i",
"1",
"0",
"t[i - 1] in range(b[i - 1])",
"t[i - 1]",
"t",
"i - 1",
"i",
"1",
"range(b[i - 1])",
"range",
"b[i - 1]",
"b",
"i - 1",
"i",
"1",
"print(0)",
"print",
"0",
"exit(0)",
"exit",
"0",
"s.add(i - 1)",
"s.add",
"s",
"add",
"i - 1",
"i",
"1",
"t[i - 1] = b[i - 1]",
"t[i - 1]",
"t",
"i - 1",
"i",
"1",
"b[i - 1]",
"b",
"i - 1",
"i",
"1",
"res = 1",
"res",
"1",
"for i in range(N):\n if i in s: continue\n res *= t[i]\n res %= mod",
"i",
"range(N)",
"range",
"N",
"if i in s: continue\n ",
"i in s",
"i",
"s",
"res *= t[i]",
"res",
"t[i]",
"t",
"i",
"res %= mod",
"res",
"mod",
"print(res)",
"print",
"res",
"res = 1",
"1",
"res",
"res *= t[i]",
"t[i]",
"res",
"res %= mod",
"mod",
"res",
"s = set()",
"set()",
"s",
"N = int(input())",
"int(input())",
"N",
"mod = 10 ** 9 + 7",
"10 ** 9 + 7",
"mod",
"input = sys.stdin.readline",
"sys.stdin.readline",
"input",
"t = [10 ** 10 for _ in range(N)]",
"[10 ** 10 for _ in range(N)]",
"t",
"a = list(map(int, input().split()))",
"list(map(int, input().split()))",
"a",
"b = list(map(int, input().split()))",
"list(map(int, input().split()))",
"b"
] |
import sys
input = sys.stdin.readline
N = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
mod = 10 ** 9 + 7
t = [10 ** 10 for _ in range(N)]
t[0] = a[0]
t[-1] = b[-1]
s = set()
s.add(0)
s.add(N - 1)
if a[0] > b[0] or (a[-1] < b[-1]):
print(0)
exit(0)
if a[-1] != b[0]:
print(0)
exit(0)
for i in range(N - 1):
if a[i + 1] > a[i]:
if t[i + 1] > 0 and (t[i + 1] in range(a[i + 1])):
print(0)
exit(0)
s.add(i + 1)
t[i + 1] = a[i + 1]
else: t[i + 1] = min(t[i + 1], t[i])
#print(t)
for i in range(N - 1, 0, -1):
if b[i - 1] > b[i]:
if t[i - 1] > 0 and (t[i - 1] in range(b[i - 1])):
print(0)
exit(0)
s.add(i - 1)
t[i - 1] = b[i - 1]
else: t[i - 1] = min(t[i - 1], t[i])
#print(t)
res = 1
for i in range(N):
if i in s: continue
res *= t[i]
res %= mod
print(res)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
41,
28,
13,
4,
13,
13,
4,
39,
17,
2,
17,
17,
0,
13,
13,
28,
13,
4,
13,
13,
14,
2,
13,
17,
0,
13,
18,
13,
13,
0,
13,
18,
13,
13,
14,
2,
18,
13,
2,
13,
17,
18,
13,
13,
0,
13,
18,
13,
13,
0,
13,
18,
13,
13,
0,
13,
17,
0,
18,
18,
13,
13,
17,
13,
0,
18,
18,
13,
13,
17,
13,
28,
13,
4,
13,
2,
13,
17,
17,
17,
14,
2,
13,
2,
13,
17,
0,
13,
18,
13,
13,
0,
13,
18,
13,
13,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
13,
18,
13,
13,
0,
13,
18,
13,
13,
0,
13,
17,
0,
18,
18,
13,
13,
17,
4,
13,
13,
18,
18,
13,
13,
17,
0,
18,
18,
13,
13,
17,
4,
13,
13,
18,
18,
13,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
14,
2,
18,
18,
13,
13,
17,
18,
18,
13,
13,
17,
4,
13,
17,
4,
13,
0,
13,
2,
2,
18,
18,
13,
13,
17,
18,
18,
13,
13,
17,
17,
0,
13,
2,
2,
17,
17,
17,
4,
13,
13,
10,
17,
13,
10,
17,
13,
10,
18,
13,
10,
4,
13,
10,
18,
13,
10,
18,
13,
10,
18,
13,
10,
2,
13,
10,
18,
13,
10,
4,
13,
10,
2,
13,
10,
18,
13,
10,
18,
13,
10,
4,
13,
10,
13,
13,
10,
18,
13,
10,
17,
13
] |
[
[
256,
2
],
[
238,
8
],
[
268,
20
],
[
34,
33
],
[
257,
36
],
[
271,
44
],
[
48,
47
],
[
257,
50
],
[
47,
53
],
[
235,
56
],
[
239,
58
],
[
47,
59
],
[
244,
61
],
[
239,
63
],
[
47,
64
],
[
239,
68
],
[
47,
70
],
[
239,
73
],
[
47,
74
],
[
247,
76
],
[
239,
78
],
[
47,
79
],
[
253,
81
],
[
239,
83
],
[
47,
84
],
[
229,
86
],
[
94,
89
],
[
272,
91
],
[
47,
92
],
[
230,
94
],
[
248,
94
],
[
236,
94
],
[
101,
96
],
[
272,
98
],
[
47,
99
],
[
254,
101
],
[
245,
101
],
[
104,
103
],
[
257,
107
],
[
103,
113
],
[
257,
115
],
[
274,
118
],
[
269,
120
],
[
103,
121
],
[
262,
123
],
[
269,
125
],
[
103,
126
],
[
269,
130
],
[
103,
131
],
[
269,
133
],
[
103,
135
],
[
265,
138
],
[
269,
140
],
[
103,
141
],
[
241,
143
],
[
269,
145
],
[
103,
146
],
[
232,
148
],
[
156,
151
],
[
272,
153
],
[
103,
154
],
[
233,
158
],
[
242,
158
],
[
275,
158
],
[
230,
158
],
[
248,
158
],
[
236,
158
],
[
272,
161
],
[
103,
162
],
[
170,
165
],
[
272,
167
],
[
103,
168
],
[
266,
172
],
[
263,
172
],
[
254,
172
],
[
245,
172
],
[
272,
175
],
[
103,
176
],
[
277,
179
],
[
183,
182
],
[
257,
185
],
[
272,
190
],
[
182,
191
],
[
272,
195
],
[
182,
196
],
[
250,
204
],
[
272,
209
],
[
182,
210
],
[
272,
214
],
[
182,
215
],
[
259,
219
],
[
260,
227
],
[
251,
227
],
[
278,
227
],
[
229,
230
],
[
232,
233
],
[
235,
236
],
[
238,
239
],
[
241,
242
],
[
244,
245
],
[
247,
248
],
[
250,
251
],
[
253,
254
],
[
256,
257
],
[
259,
260
],
[
262,
263
],
[
265,
266
],
[
268,
269
],
[
271,
272
],
[
274,
275
],
[
277,
278
]
] |
[
"N = int(input())\nT = list(map(int,input().split()))\nA = list(map(int,input().split()))\n\nH = [[1,10 ** 9] for _ in range(N)]\n\nfor i in range(N):\n if i == 0:\n hmin = T[i]\n hmax = T[i]\n elif T[i-1] < T[i]:\n hmin = T[i]\n hmax = T[i]\n else:\n hmin = 1\n H[i][0] = hmin\n H[i][1] = hmax\n #print(H)\nfor i in range(N-1,-1,-1):\n if i == N-1:\n hmin = A[i]\n hmax = A[i]\n elif A[i] > A[i+1]:\n hmax = A[i]\n hmin = A[i]\n else:\n hmin = 1\n H[i][0] = max(hmin,H[i][0])\n H[i][1] = min(hmax,H[i][1])\n #print(H)\n\n#print(H)\nans = 1\nfor i in range(N):\n if H[i][1] < H[i][0]:\n print(0)\n exit()\n ans *= (H[i][1] - H[i][0] + 1)\n ans %= 10 ** 9 + 7\nprint(ans)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"T = list(map(int,input().split()))",
"T",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"A = list(map(int,input().split()))",
"A",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"[1,10 ** 9] for _ in range(N)",
"for _ in range(N)",
"_",
"range(N)",
"range",
"N",
"for _ in range(N)",
"[1,10 ** 9]",
"1",
"10 ** 9",
"10",
"9",
"H = [[1,10 ** 9] for _ in range(N)]",
"H",
"[[1,10 ** 9] for _ in range(N)]",
"for i in range(N):\n if i == 0:\n hmin = T[i]\n hmax = T[i]\n elif T[i-1] < T[i]:\n hmin = T[i]\n hmax = T[i]\n else:\n hmin = 1\n H[i][0] = hmin\n H[i][1] = hmax\n #print(H)",
"i",
"range(N)",
"range",
"N",
"if i == 0:\n hmin = T[i]\n hmax = T[i]\n elif T[i-1] < T[i]:\n hmin = T[i]\n hmax = T[i]\n else:\n hmin = 1\n ",
"i == 0",
"i",
"0",
"hmin = T[i]",
"hmin",
"T[i]",
"T",
"i",
"hmax = T[i]",
"hmax",
"T[i]",
"T",
"i",
"elif T[i-1] < T[i]:\n hmin = T[i]\n hmax = T[i]\n ",
"T[i-1] < T[i]",
"T[i-1]",
"T",
"i-1",
"i",
"1",
"T[i]",
"T",
"i",
"hmin = T[i]",
"hmin",
"T[i]",
"T",
"i",
"hmax = T[i]",
"hmax",
"T[i]",
"T",
"i",
"hmin = 1",
"hmin",
"1",
"H[i][0] = hmin",
"H[i][0]",
"[i]",
"H",
"i",
"0",
"hmin",
"H[i][1] = hmax",
"H[i][1]",
"[i]",
"H",
"i",
"1",
"hmax",
"for i in range(N-1,-1,-1):\n if i == N-1:\n hmin = A[i]\n hmax = A[i]\n elif A[i] > A[i+1]:\n hmax = A[i]\n hmin = A[i]\n else:\n hmin = 1\n H[i][0] = max(hmin,H[i][0])\n H[i][1] = min(hmax,H[i][1])\n #print(H)\n\n#print(H)",
"i",
"range(N-1,-1,-1)",
"range",
"N-1",
"N",
"1",
"-1",
"-1",
"if i == N-1:\n hmin = A[i]\n hmax = A[i]\n elif A[i] > A[i+1]:\n hmax = A[i]\n hmin = A[i]\n else:\n hmin = 1\n ",
"i == N-1",
"i",
"N-1",
"N",
"1",
"hmin = A[i]",
"hmin",
"A[i]",
"A",
"i",
"hmax = A[i]",
"hmax",
"A[i]",
"A",
"i",
"elif A[i] > A[i+1]:\n hmax = A[i]\n hmin = A[i]\n ",
"A[i] > A[i+1]",
"A[i]",
"A",
"i",
"A[i+1]",
"A",
"i+1",
"i",
"1",
"hmax = A[i]",
"hmax",
"A[i]",
"A",
"i",
"hmin = A[i]",
"hmin",
"A[i]",
"A",
"i",
"hmin = 1",
"hmin",
"1",
"H[i][0] = max(hmin,H[i][0])",
"H[i][0]",
"[i]",
"H",
"i",
"0",
"max(hmin,H[i][0])",
"max",
"hmin",
"H[i][0]",
"[i]",
"H",
"i",
"0",
"H[i][1] = min(hmax,H[i][1])",
"H[i][1]",
"[i]",
"H",
"i",
"1",
"min(hmax,H[i][1])",
"min",
"hmax",
"H[i][1]",
"[i]",
"H",
"i",
"1",
"ans = 1",
"ans",
"1",
"for i in range(N):\n if H[i][1] < H[i][0]:\n print(0)\n exit()\n ans *= (H[i][1] - H[i][0] + 1)\n ans %= 10 ** 9 + 7",
"i",
"range(N)",
"range",
"N",
"if H[i][1] < H[i][0]:\n print(0)\n exit()\n ",
"H[i][1] < H[i][0]",
"H[i][1]",
"[i]",
"H",
"i",
"1",
"H[i][0]",
"[i]",
"H",
"i",
"0",
"print(0)",
"print",
"0",
"exit()",
"exit",
"ans *= (H[i][1] - H[i][0] + 1)",
"ans",
"H[i][1] - H[i][0] + 1",
"H[i][1] - H[i][0]",
"H[i][1]",
"[i]",
"H",
"i",
"1",
"H[i][0]",
"[i]",
"H",
"i",
"0",
"1",
"ans %= 10 ** 9 + 7",
"ans",
"10 ** 9 + 7",
"10 ** 9",
"10",
"9",
"7",
"print(ans)",
"print",
"ans",
"hmin = 1",
"1",
"hmin",
"hmin = 1",
"1",
"hmin",
"hmin = T[i]",
"T[i]",
"hmin",
"T = list(map(int,input().split()))",
"list(map(int,input().split()))",
"T",
"hmin = A[i]",
"A[i]",
"hmin",
"hmax = T[i]",
"T[i]",
"hmax",
"hmin = T[i]",
"T[i]",
"hmin",
"ans *= (H[i][1] - H[i][0] + 1)",
"H[i][1] - H[i][0] + 1",
"ans",
"hmax = T[i]",
"T[i]",
"hmax",
"N = int(input())",
"int(input())",
"N",
"ans %= 10 ** 9 + 7",
"10 ** 9 + 7",
"ans",
"hmax = A[i]",
"A[i]",
"hmax",
"hmax = A[i]",
"A[i]",
"hmax",
"A = list(map(int,input().split()))",
"list(map(int,input().split()))",
"A",
"H = [[1,10 ** 9] for _ in range(N)]",
"[[1,10 ** 9] for _ in range(N)]",
"H",
"hmin = A[i]",
"A[i]",
"hmin",
"ans = 1",
"1",
"ans"
] |
N = int(input())
T = list(map(int,input().split()))
A = list(map(int,input().split()))
H = [[1,10 ** 9] for _ in range(N)]
for i in range(N):
if i == 0:
hmin = T[i]
hmax = T[i]
elif T[i-1] < T[i]:
hmin = T[i]
hmax = T[i]
else:
hmin = 1
H[i][0] = hmin
H[i][1] = hmax
#print(H)
for i in range(N-1,-1,-1):
if i == N-1:
hmin = A[i]
hmax = A[i]
elif A[i] > A[i+1]:
hmax = A[i]
hmin = A[i]
else:
hmin = 1
H[i][0] = max(hmin,H[i][0])
H[i][1] = min(hmax,H[i][1])
#print(H)
#print(H)
ans = 1
for i in range(N):
if H[i][1] < H[i][0]:
print(0)
exit()
ans *= (H[i][1] - H[i][0] + 1)
ans %= 10 ** 9 + 7
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
2,
2,
39,
17,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
39,
17,
0,
13,
2,
2,
39,
17,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
39,
17,
0,
13,
2,
2,
17,
17,
17,
14,
40,
4,
13,
13,
4,
13,
13,
4,
13,
17,
4,
13,
0,
13,
17,
28,
13,
4,
13,
17,
2,
13,
17,
0,
13,
17,
14,
40,
18,
13,
13,
18,
13,
2,
13,
17,
0,
13,
17,
0,
13,
18,
13,
13,
14,
40,
18,
13,
13,
18,
13,
2,
13,
17,
14,
13,
14,
40,
13,
18,
13,
13,
4,
13,
17,
4,
13,
0,
13,
17,
0,
13,
18,
13,
13,
14,
13,
14,
2,
2,
13,
18,
13,
13,
2,
13,
18,
13,
13,
4,
13,
17,
4,
13,
14,
40,
13,
0,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
13,
13,
4,
13,
2,
13,
13,
10,
2,
13,
10,
17,
13,
10,
17,
13,
10,
13,
13,
10,
17,
13,
10,
4,
13,
10,
2,
13,
10,
18,
13,
10,
4,
13,
10,
2,
13,
10,
18,
13,
10,
17,
13
] |
[
[
191,
2
],
[
167,
8
],
[
194,
26
],
[
185,
44
],
[
168,
54
],
[
195,
57
],
[
170,
64
],
[
68,
67
],
[
192,
72
],
[
173,
75
],
[
168,
80
],
[
67,
81
],
[
168,
83
],
[
67,
85
],
[
179,
88
],
[
188,
91
],
[
168,
93
],
[
67,
94
],
[
195,
98
],
[
67,
99
],
[
195,
101
],
[
67,
103
],
[
189,
109
],
[
198,
109
],
[
195,
111
],
[
67,
112
],
[
200,
119
],
[
197,
122
],
[
195,
124
],
[
67,
125
],
[
198,
131
],
[
189,
131
],
[
168,
133
],
[
67,
134
],
[
198,
136
],
[
189,
136
],
[
195,
138
],
[
67,
139
],
[
201,
147
],
[
180,
147
],
[
174,
147
],
[
182,
149
],
[
195,
153
],
[
67,
154
],
[
168,
156
],
[
67,
157
],
[
176,
159
],
[
186,
160
],
[
177,
164
],
[
183,
164
],
[
171,
164
],
[
186,
165
],
[
167,
168
],
[
170,
171
],
[
173,
174
],
[
186,
176
],
[
176,
177
],
[
179,
180
],
[
182,
183
],
[
185,
186
],
[
188,
189
],
[
191,
192
],
[
194,
195
],
[
197,
198
],
[
200,
201
]
] |
[
"n = int(input())\nt = [0]+list(map(int,input().split()))+[0]\ns = [0]+list(map(int,input().split()))+[0]\n\nmod = 10**9+7\nif max(t) != max(s):\n print(0)\n exit()\nans = 1\nfor i in range(1,n+1):\n d = False\n if t[i] != t[i-1]:\n d = True\n x = t[i]\n if s[i] != s[i+1]:\n if d:\n if x != s[i]:\n print(0)\n exit()\n else:\n d = True\n x = s[i]\n if d:\n if x > t[i] or x > s[i]:\n print(0)\n exit()\n if not d:\n ans *= min(s[i],t[i])\n ans %= mod\nprint(ans%mod)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"t = [0]+list(map(int,input().split()))+[0]",
"t",
"[0]+list(map(int,input().split()))+[0]",
"[0]+list(map(int,input().split()))",
"[0]",
"0",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"[0]",
"0",
"s = [0]+list(map(int,input().split()))+[0]",
"s",
"[0]+list(map(int,input().split()))+[0]",
"[0]+list(map(int,input().split()))",
"[0]",
"0",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"[0]",
"0",
"mod = 10**9+7",
"mod",
"10**9+7",
"10**9",
"10",
"9",
"7",
"if max(t) != max(s):\n print(0)\n exit()",
"max(t) != max(s)",
"max(t)",
"max",
"t",
"max(s)",
"max",
"s",
"print(0)",
"print",
"0",
"exit()",
"exit",
"ans = 1",
"ans",
"1",
"for i in range(1,n+1):\n d = False\n if t[i] != t[i-1]:\n d = True\n x = t[i]\n if s[i] != s[i+1]:\n if d:\n if x != s[i]:\n print(0)\n exit()\n else:\n d = True\n x = s[i]\n if d:\n if x > t[i] or x > s[i]:\n print(0)\n exit()\n if not d:\n ans *= min(s[i],t[i])\n ans %= mod",
"i",
"range(1,n+1)",
"range",
"1",
"n+1",
"n",
"1",
"d = False",
"d",
"False",
"if t[i] != t[i-1]:\n d = True\n x = t[i]\n ",
"t[i] != t[i-1]",
"t[i]",
"t",
"i",
"t[i-1]",
"t",
"i-1",
"i",
"1",
"d = True",
"d",
"True",
"x = t[i]",
"x",
"t[i]",
"t",
"i",
"if s[i] != s[i+1]:\n if d:\n if x != s[i]:\n print(0)\n exit()\n else:\n d = True\n x = s[i]\n ",
"s[i] != s[i+1]",
"s[i]",
"s",
"i",
"s[i+1]",
"s",
"i+1",
"i",
"1",
"if d:\n if x != s[i]:\n print(0)\n exit()\n else:\n d = True\n x = s[i]\n ",
"d",
"if x != s[i]:\n print(0)\n exit()\n ",
"x != s[i]",
"x",
"s[i]",
"s",
"i",
"print(0)",
"print",
"0",
"exit()",
"exit",
"d = True",
"d",
"True",
"x = s[i]",
"x",
"s[i]",
"s",
"i",
"if d:\n if x > t[i] or x > s[i]:\n print(0)\n exit()\n ",
"d",
"if x > t[i] or x > s[i]:\n print(0)\n exit()\n ",
"x > t[i] or x > s[i]",
"x > t[i]",
"x",
"t[i]",
"t",
"i",
"x > s[i]",
"x",
"s[i]",
"s",
"i",
"print(0)",
"print",
"0",
"exit()",
"exit",
"if not d:\n ans *= min(s[i],t[i])\n ans %= mod",
"not d",
"d",
"ans *= min(s[i],t[i])",
"ans",
"min(s[i],t[i])",
"min",
"s[i]",
"s",
"i",
"t[i]",
"t",
"i",
"ans %= mod",
"ans",
"mod",
"print(ans%mod)",
"print",
"ans%mod",
"ans",
"mod",
"t = [0]+list(map(int,input().split()))+[0]",
"[0]+list(map(int,input().split()))+[0]",
"t",
"ans = 1",
"1",
"ans",
"d = False",
"False",
"d",
"ans %= mod",
"mod",
"ans",
"d = True",
"True",
"d",
"ans *= min(s[i],t[i])",
"min(s[i],t[i])",
"ans",
"mod = 10**9+7",
"10**9+7",
"mod",
"x = t[i]",
"t[i]",
"x",
"n = int(input())",
"int(input())",
"n",
"s = [0]+list(map(int,input().split()))+[0]",
"[0]+list(map(int,input().split()))+[0]",
"s",
"x = s[i]",
"s[i]",
"x",
"d = True",
"True",
"d"
] |
n = int(input())
t = [0]+list(map(int,input().split()))+[0]
s = [0]+list(map(int,input().split()))+[0]
mod = 10**9+7
if max(t) != max(s):
print(0)
exit()
ans = 1
for i in range(1,n+1):
d = False
if t[i] != t[i-1]:
d = True
x = t[i]
if s[i] != s[i+1]:
if d:
if x != s[i]:
print(0)
exit()
else:
d = True
x = s[i]
if d:
if x > t[i] or x > s[i]:
print(0)
exit()
if not d:
ans *= min(s[i],t[i])
ans %= mod
print(ans%mod)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
17,
0,
13,
2,
2,
17,
17,
17,
0,
13,
4,
13,
17,
28,
13,
4,
13,
2,
13,
17,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
18,
13,
13,
40,
18,
13,
13,
14,
2,
18,
13,
2,
2,
13,
13,
17,
18,
13,
2,
2,
13,
13,
17,
0,
18,
13,
2,
2,
13,
13,
17,
40,
18,
13,
2,
2,
13,
13,
17,
28,
13,
13,
4,
13,
13,
13,
14,
2,
2,
13,
17,
2,
13,
17,
0,
13,
4,
13,
40,
13,
40,
13,
0,
13,
13,
14,
2,
13,
17,
14,
2,
40,
13,
13,
0,
13,
17,
14,
2,
13,
17,
14,
2,
40,
13,
13,
0,
13,
17,
14,
40,
13,
13,
0,
13,
17,
4,
13,
13,
10,
17,
13,
10,
4,
13,
10,
4,
13,
10,
13,
13,
10,
4,
13,
10,
17,
13,
10,
4,
13,
10,
17,
13,
10,
17,
13,
10,
4,
13,
10,
2,
13
] |
[
[
170,
2
],
[
167,
8
],
[
191,
20
],
[
188,
32
],
[
194,
35
],
[
176,
42
],
[
48,
47
],
[
171,
51
],
[
64,
55
],
[
192,
56
],
[
47,
57
],
[
192,
59
],
[
47,
61
],
[
67,
64
],
[
192,
65
],
[
47,
66
],
[
64,
68
],
[
192,
69
],
[
47,
70
],
[
168,
74
],
[
171,
77
],
[
47,
78
],
[
168,
81
],
[
171,
84
],
[
47,
85
],
[
95,
88
],
[
168,
89
],
[
171,
92
],
[
47,
93
],
[
168,
97
],
[
171,
100
],
[
47,
101
],
[
168,
108
],
[
192,
109
],
[
182,
119
],
[
173,
127
],
[
195,
128
],
[
185,
139
],
[
179,
151
],
[
164,
158
],
[
165,
162
],
[
180,
162
],
[
186,
162
],
[
174,
162
],
[
183,
162
],
[
189,
162
],
[
164,
165
],
[
167,
168
],
[
170,
171
],
[
195,
173
],
[
173,
174
],
[
176,
177
],
[
179,
180
],
[
182,
183
],
[
185,
186
],
[
188,
189
],
[
191,
192
],
[
194,
195
]
] |
[
"n = int(input())\nT = list(map(int,input().split()))\nA = list(map(int,input().split()))\n\nans = 1\nmod = 10**9 + 7\ninf = float('inf')\n\nfor i in range(n-1):\n if A[i] == A[i+1]:\n A[i] = -A[i]\n if T[n-i-1] == T[n-i-2]:\n T[n-i-1] = -T[n-i-1]\n\nfor t,a in zip(T,A):\n if t < 0 and a < 0:\n ans *= min(-t,-a)\n ans %= mod\n elif t < 0:\n if -t < a:\n ans *= 0\n elif a < 0:\n if -a < t:\n ans *= 0\n elif t != a:\n ans *= 0\nprint(ans)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"T = list(map(int,input().split()))",
"T",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"A = list(map(int,input().split()))",
"A",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"ans = 1",
"ans",
"1",
"mod = 10**9 + 7",
"mod",
"10**9 + 7",
"10**9",
"10",
"9",
"7",
"inf = float('inf')",
"inf",
"float('inf')",
"float",
"'inf'",
"for i in range(n-1):\n if A[i] == A[i+1]:\n A[i] = -A[i]\n if T[n-i-1] == T[n-i-2]:\n T[n-i-1] = -T[n-i-1]",
"i",
"range(n-1)",
"range",
"n-1",
"n",
"1",
"if A[i] == A[i+1]:\n A[i] = -A[i]\n ",
"A[i] == A[i+1]",
"A[i]",
"A",
"i",
"A[i+1]",
"A",
"i+1",
"i",
"1",
"A[i] = -A[i]",
"A[i]",
"A",
"i",
"-A[i]",
"A[i]",
"A",
"i",
"if T[n-i-1] == T[n-i-2]:\n T[n-i-1] = -T[n-i-1]",
"T[n-i-1] == T[n-i-2]",
"T[n-i-1]",
"T",
"n-i-1",
"n-i",
"n",
"i",
"1",
"T[n-i-2]",
"T",
"n-i-2",
"n-i",
"n",
"i",
"2",
"T[n-i-1] = -T[n-i-1]",
"T[n-i-1]",
"T",
"n-i-1",
"n-i",
"n",
"i",
"1",
"-T[n-i-1]",
"T[n-i-1]",
"T",
"n-i-1",
"n-i",
"n",
"i",
"1",
"for t,a in zip(T,A):\n if t < 0 and a < 0:\n ans *= min(-t,-a)\n ans %= mod\n elif t < 0:\n if -t < a:\n ans *= 0\n elif a < 0:\n if -a < t:\n ans *= 0\n elif t != a:\n ans *= 0",
"t",
"a",
"zip(T,A)",
"zip",
"T",
"A",
"if t < 0 and a < 0:\n ans *= min(-t,-a)\n ans %= mod\n elif t < 0:\n if -t < a:\n ans *= 0\n elif a < 0:\n if -a < t:\n ans *= 0\n elif t != a:\n ans *= 0",
"t < 0 and a < 0",
"t < 0",
"t",
"0",
"a < 0",
"a",
"0",
"ans *= min(-t,-a)",
"ans",
"min(-t,-a)",
"min",
"-t",
"t",
"-a",
"a",
"ans %= mod",
"ans",
"mod",
"elif t < 0:\n if -t < a:\n ans *= 0\n ",
"t < 0",
"t",
"0",
"if -t < a:\n ans *= 0\n ",
"-t < a",
"-t",
"t",
"a",
"ans *= 0",
"ans",
"0",
"elif a < 0:\n if -a < t:\n ans *= 0\n ",
"a < 0",
"a",
"0",
"if -a < t:\n ans *= 0\n ",
"-a < t",
"-a",
"a",
"t",
"ans *= 0",
"ans",
"0",
"elif t != a:\n ans *= 0",
"t != a",
"t",
"a",
"ans *= 0",
"ans",
"0",
"print(ans)",
"print",
"ans",
"ans *= 0",
"0",
"ans",
"T = list(map(int,input().split()))",
"list(map(int,input().split()))",
"T",
"n = int(input())",
"int(input())",
"n",
"ans %= mod",
"mod",
"ans",
"inf = float('inf')",
"float('inf')",
"inf",
"ans *= 0",
"0",
"ans",
"ans *= min(-t,-a)",
"min(-t,-a)",
"ans",
"ans *= 0",
"0",
"ans",
"ans = 1",
"1",
"ans",
"A = list(map(int,input().split()))",
"list(map(int,input().split()))",
"A",
"mod = 10**9 + 7",
"10**9 + 7",
"mod"
] |
n = int(input())
T = list(map(int,input().split()))
A = list(map(int,input().split()))
ans = 1
mod = 10**9 + 7
inf = float('inf')
for i in range(n-1):
if A[i] == A[i+1]:
A[i] = -A[i]
if T[n-i-1] == T[n-i-2]:
T[n-i-1] = -T[n-i-1]
for t,a in zip(T,A):
if t < 0 and a < 0:
ans *= min(-t,-a)
ans %= mod
elif t < 0:
if -t < a:
ans *= 0
elif a < 0:
if -a < t:
ans *= 0
elif t != a:
ans *= 0
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
2,
2,
17,
17,
17,
0,
13,
2,
39,
17,
13,
0,
13,
2,
39,
17,
13,
0,
18,
13,
17,
18,
13,
17,
0,
18,
13,
17,
18,
13,
17,
28,
13,
4,
13,
2,
13,
17,
14,
2,
18,
13,
2,
13,
17,
18,
13,
13,
0,
18,
13,
2,
13,
17,
18,
13,
2,
13,
17,
14,
2,
18,
13,
40,
2,
13,
17,
18,
13,
40,
2,
13,
17,
0,
18,
13,
40,
2,
13,
17,
18,
13,
40,
2,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
14,
18,
13,
13,
14,
2,
18,
13,
13,
18,
13,
13,
0,
13,
17,
3,
14,
18,
13,
13,
14,
2,
18,
13,
13,
18,
13,
13,
0,
13,
17,
3,
28,
13,
4,
13,
13,
14,
2,
18,
13,
13,
18,
13,
13,
9,
0,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
13,
13,
14,
40,
18,
13,
17,
18,
13,
17,
0,
13,
17,
4,
13,
13,
10,
2,
13,
10,
4,
13,
10,
17,
13,
10,
17,
13,
10,
4,
13,
10,
4,
13,
10,
2,
13,
10,
2,
13,
10,
17,
13,
10,
4,
13,
10,
13,
13,
10,
17,
13
] |
[
[
216,
2
],
[
213,
8
],
[
228,
20
],
[
201,
32
],
[
219,
39
],
[
217,
43
],
[
222,
45
],
[
217,
49
],
[
54,
51
],
[
220,
52
],
[
214,
55
],
[
61,
58
],
[
223,
59
],
[
229,
62
],
[
66,
65
],
[
217,
69
],
[
214,
74
],
[
65,
76
],
[
214,
79
],
[
65,
80
],
[
87,
82
],
[
220,
83
],
[
65,
85
],
[
214,
88
],
[
65,
90
],
[
229,
95
],
[
65,
98
],
[
229,
101
],
[
65,
104
],
[
113,
107
],
[
223,
108
],
[
65,
111
],
[
229,
114
],
[
65,
117
],
[
225,
120
],
[
124,
123
],
[
217,
126
],
[
220,
129
],
[
123,
130
],
[
229,
134
],
[
123,
135
],
[
220,
137
],
[
123,
138
],
[
210,
140
],
[
223,
145
],
[
123,
146
],
[
214,
150
],
[
123,
151
],
[
223,
153
],
[
123,
154
],
[
207,
156
],
[
161,
160
],
[
217,
163
],
[
220,
167
],
[
160,
168
],
[
223,
170
],
[
160,
171
],
[
204,
174
],
[
214,
178
],
[
160,
179
],
[
229,
181
],
[
160,
182
],
[
231,
184
],
[
202,
185
],
[
214,
189
],
[
229,
192
],
[
234,
195
],
[
235,
199
],
[
232,
199
],
[
205,
199
],
[
208,
199
],
[
211,
199
],
[
226,
199
],
[
201,
202
],
[
204,
205
],
[
207,
208
],
[
210,
211
],
[
213,
214
],
[
216,
217
],
[
219,
220
],
[
222,
223
],
[
225,
226
],
[
228,
229
],
[
202,
231
],
[
231,
232
],
[
234,
235
]
] |
[
"#two alpinist\nN = int(input())\nA = tuple(map(int, input().split()))\nB = tuple(map(int, input().split()))\nmod = 10**9+7\n \n#fixed[i]: i 山の高さが確定してる\nfix_a= [0]*(N)\nfix_b= [0]*(N)\nfix_a[0] = A[0]\nfix_b[-1] = B[-1]\nfor i in range(N-1):\n if A[i+1]>A[i]:\n fix_a[i+1] = A[i+1]\n if B[-(i+2)]>B[-(i+1)]:\n fix_b[-(i+2)] = B[-(i+2)]\n\nans = 1\nfor i in range(N):\n if fix_a[i]:\n if B[i]<fix_a[i]:\n ans = 0\n break\n if fix_b[i]:\n if A[i]<fix_b[i]:\n ans = 0\n break\n \nfor i in range(N):\n if fix_a[i] or fix_b[i]:\n continue\n ans *= min(A[i], B[i])\n ans %= mod\n \nif A[-1] != B[0]:\n ans = 0\n \nprint(ans)\n",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"A = tuple(map(int, input().split()))",
"A",
"tuple(map(int, input().split()))",
"tuple",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"B = tuple(map(int, input().split()))",
"B",
"tuple(map(int, input().split()))",
"tuple",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"mod = 10**9+7",
"mod",
"10**9+7",
"10**9",
"10",
"9",
"7",
"fix_a= [0]*(N)",
"fix_a",
"[0]*(N)",
"[0]",
"0",
"N",
"fix_b= [0]*(N)",
"fix_b",
"[0]*(N)",
"[0]",
"0",
"N",
"fix_a[0] = A[0]",
"fix_a[0]",
"fix_a",
"0",
"A[0]",
"A",
"0",
"fix_b[-1] = B[-1]",
"fix_b[-1]",
"fix_b",
"-1",
"B[-1]",
"B",
"-1",
"for i in range(N-1):\n if A[i+1]>A[i]:\n fix_a[i+1] = A[i+1]\n if B[-(i+2)]>B[-(i+1)]:\n fix_b[-(i+2)] = B[-(i+2)]",
"i",
"range(N-1)",
"range",
"N-1",
"N",
"1",
"if A[i+1]>A[i]:\n fix_a[i+1] = A[i+1]\n ",
"A[i+1]>A[i]",
"A[i+1]",
"A",
"i+1",
"i",
"1",
"A[i]",
"A",
"i",
"fix_a[i+1] = A[i+1]",
"fix_a[i+1]",
"fix_a",
"i+1",
"i",
"1",
"A[i+1]",
"A",
"i+1",
"i",
"1",
"if B[-(i+2)]>B[-(i+1)]:\n fix_b[-(i+2)] = B[-(i+2)]",
"B[-(i+2)]>B[-(i+1)]",
"B[-(i+2)]",
"B",
"-(i+2)",
"i+2",
"i",
"2",
"B[-(i+1)]",
"B",
"-(i+1)",
"i+1",
"i",
"1",
"fix_b[-(i+2)] = B[-(i+2)]",
"fix_b[-(i+2)]",
"fix_b",
"-(i+2)",
"i+2",
"i",
"2",
"B[-(i+2)]",
"B",
"-(i+2)",
"i+2",
"i",
"2",
"ans = 1",
"ans",
"1",
"for i in range(N):\n if fix_a[i]:\n if B[i]<fix_a[i]:\n ans = 0\n break\n if fix_b[i]:\n if A[i]<fix_b[i]:\n ans = 0\n break\n ",
"i",
"range(N)",
"range",
"N",
"if fix_a[i]:\n if B[i]<fix_a[i]:\n ans = 0\n break\n ",
"fix_a[i]",
"fix_a",
"i",
"if B[i]<fix_a[i]:\n ans = 0\n break\n ",
"B[i]<fix_a[i]",
"B[i]",
"B",
"i",
"fix_a[i]",
"fix_a",
"i",
"ans = 0",
"ans",
"0",
"break",
"if fix_b[i]:\n if A[i]<fix_b[i]:\n ans = 0\n break\n ",
"fix_b[i]",
"fix_b",
"i",
"if A[i]<fix_b[i]:\n ans = 0\n break\n ",
"A[i]<fix_b[i]",
"A[i]",
"A",
"i",
"fix_b[i]",
"fix_b",
"i",
"ans = 0",
"ans",
"0",
"break",
"for i in range(N):\n if fix_a[i] or fix_b[i]:\n continue\n ans *= min(A[i], B[i])\n ans %= mod\n ",
"i",
"range(N)",
"range",
"N",
"if fix_a[i] or fix_b[i]:\n continue\n ",
"fix_a[i] or fix_b[i]",
"fix_a[i]",
"fix_a",
"i",
"fix_b[i]",
"fix_b",
"i",
"continue",
"ans *= min(A[i], B[i])",
"ans",
"min(A[i], B[i])",
"min",
"A[i]",
"A",
"i",
"B[i]",
"B",
"i",
"ans %= mod",
"ans",
"mod",
"if A[-1] != B[0]:\n ans = 0\n ",
"A[-1] != B[0]",
"A[-1]",
"A",
"-1",
"B[0]",
"B",
"0",
"ans = 0",
"ans",
"0",
"print(ans)",
"print",
"ans",
"mod = 10**9+7",
"10**9+7",
"mod",
"ans *= min(A[i], B[i])",
"min(A[i], B[i])",
"ans",
"ans = 0",
"0",
"ans",
"ans = 0",
"0",
"ans",
"A = tuple(map(int, input().split()))",
"tuple(map(int, input().split()))",
"A",
"N = int(input())",
"int(input())",
"N",
"fix_a= [0]*(N)",
"[0]*(N)",
"fix_a",
"fix_b= [0]*(N)",
"[0]*(N)",
"fix_b",
"ans = 1",
"1",
"ans",
"B = tuple(map(int, input().split()))",
"tuple(map(int, input().split()))",
"B",
"ans %= mod",
"mod",
"ans",
"ans = 0",
"0",
"ans"
] |
#two alpinist
N = int(input())
A = tuple(map(int, input().split()))
B = tuple(map(int, input().split()))
mod = 10**9+7
#fixed[i]: i 山の高さが確定してる
fix_a= [0]*(N)
fix_b= [0]*(N)
fix_a[0] = A[0]
fix_b[-1] = B[-1]
for i in range(N-1):
if A[i+1]>A[i]:
fix_a[i+1] = A[i+1]
if B[-(i+2)]>B[-(i+1)]:
fix_b[-(i+2)] = B[-(i+2)]
ans = 1
for i in range(N):
if fix_a[i]:
if B[i]<fix_a[i]:
ans = 0
break
if fix_b[i]:
if A[i]<fix_b[i]:
ans = 0
break
for i in range(N):
if fix_a[i] or fix_b[i]:
continue
ans *= min(A[i], B[i])
ans %= mod
if A[-1] != B[0]:
ans = 0
print(ans)
|
[
7,
15,
13,
13,
15,
15,
15,
15,
15,
15,
15,
15,
15,
15,
12,
13,
12,
13,
12,
13,
12,
13,
41,
28,
13,
4,
13,
13,
4,
4,
13,
12,
13,
23,
13,
4,
18,
13,
13,
2,
17,
17,
0,
13,
4,
13,
17,
0,
13,
2,
2,
17,
17,
17,
0,
13,
4,
13,
0,
13,
4,
13,
0,
13,
4,
13,
0,
13,
2,
39,
17,
13,
0,
13,
17,
28,
13,
13,
4,
13,
13,
14,
2,
13,
13,
0,
18,
13,
13,
13,
0,
13,
13,
0,
13,
17,
28,
13,
13,
4,
13,
18,
13,
39,
17,
14,
2,
13,
13,
14,
2,
18,
13,
2,
40,
13,
17,
40,
13,
18,
13,
2,
40,
13,
17,
4,
13,
17,
4,
13,
0,
18,
13,
2,
40,
13,
17,
13,
0,
13,
13,
0,
13,
4,
13,
4,
13,
13,
13,
0,
13,
18,
4,
13,
4,
13,
18,
13,
39,
17,
13,
39,
17,
14,
2,
40,
13,
13,
40,
13,
13,
4,
13,
17,
4,
13,
41,
28,
13,
13,
4,
13,
13,
13,
4,
4,
13,
13,
13,
0,
13,
13,
0,
13,
17,
28,
13,
4,
13,
13,
14,
2,
18,
13,
13,
17,
0,
13,
18,
13,
13,
0,
13,
13,
4,
13,
13,
10,
18,
13,
10,
18,
13,
10,
13,
13,
10,
17,
13,
10,
12,
13,
10,
2,
13,
10,
4,
13,
10,
12,
13,
10,
4,
13,
10,
13,
13,
10,
12,
13,
10,
12,
13,
10,
4,
13,
10,
4,
13,
10,
17,
13,
10,
12,
13,
10,
4,
13,
10,
2,
13,
10,
17,
13,
10,
13,
13,
10,
13,
13
] |
[
[
25,
24
],
[
231,
30
],
[
34,
34
],
[
257,
43
],
[
233,
48
],
[
254,
55
],
[
240,
57
],
[
242,
59
],
[
264,
61
],
[
266,
63
],
[
264,
65
],
[
269,
67
],
[
255,
71
],
[
272,
73
],
[
243,
80
],
[
273,
83
],
[
276,
83
],
[
89,
86
],
[
270,
87
],
[
275,
91
],
[
260,
94
],
[
267,
102
],
[
261,
107
],
[
276,
107
],
[
273,
107
],
[
246,
107
],
[
270,
112
],
[
270,
120
],
[
137,
131
],
[
270,
132
],
[
245,
139
],
[
236,
142
],
[
270,
147
],
[
218,
150
],
[
270,
157
],
[
237,
166
],
[
243,
167
],
[
219,
169
],
[
267,
170
],
[
243,
182
],
[
267,
183
],
[
278,
190
],
[
227,
193
],
[
197,
196
],
[
255,
199
],
[
86,
202
],
[
270,
203
],
[
196,
204
],
[
221,
207
],
[
279,
209
],
[
196,
210
],
[
224,
212
],
[
234,
213
],
[
225,
216
],
[
222,
216
],
[
228,
216
],
[
218,
219
],
[
221,
222
],
[
234,
224
],
[
224,
225
],
[
227,
228
],
[
233,
234
],
[
236,
237
],
[
242,
243
],
[
245,
246
],
[
254,
255
],
[
257,
258
],
[
260,
261
],
[
266,
267
],
[
269,
270
],
[
272,
273
],
[
275,
276
],
[
278,
279
]
] |
[
"import sys, re\nfrom collections import deque, defaultdict, Counter\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees#, log2\nfrom itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby\nfrom operator import itemgetter, mul\nfrom copy import deepcopy\nfrom string import ascii_lowercase, ascii_uppercase, digits\nfrom bisect import bisect, bisect_left, insort, insort_left\nfrom fractions import gcd\nfrom heapq import heappush, heappop\nfrom functools import reduce\ndef input(): return sys.stdin.readline().strip()\ndef INT(): return int(input())\ndef MAP(): return map(int, input().split())\ndef LIST(): return list(map(int, input().split()))\ndef ZIP(n): return zip(*(MAP() for _ in range(n)))\nsys.setrecursionlimit(10 ** 9)\nINF = float('inf')\nmod = 10**9 + 7\n#from decimal import *\n\nN = INT()\nT = LIST()\nA = LIST()\n\nh = [0]*N\nma = -1\nfor i, t in enumerate(T):\n\tif ma < t:\n\t\th[i] = t\n\t\tma = t\n\n\nma = -1\nfor i, a in enumerate(A[::-1]):\n\tif ma < a:\n\t\tif h[-i-1] and a != h[-i-1]:\n\t\t\tprint(0)\n\t\t\texit()\n\t\th[-i-1] = a\n\t\tma = a\n\nacc_t = list(accumulate(h, max))\nacc_a = list(accumulate(h[::-1], max))[::-1]\n\nif acc_t != T or acc_a != A:\n\tprint(0)\n\texit()\n\nmi = [min(t, a) for t, a in zip(T, A)]\n\nans = 1\nfor i in range(N):\n\tif h[i] == 0:\n\t\tans *= mi[i]\n\t\tans %= mod\n\nprint(ans)",
"import sys, re",
"sys",
"re",
"from collections import deque, defaultdict, Counter",
"from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees",
"from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby",
"from operator import itemgetter, mul",
"from copy import deepcopy",
"from string import ascii_lowercase, ascii_uppercase, digits",
"from bisect import bisect, bisect_left, insort, insort_left",
"from fractions import gcd",
"from heapq import heappush, heappop",
"from functools import reduce",
"def input(): return sys.stdin.readline().strip()",
"input",
"def INT(): return int(input())",
"INT",
"def MAP(): return map(int, input().split())",
"MAP",
"def LIST(): return list(map(int, input().split()))",
"LIST",
"MAP() for _ in range(n)",
"for _ in range(n)",
"_",
"range(n)",
"range",
"n",
"for _ in range(n)",
"MAP()",
"MAP",
"def ZIP(n): return zip(*(MAP() for _ in range(n)))",
"ZIP",
"n",
"n",
"sys.setrecursionlimit(10 ** 9)",
"sys.setrecursionlimit",
"sys",
"setrecursionlimit",
"10 ** 9",
"10",
"9",
"INF = float('inf')",
"INF",
"float('inf')",
"float",
"'inf'",
"mod = 10**9 + 7",
"mod",
"10**9 + 7",
"10**9",
"10",
"9",
"7",
"N = INT()",
"N",
"INT()",
"INT",
"T = LIST()",
"T",
"LIST()",
"LIST",
"A = LIST()",
"A",
"LIST()",
"LIST",
"h = [0]*N",
"h",
"[0]*N",
"[0]",
"0",
"N",
"ma = -1",
"ma",
"-1",
"for i, t in enumerate(T):\n\tif ma < t:\n\t\th[i] = t\n\t\tma = t",
"i",
"t",
"enumerate(T)",
"enumerate",
"T",
"if ma < t:\n\t\th[i] = t\n\t\tma = t",
"ma < t",
"ma",
"t",
"h[i] = t",
"h[i]",
"h",
"i",
"t",
"ma = t",
"ma",
"t",
"ma = -1",
"ma",
"-1",
"for i, a in enumerate(A[::-1]):\n\tif ma < a:\n\t\tif h[-i-1] and a != h[-i-1]:\n\t\t\tprint(0)\n\t\t\texit()\n\t\th[-i-1] = a\n\t\tma = a",
"i",
"a",
"enumerate(A[::-1])",
"enumerate",
"A[::-1]",
"A",
"::-1",
"-1",
"if ma < a:\n\t\tif h[-i-1] and a != h[-i-1]:\n\t\t\tprint(0)\n\t\t\texit()\n\t\th[-i-1] = a\n\t\tma = a",
"ma < a",
"ma",
"a",
"if h[-i-1] and a != h[-i-1]:\n\t\t\tprint(0)\n\t\t\texit()\n\t\t",
"h[-i-1] and a != h[-i-1]",
"h[-i-1]",
"h",
"-i-1",
"-i",
"i",
"1",
"a != h[-i-1]",
"a",
"h[-i-1]",
"h",
"-i-1",
"-i",
"i",
"1",
"print(0)",
"print",
"0",
"exit()",
"exit",
"h[-i-1] = a",
"h[-i-1]",
"h",
"-i-1",
"-i",
"i",
"1",
"a",
"ma = a",
"ma",
"a",
"acc_t = list(accumulate(h, max))",
"acc_t",
"list(accumulate(h, max))",
"list",
"accumulate(h, max)",
"accumulate",
"h",
"max",
"acc_a = list(accumulate(h[::-1], max))[::-1]",
"acc_a",
"list(accumulate(h[::-1], max))[::-1]",
"(accumulate(h[::-1], max))",
"list",
"accumulate(h[::-1], max)",
"accumulate",
"h[::-1]",
"h",
"::-1",
"-1",
"max",
"::-1",
"-1",
"if acc_t != T or acc_a != A:\n\tprint(0)\n\texit()",
"acc_t != T or acc_a != A",
"acc_t != T",
"acc_t",
"T",
"acc_a != A",
"acc_a",
"A",
"print(0)",
"print",
"0",
"exit()",
"exit",
"min(t, a) for t, a in zip(T, A)",
"for t, a in zip(T, A)",
"t",
"a",
"zip(T, A)",
"zip",
"T",
"A",
"for t, a in zip(T, A)",
"min(t, a)",
"min",
"t",
"a",
"mi = [min(t, a) for t, a in zip(T, A)]",
"mi",
"[min(t, a) for t, a in zip(T, A)]",
"ans = 1",
"ans",
"1",
"for i in range(N):\n\tif h[i] == 0:\n\t\tans *= mi[i]\n\t\tans %= mod",
"i",
"range(N)",
"range",
"N",
"if h[i] == 0:\n\t\tans *= mi[i]\n\t\tans %= mod",
"h[i] == 0",
"h[i]",
"h",
"i",
"0",
"ans *= mi[i]",
"ans",
"mi[i]",
"mi",
"i",
"ans %= mod",
"ans",
"mod",
"print(ans)",
"print",
"ans",
"acc_a = list(accumulate(h[::-1], max))[::-1]",
"list(accumulate(h[::-1], max))[::-1]",
"acc_a",
"ans *= mi[i]",
"mi[i]",
"ans",
"ans %= mod",
"mod",
"ans",
"ans = 1",
"1",
"ans",
"def MAP(): return map(int, input().split())",
"def MAP(): return map(int, input().split())",
"MAP",
"mod = 10**9 + 7",
"10**9 + 7",
"mod",
"acc_t = list(accumulate(h, max))",
"list(accumulate(h, max))",
"acc_t",
"def INT(): return int(input())",
"def INT(): return int(input())",
"INT",
"T = LIST()",
"LIST()",
"T",
"ma = a",
"a",
"ma",
"def input(): return sys.stdin.readline().strip()",
"def input(): return sys.stdin.readline().strip()",
"input",
"def ZIP(n): return zip(*(MAP() for _ in range(n)))",
"def ZIP(n): return zip(*(MAP() for _ in range(n)))",
"ZIP",
"N = INT()",
"INT()",
"N",
"INF = float('inf')",
"float('inf')",
"INF",
"ma = -1",
"-1",
"ma",
"def LIST(): return list(map(int, input().split()))",
"def LIST(): return list(map(int, input().split()))",
"LIST",
"A = LIST()",
"LIST()",
"A",
"h = [0]*N",
"[0]*N",
"h",
"ma = -1",
"-1",
"ma",
"ma = t",
"t",
"ma",
"mi = [min(t, a) for t, a in zip(T, A)]",
"[min(t, a) for t, a in zip(T, A)]",
"mi"
] |
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees#, log2
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10**9 + 7
#from decimal import *
N = INT()
T = LIST()
A = LIST()
h = [0]*N
ma = -1
for i, t in enumerate(T):
if ma < t:
h[i] = t
ma = t
ma = -1
for i, a in enumerate(A[::-1]):
if ma < a:
if h[-i-1] and a != h[-i-1]:
print(0)
exit()
h[-i-1] = a
ma = a
acc_t = list(accumulate(h, max))
acc_a = list(accumulate(h[::-1], max))[::-1]
if acc_t != T or acc_a != A:
print(0)
exit()
mi = [min(t, a) for t, a in zip(T, A)]
ans = 1
for i in range(N):
if h[i] == 0:
ans *= mi[i]
ans %= mod
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
2,
2,
17,
17,
17,
0,
13,
17,
28,
13,
4,
13,
17,
2,
13,
17,
14,
2,
18,
13,
2,
13,
17,
18,
13,
13,
14,
2,
18,
13,
13,
18,
13,
13,
0,
13,
17,
9,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
14,
2,
18,
13,
13,
18,
13,
13,
0,
13,
17,
9,
0,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
13,
13,
14,
40,
18,
13,
17,
18,
13,
17,
0,
13,
17,
4,
13,
13,
10,
4,
13,
10,
17,
13,
10,
2,
13,
10,
17,
13,
10,
4,
13,
10,
4,
13,
10,
4,
13,
10,
17,
13,
10,
17,
13,
10,
13,
13
] |
[
[
133,
2
],
[
139,
8
],
[
121,
20
],
[
127,
32
],
[
124,
39
],
[
43,
42
],
[
134,
47
],
[
140,
52
],
[
42,
54
],
[
140,
57
],
[
42,
58
],
[
140,
62
],
[
42,
63
],
[
122,
65
],
[
42,
66
],
[
142,
68
],
[
122,
74
],
[
42,
75
],
[
122,
77
],
[
42,
79
],
[
122,
84
],
[
42,
85
],
[
140,
87
],
[
42,
88
],
[
145,
90
],
[
136,
94
],
[
122,
98
],
[
42,
99
],
[
140,
101
],
[
42,
102
],
[
148,
104
],
[
128,
105
],
[
140,
109
],
[
122,
112
],
[
130,
115
],
[
131,
119
],
[
149,
119
],
[
137,
119
],
[
146,
119
],
[
143,
119
],
[
125,
119
],
[
121,
122
],
[
124,
125
],
[
127,
128
],
[
130,
131
],
[
133,
134
],
[
136,
137
],
[
139,
140
],
[
142,
143
],
[
145,
146
],
[
128,
148
],
[
148,
149
]
] |
[
"# -*- coding: utf-8 -*-\nn = int(input())\ntl = list(map(int, input().split()))\nal = list(map(int, input().split()))\n\nmod = 10**9 + 7\n\nres = 1\nfor i in range(1,n-1):\n if tl[i-1]<tl[i]:\n if tl[i]>al[i]:\n res = 0\n continue\n elif al[i]>al[i+1]:\n if al[i]>tl[i]:\n res = 0\n continue\n else:\n res *= min(al[i],tl[i])\n res %= mod\nif tl[-1]!=al[0]:\n res = 0\nprint(res)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"tl = list(map(int, input().split()))",
"tl",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"al = list(map(int, input().split()))",
"al",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"mod = 10**9 + 7",
"mod",
"10**9 + 7",
"10**9",
"10",
"9",
"7",
"res = 1",
"res",
"1",
"for i in range(1,n-1):\n if tl[i-1]<tl[i]:\n if tl[i]>al[i]:\n res = 0\n continue\n elif al[i]>al[i+1]:\n if al[i]>tl[i]:\n res = 0\n continue\n else:\n res *= min(al[i],tl[i])\n res %= mod",
"i",
"range(1,n-1)",
"range",
"1",
"n-1",
"n",
"1",
"if tl[i-1]<tl[i]:\n if tl[i]>al[i]:\n res = 0\n continue\n elif al[i]>al[i+1]:\n if al[i]>tl[i]:\n res = 0\n continue\n else:\n res *= min(al[i],tl[i])\n res %= mod",
"tl[i-1]<tl[i]",
"tl[i-1]",
"tl",
"i-1",
"i",
"1",
"tl[i]",
"tl",
"i",
"if tl[i]>al[i]:\n res = 0\n ",
"tl[i]>al[i]",
"tl[i]",
"tl",
"i",
"al[i]",
"al",
"i",
"res = 0",
"res",
"0",
"continue",
"elif al[i]>al[i+1]:\n if al[i]>tl[i]:\n res = 0\n continue\n ",
"al[i]>al[i+1]",
"al[i]",
"al",
"i",
"al[i+1]",
"al",
"i+1",
"i",
"1",
"if al[i]>tl[i]:\n res = 0\n ",
"al[i]>tl[i]",
"al[i]",
"al",
"i",
"tl[i]",
"tl",
"i",
"res = 0",
"res",
"0",
"continue",
"res *= min(al[i],tl[i])",
"res",
"min(al[i],tl[i])",
"min",
"al[i]",
"al",
"i",
"tl[i]",
"tl",
"i",
"res %= mod",
"res",
"mod",
"if tl[-1]!=al[0]:\n res = 0",
"tl[-1]!=al[0]",
"tl[-1]",
"tl",
"-1",
"al[0]",
"al",
"0",
"res = 0",
"res",
"0",
"print(res)",
"print",
"res",
"al = list(map(int, input().split()))",
"list(map(int, input().split()))",
"al",
"res = 1",
"1",
"res",
"mod = 10**9 + 7",
"10**9 + 7",
"mod",
"res = 0",
"0",
"res",
"n = int(input())",
"int(input())",
"n",
"res *= min(al[i],tl[i])",
"min(al[i],tl[i])",
"res",
"tl = list(map(int, input().split()))",
"list(map(int, input().split()))",
"tl",
"res = 0",
"0",
"res",
"res = 0",
"0",
"res",
"res %= mod",
"mod",
"res"
] |
# -*- coding: utf-8 -*-
n = int(input())
tl = list(map(int, input().split()))
al = list(map(int, input().split()))
mod = 10**9 + 7
res = 1
for i in range(1,n-1):
if tl[i-1]<tl[i]:
if tl[i]>al[i]:
res = 0
continue
elif al[i]>al[i+1]:
if al[i]>tl[i]:
res = 0
continue
else:
res *= min(al[i],tl[i])
res %= mod
if tl[-1]!=al[0]:
res = 0
print(res)
|
[
7,
15,
12,
13,
17,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
17,
13,
17,
13,
17,
13,
17,
28,
13,
13,
4,
13,
13,
14,
2,
13,
13,
0,
13,
13,
13,
13,
28,
13,
13,
4,
13,
13,
14,
40,
13,
13,
0,
13,
13,
13,
13,
14,
2,
40,
13,
13,
2,
13,
13,
4,
13,
17,
29,
0,
13,
2,
2,
17,
17,
17,
0,
13,
17,
13,
17,
28,
13,
18,
13,
39,
2,
13,
17,
14,
2,
13,
13,
0,
13,
13,
0,
13,
2,
2,
13,
13,
13,
28,
13,
4,
13,
2,
13,
17,
13,
0,
13,
2,
2,
13,
13,
13,
28,
13,
18,
13,
39,
2,
13,
17,
14,
2,
13,
13,
0,
13,
13,
0,
13,
2,
2,
13,
13,
13,
4,
13,
13,
14,
2,
13,
17,
4,
13,
10,
12,
13
] |
[
[
7,
6
],
[
13,
12
],
[
25,
24
],
[
37,
36
],
[
39,
38
],
[
41,
40
],
[
43,
42
],
[
12,
49
],
[
36,
53
],
[
55,
53
],
[
56,
55
],
[
58,
57
],
[
24,
64
],
[
38,
68
],
[
70,
68
],
[
71,
70
],
[
73,
72
],
[
55,
77
],
[
36,
77
],
[
70,
78
],
[
38,
78
],
[
57,
80
],
[
40,
80
],
[
72,
81
],
[
42,
81
],
[
88,
87
],
[
95,
94
],
[
97,
96
],
[
100,
99
],
[
12,
101
],
[
57,
104
],
[
40,
104
],
[
99,
108
],
[
96,
109
],
[
111,
109
],
[
112,
111
],
[
99,
112
],
[
115,
114
],
[
94,
117
],
[
114,
117
],
[
96,
118
],
[
111,
118
],
[
87,
119
],
[
122,
121
],
[
57,
125
],
[
40,
125
],
[
72,
127
],
[
42,
127
],
[
130,
129
],
[
114,
132
],
[
94,
132
],
[
129,
132
],
[
111,
133
],
[
96,
133
],
[
87,
134
],
[
137,
136
],
[
24,
138
],
[
72,
141
],
[
42,
141
],
[
136,
145
],
[
111,
146
],
[
96,
146
],
[
148,
146
],
[
149,
148
],
[
136,
149
],
[
152,
151
],
[
129,
154
],
[
114,
154
],
[
94,
154
],
[
151,
154
],
[
111,
155
],
[
96,
155
],
[
148,
155
],
[
87,
156
],
[
151,
159
],
[
129,
159
],
[
114,
159
],
[
94,
159
],
[
168,
165
]
] |
[
"# code-festival-2016-qualcC - 二人のアルピニスト / Two Alpinists\nfrom bisect import bisect_left as bs\n\n\ndef main():\n \"\"\"\n /----\\ <- xi (= yi)\n / \\--\\\n / \\\n xi yi\n 0 ~ xi / xi ~ yi / yi+1 ~ N-1\n \"\"\"\n N = int(input())\n T = tuple(map(int, input().split()))\n A = tuple(map(int, input().split()))\n x, y, xi, yi = 0, 0, 0, 0 # max of x, y and the indices\n for i, t in enumerate(T):\n if t > x:\n x, xi = t, i\n for i, a in enumerate(A):\n if a >= y:\n y, yi = a, i\n if x != y or xi > yi:\n print(0)\n return\n MOD = 10 ** 9 + 7\n ans, cur = 1, 0\n for i in T[: xi + 1]:\n if i > cur: # point of new altitude -> no choice (ans * 1)\n cur = i\n else:\n ans = (ans * cur) % MOD # mulitple choices (1, 2, ..., cur)\n for _ in range(xi + 1, yi):\n ans = (ans * cur) % MOD\n for i in A[yi + 1 :]:\n if i < cur:\n cur = i\n else:\n ans = (ans * cur) % MOD\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()",
"from bisect import bisect_left as bs",
"def main():\n \"\"\"\n /----\\ <- xi (= yi)\n / \\--\\\n / \\\n xi yi\n 0 ~ xi / xi ~ yi / yi+1 ~ N-1\n \"\"\"\n N = int(input())\n T = tuple(map(int, input().split()))\n A = tuple(map(int, input().split()))\n x, y, xi, yi = 0, 0, 0, 0 # max of x, y and the indices\n for i, t in enumerate(T):\n if t > x:\n x, xi = t, i\n for i, a in enumerate(A):\n if a >= y:\n y, yi = a, i\n if x != y or xi > yi:\n print(0)\n return\n MOD = 10 ** 9 + 7\n ans, cur = 1, 0\n for i in T[: xi + 1]:\n if i > cur: # point of new altitude -> no choice (ans * 1)\n cur = i\n else:\n ans = (ans * cur) % MOD # mulitple choices (1, 2, ..., cur)\n for _ in range(xi + 1, yi):\n ans = (ans * cur) % MOD\n for i in A[yi + 1 :]:\n if i < cur:\n cur = i\n else:\n ans = (ans * cur) % MOD\n print(ans)",
"main",
"\"\"\"\n /----\\ <- xi (= yi)\n / \\--\\\n / \\\n xi yi\n 0 ~ xi / xi ~ yi / yi+1 ~ N-1\n \"\"\"",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"T = tuple(map(int, input().split()))",
"T",
"tuple(map(int, input().split()))",
"tuple",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"A = tuple(map(int, input().split()))",
"A",
"tuple(map(int, input().split()))",
"tuple",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"x, y, xi, yi = 0, 0, 0, 0",
"x",
"0",
"y",
"0",
"xi",
"0",
"yi",
"0",
"for i, t in enumerate(T):\n if t > x:\n x, xi = t, i\n ",
"i",
"t",
"enumerate(T)",
"enumerate",
"T",
"if t > x:\n x, xi = t, i\n ",
"t > x",
"t",
"x",
"x, xi = t, i",
"x",
"t",
"xi",
"i",
"for i, a in enumerate(A):\n if a >= y:\n y, yi = a, i\n ",
"i",
"a",
"enumerate(A)",
"enumerate",
"A",
"if a >= y:\n y, yi = a, i\n ",
"a >= y",
"a",
"y",
"y, yi = a, i",
"y",
"a",
"yi",
"i",
"if x != y or xi > yi:\n print(0)\n return\n ",
"x != y or xi > yi",
"x != y",
"x",
"y",
"xi > yi",
"xi",
"yi",
"print(0)",
"print",
"0",
"return",
"MOD = 10 ** 9 + 7",
"MOD",
"10 ** 9 + 7",
"10 ** 9",
"10",
"9",
"7",
"ans, cur = 1, 0",
"ans",
"1",
"cur",
"0",
"for i in T[: xi + 1]:\n if i > cur: # point of new altitude -> no choice (ans * 1)\n cur = i\n else:\n ans = (ans * cur) % MOD # mulitple choices (1, 2, ..., cur)\n ",
"i",
"T[: xi + 1]",
"T",
": xi + 1",
"xi + 1",
"xi",
"1",
"if i > cur: # point of new altitude -> no choice (ans * 1)\n cur = i\n else:\n ans = (ans * cur) % MOD # mulitple choices (1, 2, ..., cur)\n ",
"i > cur",
"i",
"cur",
"cur = i",
"cur",
"i",
"ans = (ans * cur) % MOD",
"ans",
"(ans * cur) % MOD",
"ans * cur",
"ans",
"cur",
"MOD",
"for _ in range(xi + 1, yi):\n ans = (ans * cur) % MOD\n ",
"_",
"range(xi + 1, yi)",
"range",
"xi + 1",
"xi",
"1",
"yi",
"ans = (ans * cur) % MOD",
"ans",
"(ans * cur) % MOD",
"ans * cur",
"ans",
"cur",
"MOD",
"for i in A[yi + 1 :]:\n if i < cur:\n cur = i\n else:\n ans = (ans * cur) % MOD\n ",
"i",
"A[yi + 1 :]",
"A",
"yi + 1 :",
"yi + 1",
"yi",
"1",
"if i < cur:\n cur = i\n else:\n ans = (ans * cur) % MOD\n ",
"i < cur",
"i",
"cur",
"cur = i",
"cur",
"i",
"ans = (ans * cur) % MOD",
"ans",
"(ans * cur) % MOD",
"ans * cur",
"ans",
"cur",
"MOD",
"print(ans)",
"print",
"ans",
"if __name__ == \"__main__\":\n main()",
"__name__ == \"__main__\"",
"__name__",
"\"__main__\"",
"main()",
"main",
"def main():\n \"\"\"\n /----\\ <- xi (= yi)\n / \\--\\\n / \\\n xi yi\n 0 ~ xi / xi ~ yi / yi+1 ~ N-1\n \"\"\"\n N = int(input())\n T = tuple(map(int, input().split()))\n A = tuple(map(int, input().split()))\n x, y, xi, yi = 0, 0, 0, 0 # max of x, y and the indices\n for i, t in enumerate(T):\n if t > x:\n x, xi = t, i\n for i, a in enumerate(A):\n if a >= y:\n y, yi = a, i\n if x != y or xi > yi:\n print(0)\n return\n MOD = 10 ** 9 + 7\n ans, cur = 1, 0\n for i in T[: xi + 1]:\n if i > cur: # point of new altitude -> no choice (ans * 1)\n cur = i\n else:\n ans = (ans * cur) % MOD # mulitple choices (1, 2, ..., cur)\n for _ in range(xi + 1, yi):\n ans = (ans * cur) % MOD\n for i in A[yi + 1 :]:\n if i < cur:\n cur = i\n else:\n ans = (ans * cur) % MOD\n print(ans)",
"def main():\n \"\"\"\n /----\\ <- xi (= yi)\n / \\--\\\n / \\\n xi yi\n 0 ~ xi / xi ~ yi / yi+1 ~ N-1\n \"\"\"\n N = int(input())\n T = tuple(map(int, input().split()))\n A = tuple(map(int, input().split()))\n x, y, xi, yi = 0, 0, 0, 0 # max of x, y and the indices\n for i, t in enumerate(T):\n if t > x:\n x, xi = t, i\n for i, a in enumerate(A):\n if a >= y:\n y, yi = a, i\n if x != y or xi > yi:\n print(0)\n return\n MOD = 10 ** 9 + 7\n ans, cur = 1, 0\n for i in T[: xi + 1]:\n if i > cur: # point of new altitude -> no choice (ans * 1)\n cur = i\n else:\n ans = (ans * cur) % MOD # mulitple choices (1, 2, ..., cur)\n for _ in range(xi + 1, yi):\n ans = (ans * cur) % MOD\n for i in A[yi + 1 :]:\n if i < cur:\n cur = i\n else:\n ans = (ans * cur) % MOD\n print(ans)",
"main"
] |
# code-festival-2016-qualcC - 二人のアルピニスト / Two Alpinists
from bisect import bisect_left as bs
def main():
"""
/----\ <- xi (= yi)
/ \--\
/ \
xi yi
0 ~ xi / xi ~ yi / yi+1 ~ N-1
"""
N = int(input())
T = tuple(map(int, input().split()))
A = tuple(map(int, input().split()))
x, y, xi, yi = 0, 0, 0, 0 # max of x, y and the indices
for i, t in enumerate(T):
if t > x:
x, xi = t, i
for i, a in enumerate(A):
if a >= y:
y, yi = a, i
if x != y or xi > yi:
print(0)
return
MOD = 10 ** 9 + 7
ans, cur = 1, 0
for i in T[: xi + 1]:
if i > cur: # point of new altitude -> no choice (ans * 1)
cur = i
else:
ans = (ans * cur) % MOD # mulitple choices (1, 2, ..., cur)
for _ in range(xi + 1, yi):
ans = (ans * cur) % MOD
for i in A[yi + 1 :]:
if i < cur:
cur = i
else:
ans = (ans * cur) % MOD
print(ans)
if __name__ == "__main__":
main()
|
[
7,
15,
13,
0,
13,
18,
18,
18,
13,
13,
13,
13,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
2,
2,
17,
17,
17,
0,
13,
2,
39,
17,
13,
0,
13,
17,
14,
2,
13,
17,
14,
2,
18,
13,
17,
18,
13,
17,
4,
13,
17,
4,
13,
17,
4,
13,
17,
14,
40,
4,
13,
13,
4,
13,
13,
4,
13,
17,
4,
13,
17,
28,
13,
4,
13,
17,
2,
13,
17,
14,
2,
18,
13,
2,
13,
17,
18,
13,
13,
0,
18,
13,
13,
18,
13,
13,
14,
40,
18,
13,
2,
13,
17,
18,
13,
13,
14,
2,
18,
13,
13,
18,
13,
13,
0,
13,
17,
3,
14,
40,
18,
13,
13,
18,
13,
2,
13,
17,
14,
2,
18,
13,
13,
18,
13,
13,
0,
13,
17,
3,
28,
13,
4,
13,
2,
13,
17,
17,
17,
14,
2,
2,
18,
13,
2,
13,
17,
18,
13,
13,
2,
18,
13,
2,
13,
17,
18,
13,
13,
0,
18,
13,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
18,
13,
13,
17,
0,
13,
17,
14,
13,
4,
13,
17,
4,
13,
17,
28,
13,
4,
13,
13,
0,
13,
4,
13,
17,
18,
13,
13,
0,
13,
13,
4,
13,
13,
10,
17,
13,
10,
13,
13,
10,
4,
13,
10,
17,
13,
10,
4,
13,
10,
17,
13,
10,
18,
13,
10,
17,
13,
10,
4,
13,
10,
4,
13,
10,
2,
13,
10,
2,
13
] |
[
[
257,
4
],
[
266,
13
],
[
258,
17
],
[
245,
19
],
[
258,
28
],
[
263,
31
],
[
258,
40
],
[
269,
43
],
[
272,
50
],
[
267,
54
],
[
260,
56
],
[
267,
60
],
[
246,
65
],
[
264,
68
],
[
264,
83
],
[
246,
86
],
[
95,
94
],
[
267,
99
],
[
246,
104
],
[
94,
106
],
[
246,
109
],
[
94,
110
],
[
115,
112
],
[
273,
113
],
[
94,
114
],
[
246,
116
],
[
94,
117
],
[
246,
121
],
[
94,
123
],
[
246,
126
],
[
94,
127
],
[
246,
131
],
[
94,
132
],
[
264,
134
],
[
94,
135
],
[
248,
137
],
[
264,
143
],
[
94,
144
],
[
264,
146
],
[
94,
148
],
[
264,
153
],
[
94,
154
],
[
246,
156
],
[
94,
157
],
[
239,
159
],
[
164,
163
],
[
267,
167
],
[
264,
175
],
[
163,
177
],
[
264,
180
],
[
163,
181
],
[
246,
184
],
[
163,
186
],
[
246,
189
],
[
163,
190
],
[
195,
192
],
[
273,
193
],
[
163,
194
],
[
246,
198
],
[
163,
199
],
[
264,
201
],
[
163,
202
],
[
207,
204
],
[
273,
205
],
[
163,
206
],
[
254,
209
],
[
221,
220
],
[
267,
223
],
[
251,
225
],
[
204,
229
],
[
192,
229
],
[
112,
229
],
[
273,
230
],
[
220,
231
],
[
242,
233
],
[
270,
234
],
[
243,
237
],
[
252,
237
],
[
255,
237
],
[
239,
240
],
[
270,
242
],
[
242,
243
],
[
245,
246
],
[
248,
249
],
[
251,
252
],
[
254,
255
],
[
257,
258
],
[
260,
261
],
[
263,
264
],
[
266,
267
],
[
269,
270
],
[
272,
273
]
] |
[
"import sys\ninput = sys.stdin.buffer.readline\nN = int(input())\nt = list(map(int, input().split()))\na = list(map(int, input().split()))\nmod = 10 ** 9 + 7\nfree = [0] * N\nf = 0\nif N == 1:\n if t[0] == a[0]:\n print(1)\n else:\n print(0)\n exit(0)\nif max(a) != max(t):\n print(0)\n exit(0)\nfor i in range(1, N - 1):\n if t[i - 1] == t[i]:\n free[i] = t[i]\n if t[i - 1] != t[i]:\n if t[i] > a[i]:\n f = 1\n break\n if a[i] != a[i + 1]:\n if a[i] > t[i]:\n f = 1\n break\nfor i in range(N - 2, 0, -1):\n if a[i + 1] == a[i] and t[i - 1] == t[i]:\n free[i] = min(t[i], a[i])\n else:\n free[i] = 0\nres = 1\nif f:\n print(0)\n exit(0)\nfor i in range(N):\n res *= max(1, free[i])\n res %= mod\nprint(res)",
"import sys",
"sys",
"input = sys.stdin.buffer.readline",
"input",
"sys.stdin.buffer.readline",
"sys.stdin.buffer",
"sys.stdin",
"sys",
"stdin",
"buffer",
"readline",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"t = list(map(int, input().split()))",
"t",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"a = list(map(int, input().split()))",
"a",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"mod = 10 ** 9 + 7",
"mod",
"10 ** 9 + 7",
"10 ** 9",
"10",
"9",
"7",
"free = [0] * N",
"free",
"[0] * N",
"[0]",
"0",
"N",
"f = 0",
"f",
"0",
"if N == 1:\n if t[0] == a[0]:\n print(1)\n else:\n print(0)\n exit(0)",
"N == 1",
"N",
"1",
"if t[0] == a[0]:\n print(1)\n else:\n print(0)\n ",
"t[0] == a[0]",
"t[0]",
"t",
"0",
"a[0]",
"a",
"0",
"print(1)",
"print",
"1",
"print(0)",
"print",
"0",
"exit(0)",
"exit",
"0",
"if max(a) != max(t):\n print(0)\n exit(0)",
"max(a) != max(t)",
"max(a)",
"max",
"a",
"max(t)",
"max",
"t",
"print(0)",
"print",
"0",
"exit(0)",
"exit",
"0",
"for i in range(1, N - 1):\n if t[i - 1] == t[i]:\n free[i] = t[i]\n if t[i - 1] != t[i]:\n if t[i] > a[i]:\n f = 1\n break\n if a[i] != a[i + 1]:\n if a[i] > t[i]:\n f = 1\n break",
"i",
"range(1, N - 1)",
"range",
"1",
"N - 1",
"N",
"1",
"if t[i - 1] == t[i]:\n free[i] = t[i]\n ",
"t[i - 1] == t[i]",
"t[i - 1]",
"t",
"i - 1",
"i",
"1",
"t[i]",
"t",
"i",
"free[i] = t[i]",
"free[i]",
"free",
"i",
"t[i]",
"t",
"i",
"if t[i - 1] != t[i]:\n if t[i] > a[i]:\n f = 1\n break\n ",
"t[i - 1] != t[i]",
"t[i - 1]",
"t",
"i - 1",
"i",
"1",
"t[i]",
"t",
"i",
"if t[i] > a[i]:\n f = 1\n break\n ",
"t[i] > a[i]",
"t[i]",
"t",
"i",
"a[i]",
"a",
"i",
"f = 1",
"f",
"1",
"break",
"if a[i] != a[i + 1]:\n if a[i] > t[i]:\n f = 1\n break",
"a[i] != a[i + 1]",
"a[i]",
"a",
"i",
"a[i + 1]",
"a",
"i + 1",
"i",
"1",
"if a[i] > t[i]:\n f = 1\n break",
"a[i] > t[i]",
"a[i]",
"a",
"i",
"t[i]",
"t",
"i",
"f = 1",
"f",
"1",
"break",
"for i in range(N - 2, 0, -1):\n if a[i + 1] == a[i] and t[i - 1] == t[i]:\n free[i] = min(t[i], a[i])\n else:\n free[i] = 0",
"i",
"range(N - 2, 0, -1)",
"range",
"N - 2",
"N",
"2",
"0",
"-1",
"if a[i + 1] == a[i] and t[i - 1] == t[i]:\n free[i] = min(t[i], a[i])\n else:\n free[i] = 0",
"a[i + 1] == a[i] and t[i - 1] == t[i]",
"a[i + 1] == a[i]",
"a[i + 1]",
"a",
"i + 1",
"i",
"1",
"a[i]",
"a",
"i",
"t[i - 1] == t[i]",
"t[i - 1]",
"t",
"i - 1",
"i",
"1",
"t[i]",
"t",
"i",
"free[i] = min(t[i], a[i])",
"free[i]",
"free",
"i",
"min(t[i], a[i])",
"min",
"t[i]",
"t",
"i",
"a[i]",
"a",
"i",
"free[i] = 0",
"free[i]",
"free",
"i",
"0",
"res = 1",
"res",
"1",
"if f:\n print(0)\n exit(0)",
"f",
"print(0)",
"print",
"0",
"exit(0)",
"exit",
"0",
"for i in range(N):\n res *= max(1, free[i])\n res %= mod",
"i",
"range(N)",
"range",
"N",
"res *= max(1, free[i])",
"res",
"max(1, free[i])",
"max",
"1",
"free[i]",
"free",
"i",
"res %= mod",
"res",
"mod",
"print(res)",
"print",
"res",
"f = 1",
"1",
"f",
"res %= mod",
"mod",
"res",
"t = list(map(int, input().split()))",
"list(map(int, input().split()))",
"t",
"f = 1",
"1",
"f",
"res *= max(1, free[i])",
"max(1, free[i])",
"res",
"res = 1",
"1",
"res",
"input = sys.stdin.buffer.readline",
"sys.stdin.buffer.readline",
"input",
"f = 0",
"0",
"f",
"a = list(map(int, input().split()))",
"list(map(int, input().split()))",
"a",
"N = int(input())",
"int(input())",
"N",
"mod = 10 ** 9 + 7",
"10 ** 9 + 7",
"mod",
"free = [0] * N",
"[0] * N",
"free"
] |
import sys
input = sys.stdin.buffer.readline
N = int(input())
t = list(map(int, input().split()))
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
free = [0] * N
f = 0
if N == 1:
if t[0] == a[0]:
print(1)
else:
print(0)
exit(0)
if max(a) != max(t):
print(0)
exit(0)
for i in range(1, N - 1):
if t[i - 1] == t[i]:
free[i] = t[i]
if t[i - 1] != t[i]:
if t[i] > a[i]:
f = 1
break
if a[i] != a[i + 1]:
if a[i] > t[i]:
f = 1
break
for i in range(N - 2, 0, -1):
if a[i + 1] == a[i] and t[i - 1] == t[i]:
free[i] = min(t[i], a[i])
else:
free[i] = 0
res = 1
if f:
print(0)
exit(0)
for i in range(N):
res *= max(1, free[i])
res %= mod
print(res)
|
[
7,
14,
2,
13,
17,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
17,
14,
2,
2,
18,
13,
17,
18,
13,
17,
2,
18,
13,
2,
13,
17,
18,
13,
2,
13,
17,
0,
13,
17,
28,
13,
4,
13,
2,
13,
17,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
13,
17,
14,
2,
2,
18,
13,
13,
18,
13,
2,
13,
17,
2,
18,
13,
2,
13,
17,
18,
13,
2,
13,
17,
0,
13,
17,
28,
13,
4,
13,
2,
13,
17,
17,
17,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
13,
17,
14,
2,
2,
18,
13,
13,
18,
13,
2,
13,
17,
2,
18,
13,
2,
13,
17,
18,
13,
2,
13,
17,
0,
13,
17,
28,
13,
4,
13,
17,
2,
13,
17,
14,
2,
40,
18,
13,
13,
18,
13,
2,
13,
17,
40,
18,
13,
13,
18,
13,
2,
13,
17,
9,
0,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
13,
4,
13,
2,
17,
17,
4,
13,
13,
10,
4,
13,
10,
4,
13,
10,
17,
13,
10,
17,
13,
10,
4,
13,
10,
4,
13,
10,
17,
13,
10,
17,
13,
10,
4,
13,
10,
17,
13,
10,
17,
13
] |
[
[
227,
6
],
[
206,
12
],
[
215,
24
],
[
221,
36
],
[
207,
42
],
[
216,
45
],
[
207,
49
],
[
228,
51
],
[
216,
54
],
[
228,
56
],
[
209,
59
],
[
63,
62
],
[
228,
66
],
[
207,
71
],
[
62,
72
],
[
207,
74
],
[
62,
76
],
[
212,
79
],
[
207,
85
],
[
62,
86
],
[
207,
88
],
[
62,
90
],
[
207,
94
],
[
62,
96
],
[
216,
99
],
[
62,
101
],
[
230,
104
],
[
108,
107
],
[
228,
111
],
[
216,
118
],
[
107,
119
],
[
216,
121
],
[
107,
123
],
[
224,
126
],
[
216,
132
],
[
107,
133
],
[
216,
135
],
[
107,
137
],
[
216,
141
],
[
107,
143
],
[
207,
146
],
[
107,
148
],
[
233,
151
],
[
155,
154
],
[
228,
159
],
[
207,
165
],
[
154,
166
],
[
207,
168
],
[
154,
170
],
[
216,
174
],
[
154,
175
],
[
216,
177
],
[
154,
179
],
[
218,
183
],
[
216,
187
],
[
154,
188
],
[
207,
190
],
[
154,
191
],
[
203,
193
],
[
204,
201
],
[
219,
201
],
[
234,
201
],
[
225,
201
],
[
231,
201
],
[
213,
201
],
[
210,
201
],
[
222,
201
],
[
203,
204
],
[
206,
207
],
[
209,
210
],
[
212,
213
],
[
215,
216
],
[
218,
219
],
[
221,
222
],
[
224,
225
],
[
227,
228
],
[
230,
231
],
[
233,
234
]
] |
[
"\nif __name__ == '__main__':\n N = int(input())\n T = list(map(int, input().split()))\n A = list(map(int, input().split()))\n ans = 1\n if T[0] > A[0] or T[N-1] < A[N-1]:\n ans = 0\n for i in range(N-1):\n if T[i] > T[i+1]:\n ans = 0\n if T[i] < T[i+1] and T[i+1] > A[i+1]:\n ans = 0\n for i in range(N-1, 0, -1):\n if A[i] > A[i-1]:\n ans = 0\n if A[i] < A[i-1] and A[i-1] > T[i-1]:\n ans = 0\n for i in range(1, N-1):\n if T[i] != T[i-1] or A[i] != A[i+1]:\n continue\n else:\n ans *= min(A[i], T[i])\n ans %= int(1e9+7)\n print(ans)",
"if __name__ == '__main__':\n N = int(input())\n T = list(map(int, input().split()))\n A = list(map(int, input().split()))\n ans = 1\n if T[0] > A[0] or T[N-1] < A[N-1]:\n ans = 0\n for i in range(N-1):\n if T[i] > T[i+1]:\n ans = 0\n if T[i] < T[i+1] and T[i+1] > A[i+1]:\n ans = 0\n for i in range(N-1, 0, -1):\n if A[i] > A[i-1]:\n ans = 0\n if A[i] < A[i-1] and A[i-1] > T[i-1]:\n ans = 0\n for i in range(1, N-1):\n if T[i] != T[i-1] or A[i] != A[i+1]:\n continue\n else:\n ans *= min(A[i], T[i])\n ans %= int(1e9+7)\n print(ans)",
"__name__ == '__main__'",
"__name__",
"'__main__'",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"T = list(map(int, input().split()))",
"T",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"A = list(map(int, input().split()))",
"A",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"ans = 1",
"ans",
"1",
"if T[0] > A[0] or T[N-1] < A[N-1]:\n ans = 0\n ",
"T[0] > A[0] or T[N-1] < A[N-1]",
"T[0] > A[0]",
"T[0]",
"T",
"0",
"A[0]",
"A",
"0",
"T[N-1] < A[N-1]",
"T[N-1]",
"T",
"N-1",
"N",
"1",
"A[N-1]",
"A",
"N-1",
"N",
"1",
"ans = 0",
"ans",
"0",
"for i in range(N-1):\n if T[i] > T[i+1]:\n ans = 0\n if T[i] < T[i+1] and T[i+1] > A[i+1]:\n ans = 0\n ",
"i",
"range(N-1)",
"range",
"N-1",
"N",
"1",
"if T[i] > T[i+1]:\n ans = 0\n ",
"T[i] > T[i+1]",
"T[i]",
"T",
"i",
"T[i+1]",
"T",
"i+1",
"i",
"1",
"ans = 0",
"ans",
"0",
"if T[i] < T[i+1] and T[i+1] > A[i+1]:\n ans = 0\n ",
"T[i] < T[i+1] and T[i+1] > A[i+1]",
"T[i] < T[i+1]",
"T[i]",
"T",
"i",
"T[i+1]",
"T",
"i+1",
"i",
"1",
"T[i+1] > A[i+1]",
"T[i+1]",
"T",
"i+1",
"i",
"1",
"A[i+1]",
"A",
"i+1",
"i",
"1",
"ans = 0",
"ans",
"0",
"for i in range(N-1, 0, -1):\n if A[i] > A[i-1]:\n ans = 0\n if A[i] < A[i-1] and A[i-1] > T[i-1]:\n ans = 0\n ",
"i",
"range(N-1, 0, -1)",
"range",
"N-1",
"N",
"1",
"0",
"-1",
"if A[i] > A[i-1]:\n ans = 0\n ",
"A[i] > A[i-1]",
"A[i]",
"A",
"i",
"A[i-1]",
"A",
"i-1",
"i",
"1",
"ans = 0",
"ans",
"0",
"if A[i] < A[i-1] and A[i-1] > T[i-1]:\n ans = 0\n ",
"A[i] < A[i-1] and A[i-1] > T[i-1]",
"A[i] < A[i-1]",
"A[i]",
"A",
"i",
"A[i-1]",
"A",
"i-1",
"i",
"1",
"A[i-1] > T[i-1]",
"A[i-1]",
"A",
"i-1",
"i",
"1",
"T[i-1]",
"T",
"i-1",
"i",
"1",
"ans = 0",
"ans",
"0",
"for i in range(1, N-1):\n if T[i] != T[i-1] or A[i] != A[i+1]:\n continue\n else:\n ans *= min(A[i], T[i])\n ans %= int(1e9+7)\n ",
"i",
"range(1, N-1)",
"range",
"1",
"N-1",
"N",
"1",
"if T[i] != T[i-1] or A[i] != A[i+1]:\n continue\n else:\n ans *= min(A[i], T[i])\n ans %= int(1e9+7)\n ",
"T[i] != T[i-1] or A[i] != A[i+1]",
"T[i] != T[i-1]",
"T[i]",
"T",
"i",
"T[i-1]",
"T",
"i-1",
"i",
"1",
"A[i] != A[i+1]",
"A[i]",
"A",
"i",
"A[i+1]",
"A",
"i+1",
"i",
"1",
"continue",
"ans *= min(A[i], T[i])",
"ans",
"min(A[i], T[i])",
"min",
"A[i]",
"A",
"i",
"T[i]",
"T",
"i",
"ans %= int(1e9+7)",
"ans",
"int(1e9+7)",
"int",
"1e9+7",
"1e9",
"7",
"print(ans)",
"print",
"ans",
"ans %= int(1e9+7)",
"int(1e9+7)",
"ans",
"T = list(map(int, input().split()))",
"list(map(int, input().split()))",
"T",
"ans = 0",
"0",
"ans",
"ans = 0",
"0",
"ans",
"A = list(map(int, input().split()))",
"list(map(int, input().split()))",
"A",
"ans *= min(A[i], T[i])",
"min(A[i], T[i])",
"ans",
"ans = 1",
"1",
"ans",
"ans = 0",
"0",
"ans",
"N = int(input())",
"int(input())",
"N",
"ans = 0",
"0",
"ans",
"ans = 0",
"0",
"ans"
] |
if __name__ == '__main__':
N = int(input())
T = list(map(int, input().split()))
A = list(map(int, input().split()))
ans = 1
if T[0] > A[0] or T[N-1] < A[N-1]:
ans = 0
for i in range(N-1):
if T[i] > T[i+1]:
ans = 0
if T[i] < T[i+1] and T[i+1] > A[i+1]:
ans = 0
for i in range(N-1, 0, -1):
if A[i] > A[i-1]:
ans = 0
if A[i] < A[i-1] and A[i-1] > T[i-1]:
ans = 0
for i in range(1, N-1):
if T[i] != T[i-1] or A[i] != A[i+1]:
continue
else:
ans *= min(A[i], T[i])
ans %= int(1e9+7)
print(ans)
|
[
7,
0,
13,
2,
2,
17,
17,
17,
0,
13,
4,
13,
4,
13,
0,
31,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
31,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
17,
0,
13,
17,
14,
2,
2,
13,
17,
2,
18,
13,
2,
13,
17,
18,
13,
13,
0,
13,
18,
13,
13,
14,
2,
2,
13,
2,
13,
17,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
13,
18,
13,
13,
14,
2,
2,
13,
17,
2,
13,
17,
0,
13,
2,
2,
13,
4,
13,
18,
13,
13,
18,
13,
13,
13,
14,
2,
2,
13,
17,
40,
13,
17,
14,
2,
13,
18,
13,
13,
14,
2,
40,
13,
17,
2,
13,
17,
14,
2,
13,
18,
13,
13,
14,
40,
13,
13,
4,
13,
13,
10,
2,
13,
10,
17,
13,
10,
4,
13,
10,
2,
13,
10,
17,
13,
10,
17,
13,
10,
18,
13,
10,
18,
13
] |
[
[
157,
2
],
[
154,
9
],
[
17,
15
],
[
28,
26
],
[
160,
37
],
[
41,
40
],
[
155,
43
],
[
151,
45
],
[
163,
48
],
[
40,
53
],
[
40,
59
],
[
40,
63
],
[
166,
65
],
[
40,
68
],
[
40,
72
],
[
155,
74
],
[
40,
79
],
[
40,
83
],
[
169,
86
],
[
40,
89
],
[
167,
93
],
[
152,
93
],
[
170,
96
],
[
164,
96
],
[
148,
99
],
[
161,
102
],
[
149,
102
],
[
40,
107
],
[
40,
110
],
[
158,
111
],
[
167,
115
],
[
152,
115
],
[
170,
118
],
[
164,
118
],
[
170,
122
],
[
164,
122
],
[
40,
125
],
[
167,
129
],
[
152,
129
],
[
170,
132
],
[
164,
132
],
[
170,
136
],
[
164,
136
],
[
40,
139
],
[
167,
142
],
[
152,
142
],
[
170,
143
],
[
164,
143
],
[
149,
146
],
[
161,
146
],
[
148,
149
],
[
151,
152
],
[
154,
155
],
[
157,
158
],
[
160,
161
],
[
163,
164
],
[
166,
167
],
[
169,
170
]
] |
[
"MOD = 10**9 + 7\nN = int(input())\n*T, = map(int, input().split())\n*A, = map(int, input().split())\nans = 1\nfor i in range(N):\n temp1 = -1\n temp2 = -1\n if i == 0 or T[i-1] < T[i]:\n temp1 = T[i]\n if i == N-1 or A[i] > A[i+1]:\n temp2 = A[i]\n\n if temp1 == -1 and temp2 == -1:\n ans = (ans * min(T[i], A[i])) % MOD\n elif temp1 == -1 and temp2 != -1:\n if temp2 > T[i]: ans = 0; break\n elif temp1 != -1 and temp2 == -1:\n if temp2 > A[i]: ans = 0; break\n else:\n if temp1 != temp2: ans = 0; break\nprint(ans)",
"MOD = 10**9 + 7",
"MOD",
"10**9 + 7",
"10**9",
"10",
"9",
"7",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"*T, = map(int, input().split())",
"*T",
"T",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"*A, = map(int, input().split())",
"*A",
"A",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"ans = 1",
"ans",
"1",
"for i in range(N):\n temp1 = -1\n temp2 = -1\n if i == 0 or T[i-1] < T[i]:\n temp1 = T[i]\n if i == N-1 or A[i] > A[i+1]:\n temp2 = A[i]\n\n if temp1 == -1 and temp2 == -1:\n ans = (ans * min(T[i], A[i])) % MOD\n elif temp1 == -1 and temp2 != -1:\n if temp2 > T[i]: ans = 0; break\n elif temp1 != -1 and temp2 == -1:\n if temp2 > A[i]: ans = 0; break\n else:\n if temp1 != temp2: ans = 0; break",
"i",
"range(N)",
"range",
"N",
"temp1 = -1",
"temp1",
"-1",
"temp2 = -1",
"temp2",
"-1",
"if i == 0 or T[i-1] < T[i]:\n temp1 = T[i]\n ",
"i == 0 or T[i-1] < T[i]",
"i == 0",
"i",
"0",
"T[i-1] < T[i]",
"T[i-1]",
"T",
"i-1",
"i",
"1",
"T[i]",
"T",
"i",
"temp1 = T[i]",
"temp1",
"T[i]",
"T",
"i",
"if i == N-1 or A[i] > A[i+1]:\n temp2 = A[i]\n\n ",
"i == N-1 or A[i] > A[i+1]",
"i == N-1",
"i",
"N-1",
"N",
"1",
"A[i] > A[i+1]",
"A[i]",
"A",
"i",
"A[i+1]",
"A",
"i+1",
"i",
"1",
"temp2 = A[i]",
"temp2",
"A[i]",
"A",
"i",
"if temp1 == -1 and temp2 == -1:\n ans = (ans * min(T[i], A[i])) % MOD\n elif temp1 == -1 and temp2 != -1:\n if temp2 > T[i]: ans = 0; break\n elif temp1 != -1 and temp2 == -1:\n if temp2 > A[i]: ans = 0; break\n else:\n if temp1 != temp2: ans = 0; break",
"temp1 == -1 and temp2 == -1",
"temp1 == -1",
"temp1",
"-1",
"temp2 == -1",
"temp2",
"-1",
"ans = (ans * min(T[i], A[i])) % MOD",
"ans",
"(ans * min(T[i], A[i])) % MOD",
"ans * min(T[i], A[i])",
"ans",
"min(T[i], A[i])",
"min",
"T[i]",
"T",
"i",
"A[i]",
"A",
"i",
"MOD",
"elif temp1 == -1 and temp2 != -1:\n if temp2 > T[i]: ans = 0; break\n ",
"temp1 == -1 and temp2 != -1",
"temp1 == -1",
"temp1",
"-1",
"temp2 != -1",
"temp2",
"-1",
"if temp2 > T[i]: ans = 0; break\n ",
"temp2 > T[i]",
"temp2",
"T[i]",
"T",
"i",
"elif temp1 != -1 and temp2 == -1:\n if temp2 > A[i]: ans = 0; break\n ",
"temp1 != -1 and temp2 == -1",
"temp1 != -1",
"temp1",
"-1",
"temp2 == -1",
"temp2",
"-1",
"if temp2 > A[i]: ans = 0; break\n ",
"temp2 > A[i]",
"temp2",
"A[i]",
"A",
"i",
"if temp1 != temp2: ans = ",
"temp1 != temp2",
"temp1",
"temp2",
"print(ans)",
"print",
"ans",
"ans = (ans * min(T[i], A[i])) % MOD",
"(ans * min(T[i], A[i])) % MOD",
"ans",
"temp1 = -1",
"-1",
"temp1",
"N = int(input())",
"int(input())",
"N",
"MOD = 10**9 + 7",
"10**9 + 7",
"MOD",
"ans = 1",
"1",
"ans",
"temp2 = -1",
"-1",
"temp2",
"temp1 = T[i]",
"T[i]",
"temp1",
"temp2 = A[i]",
"A[i]",
"temp2"
] |
MOD = 10**9 + 7
N = int(input())
*T, = map(int, input().split())
*A, = map(int, input().split())
ans = 1
for i in range(N):
temp1 = -1
temp2 = -1
if i == 0 or T[i-1] < T[i]:
temp1 = T[i]
if i == N-1 or A[i] > A[i+1]:
temp2 = A[i]
if temp1 == -1 and temp2 == -1:
ans = (ans * min(T[i], A[i])) % MOD
elif temp1 == -1 and temp2 != -1:
if temp2 > T[i]: ans = 0; break
elif temp1 != -1 and temp2 == -1:
if temp2 > A[i]: ans = 0; break
else:
if temp1 != temp2: ans = 0; break
print(ans)
|
[
7,
15,
13,
0,
13,
18,
18,
13,
13,
13,
4,
18,
13,
13,
2,
17,
17,
15,
13,
0,
13,
2,
2,
17,
17,
17,
0,
13,
4,
13,
4,
13,
0,
13,
4,
18,
13,
13,
4,
18,
4,
13,
13,
0,
13,
18,
13,
13,
0,
13,
4,
18,
13,
13,
4,
18,
4,
13,
13,
0,
13,
18,
13,
13,
0,
13,
4,
18,
13,
13,
0,
18,
18,
13,
39,
17,
40,
18,
13,
39,
17,
18,
13,
39,
17,
17,
0,
13,
18,
13,
39,
17,
0,
13,
4,
18,
13,
13,
0,
18,
18,
13,
39,
17,
40,
18,
13,
39,
17,
18,
13,
39,
17,
17,
0,
13,
18,
13,
39,
17,
0,
13,
18,
13,
39,
17,
0,
13,
4,
18,
13,
13,
13,
13,
0,
13,
4,
18,
13,
13,
13,
13,
0,
13,
4,
18,
13,
13,
17,
2,
2,
13,
13,
17,
0,
13,
4,
13,
13,
0,
13,
4,
13,
2,
2,
13,
17,
17,
0,
13,
4,
18,
13,
13,
13,
2,
13,
17,
0,
18,
13,
39,
13,
17,
0,
13,
4,
18,
13,
13,
39,
13,
13,
28,
13,
4,
13,
17,
13,
0,
18,
13,
39,
18,
13,
39,
0,
18,
13,
39,
13,
28,
13,
4,
13,
17,
13,
0,
18,
13,
13,
18,
13,
2,
13,
17,
0,
18,
13,
13,
13,
0,
13,
18,
13,
17,
4,
13,
13,
10,
4,
13,
10,
4,
13,
10,
18,
13,
10,
18,
13,
10,
2,
13,
10,
4,
13,
10,
4,
13,
10,
18,
13,
10,
18,
13,
10,
4,
13,
10,
18,
13,
10,
4,
13,
10,
4,
13,
10,
4,
13,
10,
4,
13,
10,
4,
13,
10,
4,
13,
10,
4,
13
] |
[
[
246,
4
],
[
252,
20
],
[
243,
27
],
[
247,
31
],
[
255,
33
],
[
247,
41
],
[
45,
44
],
[
240,
49
],
[
247,
57
],
[
61,
60
],
[
285,
65
],
[
256,
68
],
[
85,
71
],
[
286,
73
],
[
256,
78
],
[
256,
82
],
[
270,
87
],
[
241,
89
],
[
273,
93
],
[
271,
96
],
[
241,
96
],
[
113,
99
],
[
274,
101
],
[
271,
106
],
[
241,
106
],
[
271,
110
],
[
241,
110
],
[
249,
115
],
[
271,
117
],
[
241,
117
],
[
264,
121
],
[
274,
123
],
[
276,
127
],
[
265,
132
],
[
274,
132
],
[
286,
133
],
[
267,
135
],
[
250,
140
],
[
271,
140
],
[
241,
140
],
[
256,
141
],
[
282,
143
],
[
268,
151
],
[
277,
152
],
[
288,
155
],
[
283,
158
],
[
291,
160
],
[
289,
165
],
[
279,
169
],
[
283,
174
],
[
292,
176
],
[
183,
179
],
[
280,
180
],
[
283,
180
],
[
258,
185
],
[
280,
188
],
[
283,
188
],
[
195,
194
],
[
292,
198
],
[
203,
200
],
[
259,
201
],
[
280,
201
],
[
283,
201
],
[
259,
204
],
[
280,
204
],
[
283,
204
],
[
210,
207
],
[
259,
208
],
[
280,
208
],
[
283,
208
],
[
253,
210
],
[
213,
212
],
[
292,
216
],
[
221,
218
],
[
259,
219
],
[
280,
219
],
[
283,
219
],
[
212,
220
],
[
259,
222
],
[
280,
222
],
[
283,
222
],
[
212,
224
],
[
230,
227
],
[
259,
228
],
[
280,
228
],
[
283,
228
],
[
212,
229
],
[
253,
230
],
[
261,
232
],
[
259,
234
],
[
280,
234
],
[
283,
234
],
[
262,
238
],
[
240,
241
],
[
243,
244
],
[
246,
247
],
[
249,
250
],
[
252,
253
],
[
255,
256
],
[
258,
259
],
[
261,
262
],
[
264,
265
],
[
267,
268
],
[
270,
271
],
[
273,
274
],
[
276,
277
],
[
279,
280
],
[
282,
283
],
[
285,
286
],
[
288,
289
],
[
291,
292
]
] |
[
"import sys\ninput = sys.stdin.readline\nsys.setrecursionlimit(10 ** 7)\n\nimport numpy as np\n\nMOD = 10**9 + 7\n\nN = int(input())\nT = np.array(input().split(),dtype=np.int64)\nA = np.array(input().split(),dtype=np.int64)\n\nTlower = T.copy()\nTlower[1:][T[1:]<=T[:-1]] = 1\n\nA = A[::-1]\nAlower = A.copy()\nAlower[1:][A[1:]<=A[:-1]] = 1\nA = A[::-1]; Alower = Alower[::-1]\n\nlower = np.maximum(Alower,Tlower)\nupper = np.minimum(A,T)\nx = np.maximum(0,upper - lower + 1)\n\nL = len(x); Lsq = int(L**.5+1)\nx = np.resize(x,Lsq**2); x[L:] = 1; x = x.reshape((Lsq,Lsq))\nfor n in range(1,Lsq):\n x[:,n] *= x[:,n-1]; x[:,n] %= MOD\nfor n in range(1,Lsq):\n x[n] *= x[n-1,-1]; x[n] %= MOD\nanswer = x[-1,-1]\nprint(answer)",
"import sys",
"sys",
"input = sys.stdin.readline",
"input",
"sys.stdin.readline",
"sys.stdin",
"sys",
"stdin",
"readline",
"sys.setrecursionlimit(10 ** 7)",
"sys.setrecursionlimit",
"sys",
"setrecursionlimit",
"10 ** 7",
"10",
"7",
"import numpy as np",
"numpy",
"MOD = 10**9 + 7",
"MOD",
"10**9 + 7",
"10**9",
"10",
"9",
"7",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"T = np.array(input().split(),dtype=np.int64)",
"T",
"np.array(input().split(),dtype=np.int64)",
"np.array",
"np",
"array",
"input().split()",
"().split",
"()",
"input",
"split",
"dtype=np.int64",
"dtype",
"np.int64",
"np",
"int64",
"A = np.array(input().split(),dtype=np.int64)",
"A",
"np.array(input().split(),dtype=np.int64)",
"np.array",
"np",
"array",
"input().split()",
"().split",
"()",
"input",
"split",
"dtype=np.int64",
"dtype",
"np.int64",
"np",
"int64",
"Tlower = T.copy()",
"Tlower",
"T.copy()",
"T.copy",
"T",
"copy",
"Tlower[1:][T[1:]<=T[:-1]] = 1",
"Tlower[1:][T[1:]<=T[:-1]]",
"[1:]",
"Tlower",
"1:",
"1",
"T[1:]<=T[:-1]",
"T[1:]",
"T",
"1:",
"1",
"T[:-1]",
"T",
":-1",
"-1",
"1",
"A = A[::-1]",
"A",
"A[::-1]",
"A",
"::-1",
"-1",
"Alower = A.copy()",
"Alower",
"A.copy()",
"A.copy",
"A",
"copy",
"Alower[1:][A[1:]<=A[:-1]] = 1",
"Alower[1:][A[1:]<=A[:-1]]",
"[1:]",
"Alower",
"1:",
"1",
"A[1:]<=A[:-1]",
"A[1:]",
"A",
"1:",
"1",
"A[:-1]",
"A",
":-1",
"-1",
"1",
"A = A[::-1]",
"A",
"A[::-1]",
"A",
"::-1",
"-1",
"Alower = Alower[::-1]",
"Alower",
"Alower[::-1]",
"Alower",
"::-1",
"-1",
"lower = np.maximum(Alower,Tlower)",
"lower",
"np.maximum(Alower,Tlower)",
"np.maximum",
"np",
"maximum",
"Alower",
"Tlower",
"upper = np.minimum(A,T)",
"upper",
"np.minimum(A,T)",
"np.minimum",
"np",
"minimum",
"A",
"T",
"x = np.maximum(0,upper - lower + 1)",
"x",
"np.maximum(0,upper - lower + 1)",
"np.maximum",
"np",
"maximum",
"0",
"upper - lower + 1",
"upper - lower",
"upper",
"lower",
"1",
"L = len(x)",
"L",
"len(x)",
"len",
"x",
"Lsq = int(L**.5+1)",
"Lsq",
"int(L**.5+1)",
"int",
"L**.5+1",
"L**.5",
"L",
".5",
"1",
"x = np.resize(x,Lsq**2)",
"x",
"np.resize(x,Lsq**2)",
"np.resize",
"np",
"resize",
"x",
"Lsq**2",
"Lsq",
"2",
"x[L:] = 1",
"x[L:]",
"x",
"L:",
"L",
"1",
"x = x.reshape((Lsq,Lsq))",
"x",
"x.reshape((Lsq,Lsq))",
"x.reshape",
"x",
"reshape",
"(Lsq,Lsq)",
"Lsq",
"Lsq",
"for n in range(1,Lsq):\n x[:,n] *= x[:,n-1]; x[:,n] %= MOD",
"n",
"range(1,Lsq)",
"range",
"1",
"Lsq",
"x[:,n] *= x[:,n-1]",
"x[:,n]",
"x",
":",
"x[:,n-1]",
"x",
":",
"x[:,n] %= MOD",
"x[:,n]",
"x",
":",
"MOD",
"for n in range(1,Lsq):\n x[n] *= x[n-1,-1]; x[n] %= MOD",
"n",
"range(1,Lsq)",
"range",
"1",
"Lsq",
"x[n] *= x[n-1,-1]",
"x[n]",
"x",
"n",
"x[n-1,-1]",
"x",
"n-1",
"n",
"1",
"x[n] %= MOD",
"x[n]",
"x",
"n",
"MOD",
"answer = x[-1,-1]",
"answer",
"x[-1,-1]",
"x",
"-1",
"print(answer)",
"print",
"answer",
"A = np.array(input().split(),dtype=np.int64)",
"np.array(input().split(),dtype=np.int64)",
"A",
"N = int(input())",
"int(input())",
"N",
"input = sys.stdin.readline",
"sys.stdin.readline",
"input",
"A = A[::-1]",
"A[::-1]",
"A",
"MOD = 10**9 + 7",
"10**9 + 7",
"MOD",
"T = np.array(input().split(),dtype=np.int64)",
"np.array(input().split(),dtype=np.int64)",
"T",
"x = x.reshape((Lsq,Lsq))",
"x.reshape((Lsq,Lsq))",
"x",
"answer = x[-1,-1]",
"x[-1,-1]",
"answer",
"Alower = Alower[::-1]",
"Alower[::-1]",
"Alower",
"upper = np.minimum(A,T)",
"np.minimum(A,T)",
"upper",
"A = A[::-1]",
"A[::-1]",
"A",
"Alower = A.copy()",
"A.copy()",
"Alower",
"lower = np.maximum(Alower,Tlower)",
"np.maximum(Alower,Tlower)",
"lower",
"x = np.resize(x,Lsq**2)",
"np.resize(x,Lsq**2)",
"x",
"x = np.maximum(0,upper - lower + 1)",
"np.maximum(0,upper - lower + 1)",
"x",
"Tlower = T.copy()",
"T.copy()",
"Tlower",
"L = len(x)",
"len(x)",
"L",
"Lsq = int(L**.5+1)",
"int(L**.5+1)",
"Lsq"
] |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
import numpy as np
MOD = 10**9 + 7
N = int(input())
T = np.array(input().split(),dtype=np.int64)
A = np.array(input().split(),dtype=np.int64)
Tlower = T.copy()
Tlower[1:][T[1:]<=T[:-1]] = 1
A = A[::-1]
Alower = A.copy()
Alower[1:][A[1:]<=A[:-1]] = 1
A = A[::-1]; Alower = Alower[::-1]
lower = np.maximum(Alower,Tlower)
upper = np.minimum(A,T)
x = np.maximum(0,upper - lower + 1)
L = len(x); Lsq = int(L**.5+1)
x = np.resize(x,Lsq**2); x[L:] = 1; x = x.reshape((Lsq,Lsq))
for n in range(1,Lsq):
x[:,n] *= x[:,n-1]; x[:,n] %= MOD
for n in range(1,Lsq):
x[n] *= x[n-1,-1]; x[n] %= MOD
answer = x[-1,-1]
print(answer)
|
[
7,
15,
15,
13,
13,
13,
13,
13,
13,
13,
13,
4,
18,
13,
13,
2,
17,
17,
0,
13,
4,
13,
17,
0,
13,
2,
2,
17,
17,
17,
0,
13,
2,
17,
17,
12,
13,
12,
13,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
0,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
39,
17,
17,
0,
13,
13,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
18,
13,
13,
14,
40,
13,
13,
0,
18,
13,
13,
39,
13,
13,
0,
18,
13,
13,
39,
17,
13,
0,
13,
13,
0,
13,
17,
28,
13,
4,
13,
4,
13,
13,
0,
13,
18,
13,
13,
0,
13,
18,
13,
13,
13,
14,
40,
13,
13,
14,
40,
40,
13,
13,
13,
0,
18,
13,
13,
39,
13,
13,
4,
13,
17,
4,
18,
13,
13,
0,
18,
13,
13,
39,
4,
13,
17,
13,
4,
13,
13,
13,
0,
13,
13,
0,
13,
17,
28,
13,
13,
13,
0,
13,
2,
2,
13,
13,
17,
0,
13,
13,
4,
13,
13,
10,
17,
13,
10,
4,
13,
10,
17,
13,
10,
18,
13,
10,
12,
13,
10,
2,
13,
10,
4,
13,
10,
18,
13,
10,
18,
13,
10,
13,
13,
10,
12,
13,
10,
4,
13,
10,
13,
13,
10,
4,
13,
10,
13,
13,
10,
2,
13,
10,
17,
13,
10,
18,
13,
10,
13,
13,
10,
2,
13
] |
[
[
185,
19
],
[
227,
24
],
[
197,
31
],
[
200,
40
],
[
221,
46
],
[
195,
48
],
[
215,
50
],
[
195,
52
],
[
56,
55
],
[
201,
58
],
[
209,
64
],
[
182,
67
],
[
71,
70
],
[
201,
73
],
[
206,
75
],
[
222,
77
],
[
70,
78
],
[
207,
81
],
[
183,
82
],
[
225,
82
],
[
87,
84
],
[
210,
85
],
[
70,
86
],
[
94,
91
],
[
210,
92
],
[
70,
93
],
[
224,
98
],
[
207,
99
],
[
188,
101
],
[
105,
104
],
[
201,
109
],
[
191,
111
],
[
216,
113
],
[
104,
114
],
[
233,
116
],
[
91,
117
],
[
84,
117
],
[
146,
117
],
[
132,
117
],
[
210,
118
],
[
104,
119
],
[
233,
120
],
[
192,
123
],
[
189,
124
],
[
237,
124
],
[
234,
128
],
[
192,
129
],
[
204,
130
],
[
135,
132
],
[
210,
133
],
[
104,
134
],
[
149,
146
],
[
210,
147
],
[
104,
148
],
[
234,
153
],
[
192,
156
],
[
204,
157
],
[
236,
159
],
[
192,
160
],
[
230,
162
],
[
239,
169
],
[
218,
176
],
[
228,
177
],
[
219,
180
],
[
240,
180
],
[
231,
180
],
[
182,
183
],
[
185,
186
],
[
188,
189
],
[
191,
192
],
[
197,
198
],
[
200,
201
],
[
91,
203
],
[
84,
203
],
[
146,
203
],
[
132,
203
],
[
233,
204
],
[
206,
207
],
[
209,
210
],
[
215,
216
],
[
228,
218
],
[
218,
219
],
[
221,
222
],
[
207,
224
],
[
224,
225
],
[
227,
228
],
[
230,
231
],
[
91,
233
],
[
84,
233
],
[
146,
233
],
[
132,
233
],
[
233,
234
],
[
192,
236
],
[
236,
237
],
[
239,
240
]
] |
[
"from collections import defaultdict,deque\nimport sys,heapq,bisect,math,itertools,string,queue,datetime\nsys.setrecursionlimit(10**8)\nINF = float('inf')\nmod = 10**9+7\neps = 10**-7\ndef inpl(): return list(map(int, input().split()))\ndef inpls(): return list(input().split())\n\nN = int(input())\ntt = inpl()\naa = inpl()\nhh = [[0,0] for i in range(N)]\n\nbt = 0\nfor i in range(N):\n\tt = tt[i]\n\tif t != bt:\n\t\thh[i] = [t,t]\n\telse:\n\t\thh[i] = [1,t]\n\tbt = t\n\nba = 0\nfor i in reversed(range(N)):\n\ta = aa[i]\n\tMIN,MAX = hh[i]\n\tif a != ba:\n\t\tif MIN <= a <= MAX:\n\t\t\thh[i] = [a,a]\n\t\telse:\n\t\t\tprint(0)\n\t\t\tsys.exit()\n\telse:\n\t\thh[i] = [max(1,MIN),min(a,MAX)]\n\n\tba = a\n\nans = 1\nfor azu,nyan in hh:\n\tans *= (nyan-azu+1)\n\tans %= mod\n\nprint(ans)",
"from collections import defaultdict,deque",
"import sys,heapq,bisect,math,itertools,string,queue,datetime",
"sys",
"heapq",
"bisect",
"math",
"itertools",
"string",
"queue",
"datetime",
"sys.setrecursionlimit(10**8)",
"sys.setrecursionlimit",
"sys",
"setrecursionlimit",
"10**8",
"10",
"8",
"INF = float('inf')",
"INF",
"float('inf')",
"float",
"'inf'",
"mod = 10**9+7",
"mod",
"10**9+7",
"10**9",
"10",
"9",
"7",
"eps = 10**-7",
"eps",
"10**-7",
"10",
"-7",
"def inpl(): return list(map(int, input().split()))",
"inpl",
"def inpls(): return list(input().split())",
"inpls",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"tt = inpl()",
"tt",
"inpl()",
"inpl",
"aa = inpl()",
"aa",
"inpl()",
"inpl",
"[0,0] for i in range(N)",
"for i in range(N)",
"i",
"range(N)",
"range",
"N",
"for i in range(N)",
"[0,0]",
"0",
"0",
"hh = [[0,0] for i in range(N)]",
"hh",
"[[0,0] for i in range(N)]",
"bt = 0",
"bt",
"0",
"for i in range(N):\n\tt = tt[i]\n\tif t != bt:\n\t\thh[i] = [t,t]\n\telse:\n\t\thh[i] = [1,t]\n\tbt = t",
"i",
"range(N)",
"range",
"N",
"t = tt[i]",
"t",
"tt[i]",
"tt",
"i",
"if t != bt:\n\t\thh[i] = [t,t]\n\telse:\n\t\thh[i] = [1,t]\n\t",
"t != bt",
"t",
"bt",
"hh[i] = [t,t]",
"hh[i]",
"hh",
"i",
"[t,t]",
"t",
"t",
"hh[i] = [1,t]",
"hh[i]",
"hh",
"i",
"[1,t]",
"1",
"t",
"bt = t",
"bt",
"t",
"ba = 0",
"ba",
"0",
"for i in reversed(range(N)):\n\ta = aa[i]\n\tMIN,MAX = hh[i]\n\tif a != ba:\n\t\tif MIN <= a <= MAX:\n\t\t\thh[i] = [a,a]\n\t\telse:\n\t\t\tprint(0)\n\t\t\tsys.exit()\n\telse:\n\t\thh[i] = [max(1,MIN),min(a,MAX)]\n\n\tba = a",
"i",
"reversed(range(N))",
"reversed",
"range(N)",
"range",
"N",
"a = aa[i]",
"a",
"aa[i]",
"aa",
"i",
"MIN,MAX = hh[i]",
"MIN",
"hh[i]",
"hh",
"i",
"MAX",
"if a != ba:\n\t\tif MIN <= a <= MAX:\n\t\t\thh[i] = [a,a]\n\t\telse:\n\t\t\tprint(0)\n\t\t\tsys.exit()\n\telse:\n\t\thh[i] = [max(1,MIN),min(a,MAX)]\n\n\t",
"a != ba",
"a",
"ba",
"if MIN <= a <= MAX:\n\t\t\thh[i] = [a,a]\n\t\telse:\n\t\t\tprint(0)\n\t\t\tsys.exit()\n\t",
"MIN <= a <= MAX",
"MIN <= a",
"MIN",
"a",
"MAX",
"hh[i] = [a,a]",
"hh[i]",
"hh",
"i",
"[a,a]",
"a",
"a",
"print(0)",
"print",
"0",
"sys.exit()",
"sys.exit",
"sys",
"exit",
"hh[i] = [max(1,MIN),min(a,MAX)]",
"hh[i]",
"hh",
"i",
"[max(1,MIN),min(a,MAX)]",
"max(1,MIN)",
"max",
"1",
"MIN",
"min(a,MAX)",
"min",
"a",
"MAX",
"ba = a",
"ba",
"a",
"ans = 1",
"ans",
"1",
"for azu,nyan in hh:\n\tans *= (nyan-azu+1)\n\tans %= mod",
"azu",
"nyan",
"hh",
"ans *= (nyan-azu+1)",
"ans",
"nyan-azu+1",
"nyan-azu",
"nyan",
"azu",
"1",
"ans %= mod",
"ans",
"mod",
"print(ans)",
"print",
"ans",
"bt = 0",
"0",
"bt",
"INF = float('inf')",
"float('inf')",
"INF",
"ba = 0",
"0",
"ba",
"a = aa[i]",
"aa[i]",
"a",
"def inpl(): return list(map(int, input().split()))",
"def inpl(): return list(map(int, input().split()))",
"inpl",
"eps = 10**-7",
"10**-7",
"eps",
"N = int(input())",
"int(input())",
"N",
"MAX = hh[i]",
"hh[i]",
"MAX",
"t = tt[i]",
"tt[i]",
"t",
"hh = [[0,0] for i in range(N)]",
"[[0,0] for i in range(N)]",
"hh",
"def inpls(): return list(input().split())",
"def inpls(): return list(input().split())",
"inpls",
"aa = inpl()",
"inpl()",
"aa",
"ans %= mod",
"mod",
"ans",
"tt = inpl()",
"inpl()",
"tt",
"bt = t",
"t",
"bt",
"mod = 10**9+7",
"10**9+7",
"mod",
"ans = 1",
"1",
"ans",
"MIN,MAX = hh[i]",
"hh[i]",
"MIN",
"ba = a",
"a",
"ba",
"ans *= (nyan-azu+1)",
"nyan-azu+1",
"ans"
] |
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
N = int(input())
tt = inpl()
aa = inpl()
hh = [[0,0] for i in range(N)]
bt = 0
for i in range(N):
t = tt[i]
if t != bt:
hh[i] = [t,t]
else:
hh[i] = [1,t]
bt = t
ba = 0
for i in reversed(range(N)):
a = aa[i]
MIN,MAX = hh[i]
if a != ba:
if MIN <= a <= MAX:
hh[i] = [a,a]
else:
print(0)
sys.exit()
else:
hh[i] = [max(1,MIN),min(a,MAX)]
ba = a
ans = 1
for azu,nyan in hh:
ans *= (nyan-azu+1)
ans %= mod
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
2,
2,
17,
17,
17,
0,
13,
2,
39,
17,
13,
0,
18,
13,
17,
18,
13,
17,
14,
2,
18,
13,
17,
18,
13,
17,
4,
13,
17,
4,
13,
28,
13,
4,
13,
2,
13,
17,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
18,
13,
2,
13,
17,
18,
13,
2,
13,
17,
14,
2,
18,
13,
2,
13,
17,
18,
13,
2,
13,
17,
4,
13,
17,
4,
13,
28,
13,
4,
13,
2,
13,
17,
17,
17,
14,
2,
18,
13,
2,
13,
17,
18,
13,
13,
0,
18,
13,
2,
13,
17,
18,
13,
2,
13,
17,
14,
2,
18,
13,
2,
13,
17,
18,
13,
2,
13,
17,
4,
13,
17,
4,
13,
14,
2,
18,
13,
2,
13,
17,
18,
13,
2,
13,
17,
4,
13,
17,
4,
13,
0,
18,
13,
2,
13,
17,
18,
13,
2,
13,
17,
0,
13,
17,
28,
13,
4,
13,
17,
2,
13,
17,
14,
2,
18,
13,
13,
17,
0,
13,
2,
2,
13,
4,
13,
18,
13,
13,
18,
13,
13,
13,
4,
13,
13,
10,
2,
13,
10,
4,
13,
10,
2,
13,
10,
4,
13,
10,
4,
13,
10,
2,
13,
10,
17,
13
] |
[
[
222,
2
],
[
231,
8
],
[
228,
20
],
[
234,
32
],
[
225,
39
],
[
223,
43
],
[
48,
45
],
[
226,
46
],
[
232,
49
],
[
232,
54
],
[
229,
57
],
[
66,
65
],
[
223,
69
],
[
232,
74
],
[
65,
75
],
[
232,
77
],
[
65,
79
],
[
87,
82
],
[
226,
83
],
[
65,
85
],
[
232,
88
],
[
65,
90
],
[
232,
95
],
[
65,
97
],
[
229,
100
],
[
65,
102
],
[
111,
110
],
[
223,
114
],
[
229,
121
],
[
110,
123
],
[
229,
126
],
[
110,
127
],
[
134,
129
],
[
226,
130
],
[
110,
132
],
[
229,
135
],
[
110,
137
],
[
229,
142
],
[
110,
144
],
[
232,
147
],
[
110,
149
],
[
229,
159
],
[
223,
161
],
[
232,
164
],
[
223,
166
],
[
179,
174
],
[
226,
175
],
[
223,
177
],
[
229,
180
],
[
223,
182
],
[
237,
185
],
[
189,
188
],
[
223,
193
],
[
226,
198
],
[
188,
199
],
[
219,
202
],
[
238,
205
],
[
220,
205
],
[
229,
209
],
[
188,
210
],
[
232,
212
],
[
188,
213
],
[
235,
214
],
[
220,
217
],
[
238,
217
],
[
219,
220
],
[
222,
223
],
[
225,
226
],
[
228,
229
],
[
231,
232
],
[
234,
235
],
[
237,
238
]
] |
[
"n = int(input())\nt = list(map(int, input().split()))\na = list(map(int, input().split()))\n\nmod = 10 ** 9 + 7\n\nyama = [0] * n\n\n# tは、t[i] == t[i + 1]だったら左の以外全部ありうる\nyama[0] = t[0]\nif t[0] > a[0]:\n print(0)\n exit()\nfor i in range(n - 1):\n if t[i] < t[i + 1]:\n # i + 1の高さ確定\n yama[i + 1] = t[i + 1]\n if t[i + 1] > a[i + 1]:\n print(0)\n exit()\nfor i in range(n - 1, 0, -1):\n if a[i - 1] > a[i]:\n yama[i - 1] = a[i - 1]\n if a[i - 1] > t[i - 1]:\n print(0)\n exit()\nif a[n - 1] > t[n - 1]:\n print(0)\n exit()\nyama[n - 1] = a[n - 1]\n\nans = 1\nfor i in range(1, n - 1):\n if yama[i] == 0:\n ans = (ans * min(a[i], t[i])) % mod\nprint(ans)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"t = list(map(int, input().split()))",
"t",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"a = list(map(int, input().split()))",
"a",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"mod = 10 ** 9 + 7",
"mod",
"10 ** 9 + 7",
"10 ** 9",
"10",
"9",
"7",
"yama = [0] * n",
"yama",
"[0] * n",
"[0]",
"0",
"n",
"yama[0] = t[0]",
"yama[0]",
"yama",
"0",
"t[0]",
"t",
"0",
"if t[0] > a[0]:\n print(0)\n exit()",
"t[0] > a[0]",
"t[0]",
"t",
"0",
"a[0]",
"a",
"0",
"print(0)",
"print",
"0",
"exit()",
"exit",
"for i in range(n - 1):\n if t[i] < t[i + 1]:\n # i + 1の高さ確定\n yama[i + 1] = t[i + 1]\n if t[i + 1] > a[i + 1]:\n print(0)\n exit()",
"i",
"range(n - 1)",
"range",
"n - 1",
"n",
"1",
"if t[i] < t[i + 1]:\n # i + 1の高さ確定\n yama[i + 1] = t[i + 1]\n if t[i + 1] > a[i + 1]:\n print(0)\n exit()",
"t[i] < t[i + 1]",
"t[i]",
"t",
"i",
"t[i + 1]",
"t",
"i + 1",
"i",
"1",
"yama[i + 1] = t[i + 1]",
"yama[i + 1]",
"yama",
"i + 1",
"i",
"1",
"t[i + 1]",
"t",
"i + 1",
"i",
"1",
"if t[i + 1] > a[i + 1]:\n print(0)\n exit()",
"t[i + 1] > a[i + 1]",
"t[i + 1]",
"t",
"i + 1",
"i",
"1",
"a[i + 1]",
"a",
"i + 1",
"i",
"1",
"print(0)",
"print",
"0",
"exit()",
"exit",
"for i in range(n - 1, 0, -1):\n if a[i - 1] > a[i]:\n yama[i - 1] = a[i - 1]\n if a[i - 1] > t[i - 1]:\n print(0)\n exit()",
"i",
"range(n - 1, 0, -1)",
"range",
"n - 1",
"n",
"1",
"0",
"-1",
"if a[i - 1] > a[i]:\n yama[i - 1] = a[i - 1]\n if a[i - 1] > t[i - 1]:\n print(0)\n exit()",
"a[i - 1] > a[i]",
"a[i - 1]",
"a",
"i - 1",
"i",
"1",
"a[i]",
"a",
"i",
"yama[i - 1] = a[i - 1]",
"yama[i - 1]",
"yama",
"i - 1",
"i",
"1",
"a[i - 1]",
"a",
"i - 1",
"i",
"1",
"if a[i - 1] > t[i - 1]:\n print(0)\n exit()",
"a[i - 1] > t[i - 1]",
"a[i - 1]",
"a",
"i - 1",
"i",
"1",
"t[i - 1]",
"t",
"i - 1",
"i",
"1",
"print(0)",
"print",
"0",
"exit()",
"exit",
"if a[n - 1] > t[n - 1]:\n print(0)\n exit()",
"a[n - 1] > t[n - 1]",
"a[n - 1]",
"a",
"n - 1",
"n",
"1",
"t[n - 1]",
"t",
"n - 1",
"n",
"1",
"print(0)",
"print",
"0",
"exit()",
"exit",
"yama[n - 1] = a[n - 1]",
"yama[n - 1]",
"yama",
"n - 1",
"n",
"1",
"a[n - 1]",
"a",
"n - 1",
"n",
"1",
"ans = 1",
"ans",
"1",
"for i in range(1, n - 1):\n if yama[i] == 0:\n ans = (ans * min(a[i], t[i])) % mod",
"i",
"range(1, n - 1)",
"range",
"1",
"n - 1",
"n",
"1",
"if yama[i] == 0:\n ans = (ans * min(a[i], t[i])) % mod",
"yama[i] == 0",
"yama[i]",
"yama",
"i",
"0",
"ans = (ans * min(a[i], t[i])) % mod",
"ans",
"(ans * min(a[i], t[i])) % mod",
"ans * min(a[i], t[i])",
"ans",
"min(a[i], t[i])",
"min",
"a[i]",
"a",
"i",
"t[i]",
"t",
"i",
"mod",
"print(ans)",
"print",
"ans",
"ans = (ans * min(a[i], t[i])) % mod",
"(ans * min(a[i], t[i])) % mod",
"ans",
"n = int(input())",
"int(input())",
"n",
"yama = [0] * n",
"[0] * n",
"yama",
"a = list(map(int, input().split()))",
"list(map(int, input().split()))",
"a",
"t = list(map(int, input().split()))",
"list(map(int, input().split()))",
"t",
"mod = 10 ** 9 + 7",
"10 ** 9 + 7",
"mod",
"ans = 1",
"1",
"ans"
] |
n = int(input())
t = list(map(int, input().split()))
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
yama = [0] * n
# tは、t[i] == t[i + 1]だったら左の以外全部ありうる
yama[0] = t[0]
if t[0] > a[0]:
print(0)
exit()
for i in range(n - 1):
if t[i] < t[i + 1]:
# i + 1の高さ確定
yama[i + 1] = t[i + 1]
if t[i + 1] > a[i + 1]:
print(0)
exit()
for i in range(n - 1, 0, -1):
if a[i - 1] > a[i]:
yama[i - 1] = a[i - 1]
if a[i - 1] > t[i - 1]:
print(0)
exit()
if a[n - 1] > t[n - 1]:
print(0)
exit()
yama[n - 1] = a[n - 1]
ans = 1
for i in range(1, n - 1):
if yama[i] == 0:
ans = (ans * min(a[i], t[i])) % mod
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
17,
0,
13,
17,
0,
13,
17,
0,
13,
17,
0,
13,
17,
0,
13,
2,
2,
17,
17,
17,
28,
13,
4,
13,
13,
0,
13,
18,
13,
13,
0,
13,
18,
13,
13,
14,
2,
13,
13,
0,
13,
13,
0,
13,
13,
14,
40,
13,
13,
0,
13,
13,
0,
13,
13,
14,
2,
2,
13,
13,
40,
13,
13,
0,
13,
18,
13,
17,
0,
13,
18,
13,
17,
28,
13,
4,
13,
17,
13,
0,
13,
18,
13,
13,
14,
2,
13,
13,
0,
13,
13,
0,
13,
13,
0,
13,
13,
28,
13,
4,
13,
2,
13,
17,
13,
17,
0,
13,
18,
13,
13,
14,
2,
13,
13,
0,
13,
13,
0,
13,
13,
0,
13,
13,
4,
13,
2,
13,
13,
4,
13,
17,
10,
4,
13,
10,
13,
13,
10,
17,
13,
10,
13,
13,
10,
2,
13,
10,
17,
13,
10,
13,
13,
10,
18,
13,
10,
17,
13,
10,
18,
13,
10,
18,
13,
10,
18,
13,
10,
4,
13,
10,
13,
13,
10,
13,
13,
10,
13,
13,
10,
17,
13,
10,
13,
13,
10,
13,
13,
10,
17,
13,
10,
18,
13,
10,
13,
13,
10,
13,
13,
10,
4,
13,
10,
18,
13
] |
[
[
166,
2
],
[
235,
8
],
[
202,
20
],
[
214,
32
],
[
190,
35
],
[
181,
38
],
[
172,
41
],
[
223,
44
],
[
178,
47
],
[
55,
54
],
[
167,
57
],
[
193,
59
],
[
236,
61
],
[
54,
62
],
[
238,
64
],
[
203,
66
],
[
54,
67
],
[
194,
70
],
[
215,
71
],
[
185,
71
],
[
184,
73
],
[
194,
74
],
[
208,
76
],
[
54,
77
],
[
239,
80
],
[
182,
81
],
[
233,
81
],
[
232,
83
],
[
239,
84
],
[
229,
86
],
[
54,
87
],
[
233,
91
],
[
182,
91
],
[
185,
92
],
[
215,
92
],
[
209,
94
],
[
191,
94
],
[
230,
95
],
[
173,
95
],
[
226,
97
],
[
203,
99
],
[
187,
102
],
[
236,
104
],
[
108,
107
],
[
209,
111
],
[
191,
111
],
[
196,
113
],
[
236,
115
],
[
107,
116
],
[
197,
119
],
[
194,
119
],
[
188,
120
],
[
176,
120
],
[
220,
122
],
[
188,
123
],
[
176,
123
],
[
169,
125
],
[
179,
126
],
[
175,
128
],
[
197,
129
],
[
194,
129
],
[
132,
131
],
[
167,
135
],
[
209,
137
],
[
191,
137
],
[
199,
140
],
[
203,
142
],
[
131,
143
],
[
200,
146
],
[
239,
146
],
[
227,
147
],
[
212,
147
],
[
217,
149
],
[
227,
150
],
[
212,
150
],
[
205,
152
],
[
179,
153
],
[
211,
155
],
[
200,
156
],
[
239,
156
],
[
206,
160
],
[
218,
160
],
[
170,
160
],
[
221,
160
],
[
224,
160
],
[
179,
161
],
[
166,
167
],
[
179,
169
],
[
169,
170
],
[
172,
173
],
[
197,
175
],
[
194,
175
],
[
175,
176
],
[
178,
179
],
[
181,
182
],
[
194,
184
],
[
184,
185
],
[
187,
188
],
[
190,
191
],
[
193,
194
],
[
196,
197
],
[
199,
200
],
[
202,
203
],
[
179,
205
],
[
205,
206
],
[
54,
208
],
[
208,
209
],
[
200,
211
],
[
239,
211
],
[
211,
212
],
[
214,
215
],
[
227,
217
],
[
212,
217
],
[
217,
218
],
[
188,
220
],
[
176,
220
],
[
220,
221
],
[
223,
224
],
[
226,
227
],
[
54,
229
],
[
229,
230
],
[
239,
232
],
[
232,
233
],
[
235,
236
],
[
238,
239
]
] |
[
"N = int(input())\nt_list = list(map(int, input().split()))\na_list = list(map(int, input().split()))\n\nt_max = -1\nt_i = 0\na_max = -1\na_i = 0\nans = 1\nmod = 10 ** 9 + 7\n\nfor i in range(N):\n t = t_list[i]\n a = a_list[i]\n if t > t_max:\n t_max = t\n t_i = i\n if a >= a_max:\n a_max = a\n a_i = i\nif a_max == t_max and t_i <= a_i:\n prev_a = a_list[-1]\n prev_t = t_list[0]\n for i in range(1, t_i):\n t = t_list[i]\n if t == prev_t:\n ans *= prev_t\n ans %= mod\n prev_t = t\n for i in range(N-2, t_i, -1):\n a = a_list[i]\n if a == prev_a:\n ans *= prev_a\n ans %= mod\n prev_a = a\n print(ans % mod)\nelse:\n print(0)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"t_list = list(map(int, input().split()))",
"t_list",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"a_list = list(map(int, input().split()))",
"a_list",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"t_max = -1",
"t_max",
"-1",
"t_i = 0",
"t_i",
"0",
"a_max = -1",
"a_max",
"-1",
"a_i = 0",
"a_i",
"0",
"ans = 1",
"ans",
"1",
"mod = 10 ** 9 + 7",
"mod",
"10 ** 9 + 7",
"10 ** 9",
"10",
"9",
"7",
"for i in range(N):\n t = t_list[i]\n a = a_list[i]\n if t > t_max:\n t_max = t\n t_i = i\n if a >= a_max:\n a_max = a\n a_i = i",
"i",
"range(N)",
"range",
"N",
"t = t_list[i]",
"t",
"t_list[i]",
"t_list",
"i",
"a = a_list[i]",
"a",
"a_list[i]",
"a_list",
"i",
"if t > t_max:\n t_max = t\n t_i = i\n ",
"t > t_max",
"t",
"t_max",
"t_max = t",
"t_max",
"t",
"t_i = i",
"t_i",
"i",
"if a >= a_max:\n a_max = a\n a_i = i",
"a >= a_max",
"a",
"a_max",
"a_max = a",
"a_max",
"a",
"a_i = i",
"a_i",
"i",
"if a_max == t_max and t_i <= a_i:\n prev_a = a_list[-1]\n prev_t = t_list[0]\n for i in range(1, t_i):\n t = t_list[i]\n if t == prev_t:\n ans *= prev_t\n ans %= mod\n prev_t = t\n for i in range(N-2, t_i, -1):\n a = a_list[i]\n if a == prev_a:\n ans *= prev_a\n ans %= mod\n prev_a = a\n print(ans % mod)\nelse:\n print(0)",
"a_max == t_max and t_i <= a_i",
"a_max == t_max",
"a_max",
"t_max",
"t_i <= a_i",
"t_i",
"a_i",
"prev_a = a_list[-1]",
"prev_a",
"a_list[-1]",
"a_list",
"-1",
"prev_t = t_list[0]",
"prev_t",
"t_list[0]",
"t_list",
"0",
"for i in range(1, t_i):\n t = t_list[i]\n if t == prev_t:\n ans *= prev_t\n ans %= mod\n prev_t = t\n ",
"i",
"range(1, t_i)",
"range",
"1",
"t_i",
"t = t_list[i]",
"t",
"t_list[i]",
"t_list",
"i",
"if t == prev_t:\n ans *= prev_t\n ans %= mod\n ",
"t == prev_t",
"t",
"prev_t",
"ans *= prev_t",
"ans",
"prev_t",
"ans %= mod",
"ans",
"mod",
"prev_t = t",
"prev_t",
"t",
"for i in range(N-2, t_i, -1):\n a = a_list[i]\n if a == prev_a:\n ans *= prev_a\n ans %= mod\n prev_a = a\n ",
"i",
"range(N-2, t_i, -1)",
"range",
"N-2",
"N",
"2",
"t_i",
"-1",
"a = a_list[i]",
"a",
"a_list[i]",
"a_list",
"i",
"if a == prev_a:\n ans *= prev_a\n ans %= mod\n ",
"a == prev_a",
"a",
"prev_a",
"ans *= prev_a",
"ans",
"prev_a",
"ans %= mod",
"ans",
"mod",
"prev_a = a",
"prev_a",
"a",
"print(ans % mod)",
"print",
"ans % mod",
"ans",
"mod",
"print(0)",
"print",
"0",
"N = int(input())",
"int(input())",
"N",
"ans %= mod",
"mod",
"ans",
"a_i = 0",
"0",
"a_i",
"prev_t = t",
"t",
"prev_t",
"mod = 10 ** 9 + 7",
"10 ** 9 + 7",
"mod",
"a_max = -1",
"-1",
"a_max",
"t_max = t",
"t",
"t_max",
"prev_t = t_list[0]",
"t_list[0]",
"prev_t",
"t_i = 0",
"0",
"t_i",
"t = t_list[i]",
"t_list[i]",
"t",
"t = t_list[i]",
"t_list[i]",
"t",
"a = a_list[i]",
"a_list[i]",
"a",
"a_list = list(map(int, input().split()))",
"list(map(int, input().split()))",
"a_list",
"ans %= mod",
"mod",
"ans",
"t_i = i",
"i",
"t_i",
"prev_a = a",
"a",
"prev_a",
"t_max = -1",
"-1",
"t_max",
"ans *= prev_a",
"prev_a",
"ans",
"ans *= prev_t",
"prev_t",
"ans",
"ans = 1",
"1",
"ans",
"prev_a = a_list[-1]",
"a_list[-1]",
"prev_a",
"a_i = i",
"i",
"a_i",
"a_max = a",
"a",
"a_max",
"t_list = list(map(int, input().split()))",
"list(map(int, input().split()))",
"t_list",
"a = a_list[i]",
"a_list[i]",
"a"
] |
N = int(input())
t_list = list(map(int, input().split()))
a_list = list(map(int, input().split()))
t_max = -1
t_i = 0
a_max = -1
a_i = 0
ans = 1
mod = 10 ** 9 + 7
for i in range(N):
t = t_list[i]
a = a_list[i]
if t > t_max:
t_max = t
t_i = i
if a >= a_max:
a_max = a
a_i = i
if a_max == t_max and t_i <= a_i:
prev_a = a_list[-1]
prev_t = t_list[0]
for i in range(1, t_i):
t = t_list[i]
if t == prev_t:
ans *= prev_t
ans %= mod
prev_t = t
for i in range(N-2, t_i, -1):
a = a_list[i]
if a == prev_a:
ans *= prev_a
ans %= mod
prev_a = a
print(ans % mod)
else:
print(0)
|
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
0,
13,
2,
13,
39,
17,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
0,
13,
2,
13,
39,
17,
0,
13,
2,
39,
17,
13,
0,
13,
2,
39,
17,
13,
0,
13,
2,
2,
17,
17,
17,
28,
13,
4,
13,
13,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
18,
13,
13,
18,
13,
13,
0,
18,
13,
13,
18,
0,
18,
13,
13,
18,
13,
13,
28,
13,
18,
4,
13,
13,
39,
17,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
14,
40,
40,
18,
13,
13,
18,
13,
13,
18,
13,
13,
0,
18,
13,
13,
18,
13,
13,
0,
18,
13,
13,
18,
4,
13,
17,
4,
13,
14,
40,
18,
13,
13,
18,
13,
13,
0,
18,
13,
13,
4,
13,
18,
13,
13,
18,
13,
13,
4,
13,
17,
4,
13,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
2,
2,
13,
2,
2,
18,
13,
13,
18,
13,
13,
17,
13,
4,
13,
13,
10,
2,
13,
10,
2,
13,
10,
17,
13,
10,
2,
13,
10,
4,
13,
10,
2,
13,
10,
2,
13,
10,
2,
13
] |
[
[
207,
2
],
[
10,
9
],
[
9,
18
],
[
216,
20
],
[
28,
27
],
[
27,
36
],
[
210,
38
],
[
204,
44
],
[
208,
48
],
[
213,
50
],
[
208,
54
],
[
198,
56
],
[
64,
63
],
[
208,
66
],
[
217,
70
],
[
63,
71
],
[
217,
73
],
[
63,
75
],
[
88,
78
],
[
205,
79
],
[
63,
80
],
[
217,
82
],
[
63,
83
],
[
88,
85
],
[
214,
86
],
[
63,
87
],
[
93,
90
],
[
205,
91
],
[
63,
92
],
[
217,
94
],
[
63,
95
],
[
98,
97
],
[
208,
101
],
[
211,
107
],
[
97,
108
],
[
211,
110
],
[
97,
112
],
[
85,
117
],
[
134,
117
],
[
214,
118
],
[
97,
119
],
[
211,
121
],
[
97,
122
],
[
90,
123
],
[
78,
123
],
[
152,
123
],
[
127,
123
],
[
205,
124
],
[
97,
125
],
[
137,
127
],
[
205,
128
],
[
97,
129
],
[
211,
131
],
[
97,
132
],
[
137,
134
],
[
214,
135
],
[
97,
136
],
[
211,
146
],
[
97,
147
],
[
85,
148
],
[
134,
148
],
[
214,
149
],
[
97,
150
],
[
155,
152
],
[
205,
153
],
[
97,
154
],
[
90,
157
],
[
78,
157
],
[
152,
157
],
[
127,
157
],
[
205,
158
],
[
97,
159
],
[
211,
161
],
[
97,
162
],
[
201,
169
],
[
173,
172
],
[
208,
175
],
[
195,
177
],
[
202,
180
],
[
196,
180
],
[
152,
183
],
[
127,
183
],
[
90,
183
],
[
78,
183
],
[
205,
184
],
[
172,
185
],
[
134,
186
],
[
85,
186
],
[
214,
187
],
[
172,
188
],
[
199,
190
],
[
196,
193
],
[
202,
193
],
[
195,
196
],
[
198,
199
],
[
201,
202
],
[
204,
205
],
[
207,
208
],
[
210,
211
],
[
213,
214
],
[
216,
217
]
] |
[
"N = int(input())\nA = [int(a) for a in input().split()] + [0]\nB = [int(a) for a in input().split()] + [0]\n\nMA = [0] * N\nMI = [1] * N\nP = 10**9+7\nfor i in range(N):\n if A[i] > A[i-1]:\n MA[i] = MI[i] = A[i]\n else:\n MA[i] = A[i]\n\nfor i in range(N)[::-1]:\n if B[i] > B[i+1]:\n if MI[i] <= B[i] <= MA[i]:\n MA[i] = MI[i] = B[i]\n else:\n print(0)\n exit()\n else:\n if B[i] >= MI[i]:\n MA[i] = min(MA[i], B[i])\n else:\n print(0)\n exit()\nans = 1\nfor i in range(N):\n ans = ans * (MA[i] - MI[i] + 1) % P\nprint(ans)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"int(a) for a in input().split()",
"for a in input().split()",
"a",
"input().split()",
"().split",
"()",
"input",
"split",
"for a in input().split()",
"int(a)",
"int",
"a",
"A = [int(a) for a in input().split()] + [0]",
"A",
"[int(a) for a in input().split()] + [0]",
"[int(a) for a in input().split()]",
"[0]",
"0",
"int(a) for a in input().split()",
"for a in input().split()",
"a",
"input().split()",
"().split",
"()",
"input",
"split",
"for a in input().split()",
"int(a)",
"int",
"a",
"B = [int(a) for a in input().split()] + [0]",
"B",
"[int(a) for a in input().split()] + [0]",
"[int(a) for a in input().split()]",
"[0]",
"0",
"MA = [0] * N",
"MA",
"[0] * N",
"[0]",
"0",
"N",
"MI = [1] * N",
"MI",
"[1] * N",
"[1]",
"1",
"N",
"P = 10**9+7",
"P",
"10**9+7",
"10**9",
"10",
"9",
"7",
"for i in range(N):\n if A[i] > A[i-1]:\n MA[i] = MI[i] = A[i]\n else:\n MA[i] = A[i]",
"i",
"range(N)",
"range",
"N",
"if A[i] > A[i-1]:\n MA[i] = MI[i] = A[i]\n else:\n MA[i] = A[i]",
"A[i] > A[i-1]",
"A[i]",
"A",
"i",
"A[i-1]",
"A",
"i-1",
"i",
"1",
"MA[i] = MI[i] = A[i]",
"MA[i]",
"MA",
"i",
"A[i]",
"A",
"i",
"= MI[i] = A[i]",
"MI[i]",
"MI",
"i",
"A[i]",
"MA[i] = A[i]",
"MA[i]",
"MA",
"i",
"A[i]",
"A",
"i",
"for i in range(N)[::-1]:\n if B[i] > B[i+1]:\n if MI[i] <= B[i] <= MA[i]:\n MA[i] = MI[i] = B[i]\n else:\n print(0)\n exit()\n else:\n if B[i] >= MI[i]:\n MA[i] = min(MA[i], B[i])\n else:\n print(0)\n exit()",
"i",
"range(N)[::-1]",
"(N)",
"range",
"N",
"::-1",
"-1",
"if B[i] > B[i+1]:\n if MI[i] <= B[i] <= MA[i]:\n MA[i] = MI[i] = B[i]\n else:\n print(0)\n exit()\n else:\n if B[i] >= MI[i]:\n MA[i] = min(MA[i], B[i])\n else:\n print(0)\n exit()",
"B[i] > B[i+1]",
"B[i]",
"B",
"i",
"B[i+1]",
"B",
"i+1",
"i",
"1",
"if MI[i] <= B[i] <= MA[i]:\n MA[i] = MI[i] = B[i]\n else:\n print(0)\n exit()\n ",
"MI[i] <= B[i] <= MA[i]",
"MI[i] <= B[i]",
"MI[i]",
"MI",
"i",
"B[i]",
"B",
"i",
"MA[i]",
"MA",
"i",
"MA[i] = MI[i] = B[i]",
"MA[i]",
"MA",
"i",
"B[i]",
"B",
"i",
"= MI[i] = B[i]",
"MI[i]",
"MI",
"i",
"B[i]",
"print(0)",
"print",
"0",
"exit()",
"exit",
"if B[i] >= MI[i]:\n MA[i] = min(MA[i], B[i])\n else:\n print(0)\n exit()",
"B[i] >= MI[i]",
"B[i]",
"B",
"i",
"MI[i]",
"MI",
"i",
"MA[i] = min(MA[i], B[i])",
"MA[i]",
"MA",
"i",
"min(MA[i], B[i])",
"min",
"MA[i]",
"MA",
"i",
"B[i]",
"B",
"i",
"print(0)",
"print",
"0",
"exit()",
"exit",
"ans = 1",
"ans",
"1",
"for i in range(N):\n ans = ans * (MA[i] - MI[i] + 1) % P",
"i",
"range(N)",
"range",
"N",
"ans = ans * (MA[i] - MI[i] + 1) % P",
"ans",
"ans * (MA[i] - MI[i] + 1) % P",
"ans * (MA[i] - MI[i] + 1)",
"ans",
"MA[i] - MI[i] + 1",
"MA[i] - MI[i]",
"MA[i]",
"MA",
"i",
"MI[i]",
"MI",
"i",
"1",
"P",
"print(ans)",
"print",
"ans",
"ans = ans * (MA[i] - MI[i] + 1) % P",
"ans * (MA[i] - MI[i] + 1) % P",
"ans",
"P = 10**9+7",
"10**9+7",
"P",
"ans = 1",
"1",
"ans",
"MA = [0] * N",
"[0] * N",
"MA",
"N = int(input())",
"int(input())",
"N",
"B = [int(a) for a in input().split()] + [0]",
"[int(a) for a in input().split()] + [0]",
"B",
"MI = [1] * N",
"[1] * N",
"MI",
"A = [int(a) for a in input().split()] + [0]",
"[int(a) for a in input().split()] + [0]",
"A"
] |
N = int(input())
A = [int(a) for a in input().split()] + [0]
B = [int(a) for a in input().split()] + [0]
MA = [0] * N
MI = [1] * N
P = 10**9+7
for i in range(N):
if A[i] > A[i-1]:
MA[i] = MI[i] = A[i]
else:
MA[i] = A[i]
for i in range(N)[::-1]:
if B[i] > B[i+1]:
if MI[i] <= B[i] <= MA[i]:
MA[i] = MI[i] = B[i]
else:
print(0)
exit()
else:
if B[i] >= MI[i]:
MA[i] = min(MA[i], B[i])
else:
print(0)
exit()
ans = 1
for i in range(N):
ans = ans * (MA[i] - MI[i] + 1) % P
print(ans)
|
[
7,
12,
13,
17,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
18,
13,
17,
13,
18,
13,
17,
0,
13,
4,
18,
13,
13,
13,
13,
2,
2,
13,
4,
18,
18,
13,
39,
17,
13,
13,
17,
14,
2,
40,
13,
13,
2,
13,
13,
4,
13,
17,
29,
0,
13,
2,
2,
17,
17,
17,
0,
13,
17,
13,
17,
28,
13,
18,
13,
39,
2,
13,
17,
14,
2,
13,
13,
0,
13,
13,
0,
13,
2,
2,
13,
13,
13,
28,
13,
4,
13,
2,
13,
17,
13,
0,
13,
2,
2,
13,
13,
13,
28,
13,
18,
13,
39,
2,
13,
17,
14,
2,
13,
13,
0,
13,
13,
0,
13,
2,
2,
13,
13,
13,
4,
13,
13,
14,
2,
13,
17,
4,
13,
10,
12,
13
] |
[
[
6,
5
],
[
12,
11
],
[
24,
23
],
[
36,
35
],
[
11,
37
],
[
40,
39
],
[
23,
41
],
[
45,
44
],
[
11,
47
],
[
35,
49
],
[
51,
50
],
[
5,
53
],
[
23,
57
],
[
39,
61
],
[
35,
66
],
[
39,
67
],
[
44,
69
],
[
50,
70
],
[
77,
76
],
[
84,
83
],
[
86,
85
],
[
89,
88
],
[
11,
90
],
[
44,
93
],
[
88,
97
],
[
85,
98
],
[
100,
98
],
[
101,
100
],
[
88,
101
],
[
104,
103
],
[
83,
106
],
[
103,
106
],
[
85,
107
],
[
100,
107
],
[
76,
108
],
[
111,
110
],
[
44,
114
],
[
50,
116
],
[
119,
118
],
[
103,
121
],
[
83,
121
],
[
118,
121
],
[
100,
122
],
[
85,
122
],
[
76,
123
],
[
126,
125
],
[
23,
127
],
[
50,
130
],
[
125,
134
],
[
100,
135
],
[
85,
135
],
[
137,
135
],
[
138,
137
],
[
125,
138
],
[
141,
140
],
[
118,
143
],
[
103,
143
],
[
83,
143
],
[
140,
143
],
[
100,
144
],
[
85,
144
],
[
137,
144
],
[
76,
145
],
[
140,
148
],
[
118,
148
],
[
103,
148
],
[
83,
148
],
[
157,
154
]
] |
[
"# code-festival-2016-qualcC - 二人のアルピニスト / Two Alpinists\ndef main():\n \"\"\"\n /----\\ <- x = y\n / \\--\\\n / \\\n xi yi\n 0 ~ xi / xi ~ yi / yi+1 ~ N-1\n \"\"\"\n N = int(input())\n T = tuple(map(int, input().split()))\n A = tuple(map(int, input().split()))\n x, y = T[-1], A[0] # max of x, y\n xi, yi = T.index(x), N - A[::-1].index(y) - 1 # indices of x, y\n if x != y or xi > yi: # corner case\n print(0)\n return\n MOD = 10 ** 9 + 7\n ans, cur = 1, 0\n for i in T[: xi + 1]:\n if i > cur: # point of new altitude -> no choice (ans * 1)\n cur = i\n else:\n ans = (ans * cur) % MOD # mulitple choices (1, 2, ..., cur)\n for _ in range(xi + 1, yi):\n ans = (ans * cur) % MOD\n for i in A[yi + 1 :]:\n if i < cur:\n cur = i\n else:\n ans = (ans * cur) % MOD\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()",
"def main():\n \"\"\"\n /----\\ <- x = y\n / \\--\\\n / \\\n xi yi\n 0 ~ xi / xi ~ yi / yi+1 ~ N-1\n \"\"\"\n N = int(input())\n T = tuple(map(int, input().split()))\n A = tuple(map(int, input().split()))\n x, y = T[-1], A[0] # max of x, y\n xi, yi = T.index(x), N - A[::-1].index(y) - 1 # indices of x, y\n if x != y or xi > yi: # corner case\n print(0)\n return\n MOD = 10 ** 9 + 7\n ans, cur = 1, 0\n for i in T[: xi + 1]:\n if i > cur: # point of new altitude -> no choice (ans * 1)\n cur = i\n else:\n ans = (ans * cur) % MOD # mulitple choices (1, 2, ..., cur)\n for _ in range(xi + 1, yi):\n ans = (ans * cur) % MOD\n for i in A[yi + 1 :]:\n if i < cur:\n cur = i\n else:\n ans = (ans * cur) % MOD\n print(ans)",
"main",
"\"\"\"\n /----\\ <- x = y\n / \\--\\\n / \\\n xi yi\n 0 ~ xi / xi ~ yi / yi+1 ~ N-1\n \"\"\"",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"T = tuple(map(int, input().split()))",
"T",
"tuple(map(int, input().split()))",
"tuple",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"A = tuple(map(int, input().split()))",
"A",
"tuple(map(int, input().split()))",
"tuple",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"x, y = T[-1], A[0]",
"x",
"T[-1]",
"T",
"-1",
"y",
"A[0]",
"A",
"0",
"xi, yi = T.index(x), N - A[::-1].index(y) - 1",
"xi",
"T.index(x)",
"T.index",
"T",
"index",
"x",
"yi",
"N - A[::-1].index(y) - 1",
"N - A[::-1].index(y)",
"N",
"A[::-1].index(y)",
"[::-1].index",
"[::-1]",
"A",
"::-1",
"-1",
"index",
"y",
"1",
"if x != y or xi > yi: # corner case\n print(0)\n return\n ",
"x != y or xi > yi",
"x != y",
"x",
"y",
"xi > yi",
"xi",
"yi",
"print(0)",
"print",
"0",
"return",
"MOD = 10 ** 9 + 7",
"MOD",
"10 ** 9 + 7",
"10 ** 9",
"10",
"9",
"7",
"ans, cur = 1, 0",
"ans",
"1",
"cur",
"0",
"for i in T[: xi + 1]:\n if i > cur: # point of new altitude -> no choice (ans * 1)\n cur = i\n else:\n ans = (ans * cur) % MOD # mulitple choices (1, 2, ..., cur)\n ",
"i",
"T[: xi + 1]",
"T",
": xi + 1",
"xi + 1",
"xi",
"1",
"if i > cur: # point of new altitude -> no choice (ans * 1)\n cur = i\n else:\n ans = (ans * cur) % MOD # mulitple choices (1, 2, ..., cur)\n ",
"i > cur",
"i",
"cur",
"cur = i",
"cur",
"i",
"ans = (ans * cur) % MOD",
"ans",
"(ans * cur) % MOD",
"ans * cur",
"ans",
"cur",
"MOD",
"for _ in range(xi + 1, yi):\n ans = (ans * cur) % MOD\n ",
"_",
"range(xi + 1, yi)",
"range",
"xi + 1",
"xi",
"1",
"yi",
"ans = (ans * cur) % MOD",
"ans",
"(ans * cur) % MOD",
"ans * cur",
"ans",
"cur",
"MOD",
"for i in A[yi + 1 :]:\n if i < cur:\n cur = i\n else:\n ans = (ans * cur) % MOD\n ",
"i",
"A[yi + 1 :]",
"A",
"yi + 1 :",
"yi + 1",
"yi",
"1",
"if i < cur:\n cur = i\n else:\n ans = (ans * cur) % MOD\n ",
"i < cur",
"i",
"cur",
"cur = i",
"cur",
"i",
"ans = (ans * cur) % MOD",
"ans",
"(ans * cur) % MOD",
"ans * cur",
"ans",
"cur",
"MOD",
"print(ans)",
"print",
"ans",
"if __name__ == \"__main__\":\n main()",
"__name__ == \"__main__\"",
"__name__",
"\"__main__\"",
"main()",
"main",
"def main():\n \"\"\"\n /----\\ <- x = y\n / \\--\\\n / \\\n xi yi\n 0 ~ xi / xi ~ yi / yi+1 ~ N-1\n \"\"\"\n N = int(input())\n T = tuple(map(int, input().split()))\n A = tuple(map(int, input().split()))\n x, y = T[-1], A[0] # max of x, y\n xi, yi = T.index(x), N - A[::-1].index(y) - 1 # indices of x, y\n if x != y or xi > yi: # corner case\n print(0)\n return\n MOD = 10 ** 9 + 7\n ans, cur = 1, 0\n for i in T[: xi + 1]:\n if i > cur: # point of new altitude -> no choice (ans * 1)\n cur = i\n else:\n ans = (ans * cur) % MOD # mulitple choices (1, 2, ..., cur)\n for _ in range(xi + 1, yi):\n ans = (ans * cur) % MOD\n for i in A[yi + 1 :]:\n if i < cur:\n cur = i\n else:\n ans = (ans * cur) % MOD\n print(ans)",
"def main():\n \"\"\"\n /----\\ <- x = y\n / \\--\\\n / \\\n xi yi\n 0 ~ xi / xi ~ yi / yi+1 ~ N-1\n \"\"\"\n N = int(input())\n T = tuple(map(int, input().split()))\n A = tuple(map(int, input().split()))\n x, y = T[-1], A[0] # max of x, y\n xi, yi = T.index(x), N - A[::-1].index(y) - 1 # indices of x, y\n if x != y or xi > yi: # corner case\n print(0)\n return\n MOD = 10 ** 9 + 7\n ans, cur = 1, 0\n for i in T[: xi + 1]:\n if i > cur: # point of new altitude -> no choice (ans * 1)\n cur = i\n else:\n ans = (ans * cur) % MOD # mulitple choices (1, 2, ..., cur)\n for _ in range(xi + 1, yi):\n ans = (ans * cur) % MOD\n for i in A[yi + 1 :]:\n if i < cur:\n cur = i\n else:\n ans = (ans * cur) % MOD\n print(ans)",
"main"
] |
# code-festival-2016-qualcC - 二人のアルピニスト / Two Alpinists
def main():
"""
/----\ <- x = y
/ \--\
/ \
xi yi
0 ~ xi / xi ~ yi / yi+1 ~ N-1
"""
N = int(input())
T = tuple(map(int, input().split()))
A = tuple(map(int, input().split()))
x, y = T[-1], A[0] # max of x, y
xi, yi = T.index(x), N - A[::-1].index(y) - 1 # indices of x, y
if x != y or xi > yi: # corner case
print(0)
return
MOD = 10 ** 9 + 7
ans, cur = 1, 0
for i in T[: xi + 1]:
if i > cur: # point of new altitude -> no choice (ans * 1)
cur = i
else:
ans = (ans * cur) % MOD # mulitple choices (1, 2, ..., cur)
for _ in range(xi + 1, yi):
ans = (ans * cur) % MOD
for i in A[yi + 1 :]:
if i < cur:
cur = i
else:
ans = (ans * cur) % MOD
print(ans)
if __name__ == "__main__":
main()
|
[
7,
15,
13,
13,
13,
13,
13,
13,
13,
13,
13,
13,
13,
13,
4,
18,
13,
13,
2,
17,
17,
0,
13,
2,
17,
17,
0,
13,
2,
2,
17,
17,
17,
12,
13,
12,
13,
12,
13,
12,
13,
12,
13,
0,
13,
4,
13,
0,
13,
4,
13,
0,
13,
4,
13,
14,
2,
2,
13,
17,
40,
18,
13,
17,
18,
13,
17,
29,
17,
0,
13,
39,
0,
13,
39,
0,
13,
18,
13,
17,
4,
18,
13,
13,
17,
28,
13,
4,
13,
17,
4,
13,
13,
0,
13,
18,
13,
13,
14,
2,
13,
13,
14,
2,
13,
18,
13,
13,
4,
13,
17,
4,
13,
4,
18,
13,
13,
17,
0,
13,
13,
14,
2,
13,
13,
4,
18,
13,
13,
13,
4,
13,
17,
4,
13,
4,
18,
13,
13,
4,
18,
13,
13,
0,
13,
18,
13,
17,
4,
18,
13,
13,
17,
28,
13,
4,
13,
17,
4,
13,
13,
0,
13,
18,
13,
13,
14,
2,
13,
13,
14,
2,
13,
18,
13,
2,
2,
13,
13,
17,
4,
13,
17,
4,
13,
4,
18,
13,
13,
17,
0,
13,
13,
14,
2,
13,
13,
4,
18,
13,
13,
4,
13,
13,
18,
13,
13,
4,
13,
17,
4,
13,
0,
13,
17,
28,
13,
13,
0,
13,
13,
0,
13,
13,
29,
13,
4,
13,
4,
13,
10,
12,
13,
10,
12,
13,
10,
12,
13,
10,
12,
13,
10,
2,
13,
10,
2,
13,
10,
12,
13
] |
[
[
243,
22
],
[
246,
27
],
[
45,
44
],
[
232,
46
],
[
49,
48
],
[
235,
50
],
[
53,
52
],
[
235,
54
],
[
44,
58
],
[
48,
62
],
[
52,
65
],
[
71,
70
],
[
74,
73
],
[
77,
76
],
[
48,
78
],
[
70,
82
],
[
87,
86
],
[
48,
92
],
[
95,
94
],
[
48,
96
],
[
86,
97
],
[
76,
100
],
[
119,
100
],
[
94,
101
],
[
94,
104
],
[
52,
106
],
[
86,
107
],
[
70,
115
],
[
120,
119
],
[
94,
120
],
[
76,
123
],
[
119,
123
],
[
94,
124
],
[
70,
127
],
[
76,
129
],
[
119,
129
],
[
52,
137
],
[
70,
141
],
[
145,
144
],
[
52,
146
],
[
73,
150
],
[
155,
154
],
[
52,
160
],
[
163,
162
],
[
52,
164
],
[
154,
165
],
[
144,
168
],
[
191,
168
],
[
162,
169
],
[
94,
169
],
[
162,
172
],
[
94,
172
],
[
48,
174
],
[
44,
177
],
[
154,
178
],
[
73,
187
],
[
192,
191
],
[
162,
192
],
[
94,
192
],
[
144,
195
],
[
191,
195
],
[
162,
196
],
[
94,
196
],
[
73,
199
],
[
144,
203
],
[
191,
203
],
[
70,
205
],
[
154,
206
],
[
214,
213
],
[
217,
216
],
[
73,
216
],
[
220,
219
],
[
216,
220
],
[
223,
222
],
[
247,
223
],
[
222,
225
],
[
219,
225
],
[
213,
225
],
[
241,
229
],
[
243,
244
],
[
246,
247
]
] |
[
"import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time\n\nsys.setrecursionlimit(10**7)\ninf=10**20\nmod=10**9+7\n\ndef LI(): return list(map(int,input().split()))\ndef I(): return int(input())\ndef LS(): return input().split()\ndef S(): return input()\n\ndef main():\n n=I()\n\n a=LI()\n b=LI()\n\n if n==1 and a[0]!=b[0]:\n return 0\n\n l1=[]\n l2=[]\n\n amx=a[0]\n l1.append(1)\n for i in range(1,len(a)):\n x=a[i]\n if amx<x:\n # 矛盾\n if x>b[i]:\n print(0)\n exit()\n\n l1.append(1)\n amx=x\n elif amx==x:\n l1.append(amx)\n else:\n print(0)\n exit()\n\n b.reverse()\n l1.reverse()\n\n bmx=b[0]\n l2.append(1)\n for i in range(1,len(b)):\n x=b[i]\n if bmx<x:\n # 矛盾\n if x>a[n-i-1]:\n print(0)\n exit()\n\n l2.append(1)\n bmx=x\n elif bmx==x:\n l2.append(min(bmx,l1[i]))\n else:\n print(0)\n exit()\n\n ans=1\n for x in l2:\n ans*=x\n ans%=mod\n\n return ans\n\nprint(main())",
"import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time",
"math",
"string",
"itertools",
"fractions",
"heapq",
"collections",
"re",
"array",
"bisect",
"sys",
"random",
"time",
"sys.setrecursionlimit(10**7)",
"sys.setrecursionlimit",
"sys",
"setrecursionlimit",
"10**7",
"10",
"7",
"inf=10**20",
"inf",
"10**20",
"10",
"20",
"mod=10**9+7",
"mod",
"10**9+7",
"10**9",
"10",
"9",
"7",
"def LI(): return list(map(int,input().split()))",
"LI",
"def I(): return int(input())",
"I",
"def LS(): return input().split()",
"LS",
"def S(): return input()",
"S",
"def main():\n n=I()\n\n a=LI()\n b=LI()\n\n if n==1 and a[0]!=b[0]:\n return 0\n\n l1=[]\n l2=[]\n\n amx=a[0]\n l1.append(1)\n for i in range(1,len(a)):\n x=a[i]\n if amx<x:\n # 矛盾\n if x>b[i]:\n print(0)\n exit()\n\n l1.append(1)\n amx=x\n elif amx==x:\n l1.append(amx)\n else:\n print(0)\n exit()\n\n b.reverse()\n l1.reverse()\n\n bmx=b[0]\n l2.append(1)\n for i in range(1,len(b)):\n x=b[i]\n if bmx<x:\n # 矛盾\n if x>a[n-i-1]:\n print(0)\n exit()\n\n l2.append(1)\n bmx=x\n elif bmx==x:\n l2.append(min(bmx,l1[i]))\n else:\n print(0)\n exit()\n\n ans=1\n for x in l2:\n ans*=x\n ans%=mod\n\n return ans",
"main",
"n=I()",
"n",
"I()",
"I",
"a=LI()",
"a",
"LI()",
"LI",
"b=LI()",
"b",
"LI()",
"LI",
"if n==1 and a[0]!=b[0]:\n return 0\n\n ",
"n==1 and a[0]!=b[0]",
"n==1",
"n",
"1",
"a[0]!=b[0]",
"a[0]",
"a",
"0",
"b[0]",
"b",
"0",
"return 0",
"0",
"l1=[]",
"l1",
"[]",
"l2=[]",
"l2",
"[]",
"amx=a[0]",
"amx",
"a[0]",
"a",
"0",
"l1.append(1)",
"l1.append",
"l1",
"append",
"1",
"for i in range(1,len(a)):\n x=a[i]\n if amx<x:\n # 矛盾\n if x>b[i]:\n print(0)\n exit()\n\n l1.append(1)\n amx=x\n elif amx==x:\n l1.append(amx)\n else:\n print(0)\n exit()\n\n ",
"i",
"range(1,len(a))",
"range",
"1",
"len(a)",
"len",
"a",
"x=a[i]",
"x",
"a[i]",
"a",
"i",
"if amx<x:\n # 矛盾\n if x>b[i]:\n print(0)\n exit()\n\n l1.append(1)\n amx=x\n elif amx==x:\n l1.append(amx)\n else:\n print(0)\n exit()\n\n ",
"amx<x",
"amx",
"x",
"if x>b[i]:\n print(0)\n exit()\n\n ",
"x>b[i]",
"x",
"b[i]",
"b",
"i",
"print(0)",
"print",
"0",
"exit()",
"exit",
"l1.append(1)",
"l1.append",
"l1",
"append",
"1",
"amx=x",
"amx",
"x",
"elif amx==x:\n l1.append(amx)\n ",
"amx==x",
"amx",
"x",
"l1.append(amx)",
"l1.append",
"l1",
"append",
"amx",
"print(0)",
"print",
"0",
"exit()",
"exit",
"b.reverse()",
"b.reverse",
"b",
"reverse",
"l1.reverse()",
"l1.reverse",
"l1",
"reverse",
"bmx=b[0]",
"bmx",
"b[0]",
"b",
"0",
"l2.append(1)",
"l2.append",
"l2",
"append",
"1",
"for i in range(1,len(b)):\n x=b[i]\n if bmx<x:\n # 矛盾\n if x>a[n-i-1]:\n print(0)\n exit()\n\n l2.append(1)\n bmx=x\n elif bmx==x:\n l2.append(min(bmx,l1[i]))\n else:\n print(0)\n exit()\n\n ",
"i",
"range(1,len(b))",
"range",
"1",
"len(b)",
"len",
"b",
"x=b[i]",
"x",
"b[i]",
"b",
"i",
"if bmx<x:\n # 矛盾\n if x>a[n-i-1]:\n print(0)\n exit()\n\n l2.append(1)\n bmx=x\n elif bmx==x:\n l2.append(min(bmx,l1[i]))\n else:\n print(0)\n exit()\n\n ",
"bmx<x",
"bmx",
"x",
"if x>a[n-i-1]:\n print(0)\n exit()\n\n ",
"x>a[n-i-1]",
"x",
"a[n-i-1]",
"a",
"n-i-1",
"n-i",
"n",
"i",
"1",
"print(0)",
"print",
"0",
"exit()",
"exit",
"l2.append(1)",
"l2.append",
"l2",
"append",
"1",
"bmx=x",
"bmx",
"x",
"elif bmx==x:\n l2.append(min(bmx,l1[i]))\n ",
"bmx==x",
"bmx",
"x",
"l2.append(min(bmx,l1[i]))",
"l2.append",
"l2",
"append",
"min(bmx,l1[i])",
"min",
"bmx",
"l1[i]",
"l1",
"i",
"print(0)",
"print",
"0",
"exit()",
"exit",
"ans=1",
"ans",
"1",
"for x in l2:\n ans*=x\n ans%=mod\n\n ",
"x",
"l2",
"ans*=x",
"ans",
"x",
"ans%=mod",
"ans",
"mod",
"return ans",
"ans",
"print(main())",
"print",
"main()",
"main",
"def I(): return int(input())",
"def I(): return int(input())",
"I",
"def LI(): return list(map(int,input().split()))",
"def LI(): return list(map(int,input().split()))",
"LI",
"def S(): return input()",
"def S(): return input()",
"S",
"def main():\n n=I()\n\n a=LI()\n b=LI()\n\n if n==1 and a[0]!=b[0]:\n return 0\n\n l1=[]\n l2=[]\n\n amx=a[0]\n l1.append(1)\n for i in range(1,len(a)):\n x=a[i]\n if amx<x:\n # 矛盾\n if x>b[i]:\n print(0)\n exit()\n\n l1.append(1)\n amx=x\n elif amx==x:\n l1.append(amx)\n else:\n print(0)\n exit()\n\n b.reverse()\n l1.reverse()\n\n bmx=b[0]\n l2.append(1)\n for i in range(1,len(b)):\n x=b[i]\n if bmx<x:\n # 矛盾\n if x>a[n-i-1]:\n print(0)\n exit()\n\n l2.append(1)\n bmx=x\n elif bmx==x:\n l2.append(min(bmx,l1[i]))\n else:\n print(0)\n exit()\n\n ans=1\n for x in l2:\n ans*=x\n ans%=mod\n\n return ans",
"def main():\n n=I()\n\n a=LI()\n b=LI()\n\n if n==1 and a[0]!=b[0]:\n return 0\n\n l1=[]\n l2=[]\n\n amx=a[0]\n l1.append(1)\n for i in range(1,len(a)):\n x=a[i]\n if amx<x:\n # 矛盾\n if x>b[i]:\n print(0)\n exit()\n\n l1.append(1)\n amx=x\n elif amx==x:\n l1.append(amx)\n else:\n print(0)\n exit()\n\n b.reverse()\n l1.reverse()\n\n bmx=b[0]\n l2.append(1)\n for i in range(1,len(b)):\n x=b[i]\n if bmx<x:\n # 矛盾\n if x>a[n-i-1]:\n print(0)\n exit()\n\n l2.append(1)\n bmx=x\n elif bmx==x:\n l2.append(min(bmx,l1[i]))\n else:\n print(0)\n exit()\n\n ans=1\n for x in l2:\n ans*=x\n ans%=mod\n\n return ans",
"main",
"inf=10**20",
"10**20",
"inf",
"mod=10**9+7",
"10**9+7",
"mod",
"def LS(): return input().split()",
"def LS(): return input().split()",
"LS"
] |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
def LI(): return list(map(int,input().split()))
def I(): return int(input())
def LS(): return input().split()
def S(): return input()
def main():
n=I()
a=LI()
b=LI()
if n==1 and a[0]!=b[0]:
return 0
l1=[]
l2=[]
amx=a[0]
l1.append(1)
for i in range(1,len(a)):
x=a[i]
if amx<x:
# 矛盾
if x>b[i]:
print(0)
exit()
l1.append(1)
amx=x
elif amx==x:
l1.append(amx)
else:
print(0)
exit()
b.reverse()
l1.reverse()
bmx=b[0]
l2.append(1)
for i in range(1,len(b)):
x=b[i]
if bmx<x:
# 矛盾
if x>a[n-i-1]:
print(0)
exit()
l2.append(1)
bmx=x
elif bmx==x:
l2.append(min(bmx,l1[i]))
else:
print(0)
exit()
ans=1
for x in l2:
ans*=x
ans%=mod
return ans
print(main())
|
[
7,
12,
13,
29,
4,
13,
4,
13,
12,
13,
29,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
23,
13,
17,
12,
13,
0,
13,
2,
2,
17,
17,
17,
0,
13,
4,
13,
0,
13,
4,
13,
0,
13,
4,
13,
14,
2,
2,
40,
13,
4,
13,
13,
40,
13,
4,
13,
13,
0,
13,
17,
40,
4,
13,
13,
4,
13,
13,
4,
13,
17,
29,
14,
2,
4,
13,
13,
17,
4,
13,
17,
29,
0,
13,
2,
39,
17,
13,
0,
13,
17,
28,
13,
4,
13,
17,
13,
14,
40,
13,
18,
13,
13,
0,
18,
13,
13,
17,
0,
13,
18,
13,
13,
14,
2,
18,
13,
13,
18,
13,
13,
4,
13,
17,
29,
0,
13,
17,
28,
13,
4,
13,
2,
13,
17,
17,
17,
14,
40,
13,
18,
13,
13,
0,
18,
13,
13,
17,
0,
13,
18,
13,
13,
14,
2,
18,
13,
13,
18,
13,
13,
4,
13,
17,
29,
0,
13,
17,
28,
13,
4,
13,
17,
13,
14,
2,
18,
13,
13,
17,
0,
13,
2,
2,
13,
4,
13,
18,
13,
13,
18,
13,
13,
13,
4,
13,
13,
4,
13,
10,
12,
13,
10,
12,
13,
10,
12,
13
] |
[
[
23,
21
],
[
24,
23
],
[
29,
28
],
[
36,
35
],
[
208,
37
],
[
40,
39
],
[
205,
41
],
[
44,
43
],
[
205,
45
],
[
39,
50
],
[
39,
53
],
[
43,
55
],
[
43,
58
],
[
61,
60
],
[
39,
65
],
[
43,
68
],
[
85,
84
],
[
35,
88
],
[
91,
90
],
[
94,
93
],
[
35,
97
],
[
90,
100
],
[
110,
100
],
[
39,
102
],
[
93,
103
],
[
108,
105
],
[
84,
106
],
[
93,
107
],
[
111,
110
],
[
39,
112
],
[
93,
113
],
[
43,
117
],
[
93,
118
],
[
39,
120
],
[
93,
121
],
[
128,
127
],
[
131,
130
],
[
35,
134
],
[
127,
140
],
[
110,
140
],
[
90,
140
],
[
150,
140
],
[
43,
142
],
[
130,
143
],
[
148,
145
],
[
84,
146
],
[
130,
147
],
[
151,
150
],
[
43,
152
],
[
130,
153
],
[
39,
157
],
[
130,
158
],
[
43,
160
],
[
130,
161
],
[
168,
167
],
[
171,
170
],
[
35,
174
],
[
145,
177
],
[
105,
177
],
[
84,
178
],
[
170,
179
],
[
183,
182
],
[
167,
185
],
[
182,
185
],
[
39,
189
],
[
170,
190
],
[
43,
192
],
[
170,
193
],
[
28,
194
],
[
182,
197
],
[
167,
197
],
[
202,
199
]
] |
[
"\ndef read():\n return int(input())\n\ndef reads(sep=None):\n return list(map(int, input().split(sep)))\n\ndef main():\n m = 10**9 + 7\n n = read()\n t = reads()\n a = reads()\n if (t != sorted(t)) or (a != sorted(a, reverse=True)) or (max(t) != max(a)):\n print(0)\n return\n if len([1 for ti,ai in zip(t, a) if ti==ai]) == 0:\n print(0)\n return\n \n b = [0] * n\n o = -1\n for i in range(0, n):\n if o != t[i]:\n b[i] = 1\n o = t[i]\n if a[i] < t[i]:\n print(0)\n return\n o = -1\n for i in range(n-1, -1, -1):\n if o != a[i]:\n b[i] = 1\n o = a[i]\n if t[i] < a[i]:\n print(0)\n return\n r = 1\n for i in range(0, n):\n if b[i] == 0:\n r = (r * min(t[i], a[i])) % m\n print(r)\n\nmain()",
"def read():\n return int(input())",
"read",
"return int(input())",
"int(input())",
"int",
"input()",
"input",
"def reads(sep=None):\n return list(map(int, input().split(sep)))",
"reads",
"return list(map(int, input().split(sep)))",
"list(map(int, input().split(sep)))",
"list",
"map(int, input().split(sep))",
"map",
"int",
"input().split(sep)",
"().split",
"()",
"input",
"split",
"sep",
"sep=None",
"sep",
"None",
"def main():\n m = 10**9 + 7\n n = read()\n t = reads()\n a = reads()\n if (t != sorted(t)) or (a != sorted(a, reverse=True)) or (max(t) != max(a)):\n print(0)\n return\n if len([1 for ti,ai in zip(t, a) if ti==ai]) == 0:\n print(0)\n return\n \n b = [0] * n\n o = -1\n for i in range(0, n):\n if o != t[i]:\n b[i] = 1\n o = t[i]\n if a[i] < t[i]:\n print(0)\n return\n o = -1\n for i in range(n-1, -1, -1):\n if o != a[i]:\n b[i] = 1\n o = a[i]\n if t[i] < a[i]:\n print(0)\n return\n r = 1\n for i in range(0, n):\n if b[i] == 0:\n r = (r * min(t[i], a[i])) % m\n print(r)",
"main",
"m = 10**9 + 7",
"m",
"10**9 + 7",
"10**9",
"10",
"9",
"7",
"n = read()",
"n",
"read()",
"read",
"t = reads()",
"t",
"reads()",
"reads",
"a = reads()",
"a",
"reads()",
"reads",
"if (t != sorted(t)) or (a != sorted(a, reverse=True)) or (max(t) != max(a)):\n print(0)\n return\n ",
"(t != sorted(t)) or (a != sorted(a, reverse=True)) or (max(t) != max(a))",
"(t != sorted(t)) or (a != sorted(a, reverse=True))",
"t != sorted(t)",
"t",
"sorted(t)",
"sorted",
"t",
"a != sorted(a, reverse=True)",
"a",
"sorted(a, reverse=True)",
"sorted",
"a",
"reverse=True",
"reverse",
"True",
"max(t) != max(a)",
"max(t)",
"max",
"t",
"max(a)",
"max",
"a",
"print(0)",
"print",
"0",
"return",
"if len([1 for ti,ai in zip(t, a) if ti==ai]) == 0:\n print(0)\n return\n \n ",
"len([1 for ti,ai in zip(t, a) if ti==ai]) == 0",
"len([1 for ti,ai in zip(t, a) if ti==ai])",
"len",
"[1 for ti,ai in zip(t, a) if ti==ai]",
"0",
"print(0)",
"print",
"0",
"return",
"b = [0] * n",
"b",
"[0] * n",
"[0]",
"0",
"n",
"o = -1",
"o",
"-1",
"for i in range(0, n):\n if o != t[i]:\n b[i] = 1\n o = t[i]\n if a[i] < t[i]:\n print(0)\n return\n ",
"i",
"range(0, n)",
"range",
"0",
"n",
"if o != t[i]:\n b[i] = 1\n o = t[i]\n if a[i] < t[i]:\n print(0)\n return\n ",
"o != t[i]",
"o",
"t[i]",
"t",
"i",
"b[i] = 1",
"b[i]",
"b",
"i",
"1",
"o = t[i]",
"o",
"t[i]",
"t",
"i",
"if a[i] < t[i]:\n print(0)\n return\n ",
"a[i] < t[i]",
"a[i]",
"a",
"i",
"t[i]",
"t",
"i",
"print(0)",
"print",
"0",
"return",
"o = -1",
"o",
"-1",
"for i in range(n-1, -1, -1):\n if o != a[i]:\n b[i] = 1\n o = a[i]\n if t[i] < a[i]:\n print(0)\n return\n ",
"i",
"range(n-1, -1, -1)",
"range",
"n-1",
"n",
"1",
"-1",
"-1",
"if o != a[i]:\n b[i] = 1\n o = a[i]\n if t[i] < a[i]:\n print(0)\n return\n ",
"o != a[i]",
"o",
"a[i]",
"a",
"i",
"b[i] = 1",
"b[i]",
"b",
"i",
"1",
"o = a[i]",
"o",
"a[i]",
"a",
"i",
"if t[i] < a[i]:\n print(0)\n return\n ",
"t[i] < a[i]",
"t[i]",
"t",
"i",
"a[i]",
"a",
"i",
"print(0)",
"print",
"0",
"return",
"r = 1",
"r",
"1",
"for i in range(0, n):\n if b[i] == 0:\n r = (r * min(t[i], a[i])) % m\n ",
"i",
"range(0, n)",
"range",
"0",
"n",
"if b[i] == 0:\n r = (r * min(t[i], a[i])) % m\n ",
"b[i] == 0",
"b[i]",
"b",
"i",
"0",
"r = (r * min(t[i], a[i])) % m",
"r",
"(r * min(t[i], a[i])) % m",
"r * min(t[i], a[i])",
"r",
"min(t[i], a[i])",
"min",
"t[i]",
"t",
"i",
"a[i]",
"a",
"i",
"m",
"print(r)",
"print",
"r",
"main()",
"main",
"def main():\n m = 10**9 + 7\n n = read()\n t = reads()\n a = reads()\n if (t != sorted(t)) or (a != sorted(a, reverse=True)) or (max(t) != max(a)):\n print(0)\n return\n if len([1 for ti,ai in zip(t, a) if ti==ai]) == 0:\n print(0)\n return\n \n b = [0] * n\n o = -1\n for i in range(0, n):\n if o != t[i]:\n b[i] = 1\n o = t[i]\n if a[i] < t[i]:\n print(0)\n return\n o = -1\n for i in range(n-1, -1, -1):\n if o != a[i]:\n b[i] = 1\n o = a[i]\n if t[i] < a[i]:\n print(0)\n return\n r = 1\n for i in range(0, n):\n if b[i] == 0:\n r = (r * min(t[i], a[i])) % m\n print(r)",
"def main():\n m = 10**9 + 7\n n = read()\n t = reads()\n a = reads()\n if (t != sorted(t)) or (a != sorted(a, reverse=True)) or (max(t) != max(a)):\n print(0)\n return\n if len([1 for ti,ai in zip(t, a) if ti==ai]) == 0:\n print(0)\n return\n \n b = [0] * n\n o = -1\n for i in range(0, n):\n if o != t[i]:\n b[i] = 1\n o = t[i]\n if a[i] < t[i]:\n print(0)\n return\n o = -1\n for i in range(n-1, -1, -1):\n if o != a[i]:\n b[i] = 1\n o = a[i]\n if t[i] < a[i]:\n print(0)\n return\n r = 1\n for i in range(0, n):\n if b[i] == 0:\n r = (r * min(t[i], a[i])) % m\n print(r)",
"main",
"def reads(sep=None):\n return list(map(int, input().split(sep)))",
"def reads(sep=None):\n return list(map(int, input().split(sep)))",
"reads",
"def read():\n return int(input())",
"def read():\n return int(input())",
"read"
] |
def read():
return int(input())
def reads(sep=None):
return list(map(int, input().split(sep)))
def main():
m = 10**9 + 7
n = read()
t = reads()
a = reads()
if (t != sorted(t)) or (a != sorted(a, reverse=True)) or (max(t) != max(a)):
print(0)
return
if len([1 for ti,ai in zip(t, a) if ti==ai]) == 0:
print(0)
return
b = [0] * n
o = -1
for i in range(0, n):
if o != t[i]:
b[i] = 1
o = t[i]
if a[i] < t[i]:
print(0)
return
o = -1
for i in range(n-1, -1, -1):
if o != a[i]:
b[i] = 1
o = a[i]
if t[i] < a[i]:
print(0)
return
r = 1
for i in range(0, n):
if b[i] == 0:
r = (r * min(t[i], a[i])) % m
print(r)
main()
|
[
7,
12,
13,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
41,
28,
13,
4,
13,
13,
4,
17,
0,
13,
13,
13,
18,
13,
39,
0,
18,
13,
17,
17,
28,
13,
4,
13,
17,
13,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
18,
13,
13,
17,
14,
2,
18,
13,
17,
40,
18,
13,
17,
18,
13,
17,
4,
13,
17,
4,
13,
0,
18,
13,
17,
18,
13,
17,
0,
18,
13,
17,
17,
28,
13,
4,
13,
2,
13,
17,
17,
17,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
14,
2,
18,
13,
13,
40,
18,
13,
13,
18,
13,
13,
4,
13,
17,
4,
13,
0,
18,
13,
13,
18,
13,
13,
0,
18,
13,
13,
17,
14,
2,
18,
13,
13,
2,
18,
13,
13,
18,
13,
13,
4,
13,
17,
4,
13,
0,
18,
13,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
13,
17,
28,
13,
4,
13,
13,
14,
40,
18,
13,
13,
0,
13,
2,
2,
13,
18,
13,
13,
17,
4,
13,
13,
14,
2,
13,
17,
4,
13,
10,
12,
13
] |
[
[
5,
4
],
[
11,
10
],
[
23,
22
],
[
36,
35
],
[
4,
38
],
[
43,
42
],
[
45,
44
],
[
10,
46
],
[
52,
49
],
[
42,
50
],
[
55,
54
],
[
4,
58
],
[
10,
62
],
[
54,
63
],
[
10,
65
],
[
54,
67
],
[
73,
70
],
[
42,
71
],
[
54,
72
],
[
42,
77
],
[
44,
81
],
[
22,
84
],
[
95,
92
],
[
44,
93
],
[
22,
96
],
[
102,
99
],
[
42,
100
],
[
105,
104
],
[
4,
108
],
[
22,
115
],
[
104,
116
],
[
22,
118
],
[
104,
120
],
[
70,
124
],
[
147,
124
],
[
42,
125
],
[
104,
126
],
[
169,
128
],
[
140,
128
],
[
44,
129
],
[
104,
130
],
[
22,
132
],
[
104,
133
],
[
143,
140
],
[
44,
141
],
[
104,
142
],
[
22,
144
],
[
104,
145
],
[
150,
147
],
[
42,
148
],
[
104,
149
],
[
70,
153
],
[
147,
153
],
[
42,
154
],
[
104,
155
],
[
22,
158
],
[
104,
159
],
[
169,
160
],
[
140,
160
],
[
44,
161
],
[
104,
162
],
[
172,
169
],
[
44,
170
],
[
104,
171
],
[
169,
174
],
[
140,
174
],
[
44,
175
],
[
104,
176
],
[
22,
178
],
[
104,
179
],
[
182,
181
],
[
185,
184
],
[
4,
187
],
[
147,
190
],
[
70,
190
],
[
42,
191
],
[
184,
192
],
[
195,
194
],
[
181,
197
],
[
194,
197
],
[
169,
198
],
[
140,
198
],
[
44,
199
],
[
184,
200
],
[
194,
204
],
[
181,
204
],
[
213,
210
]
] |
[
"def main():\n n = int(input())\n t = list(map(int, input().split()))\n a = list(map(int, input().split()))\n\n is_certain, h = [0 for i in range(n)], t[:]\n is_certain[0] = 1\n for i in range(1, n):\n if t[i] > t[i-1]:\n is_certain[i] = 1\n\n if is_certain[-1] and h[-1] != a[-1]:\n print(0)\n exit()\n else:\n h[-1] = a[-1]\n is_certain[-1] = 1\n\n for i in range(n-2, -1, -1):\n if a[i] > a[i+1]:\n if is_certain[i] and h[i] != a[i]:\n print(0)\n exit()\n else:\n h[i] = a[i]\n is_certain[i] = 1\n elif is_certain[i] and a[i] < h[i]:\n print(0)\n exit()\n else:\n h[i] = min(h[i], a[i])\n\n ans = 1\n for i in range(n):\n if not is_certain[i]:\n ans = ans * h[i] % 1000000007\n\n print(ans)\n\n\nif __name__ == '__main__':\n main()",
"def main():\n n = int(input())\n t = list(map(int, input().split()))\n a = list(map(int, input().split()))\n\n is_certain, h = [0 for i in range(n)], t[:]\n is_certain[0] = 1\n for i in range(1, n):\n if t[i] > t[i-1]:\n is_certain[i] = 1\n\n if is_certain[-1] and h[-1] != a[-1]:\n print(0)\n exit()\n else:\n h[-1] = a[-1]\n is_certain[-1] = 1\n\n for i in range(n-2, -1, -1):\n if a[i] > a[i+1]:\n if is_certain[i] and h[i] != a[i]:\n print(0)\n exit()\n else:\n h[i] = a[i]\n is_certain[i] = 1\n elif is_certain[i] and a[i] < h[i]:\n print(0)\n exit()\n else:\n h[i] = min(h[i], a[i])\n\n ans = 1\n for i in range(n):\n if not is_certain[i]:\n ans = ans * h[i] % 1000000007\n\n print(ans)",
"main",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"t = list(map(int, input().split()))",
"t",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"a = list(map(int, input().split()))",
"a",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"0 for i in range(n)",
"for i in range(n)",
"i",
"range(n)",
"range",
"n",
"for i in range(n)",
"0",
"is_certain, h = [0 for i in range(n)], t[:]",
"is_certain",
"[0 for i in range(n)]",
"h",
"t[:]",
"t",
":",
"is_certain[0] = 1",
"is_certain[0]",
"is_certain",
"0",
"1",
"for i in range(1, n):\n if t[i] > t[i-1]:\n is_certain[i] = 1\n\n ",
"i",
"range(1, n)",
"range",
"1",
"n",
"if t[i] > t[i-1]:\n is_certain[i] = 1\n\n ",
"t[i] > t[i-1]",
"t[i]",
"t",
"i",
"t[i-1]",
"t",
"i-1",
"i",
"1",
"is_certain[i] = 1",
"is_certain[i]",
"is_certain",
"i",
"1",
"if is_certain[-1] and h[-1] != a[-1]:\n print(0)\n exit()\n else:\n h[-1] = a[-1]\n is_certain[-1] = 1\n\n ",
"is_certain[-1] and h[-1] != a[-1]",
"is_certain[-1]",
"is_certain",
"-1",
"h[-1] != a[-1]",
"h[-1]",
"h",
"-1",
"a[-1]",
"a",
"-1",
"print(0)",
"print",
"0",
"exit()",
"exit",
"h[-1] = a[-1]",
"h[-1]",
"h",
"-1",
"a[-1]",
"a",
"-1",
"is_certain[-1] = 1",
"is_certain[-1]",
"is_certain",
"-1",
"1",
"for i in range(n-2, -1, -1):\n if a[i] > a[i+1]:\n if is_certain[i] and h[i] != a[i]:\n print(0)\n exit()\n else:\n h[i] = a[i]\n is_certain[i] = 1\n elif is_certain[i] and a[i] < h[i]:\n print(0)\n exit()\n else:\n h[i] = min(h[i], a[i])\n\n ",
"i",
"range(n-2, -1, -1)",
"range",
"n-2",
"n",
"2",
"-1",
"-1",
"if a[i] > a[i+1]:\n if is_certain[i] and h[i] != a[i]:\n print(0)\n exit()\n else:\n h[i] = a[i]\n is_certain[i] = 1\n elif is_certain[i] and a[i] < h[i]:\n print(0)\n exit()\n else:\n h[i] = min(h[i], a[i])\n\n ",
"a[i] > a[i+1]",
"a[i]",
"a",
"i",
"a[i+1]",
"a",
"i+1",
"i",
"1",
"if is_certain[i] and h[i] != a[i]:\n print(0)\n exit()\n else:\n h[i] = a[i]\n is_certain[i] = 1\n ",
"is_certain[i] and h[i] != a[i]",
"is_certain[i]",
"is_certain",
"i",
"h[i] != a[i]",
"h[i]",
"h",
"i",
"a[i]",
"a",
"i",
"print(0)",
"print",
"0",
"exit()",
"exit",
"h[i] = a[i]",
"h[i]",
"h",
"i",
"a[i]",
"a",
"i",
"is_certain[i] = 1",
"is_certain[i]",
"is_certain",
"i",
"1",
"elif is_certain[i] and a[i] < h[i]:\n print(0)\n exit()\n ",
"is_certain[i] and a[i] < h[i]",
"is_certain[i]",
"is_certain",
"i",
"a[i] < h[i]",
"a[i]",
"a",
"i",
"h[i]",
"h",
"i",
"print(0)",
"print",
"0",
"exit()",
"exit",
"h[i] = min(h[i], a[i])",
"h[i]",
"h",
"i",
"min(h[i], a[i])",
"min",
"h[i]",
"h",
"i",
"a[i]",
"a",
"i",
"ans = 1",
"ans",
"1",
"for i in range(n):\n if not is_certain[i]:\n ans = ans * h[i] % 1000000007\n\n ",
"i",
"range(n)",
"range",
"n",
"if not is_certain[i]:\n ans = ans * h[i] % 1000000007\n\n ",
"not is_certain[i]",
"is_certain[i]",
"is_certain",
"i",
"ans = ans * h[i] % 1000000007",
"ans",
"ans * h[i] % 1000000007",
"ans * h[i]",
"ans",
"h[i]",
"h",
"i",
"1000000007",
"print(ans)",
"print",
"ans",
"if __name__ == '__main__':\n main()",
"__name__ == '__main__'",
"__name__",
"'__main__'",
"main()",
"main",
"def main():\n n = int(input())\n t = list(map(int, input().split()))\n a = list(map(int, input().split()))\n\n is_certain, h = [0 for i in range(n)], t[:]\n is_certain[0] = 1\n for i in range(1, n):\n if t[i] > t[i-1]:\n is_certain[i] = 1\n\n if is_certain[-1] and h[-1] != a[-1]:\n print(0)\n exit()\n else:\n h[-1] = a[-1]\n is_certain[-1] = 1\n\n for i in range(n-2, -1, -1):\n if a[i] > a[i+1]:\n if is_certain[i] and h[i] != a[i]:\n print(0)\n exit()\n else:\n h[i] = a[i]\n is_certain[i] = 1\n elif is_certain[i] and a[i] < h[i]:\n print(0)\n exit()\n else:\n h[i] = min(h[i], a[i])\n\n ans = 1\n for i in range(n):\n if not is_certain[i]:\n ans = ans * h[i] % 1000000007\n\n print(ans)",
"def main():\n n = int(input())\n t = list(map(int, input().split()))\n a = list(map(int, input().split()))\n\n is_certain, h = [0 for i in range(n)], t[:]\n is_certain[0] = 1\n for i in range(1, n):\n if t[i] > t[i-1]:\n is_certain[i] = 1\n\n if is_certain[-1] and h[-1] != a[-1]:\n print(0)\n exit()\n else:\n h[-1] = a[-1]\n is_certain[-1] = 1\n\n for i in range(n-2, -1, -1):\n if a[i] > a[i+1]:\n if is_certain[i] and h[i] != a[i]:\n print(0)\n exit()\n else:\n h[i] = a[i]\n is_certain[i] = 1\n elif is_certain[i] and a[i] < h[i]:\n print(0)\n exit()\n else:\n h[i] = min(h[i], a[i])\n\n ans = 1\n for i in range(n):\n if not is_certain[i]:\n ans = ans * h[i] % 1000000007\n\n print(ans)",
"main"
] |
def main():
n = int(input())
t = list(map(int, input().split()))
a = list(map(int, input().split()))
is_certain, h = [0 for i in range(n)], t[:]
is_certain[0] = 1
for i in range(1, n):
if t[i] > t[i-1]:
is_certain[i] = 1
if is_certain[-1] and h[-1] != a[-1]:
print(0)
exit()
else:
h[-1] = a[-1]
is_certain[-1] = 1
for i in range(n-2, -1, -1):
if a[i] > a[i+1]:
if is_certain[i] and h[i] != a[i]:
print(0)
exit()
else:
h[i] = a[i]
is_certain[i] = 1
elif is_certain[i] and a[i] < h[i]:
print(0)
exit()
else:
h[i] = min(h[i], a[i])
ans = 1
for i in range(n):
if not is_certain[i]:
ans = ans * h[i] % 1000000007
print(ans)
if __name__ == '__main__':
main()
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
2,
2,
17,
17,
17,
0,
13,
39,
39,
17,
18,
13,
17,
28,
13,
4,
13,
17,
13,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
4,
18,
13,
13,
39,
17,
18,
13,
13,
4,
18,
13,
13,
39,
17,
18,
13,
13,
0,
13,
39,
39,
17,
18,
13,
2,
13,
17,
28,
13,
4,
13,
2,
13,
17,
17,
17,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
4,
18,
13,
13,
39,
17,
18,
13,
13,
4,
18,
13,
13,
39,
17,
18,
13,
13,
0,
13,
18,
13,
39,
17,
0,
13,
17,
28,
13,
4,
13,
13,
14,
2,
2,
18,
18,
13,
13,
17,
17,
2,
18,
18,
13,
13,
17,
17,
14,
40,
18,
18,
13,
13,
17,
18,
18,
13,
13,
17,
0,
13,
17,
14,
2,
18,
18,
13,
13,
17,
17,
14,
2,
18,
18,
13,
13,
17,
18,
18,
13,
13,
17,
0,
13,
17,
14,
2,
18,
18,
13,
13,
17,
17,
14,
2,
18,
18,
13,
13,
17,
18,
18,
13,
13,
17,
0,
13,
17,
0,
13,
4,
13,
18,
18,
13,
13,
17,
18,
18,
13,
13,
17,
0,
13,
13,
4,
13,
13,
10,
4,
13,
10,
4,
13,
10,
2,
13,
10,
17,
13,
10,
17,
13,
10,
39,
13,
10,
4,
13,
10,
18,
13,
10,
17,
13,
10,
17,
13,
10,
39,
13,
10,
4,
13,
10,
13,
13
] |
[
[
239,
2
],
[
242,
8
],
[
257,
20
],
[
245,
32
],
[
254,
39
],
[
243,
44
],
[
48,
47
],
[
240,
51
],
[
243,
55
],
[
47,
56
],
[
243,
58
],
[
47,
60
],
[
255,
64
],
[
243,
69
],
[
47,
70
],
[
255,
73
],
[
243,
78
],
[
47,
79
],
[
269,
81
],
[
258,
86
],
[
240,
88
],
[
92,
91
],
[
240,
95
],
[
258,
102
],
[
91,
103
],
[
258,
105
],
[
91,
107
],
[
270,
111
],
[
258,
116
],
[
91,
117
],
[
270,
120
],
[
258,
125
],
[
91,
126
],
[
260,
128
],
[
270,
130
],
[
251,
134
],
[
138,
137
],
[
240,
140
],
[
261,
146
],
[
270,
146
],
[
137,
147
],
[
255,
153
],
[
137,
154
],
[
261,
161
],
[
270,
161
],
[
137,
162
],
[
255,
166
],
[
137,
167
],
[
263,
170
],
[
261,
176
],
[
270,
176
],
[
137,
177
],
[
261,
184
],
[
270,
184
],
[
137,
185
],
[
255,
189
],
[
137,
190
],
[
266,
193
],
[
255,
199
],
[
137,
200
],
[
255,
207
],
[
137,
208
],
[
261,
212
],
[
270,
212
],
[
137,
213
],
[
248,
216
],
[
272,
219
],
[
261,
224
],
[
270,
224
],
[
137,
225
],
[
255,
229
],
[
137,
230
],
[
275,
233
],
[
246,
234
],
[
276,
237
],
[
273,
237
],
[
249,
237
],
[
267,
237
],
[
264,
237
],
[
252,
237
],
[
239,
240
],
[
242,
243
],
[
245,
246
],
[
248,
249
],
[
251,
252
],
[
254,
255
],
[
257,
258
],
[
260,
261
],
[
263,
264
],
[
266,
267
],
[
269,
270
],
[
272,
273
],
[
246,
275
],
[
275,
276
]
] |
[
"n = int(input())\nt = list(map(int,input().split()))\na = list(map(int,input().split()))\nMOD = 10**9 + 7\n\nm_left =[[1,t[0]]]\nfor i in range(1,n):\n if t[i] > t[i-1]:\n m_left.append([1,t[i]])\n else:\n m_left.append([0,t[i]])\n\nm_right = [[1,a[n-1]]]\nfor i in range(n-2,-1,-1):\n if a[i] > a[i+1]:\n m_right.append([1,a[i]])\n else:\n m_right.append([0,a[i]])\nm_right = m_right[::-1]\n#print(m_left)\n#print(m_right)\n\nans = 1\nfor i in range(n):\n if m_right[i][0] == 1 and m_left[i][0] == 1:\n if m_right[i][1] != m_left[i][1]:\n ans = 0\n elif m_right[i][0] == 1:\n if m_right[i][1] > m_left[i][1]:\n ans = 0\n elif m_left[i][0] == 1:\n if m_left[i][1] > m_right[i][1]:\n ans = 0\n else:\n ans *= min(m_right[i][1], m_left[i][1])\n ans %= MOD\n\nprint(ans)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"t = list(map(int,input().split()))",
"t",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"a = list(map(int,input().split()))",
"a",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"MOD = 10**9 + 7",
"MOD",
"10**9 + 7",
"10**9",
"10",
"9",
"7",
"m_left =[[1,t[0]]]",
"m_left",
"[[1,t[0]]]",
"[1,t[0]]",
"1",
"t[0]",
"t",
"0",
"for i in range(1,n):\n if t[i] > t[i-1]:\n m_left.append([1,t[i]])\n else:\n m_left.append([0,t[i]])",
"i",
"range(1,n)",
"range",
"1",
"n",
"if t[i] > t[i-1]:\n m_left.append([1,t[i]])\n else:\n m_left.append([0,t[i]])",
"t[i] > t[i-1]",
"t[i]",
"t",
"i",
"t[i-1]",
"t",
"i-1",
"i",
"1",
"m_left.append([1,t[i]])",
"m_left.append",
"m_left",
"append",
"[1,t[i]]",
"1",
"t[i]",
"t",
"i",
"m_left.append([0,t[i]])",
"m_left.append",
"m_left",
"append",
"[0,t[i]]",
"0",
"t[i]",
"t",
"i",
"m_right = [[1,a[n-1]]]",
"m_right",
"[[1,a[n-1]]]",
"[1,a[n-1]]",
"1",
"a[n-1]",
"a",
"n-1",
"n",
"1",
"for i in range(n-2,-1,-1):\n if a[i] > a[i+1]:\n m_right.append([1,a[i]])\n else:\n m_right.append([0,a[i]])",
"i",
"range(n-2,-1,-1)",
"range",
"n-2",
"n",
"2",
"-1",
"-1",
"if a[i] > a[i+1]:\n m_right.append([1,a[i]])\n else:\n m_right.append([0,a[i]])",
"a[i] > a[i+1]",
"a[i]",
"a",
"i",
"a[i+1]",
"a",
"i+1",
"i",
"1",
"m_right.append([1,a[i]])",
"m_right.append",
"m_right",
"append",
"[1,a[i]]",
"1",
"a[i]",
"a",
"i",
"m_right.append([0,a[i]])",
"m_right.append",
"m_right",
"append",
"[0,a[i]]",
"0",
"a[i]",
"a",
"i",
"m_right = m_right[::-1]",
"m_right",
"m_right[::-1]",
"m_right",
"::-1",
"-1",
"ans = 1",
"ans",
"1",
"for i in range(n):\n if m_right[i][0] == 1 and m_left[i][0] == 1:\n if m_right[i][1] != m_left[i][1]:\n ans = 0\n elif m_right[i][0] == 1:\n if m_right[i][1] > m_left[i][1]:\n ans = 0\n elif m_left[i][0] == 1:\n if m_left[i][1] > m_right[i][1]:\n ans = 0\n else:\n ans *= min(m_right[i][1], m_left[i][1])\n ans %= MOD",
"i",
"range(n)",
"range",
"n",
"if m_right[i][0] == 1 and m_left[i][0] == 1:\n if m_right[i][1] != m_left[i][1]:\n ans = 0\n elif m_right[i][0] == 1:\n if m_right[i][1] > m_left[i][1]:\n ans = 0\n elif m_left[i][0] == 1:\n if m_left[i][1] > m_right[i][1]:\n ans = 0\n else:\n ans *= min(m_right[i][1], m_left[i][1])\n ans %= MOD",
"m_right[i][0] == 1 and m_left[i][0] == 1",
"m_right[i][0] == 1",
"m_right[i][0]",
"[i]",
"m_right",
"i",
"0",
"1",
"m_left[i][0] == 1",
"m_left[i][0]",
"[i]",
"m_left",
"i",
"0",
"1",
"if m_right[i][1] != m_left[i][1]:\n ans = 0\n ",
"m_right[i][1] != m_left[i][1]",
"m_right[i][1]",
"[i]",
"m_right",
"i",
"1",
"m_left[i][1]",
"[i]",
"m_left",
"i",
"1",
"ans = 0",
"ans",
"0",
"elif m_right[i][0] == 1:\n if m_right[i][1] > m_left[i][1]:\n ans = 0\n ",
"m_right[i][0] == 1",
"m_right[i][0]",
"[i]",
"m_right",
"i",
"0",
"1",
"if m_right[i][1] > m_left[i][1]:\n ans = 0\n ",
"m_right[i][1] > m_left[i][1]",
"m_right[i][1]",
"[i]",
"m_right",
"i",
"1",
"m_left[i][1]",
"[i]",
"m_left",
"i",
"1",
"ans = 0",
"ans",
"0",
"elif m_left[i][0] == 1:\n if m_left[i][1] > m_right[i][1]:\n ans = 0\n ",
"m_left[i][0] == 1",
"m_left[i][0]",
"[i]",
"m_left",
"i",
"0",
"1",
"if m_left[i][1] > m_right[i][1]:\n ans = 0\n ",
"m_left[i][1] > m_right[i][1]",
"m_left[i][1]",
"[i]",
"m_left",
"i",
"1",
"m_right[i][1]",
"[i]",
"m_right",
"i",
"1",
"ans = 0",
"ans",
"0",
"ans *= min(m_right[i][1], m_left[i][1])",
"ans",
"min(m_right[i][1], m_left[i][1])",
"min",
"m_right[i][1]",
"[i]",
"m_right",
"i",
"1",
"m_left[i][1]",
"[i]",
"m_left",
"i",
"1",
"ans %= MOD",
"ans",
"MOD",
"print(ans)",
"print",
"ans",
"n = int(input())",
"int(input())",
"n",
"t = list(map(int,input().split()))",
"list(map(int,input().split()))",
"t",
"MOD = 10**9 + 7",
"10**9 + 7",
"MOD",
"ans = 0",
"0",
"ans",
"ans = 1",
"1",
"ans",
"m_left =[[1,t[0]]]",
"[[1,t[0]]]",
"m_left",
"a = list(map(int,input().split()))",
"list(map(int,input().split()))",
"a",
"m_right = m_right[::-1]",
"m_right[::-1]",
"m_right",
"ans = 0",
"0",
"ans",
"ans = 0",
"0",
"ans",
"m_right = [[1,a[n-1]]]",
"[[1,a[n-1]]]",
"m_right",
"ans *= min(m_right[i][1], m_left[i][1])",
"min(m_right[i][1], m_left[i][1])",
"ans",
"ans %= MOD",
"MOD",
"ans"
] |
n = int(input())
t = list(map(int,input().split()))
a = list(map(int,input().split()))
MOD = 10**9 + 7
m_left =[[1,t[0]]]
for i in range(1,n):
if t[i] > t[i-1]:
m_left.append([1,t[i]])
else:
m_left.append([0,t[i]])
m_right = [[1,a[n-1]]]
for i in range(n-2,-1,-1):
if a[i] > a[i+1]:
m_right.append([1,a[i]])
else:
m_right.append([0,a[i]])
m_right = m_right[::-1]
#print(m_left)
#print(m_right)
ans = 1
for i in range(n):
if m_right[i][0] == 1 and m_left[i][0] == 1:
if m_right[i][1] != m_left[i][1]:
ans = 0
elif m_right[i][0] == 1:
if m_right[i][1] > m_left[i][1]:
ans = 0
elif m_left[i][0] == 1:
if m_left[i][1] > m_right[i][1]:
ans = 0
else:
ans *= min(m_right[i][1], m_left[i][1])
ans %= MOD
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
17,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
17,
0,
13,
17,
41,
28,
13,
4,
13,
13,
4,
17,
0,
13,
13,
28,
13,
4,
13,
13,
14,
40,
18,
13,
13,
13,
0,
18,
13,
13,
18,
13,
13,
0,
13,
18,
13,
13,
0,
13,
17,
41,
28,
13,
4,
13,
13,
4,
17,
0,
13,
13,
28,
13,
4,
13,
2,
13,
17,
17,
17,
14,
40,
18,
13,
13,
13,
0,
18,
13,
13,
18,
13,
13,
0,
13,
18,
13,
13,
0,
13,
17,
28,
13,
4,
13,
13,
14,
2,
2,
18,
13,
13,
17,
2,
18,
13,
13,
17,
0,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
13,
2,
2,
17,
17,
17,
14,
2,
18,
13,
13,
17,
14,
2,
18,
13,
13,
18,
13,
13,
0,
13,
17,
14,
2,
18,
13,
13,
17,
14,
2,
18,
13,
13,
18,
13,
13,
0,
13,
17,
14,
40,
18,
13,
13,
18,
13,
13,
0,
13,
17,
4,
13,
13,
10,
18,
13,
10,
17,
13,
10,
4,
13,
10,
18,
13,
10,
17,
13,
10,
13,
13,
10,
2,
13,
10,
17,
13,
10,
17,
13,
10,
4,
13,
10,
4,
13,
10,
17,
13,
10,
4,
13,
10,
13,
13,
10,
17,
13
] |
[
[
203,
2
],
[
227,
8
],
[
233,
21
],
[
218,
34
],
[
39,
38
],
[
204,
41
],
[
212,
45
],
[
49,
48
],
[
204,
51
],
[
228,
55
],
[
48,
56
],
[
219,
57
],
[
207,
57
],
[
62,
59
],
[
213,
60
],
[
48,
61
],
[
228,
63
],
[
48,
64
],
[
206,
66
],
[
228,
68
],
[
48,
69
],
[
209,
71
],
[
76,
75
],
[
204,
78
],
[
236,
82
],
[
86,
85
],
[
204,
89
],
[
234,
96
],
[
85,
97
],
[
210,
98
],
[
207,
98
],
[
219,
98
],
[
198,
98
],
[
103,
100
],
[
237,
101
],
[
85,
102
],
[
234,
104
],
[
85,
105
],
[
197,
107
],
[
234,
109
],
[
85,
110
],
[
200,
112
],
[
116,
115
],
[
204,
118
],
[
59,
122
],
[
213,
123
],
[
115,
124
],
[
100,
127
],
[
237,
128
],
[
115,
129
],
[
224,
132
],
[
228,
136
],
[
115,
137
],
[
234,
139
],
[
115,
140
],
[
215,
142
],
[
59,
150
],
[
213,
151
],
[
115,
152
],
[
228,
157
],
[
115,
158
],
[
100,
159
],
[
237,
160
],
[
115,
161
],
[
221,
163
],
[
100,
167
],
[
237,
168
],
[
115,
169
],
[
234,
174
],
[
115,
175
],
[
59,
176
],
[
213,
177
],
[
115,
178
],
[
239,
180
],
[
59,
184
],
[
213,
185
],
[
115,
186
],
[
100,
187
],
[
237,
188
],
[
115,
189
],
[
230,
191
],
[
231,
195
],
[
240,
195
],
[
222,
195
],
[
216,
195
],
[
225,
195
],
[
201,
195
],
[
197,
198
],
[
200,
201
],
[
203,
204
],
[
206,
207
],
[
209,
210
],
[
212,
213
],
[
215,
216
],
[
218,
219
],
[
221,
222
],
[
224,
225
],
[
227,
228
],
[
230,
231
],
[
233,
234
],
[
236,
237
],
[
239,
240
]
] |
[
"# -*- coding: utf-8 -*-\nN = int(input())\nT = list(map(int, input().split(' ')))\nA = list(map(int, input().split(' ')))\n\n\nprev = -1\ncandidates_t = [-1 for _ in range(N)]\nfor i in range(N):\n if T[i] != prev:\n candidates_t[i] = T[i]\n\n prev = T[i]\n\n\nprev = -1\ncandidates_a = [-1 for _ in range(N)]\nfor i in range(N-1, -1, -1):\n if A[i] != prev:\n candidates_a[i] = A[i]\n\n prev = A[i]\n\nret = 1\nfor i in range(N):\n if candidates_t[i] == -1 and candidates_a[i] == -1:\n ret *= min(T[i], A[i])\n ret %= 10**9 + 7\n\n elif candidates_t[i] == -1:\n if T[i] < candidates_a[i]:\n ret *= 0\n\n elif candidates_a[i] == -1:\n if A[i] < candidates_t[i]:\n ret *= 0\n\n elif candidates_t[i] != candidates_a[i]:\n ret *= 0\n\n\nprint(ret)\n\n",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"T = list(map(int, input().split(' ')))",
"T",
"list(map(int, input().split(' ')))",
"list",
"map(int, input().split(' '))",
"map",
"int",
"input().split(' ')",
"().split",
"()",
"input",
"split",
"' '",
"A = list(map(int, input().split(' ')))",
"A",
"list(map(int, input().split(' ')))",
"list",
"map(int, input().split(' '))",
"map",
"int",
"input().split(' ')",
"().split",
"()",
"input",
"split",
"' '",
"prev = -1",
"prev",
"-1",
"-1 for _ in range(N)",
"for _ in range(N)",
"_",
"range(N)",
"range",
"N",
"for _ in range(N)",
"-1",
"candidates_t = [-1 for _ in range(N)]",
"candidates_t",
"[-1 for _ in range(N)]",
"for i in range(N):\n if T[i] != prev:\n candidates_t[i] = T[i]\n\n prev = T[i]",
"i",
"range(N)",
"range",
"N",
"if T[i] != prev:\n candidates_t[i] = T[i]\n\n ",
"T[i] != prev",
"T[i]",
"T",
"i",
"prev",
"candidates_t[i] = T[i]",
"candidates_t[i]",
"candidates_t",
"i",
"T[i]",
"T",
"i",
"prev = T[i]",
"prev",
"T[i]",
"T",
"i",
"prev = -1",
"prev",
"-1",
"-1 for _ in range(N)",
"for _ in range(N)",
"_",
"range(N)",
"range",
"N",
"for _ in range(N)",
"-1",
"candidates_a = [-1 for _ in range(N)]",
"candidates_a",
"[-1 for _ in range(N)]",
"for i in range(N-1, -1, -1):\n if A[i] != prev:\n candidates_a[i] = A[i]\n\n prev = A[i]",
"i",
"range(N-1, -1, -1)",
"range",
"N-1",
"N",
"1",
"-1",
"-1",
"if A[i] != prev:\n candidates_a[i] = A[i]\n\n ",
"A[i] != prev",
"A[i]",
"A",
"i",
"prev",
"candidates_a[i] = A[i]",
"candidates_a[i]",
"candidates_a",
"i",
"A[i]",
"A",
"i",
"prev = A[i]",
"prev",
"A[i]",
"A",
"i",
"ret = 1",
"ret",
"1",
"for i in range(N):\n if candidates_t[i] == -1 and candidates_a[i] == -1:\n ret *= min(T[i], A[i])\n ret %= 10**9 + 7\n\n elif candidates_t[i] == -1:\n if T[i] < candidates_a[i]:\n ret *= 0\n\n elif candidates_a[i] == -1:\n if A[i] < candidates_t[i]:\n ret *= 0\n\n elif candidates_t[i] != candidates_a[i]:\n ret *= 0",
"i",
"range(N)",
"range",
"N",
"if candidates_t[i] == -1 and candidates_a[i] == -1:\n ret *= min(T[i], A[i])\n ret %= 10**9 + 7\n\n elif candidates_t[i] == -1:\n if T[i] < candidates_a[i]:\n ret *= 0\n\n elif candidates_a[i] == -1:\n if A[i] < candidates_t[i]:\n ret *= 0\n\n elif candidates_t[i] != candidates_a[i]:\n ret *= 0",
"candidates_t[i] == -1 and candidates_a[i] == -1",
"candidates_t[i] == -1",
"candidates_t[i]",
"candidates_t",
"i",
"-1",
"candidates_a[i] == -1",
"candidates_a[i]",
"candidates_a",
"i",
"-1",
"ret *= min(T[i], A[i])",
"ret",
"min(T[i], A[i])",
"min",
"T[i]",
"T",
"i",
"A[i]",
"A",
"i",
"ret %= 10**9 + 7",
"ret",
"10**9 + 7",
"10**9",
"10",
"9",
"7",
"elif candidates_t[i] == -1:\n if T[i] < candidates_a[i]:\n ret *= 0\n\n ",
"candidates_t[i] == -1",
"candidates_t[i]",
"candidates_t",
"i",
"-1",
"if T[i] < candidates_a[i]:\n ret *= 0\n\n ",
"T[i] < candidates_a[i]",
"T[i]",
"T",
"i",
"candidates_a[i]",
"candidates_a",
"i",
"ret *= 0",
"ret",
"0",
"elif candidates_a[i] == -1:\n if A[i] < candidates_t[i]:\n ret *= 0\n\n ",
"candidates_a[i] == -1",
"candidates_a[i]",
"candidates_a",
"i",
"-1",
"if A[i] < candidates_t[i]:\n ret *= 0\n\n ",
"A[i] < candidates_t[i]",
"A[i]",
"A",
"i",
"candidates_t[i]",
"candidates_t",
"i",
"ret *= 0",
"ret",
"0",
"elif candidates_t[i] != candidates_a[i]:\n ret *= 0",
"candidates_t[i] != candidates_a[i]",
"candidates_t[i]",
"candidates_t",
"i",
"candidates_a[i]",
"candidates_a",
"i",
"ret *= 0",
"ret",
"0",
"print(ret)",
"print",
"ret",
"prev = A[i]",
"A[i]",
"prev",
"ret = 1",
"1",
"ret",
"N = int(input())",
"int(input())",
"N",
"prev = T[i]",
"T[i]",
"prev",
"prev = -1",
"-1",
"prev",
"candidates_t = [-1 for _ in range(N)]",
"[-1 for _ in range(N)]",
"candidates_t",
"ret %= 10**9 + 7",
"10**9 + 7",
"ret",
"prev = -1",
"-1",
"prev",
"ret *= 0",
"0",
"ret",
"ret *= min(T[i], A[i])",
"min(T[i], A[i])",
"ret",
"T = list(map(int, input().split(' ')))",
"list(map(int, input().split(' ')))",
"T",
"ret *= 0",
"0",
"ret",
"A = list(map(int, input().split(' ')))",
"list(map(int, input().split(' ')))",
"A",
"candidates_a = [-1 for _ in range(N)]",
"[-1 for _ in range(N)]",
"candidates_a",
"ret *= 0",
"0",
"ret"
] |
# -*- coding: utf-8 -*-
N = int(input())
T = list(map(int, input().split(' ')))
A = list(map(int, input().split(' ')))
prev = -1
candidates_t = [-1 for _ in range(N)]
for i in range(N):
if T[i] != prev:
candidates_t[i] = T[i]
prev = T[i]
prev = -1
candidates_a = [-1 for _ in range(N)]
for i in range(N-1, -1, -1):
if A[i] != prev:
candidates_a[i] = A[i]
prev = A[i]
ret = 1
for i in range(N):
if candidates_t[i] == -1 and candidates_a[i] == -1:
ret *= min(T[i], A[i])
ret %= 10**9 + 7
elif candidates_t[i] == -1:
if T[i] < candidates_a[i]:
ret *= 0
elif candidates_a[i] == -1:
if A[i] < candidates_t[i]:
ret *= 0
elif candidates_t[i] != candidates_a[i]:
ret *= 0
print(ret)
|
[
7,
15,
13,
0,
13,
12,
4,
18,
4,
18,
18,
13,
13,
13,
13,
4,
18,
13,
13,
4,
13,
17,
2,
17,
17,
0,
13,
12,
4,
18,
18,
13,
13,
13,
2,
13,
17,
23,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
2,
39,
17,
13,
0,
13,
2,
39,
17,
13,
0,
13,
2,
39,
17,
13,
0,
13,
2,
39,
17,
13,
0,
13,
17,
28,
13,
13,
4,
13,
13,
14,
2,
13,
13,
0,
18,
13,
13,
13,
0,
18,
13,
13,
13,
0,
18,
13,
13,
13,
0,
13,
13,
0,
13,
17,
28,
13,
13,
4,
13,
4,
13,
13,
14,
2,
13,
13,
0,
18,
13,
2,
2,
13,
17,
13,
13,
0,
18,
13,
2,
2,
13,
17,
13,
13,
0,
18,
13,
2,
2,
13,
17,
13,
13,
0,
13,
13,
0,
13,
17,
0,
13,
2,
2,
17,
17,
17,
28,
13,
4,
13,
13,
0,
13,
2,
2,
4,
13,
18,
13,
13,
18,
13,
13,
4,
13,
18,
13,
13,
18,
13,
13,
17,
14,
40,
13,
17,
0,
13,
17,
3,
0,
13,
13,
0,
13,
13,
4,
13,
13,
10,
12,
13,
10,
13,
13,
10,
2,
13,
10,
12,
13,
10,
13,
13,
10,
17,
13,
10,
2,
13,
10,
13,
13,
10,
4,
13,
10,
13,
13,
10,
4,
13,
10,
2,
13,
10,
2,
13,
10,
17,
13,
10,
4,
13,
10,
17,
13,
10,
2,
13,
10,
17,
13,
10,
2,
13
] |
[
[
231,
4
],
[
222,
26
],
[
264,
39
],
[
232,
43
],
[
252,
45
],
[
232,
54
],
[
246,
57
],
[
232,
66
],
[
276,
69
],
[
265,
73
],
[
258,
75
],
[
265,
79
],
[
240,
81
],
[
265,
85
],
[
270,
87
],
[
265,
91
],
[
261,
93
],
[
253,
100
],
[
262,
104
],
[
244,
104
],
[
114,
106
],
[
277,
107
],
[
114,
111
],
[
259,
112
],
[
119,
116
],
[
259,
117
],
[
243,
121
],
[
267,
124
],
[
247,
133
],
[
268,
137
],
[
244,
137
],
[
262,
137
],
[
235,
137
],
[
155,
139
],
[
241,
140
],
[
265,
143
],
[
155,
148
],
[
271,
149
],
[
265,
152
],
[
164,
157
],
[
271,
158
],
[
265,
161
],
[
234,
166
],
[
273,
169
],
[
255,
172
],
[
180,
179
],
[
265,
182
],
[
228,
184
],
[
116,
189
],
[
111,
189
],
[
259,
190
],
[
179,
191
],
[
271,
193
],
[
179,
194
],
[
106,
197
],
[
277,
198
],
[
179,
199
],
[
241,
201
],
[
179,
202
],
[
229,
206
],
[
237,
209
],
[
249,
213
],
[
229,
214
],
[
225,
216
],
[
256,
217
],
[
226,
220
],
[
250,
220
],
[
238,
220
],
[
274,
220
],
[
222,
223
],
[
256,
225
],
[
225,
226
],
[
228,
229
],
[
231,
232
],
[
234,
235
],
[
237,
238
],
[
240,
241
],
[
243,
244
],
[
246,
247
],
[
229,
249
],
[
249,
250
],
[
252,
253
],
[
255,
256
],
[
258,
259
],
[
261,
262
],
[
264,
265
],
[
267,
268
],
[
270,
271
],
[
273,
274
],
[
276,
277
]
] |
[
"import sys\ninput = lambda : sys.stdin.readline().rstrip()\nsys.setrecursionlimit(max(1000, 10**9))\nwrite = lambda x: sys.stdout.write(x+\"\\n\")\n\n\nn = int(input())\nt = list(map(int, input().split()))\na = list(map(int, input().split()))\nmt = [1]*n\nMt = [None]*n\nma = [1]*n\nMa = [None]*n\nv = -1\nfor i,h in enumerate(t):\n if h>v:\n mt[i] = Mt[i] = h\n else:\n Mt[i] = h\n v = h\nv = -1\nfor i,h in enumerate(reversed(a)):\n if h>v:\n ma[n-1-i] = Ma[n-1-i] = h\n else:\n Ma[n-1-i] = h\n v = h\nans = 1\nM = 10**9+7\nfor i in range(n):\n val = min(Mt[i], Ma[i]) - max(mt[i], ma[i]) + 1\n if val<=0:\n ans = 0\n break\n ans *= val\n ans %= M\nprint(ans)",
"import sys",
"sys",
"input = lambda : sys.stdin.readline().rstrip()",
"input",
"lambda : sys.stdin.readline().rstrip()",
"sys.stdin.readline().rstrip()",
"sys.stdin.readline().rstrip",
"sys.stdin.readline()",
"sys.stdin.readline",
"sys.stdin",
"sys",
"stdin",
"readline",
"rstrip",
"sys.setrecursionlimit(max(1000, 10**9))",
"sys.setrecursionlimit",
"sys",
"setrecursionlimit",
"max(1000, 10**9)",
"max",
"1000",
"10**9",
"10",
"9",
"write = lambda x: sys.stdout.write(x+\"\\n\")",
"write",
"lambda x: sys.stdout.write(x+\"\\n\")",
"sys.stdout.write(x+\"\\n\")",
"sys.stdout.write",
"sys.stdout",
"sys",
"stdout",
"write",
"x+\"\\n\"",
"x",
"\"\\n\"",
"x",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"t = list(map(int, input().split()))",
"t",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"a = list(map(int, input().split()))",
"a",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"mt = [1]*n",
"mt",
"[1]*n",
"[1]",
"1",
"n",
"Mt = [None]*n",
"Mt",
"[None]*n",
"[None]",
"None",
"n",
"ma = [1]*n",
"ma",
"[1]*n",
"[1]",
"1",
"n",
"Ma = [None]*n",
"Ma",
"[None]*n",
"[None]",
"None",
"n",
"v = -1",
"v",
"-1",
"for i,h in enumerate(t):\n if h>v:\n mt[i] = Mt[i] = h\n else:\n Mt[i] = h\n v = h",
"i",
"h",
"enumerate(t)",
"enumerate",
"t",
"if h>v:\n mt[i] = Mt[i] = h\n else:\n Mt[i] = h\n ",
"h>v",
"h",
"v",
"mt[i] = Mt[i] = h",
"mt[i]",
"mt",
"i",
"h",
"= Mt[i] = h",
"Mt[i]",
"Mt",
"i",
"h",
"Mt[i] = h",
"Mt[i]",
"Mt",
"i",
"h",
"v = h",
"v",
"h",
"v = -1",
"v",
"-1",
"for i,h in enumerate(reversed(a)):\n if h>v:\n ma[n-1-i] = Ma[n-1-i] = h\n else:\n Ma[n-1-i] = h\n v = h",
"i",
"h",
"enumerate(reversed(a))",
"enumerate",
"reversed(a)",
"reversed",
"a",
"if h>v:\n ma[n-1-i] = Ma[n-1-i] = h\n else:\n Ma[n-1-i] = h\n ",
"h>v",
"h",
"v",
"ma[n-1-i] = Ma[n-1-i] = h",
"ma[n-1-i]",
"ma",
"n-1-i",
"n-1",
"n",
"1",
"i",
"h",
"= Ma[n-1-i] = h",
"Ma[n-1-i]",
"Ma",
"n-1-i",
"n-1",
"n",
"1",
"i",
"h",
"Ma[n-1-i] = h",
"Ma[n-1-i]",
"Ma",
"n-1-i",
"n-1",
"n",
"1",
"i",
"h",
"v = h",
"v",
"h",
"ans = 1",
"ans",
"1",
"M = 10**9+7",
"M",
"10**9+7",
"10**9",
"10",
"9",
"7",
"for i in range(n):\n val = min(Mt[i], Ma[i]) - max(mt[i], ma[i]) + 1\n if val<=0:\n ans = 0\n break\n ans *= val\n ans %= M",
"i",
"range(n)",
"range",
"n",
"val = min(Mt[i], Ma[i]) - max(mt[i], ma[i]) + 1",
"val",
"min(Mt[i], Ma[i]) - max(mt[i], ma[i]) + 1",
"min(Mt[i], Ma[i]) - max(mt[i], ma[i])",
"min(Mt[i], Ma[i])",
"min",
"Mt[i]",
"Mt",
"i",
"Ma[i]",
"Ma",
"i",
"max(mt[i], ma[i])",
"max",
"mt[i]",
"mt",
"i",
"ma[i]",
"ma",
"i",
"1",
"if val<=0:\n ans = 0\n break\n ",
"val<=0",
"val",
"0",
"ans = 0",
"ans",
"0",
"break",
"ans *= val",
"ans",
"val",
"ans %= M",
"ans",
"M",
"print(ans)",
"print",
"ans",
"write = lambda x: sys.stdout.write(x+\"\\n\")",
"lambda x: sys.stdout.write(x+\"\\n\")",
"write",
"ans %= M",
"M",
"ans",
"val = min(Mt[i], Ma[i]) - max(mt[i], ma[i]) + 1",
"min(Mt[i], Ma[i]) - max(mt[i], ma[i]) + 1",
"val",
"input = lambda : sys.stdin.readline().rstrip()",
"lambda : sys.stdin.readline().rstrip()",
"input",
"v = h",
"h",
"v",
"ans = 0",
"0",
"ans",
"ma = [1]*n",
"[1]*n",
"ma",
"v = h",
"h",
"v",
"a = list(map(int, input().split()))",
"list(map(int, input().split()))",
"a",
"ans *= val",
"val",
"ans",
"t = list(map(int, input().split()))",
"list(map(int, input().split()))",
"t",
"M = 10**9+7",
"10**9+7",
"M",
"Mt = [None]*n",
"[None]*n",
"Mt",
"v = -1",
"-1",
"v",
"n = int(input())",
"int(input())",
"n",
"v = -1",
"-1",
"v",
"Ma = [None]*n",
"[None]*n",
"Ma",
"ans = 1",
"1",
"ans",
"mt = [1]*n",
"[1]*n",
"mt"
] |
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n = int(input())
t = list(map(int, input().split()))
a = list(map(int, input().split()))
mt = [1]*n
Mt = [None]*n
ma = [1]*n
Ma = [None]*n
v = -1
for i,h in enumerate(t):
if h>v:
mt[i] = Mt[i] = h
else:
Mt[i] = h
v = h
v = -1
for i,h in enumerate(reversed(a)):
if h>v:
ma[n-1-i] = Ma[n-1-i] = h
else:
Ma[n-1-i] = h
v = h
ans = 1
M = 10**9+7
for i in range(n):
val = min(Mt[i], Ma[i]) - max(mt[i], ma[i]) + 1
if val<=0:
ans = 0
break
ans *= val
ans %= M
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
18,
13,
17,
0,
13,
18,
13,
17,
0,
13,
4,
18,
13,
13,
13,
0,
13,
2,
2,
13,
4,
18,
4,
13,
4,
13,
13,
13,
13,
17,
14,
2,
2,
13,
13,
40,
13,
13,
4,
13,
17,
0,
13,
17,
28,
13,
4,
13,
17,
2,
13,
17,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
13,
2,
2,
13,
18,
13,
2,
13,
17,
17,
28,
13,
4,
13,
2,
2,
13,
13,
17,
0,
13,
2,
2,
13,
13,
17,
28,
13,
4,
13,
2,
13,
17,
13,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
13,
2,
2,
13,
18,
13,
2,
13,
17,
17,
4,
13,
13,
10,
2,
13,
10,
4,
13,
10,
4,
13,
10,
2,
13,
10,
4,
13,
10,
18,
13,
10,
17,
13,
10,
18,
13,
10,
4,
13,
10,
2,
13,
10,
2,
13
] |
[
[
179,
2
],
[
161,
8
],
[
167,
20
],
[
176,
32
],
[
162,
34
],
[
170,
37
],
[
168,
39
],
[
158,
42
],
[
162,
45
],
[
177,
47
],
[
155,
49
],
[
180,
52
],
[
168,
59
],
[
171,
61
],
[
159,
66
],
[
156,
67
],
[
177,
69
],
[
171,
70
],
[
173,
75
],
[
79,
78
],
[
159,
83
],
[
162,
88
],
[
78,
89
],
[
162,
91
],
[
78,
93
],
[
185,
96
],
[
174,
99
],
[
186,
99
],
[
162,
101
],
[
78,
103
],
[
108,
107
],
[
156,
112
],
[
159,
113
],
[
164,
116
],
[
186,
119
],
[
174,
119
],
[
165,
119
],
[
177,
120
],
[
124,
123
],
[
156,
127
],
[
180,
129
],
[
168,
133
],
[
123,
134
],
[
168,
136
],
[
123,
138
],
[
182,
141
],
[
165,
144
],
[
186,
144
],
[
174,
144
],
[
183,
144
],
[
168,
146
],
[
123,
148
],
[
183,
153
],
[
165,
153
],
[
186,
153
],
[
174,
153
],
[
155,
156
],
[
158,
159
],
[
161,
162
],
[
164,
165
],
[
167,
168
],
[
170,
171
],
[
173,
174
],
[
176,
177
],
[
179,
180
],
[
182,
183
],
[
185,
186
]
] |
[
"N = int(input())\nT = list(map(int, input().split()))\nA = list(map(int, input().split()))\n\ntmax = T[-1]\namax = A[0]\ntf = T.index(tmax)\naf = N - (list(reversed(A))).index(amax) - 1\n\nif tf > af or tmax != amax:\n\tprint(0)\n\nelse:\n\tans = 1\n\tfor i in range(1, tf + 1):\n\t\tif T[i] == T[i - 1]:\n\t\t\tans = (ans * T[i - 1]) % 1000000007\n\n\tfor i in range(af - tf - 1):\n\t\tans = (ans * tmax) % 1000000007\n\tfor i in range(af + 1, N):\n\t\tif A[i] == A[i - 1]:\n\t\t\tans = (ans * A[i - 1]) % 1000000007\n\n\tprint(ans)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"T = list(map(int, input().split()))",
"T",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"A = list(map(int, input().split()))",
"A",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"tmax = T[-1]",
"tmax",
"T[-1]",
"T",
"-1",
"amax = A[0]",
"amax",
"A[0]",
"A",
"0",
"tf = T.index(tmax)",
"tf",
"T.index(tmax)",
"T.index",
"T",
"index",
"tmax",
"af = N - (list(reversed(A))).index(amax) - 1",
"af",
"N - (list(reversed(A))).index(amax) - 1",
"N - (list(reversed(A))).index(amax)",
"N",
"(list(reversed(A))).index(amax)",
"list(reversed(A))).index",
"list(reversed(A))",
"list",
"reversed(A)",
"reversed",
"A",
"index",
"amax",
"1",
"if tf > af or tmax != amax:\n\tprint(0)\n\nelse:\n\tans = 1\n\tfor i in range(1, tf + 1):\n\t\tif T[i] == T[i - 1]:\n\t\t\tans = (ans * T[i - 1]) % 1000000007\n\n\tfor i in range(af - tf - 1):\n\t\tans = (ans * tmax) % 1000000007\n\tfor i in range(af + 1, N):\n\t\tif A[i] == A[i - 1]:\n\t\t\tans = (ans * A[i - 1]) % 1000000007\n\n\tprint(ans)",
"tf > af or tmax != amax",
"tf > af",
"tf",
"af",
"tmax != amax",
"tmax",
"amax",
"print(0)",
"print",
"0",
"ans = 1",
"ans",
"1",
"for i in range(1, tf + 1):\n\t\tif T[i] == T[i - 1]:\n\t\t\tans = (ans * T[i - 1]) % 1000000007\n\n\t",
"i",
"range(1, tf + 1)",
"range",
"1",
"tf + 1",
"tf",
"1",
"if T[i] == T[i - 1]:\n\t\t\tans = (ans * T[i - 1]) % 1000000007\n\n\t",
"T[i] == T[i - 1]",
"T[i]",
"T",
"i",
"T[i - 1]",
"T",
"i - 1",
"i",
"1",
"ans = (ans * T[i - 1]) % 1000000007",
"ans",
"(ans * T[i - 1]) % 1000000007",
"ans * T[i - 1]",
"ans",
"T[i - 1]",
"T",
"i - 1",
"i",
"1",
"1000000007",
"for i in range(af - tf - 1):\n\t\tans = (ans * tmax) % 1000000007\n\t",
"i",
"range(af - tf - 1)",
"range",
"af - tf - 1",
"af - tf",
"af",
"tf",
"1",
"ans = (ans * tmax) % 1000000007",
"ans",
"(ans * tmax) % 1000000007",
"ans * tmax",
"ans",
"tmax",
"1000000007",
"for i in range(af + 1, N):\n\t\tif A[i] == A[i - 1]:\n\t\t\tans = (ans * A[i - 1]) % 1000000007\n\n\t",
"i",
"range(af + 1, N)",
"range",
"af + 1",
"af",
"1",
"N",
"if A[i] == A[i - 1]:\n\t\t\tans = (ans * A[i - 1]) % 1000000007\n\n\t",
"A[i] == A[i - 1]",
"A[i]",
"A",
"i",
"A[i - 1]",
"A",
"i - 1",
"i",
"1",
"ans = (ans * A[i - 1]) % 1000000007",
"ans",
"(ans * A[i - 1]) % 1000000007",
"ans * A[i - 1]",
"ans",
"A[i - 1]",
"A",
"i - 1",
"i",
"1",
"1000000007",
"print(ans)",
"print",
"ans",
"af = N - (list(reversed(A))).index(amax) - 1",
"N - (list(reversed(A))).index(amax) - 1",
"af",
"tf = T.index(tmax)",
"T.index(tmax)",
"tf",
"T = list(map(int, input().split()))",
"list(map(int, input().split()))",
"T",
"ans = (ans * tmax) % 1000000007",
"(ans * tmax) % 1000000007",
"ans",
"A = list(map(int, input().split()))",
"list(map(int, input().split()))",
"A",
"amax = A[0]",
"A[0]",
"amax",
"ans = 1",
"1",
"ans",
"tmax = T[-1]",
"T[-1]",
"tmax",
"N = int(input())",
"int(input())",
"N",
"ans = (ans * A[i - 1]) % 1000000007",
"(ans * A[i - 1]) % 1000000007",
"ans",
"ans = (ans * T[i - 1]) % 1000000007",
"(ans * T[i - 1]) % 1000000007",
"ans"
] |
N = int(input())
T = list(map(int, input().split()))
A = list(map(int, input().split()))
tmax = T[-1]
amax = A[0]
tf = T.index(tmax)
af = N - (list(reversed(A))).index(amax) - 1
if tf > af or tmax != amax:
print(0)
else:
ans = 1
for i in range(1, tf + 1):
if T[i] == T[i - 1]:
ans = (ans * T[i - 1]) % 1000000007
for i in range(af - tf - 1):
ans = (ans * tmax) % 1000000007
for i in range(af + 1, N):
if A[i] == A[i - 1]:
ans = (ans * A[i - 1]) % 1000000007
print(ans)
|
[
7,
15,
13,
13,
13,
13,
13,
13,
13,
13,
12,
13,
4,
18,
13,
13,
2,
17,
17,
0,
13,
2,
17,
17,
0,
13,
2,
2,
17,
17,
17,
41,
28,
13,
4,
18,
4,
18,
18,
13,
13,
13,
13,
4,
4,
13,
13,
0,
13,
12,
13,
0,
13,
12,
4,
13,
4,
18,
18,
13,
13,
13,
0,
13,
4,
13,
0,
13,
4,
13,
0,
13,
4,
13,
0,
13,
2,
2,
39,
17,
13,
39,
18,
13,
17,
0,
13,
2,
2,
39,
18,
13,
17,
13,
39,
17,
0,
13,
17,
28,
13,
4,
13,
17,
2,
13,
17,
0,
13,
17,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
13,
17,
0,
13,
18,
13,
13,
0,
13,
18,
13,
13,
0,
13,
17,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
13,
17,
0,
13,
18,
13,
13,
0,
13,
18,
13,
13,
0,
13,
17,
14,
2,
2,
40,
13,
13,
2,
13,
13,
2,
40,
13,
13,
2,
13,
13,
0,
13,
4,
13,
13,
13,
0,
13,
17,
0,
13,
2,
2,
13,
13,
13,
4,
13,
13,
14,
2,
13,
17,
4,
13,
10,
12,
13
] |
[
[
21,
20
],
[
26,
25
],
[
34,
33
],
[
33,
46
],
[
49,
48
],
[
53,
52
],
[
64,
63
],
[
52,
65
],
[
68,
67
],
[
48,
69
],
[
72,
71
],
[
48,
73
],
[
76,
75
],
[
67,
80
],
[
67,
83
],
[
87,
86
],
[
71,
91
],
[
71,
93
],
[
98,
97
],
[
101,
100
],
[
63,
105
],
[
109,
108
],
[
75,
113
],
[
67,
113
],
[
100,
114
],
[
75,
116
],
[
67,
116
],
[
100,
118
],
[
122,
121
],
[
125,
124
],
[
75,
126
],
[
67,
126
],
[
100,
127
],
[
130,
129
],
[
75,
131
],
[
67,
131
],
[
100,
132
],
[
135,
134
],
[
86,
139
],
[
71,
139
],
[
100,
140
],
[
86,
142
],
[
71,
142
],
[
100,
144
],
[
148,
147
],
[
151,
150
],
[
86,
152
],
[
71,
152
],
[
100,
153
],
[
156,
155
],
[
86,
157
],
[
71,
157
],
[
100,
158
],
[
161,
160
],
[
134,
166
],
[
124,
166
],
[
160,
167
],
[
150,
167
],
[
134,
169
],
[
124,
169
],
[
129,
170
],
[
121,
170
],
[
160,
173
],
[
150,
173
],
[
134,
174
],
[
124,
174
],
[
160,
176
],
[
150,
176
],
[
155,
177
],
[
147,
177
],
[
180,
179
],
[
129,
182
],
[
121,
182
],
[
155,
183
],
[
147,
183
],
[
186,
185
],
[
189,
188
],
[
97,
191
],
[
188,
191
],
[
185,
192
],
[
179,
192
],
[
25,
193
],
[
188,
196
],
[
97,
196
],
[
205,
202
]
] |
[
"import sys,queue,math,copy,itertools,bisect,collections,heapq\n\ndef main():\n sys.setrecursionlimit(10**7)\n INF = 10**9\n MOD = 10**9 + 7\n LI = lambda : [int(x) for x in sys.stdin.readline().split()]\n NI = lambda : int(sys.stdin.readline())\n\n N = NI()\n T = LI()\n A = LI()\n T = [0] + T + [T[-1]]\n A = [A[0]] + A + [0]\n\n ans = 1\n for i in range(1,N+1):\n m = 0\n if T[i] > T[i-1]:\n tmp1 = 1\n m1 = T[i]\n else:\n tmp1 = T[i]\n m1 = 1\n if A[i] > A[i+1]:\n tmp2 = 1\n m2 = A[i]\n else:\n tmp2 = A[i]\n m2 = 1\n\n if m1 <= m2 < m1 + tmp1 or m2 <= m1 < m2 + tmp2:\n tmp = min(tmp1,tmp2)\n else:\n tmp = 0\n ans = (ans * tmp) % MOD\n print(ans)\n\nif __name__ == '__main__':\n main()",
"import sys,queue,math,copy,itertools,bisect,collections,heapq",
"sys",
"queue",
"math",
"copy",
"itertools",
"bisect",
"collections",
"heapq",
"def main():\n sys.setrecursionlimit(10**7)\n INF = 10**9\n MOD = 10**9 + 7\n LI = lambda : [int(x) for x in sys.stdin.readline().split()]\n NI = lambda : int(sys.stdin.readline())\n\n N = NI()\n T = LI()\n A = LI()\n T = [0] + T + [T[-1]]\n A = [A[0]] + A + [0]\n\n ans = 1\n for i in range(1,N+1):\n m = 0\n if T[i] > T[i-1]:\n tmp1 = 1\n m1 = T[i]\n else:\n tmp1 = T[i]\n m1 = 1\n if A[i] > A[i+1]:\n tmp2 = 1\n m2 = A[i]\n else:\n tmp2 = A[i]\n m2 = 1\n\n if m1 <= m2 < m1 + tmp1 or m2 <= m1 < m2 + tmp2:\n tmp = min(tmp1,tmp2)\n else:\n tmp = 0\n ans = (ans * tmp) % MOD\n print(ans)",
"main",
"sys.setrecursionlimit(10**7)",
"sys.setrecursionlimit",
"sys",
"setrecursionlimit",
"10**7",
"10",
"7",
"INF = 10**9",
"INF",
"10**9",
"10",
"9",
"MOD = 10**9 + 7",
"MOD",
"10**9 + 7",
"10**9",
"10",
"9",
"7",
"int(x) for x in sys.stdin.readline().split()",
"for x in sys.stdin.readline().split()",
"x",
"sys.stdin.readline().split()",
"sys.stdin.readline().split",
"sys.stdin.readline()",
"sys.stdin.readline",
"sys.stdin",
"sys",
"stdin",
"readline",
"split",
"for x in sys.stdin.readline().split()",
"int(x)",
"int",
"x",
"LI = lambda : [int(x) for x in sys.stdin.readline().split()]",
"LI",
"lambda : [int(x) for x in sys.stdin.readline().split()]",
"[int(x) for x in sys.stdin.readline().split()]",
"NI = lambda : int(sys.stdin.readline())",
"NI",
"lambda : int(sys.stdin.readline())",
"int(sys.stdin.readline())",
"int",
"sys.stdin.readline()",
"sys.stdin.readline",
"sys.stdin",
"sys",
"stdin",
"readline",
"N = NI()",
"N",
"NI()",
"NI",
"T = LI()",
"T",
"LI()",
"LI",
"A = LI()",
"A",
"LI()",
"LI",
"T = [0] + T + [T[-1]]",
"T",
"[0] + T + [T[-1]]",
"[0] + T",
"[0]",
"0",
"T",
"[T[-1]]",
"T[-1]",
"T",
"-1",
"A = [A[0]] + A + [0]",
"A",
"[A[0]] + A + [0]",
"[A[0]] + A",
"[A[0]]",
"A[0]",
"A",
"0",
"A",
"[0]",
"0",
"ans = 1",
"ans",
"1",
"for i in range(1,N+1):\n m = 0\n if T[i] > T[i-1]:\n tmp1 = 1\n m1 = T[i]\n else:\n tmp1 = T[i]\n m1 = 1\n if A[i] > A[i+1]:\n tmp2 = 1\n m2 = A[i]\n else:\n tmp2 = A[i]\n m2 = 1\n\n if m1 <= m2 < m1 + tmp1 or m2 <= m1 < m2 + tmp2:\n tmp = min(tmp1,tmp2)\n else:\n tmp = 0\n ans = (ans * tmp) % MOD\n ",
"i",
"range(1,N+1)",
"range",
"1",
"N+1",
"N",
"1",
"m = 0",
"m",
"0",
"if T[i] > T[i-1]:\n tmp1 = 1\n m1 = T[i]\n else:\n tmp1 = T[i]\n m1 = 1\n ",
"T[i] > T[i-1]",
"T[i]",
"T",
"i",
"T[i-1]",
"T",
"i-1",
"i",
"1",
"tmp1 = 1",
"tmp1",
"1",
"m1 = T[i]",
"m1",
"T[i]",
"T",
"i",
"tmp1 = T[i]",
"tmp1",
"T[i]",
"T",
"i",
"m1 = 1",
"m1",
"1",
"if A[i] > A[i+1]:\n tmp2 = 1\n m2 = A[i]\n else:\n tmp2 = A[i]\n m2 = 1\n\n ",
"A[i] > A[i+1]",
"A[i]",
"A",
"i",
"A[i+1]",
"A",
"i+1",
"i",
"1",
"tmp2 = 1",
"tmp2",
"1",
"m2 = A[i]",
"m2",
"A[i]",
"A",
"i",
"tmp2 = A[i]",
"tmp2",
"A[i]",
"A",
"i",
"m2 = 1",
"m2",
"1",
"if m1 <= m2 < m1 + tmp1 or m2 <= m1 < m2 + tmp2:\n tmp = min(tmp1,tmp2)\n else:\n tmp = 0\n ",
"m1 <= m2 < m1 + tmp1 or m2 <= m1 < m2 + tmp2",
"m1 <= m2 < m1 + tmp1",
"m1 <= m2",
"m1",
"m2",
"m1 + tmp1",
"m1",
"tmp1",
"m2 <= m1 < m2 + tmp2",
"m2 <= m1",
"m2",
"m1",
"m2 + tmp2",
"m2",
"tmp2",
"tmp = min(tmp1,tmp2)",
"tmp",
"min(tmp1,tmp2)",
"min",
"tmp1",
"tmp2",
"tmp = 0",
"tmp",
"0",
"ans = (ans * tmp) % MOD",
"ans",
"(ans * tmp) % MOD",
"ans * tmp",
"ans",
"tmp",
"MOD",
"print(ans)",
"print",
"ans",
"if __name__ == '__main__':\n main()",
"__name__ == '__main__'",
"__name__",
"'__main__'",
"main()",
"main",
"def main():\n sys.setrecursionlimit(10**7)\n INF = 10**9\n MOD = 10**9 + 7\n LI = lambda : [int(x) for x in sys.stdin.readline().split()]\n NI = lambda : int(sys.stdin.readline())\n\n N = NI()\n T = LI()\n A = LI()\n T = [0] + T + [T[-1]]\n A = [A[0]] + A + [0]\n\n ans = 1\n for i in range(1,N+1):\n m = 0\n if T[i] > T[i-1]:\n tmp1 = 1\n m1 = T[i]\n else:\n tmp1 = T[i]\n m1 = 1\n if A[i] > A[i+1]:\n tmp2 = 1\n m2 = A[i]\n else:\n tmp2 = A[i]\n m2 = 1\n\n if m1 <= m2 < m1 + tmp1 or m2 <= m1 < m2 + tmp2:\n tmp = min(tmp1,tmp2)\n else:\n tmp = 0\n ans = (ans * tmp) % MOD\n print(ans)",
"def main():\n sys.setrecursionlimit(10**7)\n INF = 10**9\n MOD = 10**9 + 7\n LI = lambda : [int(x) for x in sys.stdin.readline().split()]\n NI = lambda : int(sys.stdin.readline())\n\n N = NI()\n T = LI()\n A = LI()\n T = [0] + T + [T[-1]]\n A = [A[0]] + A + [0]\n\n ans = 1\n for i in range(1,N+1):\n m = 0\n if T[i] > T[i-1]:\n tmp1 = 1\n m1 = T[i]\n else:\n tmp1 = T[i]\n m1 = 1\n if A[i] > A[i+1]:\n tmp2 = 1\n m2 = A[i]\n else:\n tmp2 = A[i]\n m2 = 1\n\n if m1 <= m2 < m1 + tmp1 or m2 <= m1 < m2 + tmp2:\n tmp = min(tmp1,tmp2)\n else:\n tmp = 0\n ans = (ans * tmp) % MOD\n print(ans)",
"main"
] |
import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
sys.setrecursionlimit(10**7)
INF = 10**9
MOD = 10**9 + 7
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
N = NI()
T = LI()
A = LI()
T = [0] + T + [T[-1]]
A = [A[0]] + A + [0]
ans = 1
for i in range(1,N+1):
m = 0
if T[i] > T[i-1]:
tmp1 = 1
m1 = T[i]
else:
tmp1 = T[i]
m1 = 1
if A[i] > A[i+1]:
tmp2 = 1
m2 = A[i]
else:
tmp2 = A[i]
m2 = 1
if m1 <= m2 < m1 + tmp1 or m2 <= m1 < m2 + tmp2:
tmp = min(tmp1,tmp2)
else:
tmp = 0
ans = (ans * tmp) % MOD
print(ans)
if __name__ == '__main__':
main()
|
[
7,
15,
13,
15,
13,
15,
13,
15,
13,
4,
18,
13,
13,
17,
0,
13,
4,
13,
17,
12,
13,
29,
4,
13,
4,
13,
12,
13,
29,
4,
13,
13,
4,
18,
4,
13,
13,
17,
12,
13,
29,
4,
13,
12,
13,
29,
4,
18,
4,
13,
13,
17,
12,
13,
29,
4,
13,
4,
13,
12,
13,
29,
4,
18,
17,
13,
13,
23,
13,
12,
13,
0,
13,
17,
12,
13,
14,
40,
13,
13,
0,
18,
13,
13,
4,
13,
31,
13,
29,
18,
13,
13,
23,
29,
13,
23,
13,
0,
13,
4,
13,
39,
17,
17,
17,
17,
39,
17,
17,
17,
17,
0,
13,
17,
0,
13,
4,
13,
0,
13,
4,
13,
0,
13,
4,
13,
0,
13,
2,
39,
17,
13,
0,
13,
2,
39,
13,
13,
0,
13,
2,
39,
17,
13,
12,
13,
14,
2,
18,
13,
13,
39,
17,
13,
0,
18,
13,
13,
13,
13,
4,
18,
13,
13,
23,
13,
23,
13,
4,
13,
17,
18,
13,
17,
4,
13,
2,
13,
17,
18,
13,
2,
13,
17,
28,
13,
4,
13,
17,
13,
14,
40,
18,
13,
13,
18,
13,
2,
13,
17,
4,
13,
13,
18,
13,
13,
0,
18,
13,
13,
18,
13,
13,
28,
13,
4,
13,
4,
13,
17,
2,
13,
17,
14,
40,
18,
13,
13,
18,
13,
2,
13,
17,
4,
13,
13,
18,
13,
13,
0,
18,
13,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
13,
17,
28,
13,
4,
13,
17,
13,
14,
2,
18,
13,
13,
17,
0,
13,
2,
2,
13,
18,
13,
13,
13,
14,
40,
18,
13,
13,
18,
13,
13,
0,
13,
13,
13,
4,
18,
13,
13,
13,
10,
4,
13,
10,
2,
13,
10,
12,
13,
10,
2,
13,
10,
12,
13,
10,
13,
13,
10,
4,
13,
10,
4,
13,
10,
2,
13,
10,
2,
13,
10,
12,
13,
10,
4,
13,
10,
12,
13,
10,
4,
13,
10,
17,
13,
10,
12,
13,
10,
12,
13,
10,
12,
13,
10,
17,
13,
10,
12,
13
] |
[
[
293,
15
],
[
68,
66
],
[
68,
68
],
[
73,
72
],
[
72,
79
],
[
84,
81
],
[
72,
82
],
[
96,
85
],
[
81,
89
],
[
72,
90
],
[
75,
94
],
[
96,
96
],
[
311,
98
],
[
335,
112
],
[
314,
115
],
[
300,
117
],
[
332,
119
],
[
351,
121
],
[
326,
123
],
[
351,
125
],
[
320,
127
],
[
315,
131
],
[
302,
133
],
[
315,
137
],
[
296,
139
],
[
315,
143
],
[
321,
149
],
[
165,
150
],
[
158,
155
],
[
321,
156
],
[
165,
157
],
[
167,
158
],
[
165,
165
],
[
167,
167
],
[
342,
169
],
[
333,
172
],
[
342,
175
],
[
315,
177
],
[
327,
180
],
[
315,
182
],
[
186,
185
],
[
315,
189
],
[
333,
193
],
[
185,
194
],
[
333,
196
],
[
185,
198
],
[
342,
201
],
[
185,
202
],
[
333,
204
],
[
185,
205
],
[
210,
207
],
[
303,
208
],
[
185,
209
],
[
333,
211
],
[
185,
212
],
[
215,
214
],
[
315,
221
],
[
327,
226
],
[
214,
227
],
[
327,
229
],
[
214,
231
],
[
342,
234
],
[
214,
235
],
[
327,
237
],
[
214,
238
],
[
243,
240
],
[
303,
241
],
[
214,
242
],
[
207,
245
],
[
240,
245
],
[
303,
246
],
[
214,
247
],
[
327,
249
],
[
214,
250
],
[
347,
252
],
[
256,
255
],
[
315,
259
],
[
321,
263
],
[
255,
264
],
[
317,
267
],
[
348,
270
],
[
309,
270
],
[
318,
270
],
[
240,
271
],
[
207,
271
],
[
303,
272
],
[
255,
273
],
[
336,
274
],
[
321,
278
],
[
255,
279
],
[
240,
280
],
[
207,
280
],
[
303,
281
],
[
255,
282
],
[
308,
284
],
[
309,
285
],
[
348,
285
],
[
318,
285
],
[
293,
294
],
[
296,
297
],
[
302,
303
],
[
309,
308
],
[
348,
308
],
[
318,
308
],
[
308,
309
],
[
311,
312
],
[
314,
315
],
[
317,
318
],
[
320,
321
],
[
326,
327
],
[
332,
333
],
[
335,
336
],
[
347,
348
]
] |
[
"import bisect\nimport sys\nimport math\nimport itertools\nsys.setrecursionlimit(10000)\n\nINF = float('inf')\n\n# input macro\ndef i():\n return int(raw_input())\ndef ii():\n return map(int,raw_input().split(\" \"))\ndef s():\n return raw_input()\ndef ss():\n return raw_input().split(\" \")\ndef slist():\n return list(raw_input())\ndef join(s):\n return ''.join(s)\n\n#memoize macro\ndef memoize(f):\n cache = {}\n def helper(*args):\n if args not in cache:\n cache[(args)] = f(*args)\n return cache[args]\n return helper\n\nnh=zip([1,0,-1,0],[0,1,0,-1])\nmod=1000000007\n\n###########\nn=i()\nt=ii()\na=ii()\njust=[0]*n\nub=[INF]*n\nlb=[0]*n\n\ndef justa(x,y):\n if just[x] in [0,y]:\n just[x]=y\n else:\n print '0'\n sys.exit()\n\njusta(0,t[0])\njusta(n-1,a[n-1])\n\nfor j in range(1,n):\n if t[j]!=t[j-1]:\n justa(j,t[j])\n else:\n ub[j]=t[j]\nfor j in reversed(range(0,n-1)):\n if a[j]!=a[j+1]:\n justa(j,a[j])\n else:\n ub[j]=min(ub[j],a[j])\n\nans=1\nfor j in range(1,n):\n if just[j]==0:\n ans=ans*ub[j]%mod\n elif just[j]<=ub[j]:\n ans=ans\n else:\n print '0'\n sys.exit()\n\nprint ans\n ",
"import bisect",
"bisect",
"import sys",
"sys",
"import math",
"math",
"import itertools",
"itertools",
"sys.setrecursionlimit(10000)",
"sys.setrecursionlimit",
"sys",
"setrecursionlimit",
"10000",
"INF = float('inf')",
"INF",
"float('inf')",
"float",
"'inf'",
"def i():\n return int(raw_input())",
"i",
"return int(raw_input())",
"int(raw_input())",
"int",
"raw_input()",
"raw_input",
"def ii():\n return map(int,raw_input().split(\" \"))",
"ii",
"return map(int,raw_input().split(\" \"))",
"map(int,raw_input().split(\" \"))",
"map",
"int",
"raw_input().split(\" \")",
"().split",
"()",
"raw_input",
"split",
"\" \"",
"def s():\n return raw_input()",
"s",
"return raw_input()",
"raw_input()",
"raw_input",
"def ss():\n return raw_input().split(\" \")",
"ss",
"return raw_input().split(\" \")",
"raw_input().split(\" \")",
"().split",
"()",
"raw_input",
"split",
"\" \"",
"def slist():\n return list(raw_input())",
"slist",
"return list(raw_input())",
"list(raw_input())",
"list",
"raw_input()",
"raw_input",
"def join(s):\n return ''.join(s)\n\n#memoize macro",
"join",
"return ''.join(s)",
"''.join(s)",
"''.join",
"''",
"join",
"s",
"s",
"s",
"def memoize(f):\n cache = {}\n def helper(*args):\n if args not in cache:\n cache[(args)] = f(*args)\n return cache[args]\n return helper",
"memoize",
"cache = {}",
"cache",
"{}",
"def helper(*args):\n if args not in cache:\n cache[(args)] = f(*args)\n return cache[args]\n ",
"helper",
"if args not in cache:\n cache[(args)] = f(*args)\n ",
"args not in cache",
"args",
"cache",
"cache[(args)] = f(*args)",
"cache[(args)]",
"cache",
"args",
"f(*args)",
"f",
"*args",
"args",
"return cache[args]",
"cache[args]",
"cache",
"args",
"*args",
"return helper",
"helper",
"f",
"f",
"nh=zip([1,0,-1,0],[0,1,0,-1])",
"nh",
"zip([1,0,-1,0],[0,1,0,-1])",
"zip",
"[1,0,-1,0]",
"1",
"0",
"-1",
"0",
"[0,1,0,-1]",
"0",
"1",
"0",
"-1",
"mod=1000000007",
"mod",
"1000000007",
"n=i()",
"n",
"i()",
"i",
"t=ii()",
"t",
"ii()",
"ii",
"a=ii()",
"a",
"ii()",
"ii",
"just=[0]*n",
"just",
"[0]*n",
"[0]",
"0",
"n",
"ub=[INF]*n",
"ub",
"[INF]*n",
"[INF]",
"INF",
"n",
"lb=[0]*n",
"lb",
"[0]*n",
"[0]",
"0",
"n",
"def justa(x,y):\n if just[x] in [0,y]:\n just[x]=y\n else:\n print '0'\n sys.exit()",
"justa",
"if just[x] in [0,y]:\n just[x]=y\n else:\n print '0'\n sys.exit()",
"just[x] in [0,y]",
"just[x]",
"just",
"x",
"[0,y]",
"0",
"y",
"just[x]=y",
"just[x]",
"just",
"x",
"y",
"print",
"sys.exit()",
"sys.exit",
"sys",
"exit",
"x",
"x",
"y",
"y",
"justa(0,t[0])",
"justa",
"0",
"t[0]",
"t",
"0",
"justa(n-1,a[n-1])",
"justa",
"n-1",
"n",
"1",
"a[n-1]",
"a",
"n-1",
"n",
"1",
"for j in range(1,n):\n if t[j]!=t[j-1]:\n justa(j,t[j])\n else:\n ub[j]=t[j]",
"j",
"range(1,n)",
"range",
"1",
"n",
"if t[j]!=t[j-1]:\n justa(j,t[j])\n else:\n ub[j]=t[j]",
"t[j]!=t[j-1]",
"t[j]",
"t",
"j",
"t[j-1]",
"t",
"j-1",
"j",
"1",
"justa(j,t[j])",
"justa",
"j",
"t[j]",
"t",
"j",
"ub[j]=t[j]",
"ub[j]",
"ub",
"j",
"t[j]",
"t",
"j",
"for j in reversed(range(0,n-1)):\n if a[j]!=a[j+1]:\n justa(j,a[j])\n else:\n ub[j]=min(ub[j],a[j])",
"j",
"reversed(range(0,n-1))",
"reversed",
"range(0,n-1)",
"range",
"0",
"n-1",
"n",
"1",
"if a[j]!=a[j+1]:\n justa(j,a[j])\n else:\n ub[j]=min(ub[j],a[j])",
"a[j]!=a[j+1]",
"a[j]",
"a",
"j",
"a[j+1]",
"a",
"j+1",
"j",
"1",
"justa(j,a[j])",
"justa",
"j",
"a[j]",
"a",
"j",
"ub[j]=min(ub[j],a[j])",
"ub[j]",
"ub",
"j",
"min(ub[j],a[j])",
"min",
"ub[j]",
"ub",
"j",
"a[j]",
"a",
"j",
"ans=1",
"ans",
"1",
"for j in range(1,n):\n if just[j]==0:\n ans=ans*ub[j]%mod\n elif just[j]<=ub[j]:\n ans=ans\n else:\n print '0'\n sys.exit()",
"j",
"range(1,n)",
"range",
"1",
"n",
"if just[j]==0:\n ans=ans*ub[j]%mod\n elif just[j]<=ub[j]:\n ans=ans\n else:\n print '0'\n sys.exit()",
"just[j]==0",
"just[j]",
"just",
"j",
"0",
"ans=ans*ub[j]%mod",
"ans",
"ans*ub[j]%mod",
"ans*ub[j]",
"ans",
"ub[j]",
"ub",
"j",
"mod",
"elif just[j]<=ub[j]:\n ans=ans\n ",
"just[j]<=ub[j]",
"just[j]",
"just",
"j",
"ub[j]",
"ub",
"j",
"ans=ans",
"ans",
"ans",
"print",
"sys.exit()",
"sys.exit",
"sys",
"exit",
"print",
"INF = float('inf')",
"float('inf')",
"INF",
"lb=[0]*n",
"[0]*n",
"lb",
"def i():\n return int(raw_input())",
"def i():\n return int(raw_input())",
"i",
"ub=[INF]*n",
"[INF]*n",
"ub",
"def join(s):\n return ''.join(s)\n\n#memoize macro",
"def join(s):\n return ''.join(s)\n\n#memoize macro",
"join",
"ans=ans",
"ans",
"ans",
"nh=zip([1,0,-1,0],[0,1,0,-1])",
"zip([1,0,-1,0],[0,1,0,-1])",
"nh",
"n=i()",
"i()",
"n",
"ans=ans*ub[j]%mod",
"ans*ub[j]%mod",
"ans",
"just=[0]*n",
"[0]*n",
"just",
"def ss():\n return raw_input().split(\" \")",
"def ss():\n return raw_input().split(\" \")",
"ss",
"a=ii()",
"ii()",
"a",
"def slist():\n return list(raw_input())",
"def slist():\n return list(raw_input())",
"slist",
"t=ii()",
"ii()",
"t",
"mod=1000000007",
"1000000007",
"mod",
"def memoize(f):\n cache = {}\n def helper(*args):\n if args not in cache:\n cache[(args)] = f(*args)\n return cache[args]\n return helper",
"def memoize(f):\n cache = {}\n def helper(*args):\n if args not in cache:\n cache[(args)] = f(*args)\n return cache[args]\n return helper",
"memoize",
"def justa(x,y):\n if just[x] in [0,y]:\n just[x]=y\n else:\n print '0'\n sys.exit()",
"def justa(x,y):\n if just[x] in [0,y]:\n just[x]=y\n else:\n print '0'\n sys.exit()",
"justa",
"def s():\n return raw_input()",
"def s():\n return raw_input()",
"s",
"ans=1",
"1",
"ans",
"def ii():\n return map(int,raw_input().split(\" \"))",
"def ii():\n return map(int,raw_input().split(\" \"))",
"ii"
] |
import bisect
import sys
import math
import itertools
sys.setrecursionlimit(10000)
INF = float('inf')
# input macro
def i():
return int(raw_input())
def ii():
return map(int,raw_input().split(" "))
def s():
return raw_input()
def ss():
return raw_input().split(" ")
def slist():
return list(raw_input())
def join(s):
return ''.join(s)
#memoize macro
def memoize(f):
cache = {}
def helper(*args):
if args not in cache:
cache[(args)] = f(*args)
return cache[args]
return helper
nh=zip([1,0,-1,0],[0,1,0,-1])
mod=1000000007
###########
n=i()
t=ii()
a=ii()
just=[0]*n
ub=[INF]*n
lb=[0]*n
def justa(x,y):
if just[x] in [0,y]:
just[x]=y
else:
print '0'
sys.exit()
justa(0,t[0])
justa(n-1,a[n-1])
for j in range(1,n):
if t[j]!=t[j-1]:
justa(j,t[j])
else:
ub[j]=t[j]
for j in reversed(range(0,n-1)):
if a[j]!=a[j+1]:
justa(j,a[j])
else:
ub[j]=min(ub[j],a[j])
ans=1
for j in range(1,n):
if just[j]==0:
ans=ans*ub[j]%mod
elif just[j]<=ub[j]:
ans=ans
else:
print '0'
sys.exit()
print ans
|
[
7,
15,
13,
0,
13,
39,
17,
17,
17,
0,
13,
17,
0,
13,
18,
13,
13,
0,
13,
12,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
17,
12,
13,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
0,
13,
39,
28,
13,
4,
13,
13,
4,
18,
13,
13,
39,
17,
17,
0,
13,
17,
28,
13,
13,
4,
13,
13,
14,
2,
13,
13,
0,
18,
13,
13,
39,
13,
13,
0,
13,
13,
0,
18,
13,
13,
39,
17,
13,
0,
13,
17,
28,
13,
13,
4,
13,
18,
13,
39,
17,
0,
13,
2,
2,
13,
13,
17,
14,
2,
13,
13,
14,
2,
40,
18,
18,
13,
13,
17,
13,
40,
13,
18,
18,
13,
13,
17,
0,
18,
13,
13,
39,
13,
13,
0,
13,
13,
29,
17,
14,
2,
40,
18,
18,
13,
13,
17,
13,
40,
13,
18,
18,
13,
13,
17,
0,
18,
18,
13,
13,
17,
13,
14,
2,
13,
18,
18,
13,
13,
17,
29,
17,
0,
13,
17,
28,
13,
13,
13,
0,
13,
2,
2,
13,
13,
17,
0,
13,
13,
4,
13,
13,
0,
13,
17,
12,
13,
14,
13,
4,
13,
13,
23,
13,
12,
13,
15,
13,
0,
13,
4,
18,
13,
13,
0,
13,
4,
18,
13,
13,
28,
13,
13,
27,
13,
14,
2,
13,
17,
14,
2,
18,
13,
13,
17,
14,
2,
13,
18,
13,
17,
0,
13,
4,
13,
0,
13,
12,
4,
18,
13,
13,
14,
2,
13,
18,
13,
17,
0,
18,
13,
13,
4,
13,
17,
0,
13,
17,
0,
13,
4,
13,
14,
40,
13,
17,
4,
13,
13,
10,
17,
13,
10,
12,
13,
10,
17,
13,
10,
18,
13,
10,
12,
13,
10,
17,
13,
10,
12,
13,
10,
12,
13,
10,
4,
13,
10,
39,
13,
10,
12,
13,
10,
17,
13,
10,
4,
13
] |
[
[
315,
4
],
[
303,
10
],
[
297,
13
],
[
316,
15
],
[
304,
16
],
[
306,
18
],
[
294,
29
],
[
35,
34
],
[
41,
40
],
[
307,
44
],
[
47,
46
],
[
307,
50
],
[
53,
52
],
[
56,
55
],
[
34,
58
],
[
52,
61
],
[
68,
67
],
[
40,
74
],
[
67,
77
],
[
87,
77
],
[
83,
80
],
[
52,
81
],
[
88,
87
],
[
93,
90
],
[
52,
91
],
[
98,
97
],
[
46,
105
],
[
110,
109
],
[
34,
112
],
[
97,
117
],
[
143,
117
],
[
136,
123
],
[
52,
124
],
[
109,
125
],
[
136,
131
],
[
52,
132
],
[
109,
133
],
[
139,
136
],
[
52,
137
],
[
109,
138
],
[
144,
143
],
[
136,
151
],
[
52,
152
],
[
109,
153
],
[
136,
159
],
[
52,
160
],
[
109,
161
],
[
169,
164
],
[
136,
165
],
[
52,
166
],
[
109,
167
],
[
136,
174
],
[
52,
175
],
[
109,
176
],
[
182,
181
],
[
189,
188
],
[
196,
195
],
[
295,
196
],
[
195,
199
],
[
188,
199
],
[
181,
199
],
[
288,
201
],
[
211,
209
],
[
211,
211
],
[
218,
217
],
[
224,
223
],
[
217,
226
],
[
230,
229
],
[
223,
229
],
[
229,
232
],
[
298,
245
],
[
316,
247
],
[
312,
250
],
[
310,
252
],
[
318,
254
],
[
313,
258
],
[
298,
262
],
[
316,
264
],
[
270,
267
],
[
321,
274
],
[
324,
277
],
[
301,
279
],
[
325,
282
],
[
325,
286
],
[
288,
289
],
[
294,
295
],
[
297,
298
],
[
303,
304
],
[
306,
307
],
[
312,
313
],
[
315,
316
],
[
318,
319
],
[
321,
322
],
[
324,
325
]
] |
[
"import sys\n\ninput_methods=['clipboard','file','key']\nusing_method=0\ninput_method=input_methods[using_method]\n\nIN=lambda : map(int, input().split())\nmod=1000000007\n\n#+++++\n\ndef main():\n\tn = int(input())\n\tal = list(IN())\n\tbl=list(IN())\n\tmm=[]\n\tfor i in range(n):\n\t\tmm.append([0,0])\n\tim=0\n\tfor i, h in enumerate(al):\n\t\tif im < h:\n\t\t\tmm[i] = [h,h]\n\t\t\tim=h\n\t\telse:\n\t\t\tmm[i] = [1,h]\n\tjm=0\n\tfor i, h in enumerate(bl[::-1]):\n\t\tj=n-i-1\n\t\tif jm < h:\n\t\t\tif mm[j][0]<= h and h <= mm[j][1]:\n\t\t\t\tmm[j] = [h,h]\n\t\t\t\tjm=h\n\t\t\telse:\n\t\t\t\treturn 0\n\t\telse:\n\t\t\tif mm[j][0]<= h and h <= mm[j][1]:\n\t\t\t\tmm[j][1]=h\n\t\t\telif h < mm[j][0]:\n\t\t\t\treturn 0\n\t\t\telse:\n\t\t\t\tpass\n\tr=1\n\tfor a,b in mm:\n\t\tr *= (b-a+1)\n\t\tr %= mod\n\tprint(r)\n\t\t\n\t\n\t\n\t\n#+++++\nisTest=False\n\ndef pa(v):\n\tif isTest:\n\t\tprint(v)\n\t\t\ndef input_clipboard():\n\timport clipboard\n\tinput_text=clipboard.get()\n\tinput_l=input_text.splitlines()\n\tfor l in input_l:\n\t\tyield l\n\nif __name__ == \"__main__\":\n\tif sys.platform =='ios':\n\t\tif input_method==input_methods[0]:\n\t\t\tic=input_clipboard()\n\t\t\tinput = lambda : ic.__next__()\n\t\telif input_method==input_methods[1]:\n\t\t\tsys.stdin=open('inputFile.txt')\n\t\telse:\n\t\t\tpass\n\t\tisTest=True\n\telse:\n\t\tpass\n\t\t#input = sys.stdin.readline\n\t\t\t\n\tret = main()\n\tif ret is not None:\n\t\tprint(ret)",
"import sys",
"sys",
"input_methods=['clipboard','file','key']",
"input_methods",
"['clipboard','file','key']",
"'clipboard'",
"'file'",
"'key'",
"using_method=0",
"using_method",
"0",
"input_method=input_methods[using_method]",
"input_method",
"input_methods[using_method]",
"input_methods",
"using_method",
"IN=lambda : map(int, input().split())",
"IN",
"lambda : map(int, input().split())",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"mod=1000000007",
"mod",
"1000000007",
"def main():\n\tn = int(input())\n\tal = list(IN())\n\tbl=list(IN())\n\tmm=[]\n\tfor i in range(n):\n\t\tmm.append([0,0])\n\tim=0\n\tfor i, h in enumerate(al):\n\t\tif im < h:\n\t\t\tmm[i] = [h,h]\n\t\t\tim=h\n\t\telse:\n\t\t\tmm[i] = [1,h]\n\tjm=0\n\tfor i, h in enumerate(bl[::-1]):\n\t\tj=n-i-1\n\t\tif jm < h:\n\t\t\tif mm[j][0]<= h and h <= mm[j][1]:\n\t\t\t\tmm[j] = [h,h]\n\t\t\t\tjm=h\n\t\t\telse:\n\t\t\t\treturn 0\n\t\telse:\n\t\t\tif mm[j][0]<= h and h <= mm[j][1]:\n\t\t\t\tmm[j][1]=h\n\t\t\telif h < mm[j][0]:\n\t\t\t\treturn 0\n\t\t\telse:\n\t\t\t\tpass\n\tr=1\n\tfor a,b in mm:\n\t\tr *= (b-a+1)\n\t\tr %= mod\n\tprint(r)\n\t\t\n\t\n\t\n\t\n#+++++",
"main",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"al = list(IN())",
"al",
"list(IN())",
"list",
"IN()",
"IN",
"bl=list(IN())",
"bl",
"list(IN())",
"list",
"IN()",
"IN",
"mm=[]",
"mm",
"[]",
"for i in range(n):\n\t\tmm.append([0,0])\n\t",
"i",
"range(n)",
"range",
"n",
"mm.append([0,0])",
"mm.append",
"mm",
"append",
"[0,0]",
"0",
"0",
"im=0",
"im",
"0",
"for i, h in enumerate(al):\n\t\tif im < h:\n\t\t\tmm[i] = [h,h]\n\t\t\tim=h\n\t\telse:\n\t\t\tmm[i] = [1,h]\n\t",
"i",
"h",
"enumerate(al)",
"enumerate",
"al",
"if im < h:\n\t\t\tmm[i] = [h,h]\n\t\t\tim=h\n\t\telse:\n\t\t\tmm[i] = [1,h]\n\t",
"im < h",
"im",
"h",
"mm[i] = [h,h]",
"mm[i]",
"mm",
"i",
"[h,h]",
"h",
"h",
"im=h",
"im",
"h",
"mm[i] = [1,h]",
"mm[i]",
"mm",
"i",
"[1,h]",
"1",
"h",
"jm=0",
"jm",
"0",
"for i, h in enumerate(bl[::-1]):\n\t\tj=n-i-1\n\t\tif jm < h:\n\t\t\tif mm[j][0]<= h and h <= mm[j][1]:\n\t\t\t\tmm[j] = [h,h]\n\t\t\t\tjm=h\n\t\t\telse:\n\t\t\t\treturn 0\n\t\telse:\n\t\t\tif mm[j][0]<= h and h <= mm[j][1]:\n\t\t\t\tmm[j][1]=h\n\t\t\telif h < mm[j][0]:\n\t\t\t\treturn 0\n\t\t\telse:\n\t\t\t\tpass\n\t",
"i",
"h",
"enumerate(bl[::-1])",
"enumerate",
"bl[::-1]",
"bl",
"::-1",
"-1",
"j=n-i-1",
"j",
"n-i-1",
"n-i",
"n",
"i",
"1",
"if jm < h:\n\t\t\tif mm[j][0]<= h and h <= mm[j][1]:\n\t\t\t\tmm[j] = [h,h]\n\t\t\t\tjm=h\n\t\t\telse:\n\t\t\t\treturn 0\n\t\telse:\n\t\t\tif mm[j][0]<= h and h <= mm[j][1]:\n\t\t\t\tmm[j][1]=h\n\t\t\telif h < mm[j][0]:\n\t\t\t\treturn 0\n\t\t\telse:\n\t\t\t\tpass\n\t",
"jm < h",
"jm",
"h",
"if mm[j][0]<= h and h <= mm[j][1]:\n\t\t\t\tmm[j] = [h,h]\n\t\t\t\tjm=h\n\t\t\telse:\n\t\t\t\treturn 0\n\t\t",
"mm[j][0]<= h and h <= mm[j][1]",
"mm[j][0]<= h",
"mm[j][0]",
"[j]",
"mm",
"j",
"0",
"h",
"h <= mm[j][1]",
"h",
"mm[j][1]",
"[j]",
"mm",
"j",
"1",
"mm[j] = [h,h]",
"mm[j]",
"mm",
"j",
"[h,h]",
"h",
"h",
"jm=h",
"jm",
"h",
"return 0",
"0",
"if mm[j][0]<= h and h <= mm[j][1]:\n\t\t\t\tmm[j][1]=h\n\t\t\telif h < mm[j][0]:\n\t\t\t\treturn 0\n\t\t\telse:\n\t\t\t\tpass\n\t",
"mm[j][0]<= h and h <= mm[j][1]",
"mm[j][0]<= h",
"mm[j][0]",
"[j]",
"mm",
"j",
"0",
"h",
"h <= mm[j][1]",
"h",
"mm[j][1]",
"[j]",
"mm",
"j",
"1",
"mm[j][1]=h",
"mm[j][1]",
"[j]",
"mm",
"j",
"1",
"h",
"elif h < mm[j][0]:\n\t\t\t\treturn 0\n\t\t\t",
"h < mm[j][0]",
"h",
"mm[j][0]",
"[j]",
"mm",
"j",
"0",
"return 0",
"0",
"r=1",
"r",
"1",
"for a,b in mm:\n\t\tr *= (b-a+1)\n\t\tr %= mod\n\t",
"a",
"b",
"mm",
"r *= (b-a+1)",
"r",
"b-a+1",
"b-a",
"b",
"a",
"1",
"r %= mod",
"r",
"mod",
"print(r)",
"print",
"r",
"isTest=False",
"isTest",
"False",
"def pa(v):\n\tif isTest:\n\t\tprint(v)\n\t\t",
"pa",
"if isTest:\n\t\tprint(v)\n\t\t",
"isTest",
"print(v)",
"print",
"v",
"v",
"v",
"def input_clipboard():\n\timport clipboard\n\tinput_text=clipboard.get()\n\tinput_l=input_text.splitlines()\n\tfor l in input_l:\n\t\tyield l",
"input_clipboard",
"import clipboard",
"clipboard",
"input_text=clipboard.get()",
"input_text",
"clipboard.get()",
"clipboard.get",
"clipboard",
"get",
"input_l=input_text.splitlines()",
"input_l",
"input_text.splitlines()",
"input_text.splitlines",
"input_text",
"splitlines",
"for l in input_l:\n\t\tyield l",
"l",
"input_l",
"yield l",
"l",
"if __name__ == \"__main__\":\n\tif sys.platform =='ios':\n\t\tif input_method==input_methods[0]:\n\t\t\tic=input_clipboard()\n\t\t\tinput = lambda : ic.__next__()\n\t\telif input_method==input_methods[1]:\n\t\t\tsys.stdin=open('inputFile.txt')\n\t\telse:\n\t\t\tpass\n\t\tisTest=True\n\telse:\n\t\tpass\n\t\t#input = sys.stdin.readline\n\t\t\t\n\tret = main()\n\tif ret is not None:\n\t\tprint(ret)",
"__name__ == \"__main__\"",
"__name__",
"\"__main__\"",
"if sys.platform =='ios':\n\t\tif input_method==input_methods[0]:\n\t\t\tic=input_clipboard()\n\t\t\tinput = lambda : ic.__next__()\n\t\telif input_method==input_methods[1]:\n\t\t\tsys.stdin=open('inputFile.txt')\n\t\telse:\n\t\t\tpass\n\t\tisTest=True\n\telse:\n\t\tpass\n\t\t#input = sys.stdin.readline\n\t\t\t\n\t",
"sys.platform =='ios'",
"sys.platform",
"sys",
"platform",
"'ios'",
"if input_method==input_methods[0]:\n\t\t\tic=input_clipboard()\n\t\t\tinput = lambda : ic.__next__()\n\t\telif input_method==input_methods[1]:\n\t\t\tsys.stdin=open('inputFile.txt')\n\t\telse:\n\t\t\tpass\n\t\t",
"input_method==input_methods[0]",
"input_method",
"input_methods[0]",
"input_methods",
"0",
"ic=input_clipboard()",
"ic",
"input_clipboard()",
"input_clipboard",
"input = lambda : ic.__next__()",
"input",
"lambda : ic.__next__()",
"ic.__next__()",
"ic.__next__",
"ic",
"__next__",
"elif input_method==input_methods[1]:\n\t\t\tsys.stdin=open('inputFile.txt')\n\t\t",
"input_method==input_methods[1]",
"input_method",
"input_methods[1]",
"input_methods",
"1",
"sys.stdin=open('inputFile.txt')",
"sys.stdin",
"sys",
"stdin",
"open('inputFile.txt')",
"open",
"'inputFile.txt'",
"isTest=True",
"isTest",
"True",
"ret = main()",
"ret",
"main()",
"main",
"if ret is not None:\n\t\tprint(ret)",
"ret is not None",
"ret",
"None",
"print(ret)",
"print",
"ret",
"isTest=False",
"False",
"isTest",
"def pa(v):\n\tif isTest:\n\t\tprint(v)\n\t\t",
"def pa(v):\n\tif isTest:\n\t\tprint(v)\n\t\t",
"pa",
"mod=1000000007",
"1000000007",
"mod",
"input_method=input_methods[using_method]",
"input_methods[using_method]",
"input_method",
"def main():\n\tn = int(input())\n\tal = list(IN())\n\tbl=list(IN())\n\tmm=[]\n\tfor i in range(n):\n\t\tmm.append([0,0])\n\tim=0\n\tfor i, h in enumerate(al):\n\t\tif im < h:\n\t\t\tmm[i] = [h,h]\n\t\t\tim=h\n\t\telse:\n\t\t\tmm[i] = [1,h]\n\tjm=0\n\tfor i, h in enumerate(bl[::-1]):\n\t\tj=n-i-1\n\t\tif jm < h:\n\t\t\tif mm[j][0]<= h and h <= mm[j][1]:\n\t\t\t\tmm[j] = [h,h]\n\t\t\t\tjm=h\n\t\t\telse:\n\t\t\t\treturn 0\n\t\telse:\n\t\t\tif mm[j][0]<= h and h <= mm[j][1]:\n\t\t\t\tmm[j][1]=h\n\t\t\telif h < mm[j][0]:\n\t\t\t\treturn 0\n\t\t\telse:\n\t\t\t\tpass\n\tr=1\n\tfor a,b in mm:\n\t\tr *= (b-a+1)\n\t\tr %= mod\n\tprint(r)\n\t\t\n\t\n\t\n\t\n#+++++",
"def main():\n\tn = int(input())\n\tal = list(IN())\n\tbl=list(IN())\n\tmm=[]\n\tfor i in range(n):\n\t\tmm.append([0,0])\n\tim=0\n\tfor i, h in enumerate(al):\n\t\tif im < h:\n\t\t\tmm[i] = [h,h]\n\t\t\tim=h\n\t\telse:\n\t\t\tmm[i] = [1,h]\n\tjm=0\n\tfor i, h in enumerate(bl[::-1]):\n\t\tj=n-i-1\n\t\tif jm < h:\n\t\t\tif mm[j][0]<= h and h <= mm[j][1]:\n\t\t\t\tmm[j] = [h,h]\n\t\t\t\tjm=h\n\t\t\telse:\n\t\t\t\treturn 0\n\t\telse:\n\t\t\tif mm[j][0]<= h and h <= mm[j][1]:\n\t\t\t\tmm[j][1]=h\n\t\t\telif h < mm[j][0]:\n\t\t\t\treturn 0\n\t\t\telse:\n\t\t\t\tpass\n\tr=1\n\tfor a,b in mm:\n\t\tr *= (b-a+1)\n\t\tr %= mod\n\tprint(r)\n\t\t\n\t\n\t\n\t\n#+++++",
"main",
"using_method=0",
"0",
"using_method",
"IN=lambda : map(int, input().split())",
"lambda : map(int, input().split())",
"IN",
"def input_clipboard():\n\timport clipboard\n\tinput_text=clipboard.get()\n\tinput_l=input_text.splitlines()\n\tfor l in input_l:\n\t\tyield l",
"def input_clipboard():\n\timport clipboard\n\tinput_text=clipboard.get()\n\tinput_l=input_text.splitlines()\n\tfor l in input_l:\n\t\tyield l",
"input_clipboard",
"ic=input_clipboard()",
"input_clipboard()",
"ic",
"input_methods=['clipboard','file','key']",
"['clipboard','file','key']",
"input_methods",
"input = lambda : ic.__next__()",
"lambda : ic.__next__()",
"input",
"isTest=True",
"True",
"isTest",
"ret = main()",
"main()",
"ret"
] |
import sys
input_methods=['clipboard','file','key']
using_method=0
input_method=input_methods[using_method]
IN=lambda : map(int, input().split())
mod=1000000007
#+++++
def main():
n = int(input())
al = list(IN())
bl=list(IN())
mm=[]
for i in range(n):
mm.append([0,0])
im=0
for i, h in enumerate(al):
if im < h:
mm[i] = [h,h]
im=h
else:
mm[i] = [1,h]
jm=0
for i, h in enumerate(bl[::-1]):
j=n-i-1
if jm < h:
if mm[j][0]<= h and h <= mm[j][1]:
mm[j] = [h,h]
jm=h
else:
return 0
else:
if mm[j][0]<= h and h <= mm[j][1]:
mm[j][1]=h
elif h < mm[j][0]:
return 0
else:
pass
r=1
for a,b in mm:
r *= (b-a+1)
r %= mod
print(r)
#+++++
isTest=False
def pa(v):
if isTest:
print(v)
def input_clipboard():
import clipboard
input_text=clipboard.get()
input_l=input_text.splitlines()
for l in input_l:
yield l
if __name__ == "__main__":
if sys.platform =='ios':
if input_method==input_methods[0]:
ic=input_clipboard()
input = lambda : ic.__next__()
elif input_method==input_methods[1]:
sys.stdin=open('inputFile.txt')
else:
pass
isTest=True
else:
pass
#input = sys.stdin.readline
ret = main()
if ret is not None:
print(ret)
|
[
7,
15,
13,
13,
13,
13,
15,
13,
15,
15,
15,
12,
13,
29,
18,
4,
18,
18,
13,
13,
13,
39,
17,
12,
13,
29,
2,
39,
17,
4,
13,
4,
13,
13,
23,
13,
4,
18,
13,
13,
17,
0,
13,
2,
4,
13,
17,
17,
17,
41,
28,
13,
4,
13,
17,
4,
4,
13,
2,
4,
13,
17,
13,
0,
13,
13,
0,
13,
39,
39,
17,
17,
39,
17,
17,
39,
17,
17,
39,
17,
17,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
2,
39,
17,
13,
0,
18,
13,
17,
18,
13,
17,
0,
18,
13,
17,
18,
13,
17,
28,
13,
4,
13,
2,
13,
17,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
18,
13,
2,
13,
17,
18,
13,
2,
13,
17,
14,
2,
18,
13,
2,
17,
13,
18,
13,
2,
17,
13,
0,
18,
13,
2,
17,
13,
18,
13,
2,
17,
13,
0,
13,
17,
14,
2,
2,
13,
17,
40,
18,
13,
17,
18,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
14,
2,
18,
13,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
13,
17,
28,
13,
4,
13,
13,
14,
2,
18,
13,
13,
17,
0,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
13,
13,
4,
13,
13,
10,
4,
13,
10,
13,
13,
10,
2,
13,
10,
17,
13,
10,
13,
13,
10,
12,
13,
10,
12,
13,
10,
39,
13,
10,
2,
13,
10,
4,
13,
10,
17,
13,
10,
17,
13,
10,
4,
13,
10,
4,
13
] |
[
[
35,
33
],
[
35,
35
],
[
255,
42
],
[
52,
51
],
[
51,
62
],
[
252,
64
],
[
270,
67
],
[
276,
82
],
[
265,
86
],
[
288,
88
],
[
265,
97
],
[
249,
100
],
[
265,
109
],
[
273,
112
],
[
277,
116
],
[
121,
118
],
[
274,
119
],
[
289,
122
],
[
128,
125
],
[
274,
126
],
[
250,
129
],
[
133,
132
],
[
277,
136
],
[
289,
141
],
[
132,
142
],
[
289,
144
],
[
132,
146
],
[
154,
149
],
[
274,
150
],
[
132,
152
],
[
289,
155
],
[
132,
157
],
[
250,
162
],
[
132,
165
],
[
250,
167
],
[
132,
170
],
[
177,
172
],
[
274,
173
],
[
132,
176
],
[
250,
178
],
[
132,
181
],
[
282,
183
],
[
277,
188
],
[
289,
192
],
[
250,
195
],
[
279,
198
],
[
202,
201
],
[
277,
204
],
[
274,
208
],
[
201,
209
],
[
289,
213
],
[
201,
214
],
[
250,
216
],
[
201,
217
],
[
258,
219
],
[
223,
222
],
[
277,
225
],
[
274,
229
],
[
222,
230
],
[
285,
233
],
[
289,
237
],
[
222,
238
],
[
250,
240
],
[
222,
241
],
[
261,
243
],
[
256,
244
],
[
262,
247
],
[
286,
247
],
[
259,
247
],
[
280,
247
],
[
283,
247
],
[
249,
250
],
[
252,
253
],
[
255,
256
],
[
258,
259
],
[
256,
261
],
[
261,
262
],
[
270,
271
],
[
273,
274
],
[
276,
277
],
[
279,
280
],
[
282,
283
],
[
285,
286
],
[
288,
289
]
] |
[
"import bisect, copy, heapq, math\nimport sys\nfrom collections import *\nfrom functools import lru_cache\nfrom itertools import accumulate, combinations, permutations, product\ndef input():\n return sys.stdin.readline()[:-1]\ndef ruiseki(lst):\n return [0]+list(accumulate(lst))\nsys.setrecursionlimit(5000000)\nmod=pow(10,9)+7\nal=[chr(ord('a') + i) for i in range(26)]\ndirection=[[1,0],[0,1],[-1,0],[0,-1]]\n\nn=int(input())\nt=list(map(int,input().split()))\na=list(map(int,input().split()))\n\nkakutei=[-1]*n\nkakutei[0]=t[0]\nkakutei[-1]=a[-1]\nfor i in range(n-1):\n if t[i]<t[i+1]:\n kakutei[i+1]=t[i+1]\n if a[-2-i]>a[-1-i]:\n kakutei[-2-i]=a[-2-i]\n# print(kakutei)\nans=1\nif n==1 and t[0]!=a[0]:\n ans=0\nfor i in range(n):\n if kakutei[i]>min(t[i],a[i]):\n ans=0\n\nfor i in range(n):\n if kakutei[i]==-1:\n ans*=min(t[i],a[i])\n ans%=mod\n\nprint(ans)",
"import bisect, copy, heapq, math",
"bisect",
"copy",
"heapq",
"math",
"import sys",
"sys",
"from collections import *",
"from functools import lru_cache",
"from itertools import accumulate, combinations, permutations, product",
"def input():\n return sys.stdin.readline()[:-1]",
"input",
"return sys.stdin.readline()[:-1]",
"sys.stdin.readline()[:-1]",
"sys.stdin.readline()",
"sys.stdin.readline",
"sys.stdin",
"sys",
"stdin",
"readline",
":-1",
"-1",
"def ruiseki(lst):\n return [0]+list(accumulate(lst))",
"ruiseki",
"return [0]+list(accumulate(lst))",
"[0]+list(accumulate(lst))",
"[0]",
"0",
"list(accumulate(lst))",
"list",
"accumulate(lst)",
"accumulate",
"lst",
"lst",
"lst",
"sys.setrecursionlimit(5000000)",
"sys.setrecursionlimit",
"sys",
"setrecursionlimit",
"5000000",
"mod=pow(10,9)+7",
"mod",
"pow(10,9)+7",
"pow(10,9)",
"pow",
"10",
"9",
"7",
"chr(ord('a') + i) for i in range(26)",
"for i in range(26)",
"i",
"range(26)",
"range",
"26",
"for i in range(26)",
"chr(ord('a') + i)",
"chr",
"ord('a') + i",
"ord('a')",
"ord",
"'a'",
"i",
"al=[chr(ord('a') + i) for i in range(26)]",
"al",
"[chr(ord('a') + i) for i in range(26)]",
"direction=[[1,0],[0,1],[-1,0],[0,-1]]",
"direction",
"[[1,0],[0,1],[-1,0],[0,-1]]",
"[1,0]",
"1",
"0",
"[0,1]",
"0",
"1",
"[-1,0]",
"-1",
"0",
"[0,-1]",
"0",
"-1",
"n=int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"t=list(map(int,input().split()))",
"t",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"a=list(map(int,input().split()))",
"a",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"kakutei=[-1]*n",
"kakutei",
"[-1]*n",
"[-1]",
"-1",
"n",
"kakutei[0]=t[0]",
"kakutei[0]",
"kakutei",
"0",
"t[0]",
"t",
"0",
"kakutei[-1]=a[-1]",
"kakutei[-1]",
"kakutei",
"-1",
"a[-1]",
"a",
"-1",
"for i in range(n-1):\n if t[i]<t[i+1]:\n kakutei[i+1]=t[i+1]\n if a[-2-i]>a[-1-i]:\n kakutei[-2-i]=a[-2-i]\n# print(kakutei)",
"i",
"range(n-1)",
"range",
"n-1",
"n",
"1",
"if t[i]<t[i+1]:\n kakutei[i+1]=t[i+1]\n ",
"t[i]<t[i+1]",
"t[i]",
"t",
"i",
"t[i+1]",
"t",
"i+1",
"i",
"1",
"kakutei[i+1]=t[i+1]",
"kakutei[i+1]",
"kakutei",
"i+1",
"i",
"1",
"t[i+1]",
"t",
"i+1",
"i",
"1",
"if a[-2-i]>a[-1-i]:\n kakutei[-2-i]=a[-2-i]\n# print(kakutei)",
"a[-2-i]>a[-1-i]",
"a[-2-i]",
"a",
"-2-i",
"-2",
"i",
"a[-1-i]",
"a",
"-1-i",
"-1",
"i",
"kakutei[-2-i]=a[-2-i]",
"kakutei[-2-i]",
"kakutei",
"-2-i",
"-2",
"i",
"a[-2-i]",
"a",
"-2-i",
"-2",
"i",
"ans=1",
"ans",
"1",
"if n==1 and t[0]!=a[0]:\n ans=0",
"n==1 and t[0]!=a[0]",
"n==1",
"n",
"1",
"t[0]!=a[0]",
"t[0]",
"t",
"0",
"a[0]",
"a",
"0",
"ans=0",
"ans",
"0",
"for i in range(n):\n if kakutei[i]>min(t[i],a[i]):\n ans=0",
"i",
"range(n)",
"range",
"n",
"if kakutei[i]>min(t[i],a[i]):\n ans=0",
"kakutei[i]>min(t[i],a[i])",
"kakutei[i]",
"kakutei",
"i",
"min(t[i],a[i])",
"min",
"t[i]",
"t",
"i",
"a[i]",
"a",
"i",
"ans=0",
"ans",
"0",
"for i in range(n):\n if kakutei[i]==-1:\n ans*=min(t[i],a[i])\n ans%=mod",
"i",
"range(n)",
"range",
"n",
"if kakutei[i]==-1:\n ans*=min(t[i],a[i])\n ",
"kakutei[i]==-1",
"kakutei[i]",
"kakutei",
"i",
"-1",
"ans*=min(t[i],a[i])",
"ans",
"min(t[i],a[i])",
"min",
"t[i]",
"t",
"i",
"a[i]",
"a",
"i",
"ans%=mod",
"ans",
"mod",
"print(ans)",
"print",
"ans",
"a=list(map(int,input().split()))",
"list(map(int,input().split()))",
"a",
"al=[chr(ord('a') + i) for i in range(26)]",
"[chr(ord('a') + i) for i in range(26)]",
"al",
"mod=pow(10,9)+7",
"pow(10,9)+7",
"mod",
"ans=0",
"0",
"ans",
"ans%=mod",
"mod",
"ans",
"def input():\n return sys.stdin.readline()[:-1]",
"def input():\n return sys.stdin.readline()[:-1]",
"input",
"def ruiseki(lst):\n return [0]+list(accumulate(lst))",
"def ruiseki(lst):\n return [0]+list(accumulate(lst))",
"ruiseki",
"direction=[[1,0],[0,1],[-1,0],[0,-1]]",
"[[1,0],[0,1],[-1,0],[0,-1]]",
"direction",
"kakutei=[-1]*n",
"[-1]*n",
"kakutei",
"n=int(input())",
"int(input())",
"n",
"ans=0",
"0",
"ans",
"ans=1",
"1",
"ans",
"ans*=min(t[i],a[i])",
"min(t[i],a[i])",
"ans",
"t=list(map(int,input().split()))",
"list(map(int,input().split()))",
"t"
] |
import bisect, copy, heapq, math
import sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
return sys.stdin.readline()[:-1]
def ruiseki(lst):
return [0]+list(accumulate(lst))
sys.setrecursionlimit(5000000)
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]
direction=[[1,0],[0,1],[-1,0],[0,-1]]
n=int(input())
t=list(map(int,input().split()))
a=list(map(int,input().split()))
kakutei=[-1]*n
kakutei[0]=t[0]
kakutei[-1]=a[-1]
for i in range(n-1):
if t[i]<t[i+1]:
kakutei[i+1]=t[i+1]
if a[-2-i]>a[-1-i]:
kakutei[-2-i]=a[-2-i]
# print(kakutei)
ans=1
if n==1 and t[0]!=a[0]:
ans=0
for i in range(n):
if kakutei[i]>min(t[i],a[i]):
ans=0
for i in range(n):
if kakutei[i]==-1:
ans*=min(t[i],a[i])
ans%=mod
print(ans)
|
[
7,
0,
13,
2,
4,
13,
17,
17,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
2,
39,
17,
13,
0,
13,
2,
39,
17,
13,
14,
2,
13,
17,
14,
40,
18,
13,
17,
18,
13,
17,
4,
13,
17,
4,
13,
17,
14,
40,
18,
13,
17,
18,
13,
17,
4,
13,
17,
0,
13,
18,
13,
17,
0,
13,
18,
13,
17,
0,
18,
13,
17,
39,
13,
13,
28,
13,
4,
13,
17,
13,
14,
2,
18,
13,
13,
13,
0,
18,
13,
13,
39,
17,
13,
0,
13,
18,
13,
13,
0,
18,
13,
13,
39,
13,
13,
0,
13,
18,
13,
17,
0,
13,
18,
13,
17,
0,
18,
13,
17,
39,
13,
13,
28,
13,
4,
13,
4,
13,
40,
13,
17,
14,
2,
18,
13,
13,
13,
0,
18,
13,
13,
39,
17,
13,
0,
13,
18,
13,
13,
0,
18,
13,
13,
39,
13,
13,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
4,
13,
18,
18,
13,
13,
17,
18,
18,
13,
13,
17,
0,
13,
4,
13,
18,
18,
13,
13,
17,
18,
18,
13,
13,
17,
14,
2,
13,
13,
0,
13,
17,
3,
0,
13,
2,
2,
13,
13,
17,
0,
13,
13,
4,
13,
13,
10,
18,
13,
10,
18,
13,
10,
17,
13,
10,
17,
13,
10,
4,
13,
10,
18,
13,
10,
18,
13,
10,
2,
13,
10,
4,
13,
10,
2,
13,
10,
4,
13,
10,
18,
13,
10,
13,
13,
10,
2,
13,
10,
2,
13,
10,
4,
13,
10,
18,
13,
10,
4,
13
] |
[
[
278,
2
],
[
260,
9
],
[
266,
15
],
[
248,
27
],
[
263,
39
],
[
261,
43
],
[
275,
45
],
[
261,
49
],
[
261,
52
],
[
267,
57
],
[
249,
60
],
[
267,
71
],
[
249,
74
],
[
284,
80
],
[
267,
82
],
[
236,
85
],
[
267,
87
],
[
93,
90
],
[
264,
91
],
[
98,
97
],
[
261,
101
],
[
267,
105
],
[
97,
106
],
[
285,
107
],
[
252,
107
],
[
112,
109
],
[
264,
110
],
[
97,
111
],
[
251,
116
],
[
267,
118
],
[
97,
119
],
[
124,
121
],
[
264,
122
],
[
97,
123
],
[
239,
128
],
[
249,
130
],
[
254,
133
],
[
249,
135
],
[
141,
138
],
[
276,
139
],
[
146,
145
],
[
261,
151
],
[
249,
156
],
[
145,
157
],
[
240,
158
],
[
252,
158
],
[
285,
158
],
[
270,
158
],
[
163,
160
],
[
276,
161
],
[
145,
162
],
[
269,
167
],
[
249,
169
],
[
145,
170
],
[
175,
172
],
[
276,
173
],
[
145,
174
],
[
242,
179
],
[
183,
182
],
[
261,
185
],
[
287,
187
],
[
121,
191
],
[
109,
191
],
[
264,
192
],
[
182,
193
],
[
172,
196
],
[
160,
196
],
[
276,
197
],
[
182,
198
],
[
281,
201
],
[
121,
205
],
[
109,
205
],
[
264,
206
],
[
182,
207
],
[
172,
210
],
[
160,
210
],
[
276,
211
],
[
182,
212
],
[
288,
216
],
[
282,
217
],
[
245,
219
],
[
257,
223
],
[
282,
226
],
[
288,
227
],
[
272,
230
],
[
279,
231
],
[
273,
234
],
[
258,
234
],
[
246,
234
],
[
243,
234
],
[
236,
237
],
[
239,
240
],
[
242,
243
],
[
245,
246
],
[
248,
249
],
[
251,
252
],
[
254,
255
],
[
257,
258
],
[
260,
261
],
[
263,
264
],
[
266,
267
],
[
269,
270
],
[
279,
272
],
[
272,
273
],
[
275,
276
],
[
278,
279
],
[
281,
282
],
[
284,
285
],
[
287,
288
]
] |
[
"# def makelist(n, m):\n# \treturn [[0 for i in range(m)] for j in range(n)]\n\n# n = int(input())\n# a, b = map(int, input().split())\n# s = input()\n\nMOD = int(1e9) + 7\nn = int(input())\nT = list(map(int, input().split()))\nA = list(map(int, input().split()))\n\nTsa = [0]*n\nAsa = [0]*n\n\nif n == 1:\n\tif T[0] != A[0]:\n\t\tprint(0)\n\telse:\n\t\tprint(1)\nelif T[-1] != A[0]:\n\tprint(0)\nelse:\n\t##\n\tdai = T[0]\n\tshou = T[0]\n\tTsa[0] = (shou, dai)\n\n\tfor i in range(1, n):\n\t\tif T[i] == dai:\n\t\t\tTsa[i] = (1, dai)\n\t\telse:\n\t\t\tdai = T[i]\n\t\t\tTsa[i] = (dai, dai)\n\n\t##\n\tdai = A[-1]\n\tshou = A[-1]\n\tAsa[-1] = (shou, dai)\n\n\tfor i in reversed(range(-n, -1)):\n\t\tif A[i] == dai:\n\t\t\tAsa[i] = (1, dai)\n\t\telse:\n\t\t\tdai = A[i]\n\t\t\tAsa[i] = (dai, dai)\n\n\t##\n\tans = 1\n\tfor i in range(n):\n\t\td = max(Tsa[i][0], Asa[i][0])\n\t\tu = min(Tsa[i][1], Asa[i][1])\n\n\t\tif d > u:\n\t\t\tans = 0\n\t\t\tbreak\n\t\telse:\n\t\t\tans *= u - d + 1\n\t\t\tans %= MOD\n\tprint(ans)",
"MOD = int(1e9) + 7",
"MOD",
"int(1e9) + 7",
"int(1e9)",
"int",
"1e9",
"7",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"T = list(map(int, input().split()))",
"T",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"A = list(map(int, input().split()))",
"A",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"Tsa = [0]*n",
"Tsa",
"[0]*n",
"[0]",
"0",
"n",
"Asa = [0]*n",
"Asa",
"[0]*n",
"[0]",
"0",
"n",
"if n == 1:\n\tif T[0] != A[0]:\n\t\tprint(0)\n\telse:\n\t\tprint(1)\nelif T[-1] != A[0]:\n\tprint(0)\nelse:\n\t##\n\tdai = T[0]\n\tshou = T[0]\n\tTsa[0] = (shou, dai)\n\n\tfor i in range(1, n):\n\t\tif T[i] == dai:\n\t\t\tTsa[i] = (1, dai)\n\t\telse:\n\t\t\tdai = T[i]\n\t\t\tTsa[i] = (dai, dai)\n\n\t##\n\tdai = A[-1]\n\tshou = A[-1]\n\tAsa[-1] = (shou, dai)\n\n\tfor i in reversed(range(-n, -1)):\n\t\tif A[i] == dai:\n\t\t\tAsa[i] = (1, dai)\n\t\telse:\n\t\t\tdai = A[i]\n\t\t\tAsa[i] = (dai, dai)\n\n\t##\n\tans = 1\n\tfor i in range(n):\n\t\td = max(Tsa[i][0], Asa[i][0])\n\t\tu = min(Tsa[i][1], Asa[i][1])\n\n\t\tif d > u:\n\t\t\tans = 0\n\t\t\tbreak\n\t\telse:\n\t\t\tans *= u - d + 1\n\t\t\tans %= MOD\n\tprint(ans)",
"n == 1",
"n",
"1",
"if T[0] != A[0]:\n\t\tprint(0)\n\telse:\n\t\tprint(1)",
"T[0] != A[0]",
"T[0]",
"T",
"0",
"A[0]",
"A",
"0",
"print(0)",
"print",
"0",
"print(1)",
"print",
"1",
"elif T[-1] != A[0]:\n\tprint(0)",
"T[-1] != A[0]",
"T[-1]",
"T",
"-1",
"A[0]",
"A",
"0",
"print(0)",
"print",
"0",
"dai = T[0]",
"dai",
"T[0]",
"T",
"0",
"shou = T[0]",
"shou",
"T[0]",
"T",
"0",
"Tsa[0] = (shou, dai)",
"Tsa[0]",
"Tsa",
"0",
"(shou, dai)",
"shou",
"dai",
"for i in range(1, n):\n\t\tif T[i] == dai:\n\t\t\tTsa[i] = (1, dai)\n\t\telse:\n\t\t\tdai = T[i]\n\t\t\tTsa[i] = (dai, dai)\n\n\t##\n\t",
"i",
"range(1, n)",
"range",
"1",
"n",
"if T[i] == dai:\n\t\t\tTsa[i] = (1, dai)\n\t\telse:\n\t\t\tdai = T[i]\n\t\t\tTsa[i] = (dai, dai)\n\n\t##\n\t",
"T[i] == dai",
"T[i]",
"T",
"i",
"dai",
"Tsa[i] = (1, dai)",
"Tsa[i]",
"Tsa",
"i",
"(1, dai)",
"1",
"dai",
"dai = T[i]",
"dai",
"T[i]",
"T",
"i",
"Tsa[i] = (dai, dai)",
"Tsa[i]",
"Tsa",
"i",
"(dai, dai)",
"dai",
"dai",
"dai = A[-1]",
"dai",
"A[-1]",
"A",
"-1",
"shou = A[-1]",
"shou",
"A[-1]",
"A",
"-1",
"Asa[-1] = (shou, dai)",
"Asa[-1]",
"Asa",
"-1",
"(shou, dai)",
"shou",
"dai",
"for i in reversed(range(-n, -1)):\n\t\tif A[i] == dai:\n\t\t\tAsa[i] = (1, dai)\n\t\telse:\n\t\t\tdai = A[i]\n\t\t\tAsa[i] = (dai, dai)\n\n\t##\n\t",
"i",
"reversed(range(-n, -1))",
"reversed",
"range(-n, -1)",
"range",
"-n",
"n",
"-1",
"if A[i] == dai:\n\t\t\tAsa[i] = (1, dai)\n\t\telse:\n\t\t\tdai = A[i]\n\t\t\tAsa[i] = (dai, dai)\n\n\t##\n\t",
"A[i] == dai",
"A[i]",
"A",
"i",
"dai",
"Asa[i] = (1, dai)",
"Asa[i]",
"Asa",
"i",
"(1, dai)",
"1",
"dai",
"dai = A[i]",
"dai",
"A[i]",
"A",
"i",
"Asa[i] = (dai, dai)",
"Asa[i]",
"Asa",
"i",
"(dai, dai)",
"dai",
"dai",
"ans = 1",
"ans",
"1",
"for i in range(n):\n\t\td = max(Tsa[i][0], Asa[i][0])\n\t\tu = min(Tsa[i][1], Asa[i][1])\n\n\t\tif d > u:\n\t\t\tans = 0\n\t\t\tbreak\n\t\telse:\n\t\t\tans *= u - d + 1\n\t\t\tans %= MOD\n\t",
"i",
"range(n)",
"range",
"n",
"d = max(Tsa[i][0], Asa[i][0])",
"d",
"max(Tsa[i][0], Asa[i][0])",
"max",
"Tsa[i][0]",
"[i]",
"Tsa",
"i",
"0",
"Asa[i][0]",
"[i]",
"Asa",
"i",
"0",
"u = min(Tsa[i][1], Asa[i][1])",
"u",
"min(Tsa[i][1], Asa[i][1])",
"min",
"Tsa[i][1]",
"[i]",
"Tsa",
"i",
"1",
"Asa[i][1]",
"[i]",
"Asa",
"i",
"1",
"if d > u:\n\t\t\tans = 0\n\t\t\tbreak\n\t\telse:\n\t\t\tans *= u - d + 1\n\t\t\tans %= MOD\n\t",
"d > u",
"d",
"u",
"ans = 0",
"ans",
"0",
"break",
"ans *= u - d + 1",
"ans",
"u - d + 1",
"u - d",
"u",
"d",
"1",
"ans %= MOD",
"ans",
"MOD",
"print(ans)",
"print",
"ans",
"shou = T[0]",
"T[0]",
"shou",
"dai = A[-1]",
"A[-1]",
"dai",
"ans = 1",
"1",
"ans",
"ans = 0",
"0",
"ans",
"A = list(map(int, input().split()))",
"list(map(int, input().split()))",
"A",
"dai = T[i]",
"T[i]",
"dai",
"shou = A[-1]",
"A[-1]",
"shou",
"ans *= u - d + 1",
"u - d + 1",
"ans",
"n = int(input())",
"int(input())",
"n",
"Tsa = [0]*n",
"[0]*n",
"Tsa",
"T = list(map(int, input().split()))",
"list(map(int, input().split()))",
"T",
"dai = A[i]",
"A[i]",
"dai",
"ans %= MOD",
"MOD",
"ans",
"Asa = [0]*n",
"[0]*n",
"Asa",
"MOD = int(1e9) + 7",
"int(1e9) + 7",
"MOD",
"u = min(Tsa[i][1], Asa[i][1])",
"min(Tsa[i][1], Asa[i][1])",
"u",
"dai = T[0]",
"T[0]",
"dai",
"d = max(Tsa[i][0], Asa[i][0])",
"max(Tsa[i][0], Asa[i][0])",
"d"
] |
# def makelist(n, m):
# return [[0 for i in range(m)] for j in range(n)]
# n = int(input())
# a, b = map(int, input().split())
# s = input()
MOD = int(1e9) + 7
n = int(input())
T = list(map(int, input().split()))
A = list(map(int, input().split()))
Tsa = [0]*n
Asa = [0]*n
if n == 1:
if T[0] != A[0]:
print(0)
else:
print(1)
elif T[-1] != A[0]:
print(0)
else:
##
dai = T[0]
shou = T[0]
Tsa[0] = (shou, dai)
for i in range(1, n):
if T[i] == dai:
Tsa[i] = (1, dai)
else:
dai = T[i]
Tsa[i] = (dai, dai)
##
dai = A[-1]
shou = A[-1]
Asa[-1] = (shou, dai)
for i in reversed(range(-n, -1)):
if A[i] == dai:
Asa[i] = (1, dai)
else:
dai = A[i]
Asa[i] = (dai, dai)
##
ans = 1
for i in range(n):
d = max(Tsa[i][0], Asa[i][0])
u = min(Tsa[i][1], Asa[i][1])
if d > u:
ans = 0
break
else:
ans *= u - d + 1
ans %= MOD
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
2,
2,
17,
17,
17,
0,
13,
4,
13,
13,
28,
13,
4,
13,
13,
14,
2,
18,
13,
13,
13,
0,
13,
13,
3,
14,
2,
40,
18,
13,
13,
18,
13,
13,
40,
18,
13,
17,
18,
13,
17,
4,
13,
17,
0,
13,
39,
0,
13,
17,
28,
13,
4,
13,
13,
14,
2,
13,
18,
13,
13,
4,
18,
13,
13,
13,
0,
13,
18,
13,
13,
14,
2,
4,
13,
13,
17,
4,
13,
17,
0,
13,
39,
28,
13,
13,
14,
2,
2,
13,
2,
13,
17,
2,
18,
13,
13,
18,
13,
2,
13,
17,
4,
18,
13,
13,
13,
14,
2,
4,
13,
13,
17,
4,
13,
17,
0,
13,
17,
28,
13,
13,
0,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
13,
13,
4,
13,
13,
10,
13,
13,
10,
17,
13,
10,
13,
13,
10,
4,
13,
10,
2,
13,
10,
4,
13,
10,
39,
13,
10,
39,
13,
10,
4,
13,
10,
4,
13,
10,
18,
13,
10,
17,
13,
10,
4,
13
] |
[
[
187,
2
],
[
181,
8
],
[
196,
20
],
[
184,
32
],
[
199,
39
],
[
182,
42
],
[
45,
44
],
[
188,
47
],
[
182,
51
],
[
44,
52
],
[
200,
53
],
[
178,
55
],
[
44,
56
],
[
182,
62
],
[
179,
63
],
[
197,
65
],
[
179,
66
],
[
182,
69
],
[
197,
72
],
[
190,
78
],
[
175,
81
],
[
85,
84
],
[
188,
87
],
[
176,
90
],
[
203,
90
],
[
182,
92
],
[
84,
93
],
[
191,
96
],
[
84,
98
],
[
202,
100
],
[
182,
102
],
[
84,
103
],
[
191,
108
],
[
193,
114
],
[
118,
117
],
[
191,
117
],
[
117,
122
],
[
188,
124
],
[
197,
128
],
[
117,
129
],
[
197,
131
],
[
117,
133
],
[
194,
137
],
[
117,
139
],
[
194,
144
],
[
205,
150
],
[
154,
153
],
[
194,
153
],
[
208,
156
],
[
182,
160
],
[
153,
161
],
[
197,
163
],
[
153,
164
],
[
172,
166
],
[
185,
167
],
[
173,
170
],
[
209,
170
],
[
206,
170
],
[
185,
172
],
[
172,
173
],
[
175,
176
],
[
44,
178
],
[
178,
179
],
[
181,
182
],
[
184,
185
],
[
187,
188
],
[
190,
191
],
[
193,
194
],
[
196,
197
],
[
199,
200
],
[
202,
203
],
[
205,
206
],
[
208,
209
]
] |
[
"n = int(input())\nt = list(map(int, input().split()))\na = list(map(int, input().split()))\nMOD = 10**9 + 7\nt_max = max(t)\nfor i in range(n):\n if t[i] == t_max:\n max_ind = i\n break\nif t[max_ind] != a[max_ind] or t[-1] != a[0]:\n print(0)\nelse:\n idx = []\n before = 0\n for i in range(n):\n if before == t[i]:\n idx .append(i)\n before = t[i]\n if len(idx) == 0:\n print(1)\n else:\n new_idx = []\n for j in idx:\n if j < n-1 and a[j] == a[j+1]:\n new_idx.append(j)\n if len(new_idx) == 0:\n print(1)\n else:\n ans = 1\n for k in new_idx:\n ans *= min(t[k], a[k])\n ans %= MOD\n print(ans)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"t = list(map(int, input().split()))",
"t",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"a = list(map(int, input().split()))",
"a",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"MOD = 10**9 + 7",
"MOD",
"10**9 + 7",
"10**9",
"10",
"9",
"7",
"t_max = max(t)",
"t_max",
"max(t)",
"max",
"t",
"for i in range(n):\n if t[i] == t_max:\n max_ind = i\n break",
"i",
"range(n)",
"range",
"n",
"if t[i] == t_max:\n max_ind = i\n break",
"t[i] == t_max",
"t[i]",
"t",
"i",
"t_max",
"max_ind = i",
"max_ind",
"i",
"break",
"if t[max_ind] != a[max_ind] or t[-1] != a[0]:\n print(0)\nelse:\n idx = []\n before = 0\n for i in range(n):\n if before == t[i]:\n idx .append(i)\n before = t[i]\n if len(idx) == 0:\n print(1)\n else:\n new_idx = []\n for j in idx:\n if j < n-1 and a[j] == a[j+1]:\n new_idx.append(j)\n if len(new_idx) == 0:\n print(1)\n else:\n ans = 1\n for k in new_idx:\n ans *= min(t[k], a[k])\n ans %= MOD\n print(ans)",
"t[max_ind] != a[max_ind] or t[-1] != a[0]",
"t[max_ind] != a[max_ind]",
"t[max_ind]",
"t",
"max_ind",
"a[max_ind]",
"a",
"max_ind",
"t[-1] != a[0]",
"t[-1]",
"t",
"-1",
"a[0]",
"a",
"0",
"print(0)",
"print",
"0",
"idx = []",
"idx",
"[]",
"before = 0",
"before",
"0",
"for i in range(n):\n if before == t[i]:\n idx .append(i)\n before = t[i]\n ",
"i",
"range(n)",
"range",
"n",
"if before == t[i]:\n idx .append(i)\n ",
"before == t[i]",
"before",
"t[i]",
"t",
"i",
"idx .append(i)",
"idx .append",
"idx",
"append",
"i",
"before = t[i]",
"before",
"t[i]",
"t",
"i",
"if len(idx) == 0:\n print(1)\n else:\n new_idx = []\n for j in idx:\n if j < n-1 and a[j] == a[j+1]:\n new_idx.append(j)\n if len(new_idx) == 0:\n print(1)\n else:\n ans = 1\n for k in new_idx:\n ans *= min(t[k], a[k])\n ans %= MOD\n print(ans)",
"len(idx) == 0",
"len(idx)",
"len",
"idx",
"0",
"print(1)",
"print",
"1",
"new_idx = []",
"new_idx",
"[]",
"for j in idx:\n if j < n-1 and a[j] == a[j+1]:\n new_idx.append(j)\n ",
"j",
"idx",
"if j < n-1 and a[j] == a[j+1]:\n new_idx.append(j)\n ",
"j < n-1 and a[j] == a[j+1]",
"j < n-1",
"j",
"n-1",
"n",
"1",
"a[j] == a[j+1]",
"a[j]",
"a",
"j",
"a[j+1]",
"a",
"j+1",
"j",
"1",
"new_idx.append(j)",
"new_idx.append",
"new_idx",
"append",
"j",
"if len(new_idx) == 0:\n print(1)\n else:\n ans = 1\n for k in new_idx:\n ans *= min(t[k], a[k])\n ans %= MOD\n print(ans)",
"len(new_idx) == 0",
"len(new_idx)",
"len",
"new_idx",
"0",
"print(1)",
"print",
"1",
"ans = 1",
"ans",
"1",
"for k in new_idx:\n ans *= min(t[k], a[k])\n ans %= MOD\n ",
"k",
"new_idx",
"ans *= min(t[k], a[k])",
"ans",
"min(t[k], a[k])",
"min",
"t[k]",
"t",
"k",
"a[k]",
"a",
"k",
"ans %= MOD",
"ans",
"MOD",
"print(ans)",
"print",
"ans",
"ans %= MOD",
"MOD",
"ans",
"before = 0",
"0",
"before",
"max_ind = i",
"i",
"max_ind",
"t = list(map(int, input().split()))",
"list(map(int, input().split()))",
"t",
"MOD = 10**9 + 7",
"10**9 + 7",
"MOD",
"n = int(input())",
"int(input())",
"n",
"idx = []",
"[]",
"idx",
"new_idx = []",
"[]",
"new_idx",
"a = list(map(int, input().split()))",
"list(map(int, input().split()))",
"a",
"t_max = max(t)",
"max(t)",
"t_max",
"before = t[i]",
"t[i]",
"before",
"ans = 1",
"1",
"ans",
"ans *= min(t[k], a[k])",
"min(t[k], a[k])",
"ans"
] |
n = int(input())
t = list(map(int, input().split()))
a = list(map(int, input().split()))
MOD = 10**9 + 7
t_max = max(t)
for i in range(n):
if t[i] == t_max:
max_ind = i
break
if t[max_ind] != a[max_ind] or t[-1] != a[0]:
print(0)
else:
idx = []
before = 0
for i in range(n):
if before == t[i]:
idx .append(i)
before = t[i]
if len(idx) == 0:
print(1)
else:
new_idx = []
for j in idx:
if j < n-1 and a[j] == a[j+1]:
new_idx.append(j)
if len(new_idx) == 0:
print(1)
else:
ans = 1
for k in new_idx:
ans *= min(t[k], a[k])
ans %= MOD
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
39,
0,
13,
17,
0,
13,
2,
2,
17,
17,
17,
28,
13,
4,
13,
13,
0,
13,
17,
13,
2,
4,
13,
18,
13,
13,
18,
13,
13,
17,
14,
40,
13,
2,
13,
17,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
13,
18,
13,
13,
0,
13,
18,
13,
13,
14,
40,
13,
17,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
13,
18,
13,
13,
0,
13,
18,
13,
13,
0,
13,
2,
2,
4,
13,
2,
13,
13,
17,
13,
13,
4,
13,
13,
10,
4,
13,
10,
4,
13,
10,
2,
13,
10,
18,
13,
10,
18,
13,
10,
4,
13,
10,
17,
13,
10,
2,
13,
10,
2,
13,
10,
39,
13,
10,
18,
13,
10,
18,
13,
10,
17,
13
] |
[
[
129,
2
],
[
132,
8
],
[
144,
20
],
[
156,
32
],
[
147,
35
],
[
150,
38
],
[
46,
45
],
[
130,
48
],
[
165,
50
],
[
135,
52
],
[
133,
57
],
[
45,
58
],
[
145,
60
],
[
45,
61
],
[
45,
65
],
[
130,
67
],
[
145,
72
],
[
45,
73
],
[
145,
75
],
[
45,
77
],
[
138,
80
],
[
145,
82
],
[
45,
83
],
[
159,
85
],
[
145,
87
],
[
45,
88
],
[
45,
91
],
[
133,
96
],
[
45,
97
],
[
133,
99
],
[
45,
101
],
[
141,
104
],
[
133,
106
],
[
45,
107
],
[
162,
109
],
[
133,
111
],
[
45,
112
],
[
153,
114
],
[
136,
120
],
[
163,
121
],
[
142,
121
],
[
160,
121
],
[
139,
121
],
[
166,
121
],
[
148,
123
],
[
154,
123
],
[
151,
124
],
[
154,
127
],
[
148,
127
],
[
129,
130
],
[
132,
133
],
[
135,
136
],
[
138,
139
],
[
141,
142
],
[
144,
145
],
[
147,
148
],
[
150,
151
],
[
153,
154
],
[
156,
157
],
[
159,
160
],
[
162,
163
],
[
165,
166
]
] |
[
"N = int(input())\nT = list(map(int,input().split()))\nA = list(map(int,input().split()))\nmami = []\nans = 1\nmod = 10**9 + 7\nfor i in range(N):\n mi, ma = 1 , min(T[i], A[i])+1\n if i != N-1:\n if A[i] > A[i+1]:\n mi = A[i]\n else :\n mi = A[i]\n if i != 0 :\n if T[i] > T[i-1]:\n mi = T[i]\n else :\n mi = T[i] \n ans = (max(ma - mi, 0) * ans ) % mod\nprint (ans)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"T = list(map(int,input().split()))",
"T",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"A = list(map(int,input().split()))",
"A",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"mami = []",
"mami",
"[]",
"ans = 1",
"ans",
"1",
"mod = 10**9 + 7",
"mod",
"10**9 + 7",
"10**9",
"10",
"9",
"7",
"for i in range(N):\n mi, ma = 1 , min(T[i], A[i])+1\n if i != N-1:\n if A[i] > A[i+1]:\n mi = A[i]\n else :\n mi = A[i]\n if i != 0 :\n if T[i] > T[i-1]:\n mi = T[i]\n else :\n mi = T[i] \n ans = (max(ma - mi, 0) * ans ) % mod",
"i",
"range(N)",
"range",
"N",
"mi, ma = 1 , min(T[i], A[i])+1",
"mi",
"1",
"ma",
"min(T[i], A[i])+1",
"min(T[i], A[i])",
"min",
"T[i]",
"T",
"i",
"A[i]",
"A",
"i",
"1",
"if i != N-1:\n if A[i] > A[i+1]:\n mi = A[i]\n else :\n mi = A[i]\n ",
"i != N-1",
"i",
"N-1",
"N",
"1",
"if A[i] > A[i+1]:\n mi = A[i]\n ",
"A[i] > A[i+1]",
"A[i]",
"A",
"i",
"A[i+1]",
"A",
"i+1",
"i",
"1",
"mi = A[i]",
"mi",
"A[i]",
"A",
"i",
"mi = A[i]",
"mi",
"A[i]",
"A",
"i",
"if i != 0 :\n if T[i] > T[i-1]:\n mi = T[i]\n else :\n mi = T[i] \n ",
"i != 0",
"i",
"0",
"if T[i] > T[i-1]:\n mi = T[i]\n ",
"T[i] > T[i-1]",
"T[i]",
"T",
"i",
"T[i-1]",
"T",
"i-1",
"i",
"1",
"mi = T[i]",
"mi",
"T[i]",
"T",
"i",
"mi = T[i]",
"mi",
"T[i]",
"T",
"i",
"ans = (max(ma - mi, 0) * ans ) % mod",
"ans",
"(max(ma - mi, 0) * ans ) % mod",
"max(ma - mi, 0) * ans",
"max(ma - mi, 0)",
"max",
"ma - mi",
"ma",
"mi",
"0",
"ans",
"mod",
"print (ans)",
"print",
"ans",
"N = int(input())",
"int(input())",
"N",
"T = list(map(int,input().split()))",
"list(map(int,input().split()))",
"T",
"ma = 1 , min(T[i], A[i])+1",
"min(T[i], A[i])+1",
"ma",
"mi = A[i]",
"A[i]",
"mi",
"mi = T[i]",
"T[i]",
"mi",
"A = list(map(int,input().split()))",
"list(map(int,input().split()))",
"A",
"ans = 1",
"1",
"ans",
"mod = 10**9 + 7",
"10**9 + 7",
"mod",
"ans = (max(ma - mi, 0) * ans ) % mod",
"(max(ma - mi, 0) * ans ) % mod",
"ans",
"mami = []",
"[]",
"mami",
"mi = A[i]",
"A[i]",
"mi",
"mi = T[i]",
"T[i]",
"mi",
"mi, ma = 1 , min(T[i], A[i])+1",
"1",
"mi"
] |
N = int(input())
T = list(map(int,input().split()))
A = list(map(int,input().split()))
mami = []
ans = 1
mod = 10**9 + 7
for i in range(N):
mi, ma = 1 , min(T[i], A[i])+1
if i != N-1:
if A[i] > A[i+1]:
mi = A[i]
else :
mi = A[i]
if i != 0 :
if T[i] > T[i-1]:
mi = T[i]
else :
mi = T[i]
ans = (max(ma - mi, 0) * ans ) % mod
print (ans)
|
[
7,
12,
13,
41,
28,
13,
4,
18,
4,
13,
13,
17,
4,
4,
13,
13,
29,
13,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
0,
13,
4,
13,
41,
28,
13,
13,
4,
13,
13,
2,
39,
17,
13,
4,
39,
40,
13,
13,
13,
0,
13,
13,
41,
28,
13,
13,
4,
13,
13,
18,
2,
13,
39,
17,
39,
17,
4,
39,
40,
13,
13,
13,
0,
13,
13,
0,
13,
17,
28,
13,
13,
4,
13,
13,
13,
14,
18,
13,
17,
14,
18,
13,
17,
14,
40,
18,
13,
17,
18,
13,
17,
4,
13,
17,
4,
13,
14,
2,
18,
13,
17,
18,
13,
17,
4,
13,
17,
4,
13,
14,
18,
13,
17,
14,
2,
18,
13,
17,
18,
13,
17,
4,
13,
17,
4,
13,
0,
13,
2,
2,
13,
4,
13,
18,
13,
17,
18,
13,
17,
2,
2,
17,
17,
17,
4,
13,
13,
10,
13,
13,
10,
4,
13,
10,
12,
13,
10,
17,
13,
10,
2,
13,
10,
13,
13,
10,
4,
13,
10,
4,
13
] |
[
[
6,
5
],
[
5,
15
],
[
161,
19
],
[
176,
25
],
[
165,
27
],
[
179,
29
],
[
165,
31
],
[
177,
38
],
[
177,
42
],
[
173,
50
],
[
180,
58
],
[
180,
61
],
[
158,
73
],
[
167,
76
],
[
174,
83
],
[
177,
83
],
[
159,
84
],
[
180,
84
],
[
170,
137
],
[
168,
140
],
[
171,
140
],
[
171,
156
],
[
168,
156
],
[
158,
159
],
[
161,
162
],
[
167,
168
],
[
170,
171
],
[
173,
174
],
[
176,
177
],
[
179,
180
]
] |
[
"def read():\n\treturn [int(i) for i in input().split(\" \")]\nN = int(input())\nT = read()\nA = read()\nT = [(i != j, i) for i, j in zip(T, [None] + T)]\nA = [(i != j, i) for i, j in zip(A, (A + [None])[1:])]\nP = 1\nfor p, q in zip(T, A):\n\tif(p[0]):\n\t\tif(q[0]):\n\t\t\tif(p[1] != q[1]):\n\t\t\t\tprint(0)\n\t\t\t\texit()\n\t\telse:\n\t\t\tif(q[1] < p[1]):\n\t\t\t\tprint(0)\n\t\t\t\texit()\n\telif(q[0]):\n\t\tif(p[1] < q[1]):\n\t\t\tprint(0)\n\t\t\texit()\n\telse:\n\t\tP = P * min(p[1], q[1]) % (10 ** 9 + 7)\nprint(P) ",
"def read():\n\treturn [int(i) for i in input().split(\" \")]",
"read",
"int(i) for i in input().split(\" \")",
"for i in input().split(\" \")",
"i",
"input().split(\" \")",
"().split",
"()",
"input",
"split",
"\" \"",
"for i in input().split(\" \")",
"int(i)",
"int",
"i",
"return [int(i) for i in input().split(\" \")]",
"[int(i) for i in input().split(\" \")]",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"T = read()",
"T",
"read()",
"read",
"A = read()",
"A",
"read()",
"read",
"(i != j, i) for i, j in zip(T, [None] + T)",
"for i, j in zip(T, [None] + T)",
"i",
"j",
"zip(T, [None] + T)",
"zip",
"T",
"[None] + T",
"[None]",
"None",
"T",
"for i, j in zip(T, [None] + T)",
"(i != j, i)",
"i != j",
"i",
"j",
"i",
"T = [(i != j, i) for i, j in zip(T, [None] + T)]",
"T",
"[(i != j, i) for i, j in zip(T, [None] + T)]",
"(i != j, i) for i, j in zip(A, (A + [None])[1:])",
"for i, j in zip(A, (A + [None])[1:])",
"i",
"j",
"zip(A, (A + [None])[1:])",
"zip",
"A",
"(A + [None])[1:]",
"A + [None]",
"A",
"[None]",
"None",
"1:",
"1",
"for i, j in zip(A, (A + [None])[1:])",
"(i != j, i)",
"i != j",
"i",
"j",
"i",
"A = [(i != j, i) for i, j in zip(A, (A + [None])[1:])]",
"A",
"[(i != j, i) for i, j in zip(A, (A + [None])[1:])]",
"P = 1",
"P",
"1",
"for p, q in zip(T, A):\n\tif(p[0]):\n\t\tif(q[0]):\n\t\t\tif(p[1] != q[1]):\n\t\t\t\tprint(0)\n\t\t\t\texit()\n\t\telse:\n\t\t\tif(q[1] < p[1]):\n\t\t\t\tprint(0)\n\t\t\t\texit()\n\telif(q[0]):\n\t\tif(p[1] < q[1]):\n\t\t\tprint(0)\n\t\t\texit()\n\telse:\n\t\tP = P * min(p[1], q[1]) % (10 ** 9 + 7)",
"p",
"q",
"zip(T, A)",
"zip",
"T",
"A",
"if(p[0]):\n\t\tif(q[0]):\n\t\t\tif(p[1] != q[1]):\n\t\t\t\tprint(0)\n\t\t\t\texit()\n\t\telse:\n\t\t\tif(q[1] < p[1]):\n\t\t\t\tprint(0)\n\t\t\t\texit()\n\telif(q[0]):\n\t\tif(p[1] < q[1]):\n\t\t\tprint(0)\n\t\t\texit()\n\telse:\n\t\tP = P * min(p[1], q[1]) % (10 ** 9 + 7)",
"p[0]",
"p",
"0",
"if(q[0]):\n\t\t\tif(p[1] != q[1]):\n\t\t\t\tprint(0)\n\t\t\t\texit()\n\t\telse:\n\t\t\tif(q[1] < p[1]):\n\t\t\t\tprint(0)\n\t\t\t\texit()\n\t",
"q[0]",
"q",
"0",
"if(p[1] != q[1]):\n\t\t\t\tprint(0)\n\t\t\t\texit()\n\t\t",
"p[1] != q[1]",
"p[1]",
"p",
"1",
"q[1]",
"q",
"1",
"print(0)",
"print",
"0",
"exit()",
"exit",
"if(q[1] < p[1]):\n\t\t\t\tprint(0)\n\t\t\t\texit()\n\t",
"q[1] < p[1]",
"q[1]",
"q",
"1",
"p[1]",
"p",
"1",
"print(0)",
"print",
"0",
"exit()",
"exit",
"elif(q[0]):\n\t\tif(p[1] < q[1]):\n\t\t\tprint(0)\n\t\t\texit()\n\t",
"q[0]",
"q",
"0",
"if(p[1] < q[1]):\n\t\t\tprint(0)\n\t\t\texit()\n\t",
"p[1] < q[1]",
"p[1]",
"p",
"1",
"q[1]",
"q",
"1",
"print(0)",
"print",
"0",
"exit()",
"exit",
"P = P * min(p[1], q[1]) % (10 ** 9 + 7)",
"P",
"P * min(p[1], q[1]) % (10 ** 9 + 7)",
"P * min(p[1], q[1])",
"P",
"min(p[1], q[1])",
"min",
"p[1]",
"p",
"1",
"q[1]",
"q",
"1",
"10 ** 9 + 7",
"10 ** 9",
"10",
"9",
"7",
"print(P)",
"print",
"P",
"A = [(i != j, i) for i, j in zip(A, (A + [None])[1:])]",
"[(i != j, i) for i, j in zip(A, (A + [None])[1:])]",
"A",
"N = int(input())",
"int(input())",
"N",
"def read():\n\treturn [int(i) for i in input().split(\" \")]",
"def read():\n\treturn [int(i) for i in input().split(\" \")]",
"read",
"P = 1",
"1",
"P",
"P = P * min(p[1], q[1]) % (10 ** 9 + 7)",
"P * min(p[1], q[1]) % (10 ** 9 + 7)",
"P",
"T = [(i != j, i) for i, j in zip(T, [None] + T)]",
"[(i != j, i) for i, j in zip(T, [None] + T)]",
"T",
"T = read()",
"read()",
"T",
"A = read()",
"read()",
"A"
] |
def read():
return [int(i) for i in input().split(" ")]
N = int(input())
T = read()
A = read()
T = [(i != j, i) for i, j in zip(T, [None] + T)]
A = [(i != j, i) for i, j in zip(A, (A + [None])[1:])]
P = 1
for p, q in zip(T, A):
if(p[0]):
if(q[0]):
if(p[1] != q[1]):
print(0)
exit()
else:
if(q[1] < p[1]):
print(0)
exit()
elif(q[0]):
if(p[1] < q[1]):
print(0)
exit()
else:
P = P * min(p[1], q[1]) % (10 ** 9 + 7)
print(P)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
2,
39,
17,
13,
0,
13,
2,
39,
17,
13,
0,
13,
17,
28,
13,
4,
13,
4,
13,
13,
14,
2,
13,
18,
13,
13,
0,
18,
13,
13,
40,
18,
13,
13,
0,
13,
18,
13,
13,
0,
18,
13,
13,
13,
0,
13,
17,
28,
13,
4,
13,
4,
13,
4,
13,
13,
14,
2,
13,
18,
13,
13,
0,
18,
13,
13,
40,
18,
13,
13,
0,
13,
18,
13,
13,
0,
18,
13,
13,
13,
0,
13,
2,
39,
17,
13,
28,
13,
4,
13,
4,
13,
13,
14,
2,
2,
18,
13,
13,
17,
2,
18,
13,
13,
17,
14,
40,
18,
13,
13,
18,
13,
13,
4,
13,
17,
4,
13,
14,
2,
2,
18,
13,
13,
17,
2,
18,
13,
13,
17,
0,
13,
4,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
13,
4,
13,
18,
13,
13,
18,
13,
13,
14,
2,
13,
13,
4,
13,
17,
4,
13,
0,
18,
13,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
13,
17,
28,
13,
13,
14,
2,
13,
17,
0,
13,
13,
0,
13,
2,
2,
17,
17,
17,
4,
13,
13,
10,
18,
13,
10,
4,
13,
10,
2,
13,
10,
2,
13,
10,
17,
13,
10,
17,
13,
10,
4,
13,
10,
4,
13,
10,
4,
13,
10,
4,
13,
10,
13,
13,
10,
17,
13,
10,
18,
13,
10,
2,
13,
10,
2,
13
] |
[
[
254,
2
],
[
233,
8
],
[
251,
20
],
[
236,
32
],
[
255,
36
],
[
272,
38
],
[
255,
42
],
[
263,
44
],
[
48,
47
],
[
234,
52
],
[
264,
55
],
[
231,
55
],
[
234,
57
],
[
47,
58
],
[
63,
60
],
[
237,
61
],
[
47,
62
],
[
234,
65
],
[
47,
66
],
[
230,
68
],
[
234,
70
],
[
47,
71
],
[
76,
73
],
[
237,
74
],
[
47,
75
],
[
264,
76
],
[
231,
76
],
[
242,
78
],
[
82,
81
],
[
234,
88
],
[
243,
91
],
[
231,
91
],
[
264,
91
],
[
267,
91
],
[
252,
93
],
[
81,
94
],
[
99,
96
],
[
273,
97
],
[
81,
98
],
[
252,
101
],
[
81,
102
],
[
266,
104
],
[
252,
106
],
[
81,
107
],
[
112,
109
],
[
273,
110
],
[
81,
111
],
[
243,
112
],
[
231,
112
],
[
264,
112
],
[
267,
112
],
[
239,
114
],
[
255,
118
],
[
121,
120
],
[
234,
125
],
[
73,
129
],
[
60,
129
],
[
237,
130
],
[
120,
131
],
[
109,
134
],
[
96,
134
],
[
273,
135
],
[
120,
136
],
[
73,
140
],
[
60,
140
],
[
237,
141
],
[
120,
142
],
[
109,
143
],
[
96,
143
],
[
273,
144
],
[
120,
145
],
[
73,
154
],
[
60,
154
],
[
237,
155
],
[
120,
156
],
[
109,
159
],
[
96,
159
],
[
273,
160
],
[
120,
161
],
[
257,
164
],
[
73,
169
],
[
60,
169
],
[
237,
170
],
[
120,
171
],
[
109,
172
],
[
96,
172
],
[
273,
173
],
[
120,
174
],
[
248,
176
],
[
73,
179
],
[
60,
179
],
[
237,
180
],
[
120,
181
],
[
109,
182
],
[
96,
182
],
[
273,
183
],
[
120,
184
],
[
249,
187
],
[
258,
188
],
[
198,
195
],
[
240,
196
],
[
120,
197
],
[
73,
200
],
[
60,
200
],
[
237,
201
],
[
120,
202
],
[
109,
203
],
[
96,
203
],
[
273,
204
],
[
120,
205
],
[
245,
207
],
[
211,
210
],
[
240,
210
],
[
210,
214
],
[
260,
217
],
[
210,
218
],
[
269,
220
],
[
270,
228
],
[
261,
228
],
[
246,
228
],
[
230,
231
],
[
233,
234
],
[
236,
237
],
[
239,
240
],
[
242,
243
],
[
245,
246
],
[
248,
249
],
[
251,
252
],
[
254,
255
],
[
257,
258
],
[
210,
260
],
[
260,
261
],
[
263,
264
],
[
266,
267
],
[
269,
270
],
[
272,
273
]
] |
[
"n = int(input())\nt = list(map(int, input().split()))\na = list(map(int, input().split()))\nmt_t=[0]*n\nmt_a=[0]*n\nlast=0\nfor i in range(len(t)):\n if last < t[i]:\n mt_t[i] = -t[i]\n last=t[i]\n else:\n mt_t[i] = last\nlast=0\nfor i in reversed(range(len(t))):\n if last < a[i]:\n mt_a[i] = -a[i]\n last=a[i]\n else:\n mt_a[i] = last\nmts = [0]*n\nfor i in range(len(t)):\n if mt_t[i] < 0 and mt_a[i] < 0:\n if mt_t[i] != mt_a[i]:\n print(0)\n exit()\n elif mt_t[i] < 0 or mt_a[i] < 0:\n kaku =abs(min(mt_t[i],mt_a[i]))\n kouho=max(mt_t[i],mt_a[i])\n if kouho < kaku:\n print(0)\n exit()\n mts[i] = min(mt_t[i],mt_a[i])\n\nans=1\nfor num in mts:\n if num > 0:\n ans*=num\n ans%=(10**9+7)\nprint(ans)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"t = list(map(int, input().split()))",
"t",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"a = list(map(int, input().split()))",
"a",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"mt_t=[0]*n",
"mt_t",
"[0]*n",
"[0]",
"0",
"n",
"mt_a=[0]*n",
"mt_a",
"[0]*n",
"[0]",
"0",
"n",
"last=0",
"last",
"0",
"for i in range(len(t)):\n if last < t[i]:\n mt_t[i] = -t[i]\n last=t[i]\n else:\n mt_t[i] = last",
"i",
"range(len(t))",
"range",
"len(t)",
"len",
"t",
"if last < t[i]:\n mt_t[i] = -t[i]\n last=t[i]\n else:\n mt_t[i] = last",
"last < t[i]",
"last",
"t[i]",
"t",
"i",
"mt_t[i] = -t[i]",
"mt_t[i]",
"mt_t",
"i",
"-t[i]",
"t[i]",
"t",
"i",
"last=t[i]",
"last",
"t[i]",
"t",
"i",
"mt_t[i] = last",
"mt_t[i]",
"mt_t",
"i",
"last",
"last=0",
"last",
"0",
"for i in reversed(range(len(t))):\n if last < a[i]:\n mt_a[i] = -a[i]\n last=a[i]\n else:\n mt_a[i] = last",
"i",
"reversed(range(len(t)))",
"reversed",
"range(len(t))",
"range",
"len(t)",
"len",
"t",
"if last < a[i]:\n mt_a[i] = -a[i]\n last=a[i]\n else:\n mt_a[i] = last",
"last < a[i]",
"last",
"a[i]",
"a",
"i",
"mt_a[i] = -a[i]",
"mt_a[i]",
"mt_a",
"i",
"-a[i]",
"a[i]",
"a",
"i",
"last=a[i]",
"last",
"a[i]",
"a",
"i",
"mt_a[i] = last",
"mt_a[i]",
"mt_a",
"i",
"last",
"mts = [0]*n",
"mts",
"[0]*n",
"[0]",
"0",
"n",
"for i in range(len(t)):\n if mt_t[i] < 0 and mt_a[i] < 0:\n if mt_t[i] != mt_a[i]:\n print(0)\n exit()\n elif mt_t[i] < 0 or mt_a[i] < 0:\n kaku =abs(min(mt_t[i],mt_a[i]))\n kouho=max(mt_t[i],mt_a[i])\n if kouho < kaku:\n print(0)\n exit()\n mts[i] = min(mt_t[i],mt_a[i])",
"i",
"range(len(t))",
"range",
"len(t)",
"len",
"t",
"if mt_t[i] < 0 and mt_a[i] < 0:\n if mt_t[i] != mt_a[i]:\n print(0)\n exit()\n elif mt_t[i] < 0 or mt_a[i] < 0:\n kaku =abs(min(mt_t[i],mt_a[i]))\n kouho=max(mt_t[i],mt_a[i])\n if kouho < kaku:\n print(0)\n exit()\n ",
"mt_t[i] < 0 and mt_a[i] < 0",
"mt_t[i] < 0",
"mt_t[i]",
"mt_t",
"i",
"0",
"mt_a[i] < 0",
"mt_a[i]",
"mt_a",
"i",
"0",
"if mt_t[i] != mt_a[i]:\n print(0)\n exit()\n ",
"mt_t[i] != mt_a[i]",
"mt_t[i]",
"mt_t",
"i",
"mt_a[i]",
"mt_a",
"i",
"print(0)",
"print",
"0",
"exit()",
"exit",
"elif mt_t[i] < 0 or mt_a[i] < 0:\n kaku =abs(min(mt_t[i],mt_a[i]))\n kouho=max(mt_t[i],mt_a[i])\n if kouho < kaku:\n print(0)\n exit()\n ",
"mt_t[i] < 0 or mt_a[i] < 0",
"mt_t[i] < 0",
"mt_t[i]",
"mt_t",
"i",
"0",
"mt_a[i] < 0",
"mt_a[i]",
"mt_a",
"i",
"0",
"kaku =abs(min(mt_t[i],mt_a[i]))",
"kaku",
"abs(min(mt_t[i],mt_a[i]))",
"abs",
"min(mt_t[i],mt_a[i])",
"min",
"mt_t[i]",
"mt_t",
"i",
"mt_a[i]",
"mt_a",
"i",
"kouho=max(mt_t[i],mt_a[i])",
"kouho",
"max(mt_t[i],mt_a[i])",
"max",
"mt_t[i]",
"mt_t",
"i",
"mt_a[i]",
"mt_a",
"i",
"if kouho < kaku:\n print(0)\n exit()\n ",
"kouho < kaku",
"kouho",
"kaku",
"print(0)",
"print",
"0",
"exit()",
"exit",
"mts[i] = min(mt_t[i],mt_a[i])",
"mts[i]",
"mts",
"i",
"min(mt_t[i],mt_a[i])",
"min",
"mt_t[i]",
"mt_t",
"i",
"mt_a[i]",
"mt_a",
"i",
"ans=1",
"ans",
"1",
"for num in mts:\n if num > 0:\n ans*=num\n ans%=(10**9+7)",
"num",
"mts",
"if num > 0:\n ans*=num\n ans%=(10**9+7)",
"num > 0",
"num",
"0",
"ans*=num",
"ans",
"num",
"ans%=(10**9+7)",
"ans",
"10**9+7",
"10**9",
"10",
"9",
"7",
"print(ans)",
"print",
"ans",
"last=t[i]",
"t[i]",
"last",
"t = list(map(int, input().split()))",
"list(map(int, input().split()))",
"t",
"mt_t=[0]*n",
"[0]*n",
"mt_t",
"mts = [0]*n",
"[0]*n",
"mts",
"last=0",
"0",
"last",
"ans=1",
"1",
"ans",
"kouho=max(mt_t[i],mt_a[i])",
"max(mt_t[i],mt_a[i])",
"kouho",
"a = list(map(int, input().split()))",
"list(map(int, input().split()))",
"a",
"n = int(input())",
"int(input())",
"n",
"kaku =abs(min(mt_t[i],mt_a[i]))",
"abs(min(mt_t[i],mt_a[i]))",
"kaku",
"ans*=num",
"num",
"ans",
"last=0",
"0",
"last",
"last=a[i]",
"a[i]",
"last",
"ans%=(10**9+7)",
"10**9+7",
"ans",
"mt_a=[0]*n",
"[0]*n",
"mt_a"
] |
n = int(input())
t = list(map(int, input().split()))
a = list(map(int, input().split()))
mt_t=[0]*n
mt_a=[0]*n
last=0
for i in range(len(t)):
if last < t[i]:
mt_t[i] = -t[i]
last=t[i]
else:
mt_t[i] = last
last=0
for i in reversed(range(len(t))):
if last < a[i]:
mt_a[i] = -a[i]
last=a[i]
else:
mt_a[i] = last
mts = [0]*n
for i in range(len(t)):
if mt_t[i] < 0 and mt_a[i] < 0:
if mt_t[i] != mt_a[i]:
print(0)
exit()
elif mt_t[i] < 0 or mt_a[i] < 0:
kaku =abs(min(mt_t[i],mt_a[i]))
kouho=max(mt_t[i],mt_a[i])
if kouho < kaku:
print(0)
exit()
mts[i] = min(mt_t[i],mt_a[i])
ans=1
for num in mts:
if num > 0:
ans*=num
ans%=(10**9+7)
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
2,
2,
17,
17,
17,
0,
13,
39,
0,
13,
39,
4,
18,
13,
13,
18,
13,
17,
4,
18,
13,
13,
18,
13,
17,
28,
13,
4,
13,
17,
13,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
4,
18,
13,
13,
17,
4,
18,
13,
13,
18,
13,
13,
4,
18,
13,
13,
18,
13,
13,
4,
18,
13,
13,
18,
13,
13,
0,
18,
13,
17,
4,
13,
18,
13,
17,
18,
13,
17,
0,
18,
13,
17,
4,
13,
18,
13,
17,
18,
13,
17,
28,
13,
4,
13,
2,
13,
17,
17,
17,
14,
2,
18,
13,
2,
13,
17,
18,
13,
13,
0,
18,
13,
2,
13,
17,
4,
13,
18,
13,
2,
13,
17,
18,
13,
2,
13,
17,
0,
18,
13,
2,
13,
17,
4,
13,
18,
13,
2,
13,
17,
18,
13,
2,
13,
17,
0,
18,
13,
2,
13,
17,
4,
13,
18,
13,
2,
13,
17,
18,
13,
2,
13,
17,
0,
13,
17,
28,
13,
13,
4,
13,
13,
13,
0,
13,
2,
2,
13,
13,
17,
14,
40,
13,
17,
4,
13,
17,
4,
13,
0,
13,
13,
0,
13,
13,
4,
13,
13,
10,
4,
13,
10,
17,
13,
10,
2,
13,
10,
4,
13,
10,
4,
13,
10,
2,
13,
10,
39,
13,
10,
39,
13,
10,
13,
13,
10,
13,
13
] |
[
[
233,
2
],
[
242,
8
],
[
245,
20
],
[
248,
32
],
[
251,
39
],
[
254,
42
],
[
252,
46
],
[
243,
49
],
[
255,
53
],
[
243,
56
],
[
60,
59
],
[
234,
63
],
[
243,
67
],
[
59,
68
],
[
243,
70
],
[
59,
72
],
[
252,
76
],
[
255,
81
],
[
243,
84
],
[
59,
85
],
[
252,
88
],
[
243,
91
],
[
59,
92
],
[
255,
95
],
[
243,
98
],
[
59,
99
],
[
104,
101
],
[
252,
102
],
[
252,
107
],
[
246,
110
],
[
116,
113
],
[
255,
114
],
[
255,
119
],
[
246,
122
],
[
126,
125
],
[
234,
129
],
[
246,
136
],
[
125,
138
],
[
246,
141
],
[
125,
142
],
[
149,
144
],
[
255,
145
],
[
125,
147
],
[
255,
152
],
[
125,
154
],
[
246,
157
],
[
125,
159
],
[
167,
162
],
[
252,
163
],
[
125,
165
],
[
252,
170
],
[
125,
172
],
[
246,
175
],
[
125,
177
],
[
185,
180
],
[
255,
181
],
[
125,
183
],
[
255,
188
],
[
125,
190
],
[
246,
193
],
[
125,
195
],
[
236,
198
],
[
252,
205
],
[
255,
206
],
[
239,
208
],
[
240,
216
],
[
260,
224
],
[
240,
225
],
[
257,
227
],
[
249,
228
],
[
258,
231
],
[
261,
231
],
[
237,
231
],
[
233,
234
],
[
236,
237
],
[
239,
240
],
[
242,
243
],
[
245,
246
],
[
248,
249
],
[
251,
252
],
[
254,
255
],
[
249,
257
],
[
257,
258
],
[
240,
260
],
[
260,
261
]
] |
[
"n = int(input())\nt = list(map(int, input().split()))\na = list(map(int, input().split()))\nmod = 10 ** 9 + 7\nMIN = []\nMAX = []\nMIN.append(t[0])\nMAX.append(t[0])\n\nfor i in range(1,n):\n if t[i] == t[i-1]:\n MIN.append(1)\n MAX.append(t[i])\n else:\n MIN.append(t[i])\n MAX.append(t[i])\nMIN[-1] = max(MIN[-1],a[-1])\nMAX[-1] = min(MAX[-1],a[-1])\nfor i in range(n-1,0,-1):\n if a[i-1] == a[i]:\n MAX[i-1] = min(MAX[i-1],a[i-1])\n else:\n MIN[i-1] = max(MIN[i-1],a[i-1])\n MAX[i-1] = min(MAX[i-1],a[i-1])\nans = 1\nfor i,j in zip(MIN,MAX):\n diff = j-i+1\n if diff <= 0:\n print(0)\n exit()\n ans *= diff\n ans %= mod\nprint(ans)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"t = list(map(int, input().split()))",
"t",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"a = list(map(int, input().split()))",
"a",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"mod = 10 ** 9 + 7",
"mod",
"10 ** 9 + 7",
"10 ** 9",
"10",
"9",
"7",
"MIN = []",
"MIN",
"[]",
"MAX = []",
"MAX",
"[]",
"MIN.append(t[0])",
"MIN.append",
"MIN",
"append",
"t[0]",
"t",
"0",
"MAX.append(t[0])",
"MAX.append",
"MAX",
"append",
"t[0]",
"t",
"0",
"for i in range(1,n):\n if t[i] == t[i-1]:\n MIN.append(1)\n MAX.append(t[i])\n else:\n MIN.append(t[i])\n MAX.append(t[i])",
"i",
"range(1,n)",
"range",
"1",
"n",
"if t[i] == t[i-1]:\n MIN.append(1)\n MAX.append(t[i])\n else:\n MIN.append(t[i])\n MAX.append(t[i])",
"t[i] == t[i-1]",
"t[i]",
"t",
"i",
"t[i-1]",
"t",
"i-1",
"i",
"1",
"MIN.append(1)",
"MIN.append",
"MIN",
"append",
"1",
"MAX.append(t[i])",
"MAX.append",
"MAX",
"append",
"t[i]",
"t",
"i",
"MIN.append(t[i])",
"MIN.append",
"MIN",
"append",
"t[i]",
"t",
"i",
"MAX.append(t[i])",
"MAX.append",
"MAX",
"append",
"t[i]",
"t",
"i",
"MIN[-1] = max(MIN[-1],a[-1])",
"MIN[-1]",
"MIN",
"-1",
"max(MIN[-1],a[-1])",
"max",
"MIN[-1]",
"MIN",
"-1",
"a[-1]",
"a",
"-1",
"MAX[-1] = min(MAX[-1],a[-1])",
"MAX[-1]",
"MAX",
"-1",
"min(MAX[-1],a[-1])",
"min",
"MAX[-1]",
"MAX",
"-1",
"a[-1]",
"a",
"-1",
"for i in range(n-1,0,-1):\n if a[i-1] == a[i]:\n MAX[i-1] = min(MAX[i-1],a[i-1])\n else:\n MIN[i-1] = max(MIN[i-1],a[i-1])\n MAX[i-1] = min(MAX[i-1],a[i-1])",
"i",
"range(n-1,0,-1)",
"range",
"n-1",
"n",
"1",
"0",
"-1",
"if a[i-1] == a[i]:\n MAX[i-1] = min(MAX[i-1],a[i-1])\n else:\n MIN[i-1] = max(MIN[i-1],a[i-1])\n MAX[i-1] = min(MAX[i-1],a[i-1])",
"a[i-1] == a[i]",
"a[i-1]",
"a",
"i-1",
"i",
"1",
"a[i]",
"a",
"i",
"MAX[i-1] = min(MAX[i-1],a[i-1])",
"MAX[i-1]",
"MAX",
"i-1",
"i",
"1",
"min(MAX[i-1],a[i-1])",
"min",
"MAX[i-1]",
"MAX",
"i-1",
"i",
"1",
"a[i-1]",
"a",
"i-1",
"i",
"1",
"MIN[i-1] = max(MIN[i-1],a[i-1])",
"MIN[i-1]",
"MIN",
"i-1",
"i",
"1",
"max(MIN[i-1],a[i-1])",
"max",
"MIN[i-1]",
"MIN",
"i-1",
"i",
"1",
"a[i-1]",
"a",
"i-1",
"i",
"1",
"MAX[i-1] = min(MAX[i-1],a[i-1])",
"MAX[i-1]",
"MAX",
"i-1",
"i",
"1",
"min(MAX[i-1],a[i-1])",
"min",
"MAX[i-1]",
"MAX",
"i-1",
"i",
"1",
"a[i-1]",
"a",
"i-1",
"i",
"1",
"ans = 1",
"ans",
"1",
"for i,j in zip(MIN,MAX):\n diff = j-i+1\n if diff <= 0:\n print(0)\n exit()\n ans *= diff\n ans %= mod",
"i",
"j",
"zip(MIN,MAX)",
"zip",
"MIN",
"MAX",
"diff = j-i+1",
"diff",
"j-i+1",
"j-i",
"j",
"i",
"1",
"if diff <= 0:\n print(0)\n exit()\n ",
"diff <= 0",
"diff",
"0",
"print(0)",
"print",
"0",
"exit()",
"exit",
"ans *= diff",
"ans",
"diff",
"ans %= mod",
"ans",
"mod",
"print(ans)",
"print",
"ans",
"n = int(input())",
"int(input())",
"n",
"ans = 1",
"1",
"ans",
"diff = j-i+1",
"j-i+1",
"diff",
"t = list(map(int, input().split()))",
"list(map(int, input().split()))",
"t",
"a = list(map(int, input().split()))",
"list(map(int, input().split()))",
"a",
"mod = 10 ** 9 + 7",
"10 ** 9 + 7",
"mod",
"MIN = []",
"[]",
"MIN",
"MAX = []",
"[]",
"MAX",
"ans %= mod",
"mod",
"ans",
"ans *= diff",
"diff",
"ans"
] |
n = int(input())
t = list(map(int, input().split()))
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
MIN = []
MAX = []
MIN.append(t[0])
MAX.append(t[0])
for i in range(1,n):
if t[i] == t[i-1]:
MIN.append(1)
MAX.append(t[i])
else:
MIN.append(t[i])
MAX.append(t[i])
MIN[-1] = max(MIN[-1],a[-1])
MAX[-1] = min(MAX[-1],a[-1])
for i in range(n-1,0,-1):
if a[i-1] == a[i]:
MAX[i-1] = min(MAX[i-1],a[i-1])
else:
MIN[i-1] = max(MIN[i-1],a[i-1])
MAX[i-1] = min(MAX[i-1],a[i-1])
ans = 1
for i,j in zip(MIN,MAX):
diff = j-i+1
if diff <= 0:
print(0)
exit()
ans *= diff
ans %= mod
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
2,
2,
17,
17,
17,
14,
40,
13,
17,
4,
13,
4,
13,
2,
13,
13,
4,
13,
0,
13,
17,
28,
13,
4,
13,
17,
2,
13,
17,
14,
2,
2,
2,
18,
13,
2,
13,
17,
18,
13,
13,
2,
18,
13,
13,
18,
13,
13,
2,
2,
18,
13,
13,
18,
13,
2,
13,
17,
2,
18,
13,
13,
18,
13,
13,
4,
13,
17,
3,
14,
2,
2,
18,
13,
2,
13,
17,
18,
13,
13,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
13,
2,
2,
13,
4,
13,
18,
13,
13,
18,
13,
13,
13,
4,
13,
13,
10,
4,
13,
10,
4,
13,
10,
4,
13,
10,
2,
13,
10,
2,
13,
10,
17,
13
] |
[
[
140,
2
],
[
146,
8
],
[
143,
20
],
[
149,
32
],
[
141,
40
],
[
147,
47
],
[
144,
48
],
[
155,
52
],
[
56,
55
],
[
141,
60
],
[
147,
67
],
[
55,
69
],
[
147,
72
],
[
55,
73
],
[
147,
76
],
[
55,
77
],
[
144,
79
],
[
55,
80
],
[
144,
84
],
[
55,
85
],
[
144,
87
],
[
55,
89
],
[
147,
93
],
[
55,
94
],
[
144,
96
],
[
55,
97
],
[
147,
106
],
[
55,
108
],
[
147,
111
],
[
55,
112
],
[
144,
115
],
[
55,
116
],
[
144,
118
],
[
55,
120
],
[
152,
123
],
[
156,
126
],
[
153,
126
],
[
147,
130
],
[
55,
131
],
[
144,
133
],
[
55,
134
],
[
150,
135
],
[
153,
138
],
[
156,
138
],
[
140,
141
],
[
143,
144
],
[
146,
147
],
[
149,
150
],
[
152,
153
],
[
155,
156
]
] |
[
"n = int(input())\nt = list(map(int, input().split()))\na = list(map(int, input().split()))\nmod = 10 ** 9 + 7\n\n# 解説AC\nif n <= 2:\n print(int(t == a))\n exit()\n\nans = 1\nfor i in range(1, n - 1):\n if ((t[i - 1] < t[i] and t[i] > a[i])\n or (a[i] > a[i + 1] and t[i] < a[i])):\n print(0)\n break\n elif t[i - 1] == t[i] and a[i] == a[i + 1]:\n ans = ans * min(t[i], a[i]) % mod\nelse:\n print(ans)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"t = list(map(int, input().split()))",
"t",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"a = list(map(int, input().split()))",
"a",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"mod = 10 ** 9 + 7",
"mod",
"10 ** 9 + 7",
"10 ** 9",
"10",
"9",
"7",
"if n <= 2:\n print(int(t == a))\n exit()",
"n <= 2",
"n",
"2",
"print(int(t == a))",
"print",
"int(t == a)",
"int",
"t == a",
"t",
"a",
"exit()",
"exit",
"ans = 1",
"ans",
"1",
"for i in range(1, n - 1):\n if ((t[i - 1] < t[i] and t[i] > a[i])\n or (a[i] > a[i + 1] and t[i] < a[i])):\n print(0)\n break\n elif t[i - 1] == t[i] and a[i] == a[i + 1]:\n ans = ans * min(t[i], a[i]) % mod\nelse:\n print(ans)",
"i",
"range(1, n - 1)",
"range",
"1",
"n - 1",
"n",
"1",
"if ((t[i - 1] < t[i] and t[i] > a[i])\n or (a[i] > a[i + 1] and t[i] < a[i])):\n print(0)\n break\n elif t[i - 1] == t[i] and a[i] == a[i + 1]:\n ans = ans * min(t[i], a[i]) % mod",
"(t[i - 1] < t[i] and t[i] > a[i])\n or (a[i] > a[i + 1] and t[i] < a[i])",
"t[i - 1] < t[i] and t[i] > a[i]",
"t[i - 1] < t[i]",
"t[i - 1]",
"t",
"i - 1",
"i",
"1",
"t[i]",
"t",
"i",
"t[i] > a[i]",
"t[i]",
"t",
"i",
"a[i]",
"a",
"i",
"a[i] > a[i + 1] and t[i] < a[i]",
"a[i] > a[i + 1]",
"a[i]",
"a",
"i",
"a[i + 1]",
"a",
"i + 1",
"i",
"1",
"t[i] < a[i]",
"t[i]",
"t",
"i",
"a[i]",
"a",
"i",
"print(0)",
"print",
"0",
"break",
"elif t[i - 1] == t[i] and a[i] == a[i + 1]:\n ans = ans * min(t[i], a[i]) % mod",
"t[i - 1] == t[i] and a[i] == a[i + 1]",
"t[i - 1] == t[i]",
"t[i - 1]",
"t",
"i - 1",
"i",
"1",
"t[i]",
"t",
"i",
"a[i] == a[i + 1]",
"a[i]",
"a",
"i",
"a[i + 1]",
"a",
"i + 1",
"i",
"1",
"ans = ans * min(t[i], a[i]) % mod",
"ans",
"ans * min(t[i], a[i]) % mod",
"ans * min(t[i], a[i])",
"ans",
"min(t[i], a[i])",
"min",
"t[i]",
"t",
"i",
"a[i]",
"a",
"i",
"mod",
"print(ans)",
"print",
"ans",
"n = int(input())",
"int(input())",
"n",
"a = list(map(int, input().split()))",
"list(map(int, input().split()))",
"a",
"t = list(map(int, input().split()))",
"list(map(int, input().split()))",
"t",
"mod = 10 ** 9 + 7",
"10 ** 9 + 7",
"mod",
"ans = ans * min(t[i], a[i]) % mod",
"ans * min(t[i], a[i]) % mod",
"ans",
"ans = 1",
"1",
"ans"
] |
n = int(input())
t = list(map(int, input().split()))
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
# 解説AC
if n <= 2:
print(int(t == a))
exit()
ans = 1
for i in range(1, n - 1):
if ((t[i - 1] < t[i] and t[i] > a[i])
or (a[i] > a[i + 1] and t[i] < a[i])):
print(0)
break
elif t[i - 1] == t[i] and a[i] == a[i + 1]:
ans = ans * min(t[i], a[i]) % mod
else:
print(ans)
|
[
7,
15,
13,
15,
13,
15,
15,
4,
18,
13,
13,
17,
15,
15,
15,
15,
15,
15,
15,
0,
13,
2,
2,
17,
17,
17,
0,
13,
4,
13,
17,
12,
13,
12,
13,
0,
13,
4,
13,
0,
13,
4,
13,
0,
13,
4,
13,
0,
13,
2,
39,
17,
13,
0,
13,
2,
39,
17,
13,
14,
40,
18,
13,
17,
18,
13,
17,
4,
13,
17,
4,
13,
28,
13,
4,
13,
17,
13,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
18,
13,
13,
17,
28,
13,
18,
4,
13,
17,
13,
39,
17,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
18,
13,
2,
13,
17,
17,
0,
13,
17,
28,
13,
4,
13,
17,
2,
13,
17,
14,
2,
2,
18,
13,
13,
17,
2,
18,
13,
13,
17,
14,
40,
18,
13,
13,
18,
13,
13,
4,
13,
17,
4,
13,
14,
2,
18,
13,
13,
17,
14,
2,
18,
13,
13,
18,
13,
13,
4,
13,
17,
4,
13,
14,
2,
18,
13,
13,
17,
14,
2,
18,
13,
13,
18,
13,
13,
4,
13,
17,
4,
13,
0,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
13,
13,
4,
13,
13,
10,
4,
13,
10,
2,
13,
10,
17,
13,
10,
4,
13,
10,
13,
13,
10,
4,
13,
10,
4,
13,
10,
4,
13,
10,
2,
13,
10,
12,
13,
10,
12,
13,
10,
2,
13
] |
[
[
213,
20
],
[
219,
27
],
[
210,
36
],
[
241,
38
],
[
225,
40
],
[
238,
42
],
[
228,
44
],
[
238,
46
],
[
234,
48
],
[
211,
52
],
[
243,
54
],
[
211,
58
],
[
229,
62
],
[
226,
65
],
[
74,
73
],
[
211,
77
],
[
226,
81
],
[
73,
82
],
[
226,
84
],
[
73,
86
],
[
92,
89
],
[
235,
90
],
[
73,
91
],
[
95,
94
],
[
211,
99
],
[
229,
105
],
[
94,
106
],
[
229,
108
],
[
94,
110
],
[
118,
113
],
[
244,
114
],
[
94,
116
],
[
216,
120
],
[
124,
123
],
[
211,
128
],
[
89,
133
],
[
235,
134
],
[
123,
135
],
[
244,
139
],
[
123,
140
],
[
226,
145
],
[
123,
146
],
[
229,
148
],
[
123,
149
],
[
89,
157
],
[
235,
158
],
[
123,
159
],
[
229,
164
],
[
123,
165
],
[
226,
167
],
[
123,
168
],
[
244,
177
],
[
123,
178
],
[
229,
183
],
[
123,
184
],
[
226,
186
],
[
123,
187
],
[
231,
194
],
[
226,
198
],
[
123,
199
],
[
229,
201
],
[
123,
202
],
[
222,
204
],
[
214,
205
],
[
223,
208
],
[
232,
208
],
[
217,
208
],
[
210,
211
],
[
213,
214
],
[
216,
217
],
[
219,
220
],
[
214,
222
],
[
222,
223
],
[
225,
226
],
[
228,
229
],
[
231,
232
],
[
234,
235
],
[
243,
244
]
] |
[
"#!/usr/bin/env python3\n#CODEFESTIVAL2016 qualC C\n\nimport sys\nimport math\nfrom bisect import bisect_right as br\nfrom bisect import bisect_left as bl\nsys.setrecursionlimit(1000000000)\nfrom heapq import heappush, heappop,heappushpop\nfrom collections import defaultdict\nfrom itertools import accumulate\nfrom collections import Counter\nfrom collections import deque\nfrom operator import itemgetter\nfrom itertools import permutations\nmod = 10**9 + 7\ninf = float('inf')\ndef I(): return int(sys.stdin.readline())\ndef LI(): return list(map(int,sys.stdin.readline().split()))\n\nn = I()\nt = LI()\na = LI()\nx = [0]*n\ny = [0]*n\nif a[0] != t[-1]:\n print(0)\n quit()\nfor i in range(1,n):\n if t[i] > t[i-1]:\n x[i] = 1\nfor i in range(1,n)[::-1]:\n if a[i] < a[i-1]:\n y[i-1] = 1\nans = 1\nfor i in range(1,n-1):\n if x[i] == 1 and y[i] == 1:\n if t[i] != a[i]:\n print(0)\n quit()\n elif x[i] == 1:\n if a[i] < t[i]:\n print(0)\n quit()\n elif y[i] == 1:\n if a[i] > t[i]:\n print(0)\n quit()\n else:\n ans *= min(t[i],a[i])\n ans %= mod\nprint(ans)",
"import sys",
"sys",
"import math",
"math",
"from bisect import bisect_right as br",
"from bisect import bisect_left as bl",
"sys.setrecursionlimit(1000000000)",
"sys.setrecursionlimit",
"sys",
"setrecursionlimit",
"1000000000",
"from heapq import heappush, heappop,heappushpop",
"from collections import defaultdict",
"from itertools import accumulate",
"from collections import Counter",
"from collections import deque",
"from operator import itemgetter",
"from itertools import permutations",
"mod = 10**9 + 7",
"mod",
"10**9 + 7",
"10**9",
"10",
"9",
"7",
"inf = float('inf')",
"inf",
"float('inf')",
"float",
"'inf'",
"def I(): return int(sys.stdin.readline())",
"I",
"def LI(): return list(map(int,sys.stdin.readline().split()))",
"LI",
"n = I()",
"n",
"I()",
"I",
"t = LI()",
"t",
"LI()",
"LI",
"a = LI()",
"a",
"LI()",
"LI",
"x = [0]*n",
"x",
"[0]*n",
"[0]",
"0",
"n",
"y = [0]*n",
"y",
"[0]*n",
"[0]",
"0",
"n",
"if a[0] != t[-1]:\n print(0)\n quit()",
"a[0] != t[-1]",
"a[0]",
"a",
"0",
"t[-1]",
"t",
"-1",
"print(0)",
"print",
"0",
"quit()",
"quit",
"for i in range(1,n):\n if t[i] > t[i-1]:\n x[i] = 1",
"i",
"range(1,n)",
"range",
"1",
"n",
"if t[i] > t[i-1]:\n x[i] = 1",
"t[i] > t[i-1]",
"t[i]",
"t",
"i",
"t[i-1]",
"t",
"i-1",
"i",
"1",
"x[i] = 1",
"x[i]",
"x",
"i",
"1",
"for i in range(1,n)[::-1]:\n if a[i] < a[i-1]:\n y[i-1] = 1",
"i",
"range(1,n)[::-1]",
"(1,n)",
"range",
"1",
"n",
"::-1",
"-1",
"if a[i] < a[i-1]:\n y[i-1] = 1",
"a[i] < a[i-1]",
"a[i]",
"a",
"i",
"a[i-1]",
"a",
"i-1",
"i",
"1",
"y[i-1] = 1",
"y[i-1]",
"y",
"i-1",
"i",
"1",
"1",
"ans = 1",
"ans",
"1",
"for i in range(1,n-1):\n if x[i] == 1 and y[i] == 1:\n if t[i] != a[i]:\n print(0)\n quit()\n elif x[i] == 1:\n if a[i] < t[i]:\n print(0)\n quit()\n elif y[i] == 1:\n if a[i] > t[i]:\n print(0)\n quit()\n else:\n ans *= min(t[i],a[i])\n ans %= mod",
"i",
"range(1,n-1)",
"range",
"1",
"n-1",
"n",
"1",
"if x[i] == 1 and y[i] == 1:\n if t[i] != a[i]:\n print(0)\n quit()\n elif x[i] == 1:\n if a[i] < t[i]:\n print(0)\n quit()\n elif y[i] == 1:\n if a[i] > t[i]:\n print(0)\n quit()\n else:\n ans *= min(t[i],a[i])\n ans %= mod",
"x[i] == 1 and y[i] == 1",
"x[i] == 1",
"x[i]",
"x",
"i",
"1",
"y[i] == 1",
"y[i]",
"y",
"i",
"1",
"if t[i] != a[i]:\n print(0)\n quit()\n ",
"t[i] != a[i]",
"t[i]",
"t",
"i",
"a[i]",
"a",
"i",
"print(0)",
"print",
"0",
"quit()",
"quit",
"elif x[i] == 1:\n if a[i] < t[i]:\n print(0)\n quit()\n ",
"x[i] == 1",
"x[i]",
"x",
"i",
"1",
"if a[i] < t[i]:\n print(0)\n quit()\n ",
"a[i] < t[i]",
"a[i]",
"a",
"i",
"t[i]",
"t",
"i",
"print(0)",
"print",
"0",
"quit()",
"quit",
"elif y[i] == 1:\n if a[i] > t[i]:\n print(0)\n quit()\n ",
"y[i] == 1",
"y[i]",
"y",
"i",
"1",
"if a[i] > t[i]:\n print(0)\n quit()\n ",
"a[i] > t[i]",
"a[i]",
"a",
"i",
"t[i]",
"t",
"i",
"print(0)",
"print",
"0",
"quit()",
"quit",
"ans *= min(t[i],a[i])",
"ans",
"min(t[i],a[i])",
"min",
"t[i]",
"t",
"i",
"a[i]",
"a",
"i",
"ans %= mod",
"ans",
"mod",
"print(ans)",
"print",
"ans",
"n = I()",
"I()",
"n",
"mod = 10**9 + 7",
"10**9 + 7",
"mod",
"ans = 1",
"1",
"ans",
"inf = float('inf')",
"float('inf')",
"inf",
"ans %= mod",
"mod",
"ans",
"t = LI()",
"LI()",
"t",
"a = LI()",
"LI()",
"a",
"ans *= min(t[i],a[i])",
"min(t[i],a[i])",
"ans",
"x = [0]*n",
"[0]*n",
"x",
"def LI(): return list(map(int,sys.stdin.readline().split()))",
"def LI(): return list(map(int,sys.stdin.readline().split()))",
"LI",
"def I(): return int(sys.stdin.readline())",
"def I(): return int(sys.stdin.readline())",
"I",
"y = [0]*n",
"[0]*n",
"y"
] |
#!/usr/bin/env python3
#CODEFESTIVAL2016 qualC C
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
n = I()
t = LI()
a = LI()
x = [0]*n
y = [0]*n
if a[0] != t[-1]:
print(0)
quit()
for i in range(1,n):
if t[i] > t[i-1]:
x[i] = 1
for i in range(1,n)[::-1]:
if a[i] < a[i-1]:
y[i-1] = 1
ans = 1
for i in range(1,n-1):
if x[i] == 1 and y[i] == 1:
if t[i] != a[i]:
print(0)
quit()
elif x[i] == 1:
if a[i] < t[i]:
print(0)
quit()
elif y[i] == 1:
if a[i] > t[i]:
print(0)
quit()
else:
ans *= min(t[i],a[i])
ans %= mod
print(ans)
|
[
7,
12,
13,
15,
15,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
18,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
39,
17,
41,
28,
13,
4,
13,
13,
4,
17,
0,
13,
13,
41,
28,
13,
4,
13,
13,
4,
17,
0,
13,
13,
0,
13,
17,
14,
40,
4,
13,
13,
4,
13,
13,
4,
13,
17,
4,
13,
14,
2,
4,
13,
13,
4,
13,
13,
2,
2,
13,
4,
13,
13,
4,
13,
13,
17,
4,
13,
17,
4,
13,
28,
13,
4,
13,
17,
13,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
18,
13,
13,
18,
13,
13,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
18,
13,
13,
18,
13,
13,
28,
13,
13,
4,
13,
13,
18,
13,
39,
17,
0,
13,
4,
13,
13,
13,
0,
13,
2,
2,
17,
17,
17,
4,
13,
13,
14,
2,
13,
17,
4,
13,
10,
12,
13
] |
[
[
7,
6
],
[
13,
12
],
[
25,
24
],
[
41,
40
],
[
6,
43
],
[
48,
47
],
[
52,
51
],
[
6,
54
],
[
59,
58
],
[
62,
61
],
[
12,
67
],
[
24,
70
],
[
12,
80
],
[
12,
83
],
[
6,
86
],
[
24,
89
],
[
24,
92
],
[
101,
100
],
[
6,
104
],
[
12,
108
],
[
100,
109
],
[
12,
111
],
[
100,
113
],
[
119,
116
],
[
47,
117
],
[
100,
118
],
[
12,
120
],
[
100,
121
],
[
24,
125
],
[
100,
126
],
[
24,
128
],
[
100,
130
],
[
136,
133
],
[
58,
134
],
[
100,
135
],
[
24,
137
],
[
100,
138
],
[
47,
144
],
[
58,
146
],
[
151,
150
],
[
157,
156
],
[
156,
164
],
[
150,
164
],
[
61,
164
],
[
173,
170
]
] |
[
"# -*- coding: utf-8 -*-\n\n\ndef main():\n from bisect import bisect_right\n from bisect import bisect_left\n\n n = int(input())\n t = list(map(int, input().split()))\n a = list(map(int, input().split()))[::-1]\n t_candidates = [1 for _ in range(n)]\n a_candidates = [1 for _ in range(n)]\n ans = 1\n\n if max(t) != max(a):\n print(0)\n exit()\n else:\n if bisect_left(t, max(t)) > (n - bisect_left(a, max(a)) - 1):\n print(0)\n exit()\n\n for i in range(1, n):\n if t[i] == t[i - 1]:\n t_candidates[i] = t[i]\n\n if a[i] == a[i - 1]:\n a_candidates[i] = a[i]\n\n for t_candidate, a_candidate in zip(t_candidates, a_candidates[::-1]):\n ans *= min(t_candidate, a_candidate)\n ans %= 10 ** 9 + 7\n\n print(ans)\n\n\nif __name__ == '__main__':\n main()",
"def main():\n from bisect import bisect_right\n from bisect import bisect_left\n\n n = int(input())\n t = list(map(int, input().split()))\n a = list(map(int, input().split()))[::-1]\n t_candidates = [1 for _ in range(n)]\n a_candidates = [1 for _ in range(n)]\n ans = 1\n\n if max(t) != max(a):\n print(0)\n exit()\n else:\n if bisect_left(t, max(t)) > (n - bisect_left(a, max(a)) - 1):\n print(0)\n exit()\n\n for i in range(1, n):\n if t[i] == t[i - 1]:\n t_candidates[i] = t[i]\n\n if a[i] == a[i - 1]:\n a_candidates[i] = a[i]\n\n for t_candidate, a_candidate in zip(t_candidates, a_candidates[::-1]):\n ans *= min(t_candidate, a_candidate)\n ans %= 10 ** 9 + 7\n\n print(ans)",
"main",
"from bisect import bisect_right",
"from bisect import bisect_left",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"t = list(map(int, input().split()))",
"t",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"a = list(map(int, input().split()))[::-1]",
"a",
"list(map(int, input().split()))[::-1]",
"(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"::-1",
"-1",
"1 for _ in range(n)",
"for _ in range(n)",
"_",
"range(n)",
"range",
"n",
"for _ in range(n)",
"1",
"t_candidates = [1 for _ in range(n)]",
"t_candidates",
"[1 for _ in range(n)]",
"1 for _ in range(n)",
"for _ in range(n)",
"_",
"range(n)",
"range",
"n",
"for _ in range(n)",
"1",
"a_candidates = [1 for _ in range(n)]",
"a_candidates",
"[1 for _ in range(n)]",
"ans = 1",
"ans",
"1",
"if max(t) != max(a):\n print(0)\n exit()\n else:\n if bisect_left(t, max(t)) > (n - bisect_left(a, max(a)) - 1):\n print(0)\n exit()\n\n ",
"max(t) != max(a)",
"max(t)",
"max",
"t",
"max(a)",
"max",
"a",
"print(0)",
"print",
"0",
"exit()",
"exit",
"if bisect_left(t, max(t)) > (n - bisect_left(a, max(a)) - 1):\n print(0)\n exit()\n\n ",
"bisect_left(t, max(t)) > (n - bisect_left(a, max(a)) - 1)",
"bisect_left(t, max(t))",
"bisect_left",
"t",
"max(t)",
"max",
"t",
"n - bisect_left(a, max(a)) - 1",
"n - bisect_left(a, max(a))",
"n",
"bisect_left(a, max(a))",
"bisect_left",
"a",
"max(a)",
"max",
"a",
"1",
"print(0)",
"print",
"0",
"exit()",
"exit",
"for i in range(1, n):\n if t[i] == t[i - 1]:\n t_candidates[i] = t[i]\n\n if a[i] == a[i - 1]:\n a_candidates[i] = a[i]\n\n ",
"i",
"range(1, n)",
"range",
"1",
"n",
"if t[i] == t[i - 1]:\n t_candidates[i] = t[i]\n\n ",
"t[i] == t[i - 1]",
"t[i]",
"t",
"i",
"t[i - 1]",
"t",
"i - 1",
"i",
"1",
"t_candidates[i] = t[i]",
"t_candidates[i]",
"t_candidates",
"i",
"t[i]",
"t",
"i",
"if a[i] == a[i - 1]:\n a_candidates[i] = a[i]\n\n ",
"a[i] == a[i - 1]",
"a[i]",
"a",
"i",
"a[i - 1]",
"a",
"i - 1",
"i",
"1",
"a_candidates[i] = a[i]",
"a_candidates[i]",
"a_candidates",
"i",
"a[i]",
"a",
"i",
"for t_candidate, a_candidate in zip(t_candidates, a_candidates[::-1]):\n ans *= min(t_candidate, a_candidate)\n ans %= 10 ** 9 + 7\n\n ",
"t_candidate",
"a_candidate",
"zip(t_candidates, a_candidates[::-1])",
"zip",
"t_candidates",
"a_candidates[::-1]",
"a_candidates",
"::-1",
"-1",
"ans *= min(t_candidate, a_candidate)",
"ans",
"min(t_candidate, a_candidate)",
"min",
"t_candidate",
"a_candidate",
"ans %= 10 ** 9 + 7",
"ans",
"10 ** 9 + 7",
"10 ** 9",
"10",
"9",
"7",
"print(ans)",
"print",
"ans",
"if __name__ == '__main__':\n main()",
"__name__ == '__main__'",
"__name__",
"'__main__'",
"main()",
"main",
"def main():\n from bisect import bisect_right\n from bisect import bisect_left\n\n n = int(input())\n t = list(map(int, input().split()))\n a = list(map(int, input().split()))[::-1]\n t_candidates = [1 for _ in range(n)]\n a_candidates = [1 for _ in range(n)]\n ans = 1\n\n if max(t) != max(a):\n print(0)\n exit()\n else:\n if bisect_left(t, max(t)) > (n - bisect_left(a, max(a)) - 1):\n print(0)\n exit()\n\n for i in range(1, n):\n if t[i] == t[i - 1]:\n t_candidates[i] = t[i]\n\n if a[i] == a[i - 1]:\n a_candidates[i] = a[i]\n\n for t_candidate, a_candidate in zip(t_candidates, a_candidates[::-1]):\n ans *= min(t_candidate, a_candidate)\n ans %= 10 ** 9 + 7\n\n print(ans)",
"def main():\n from bisect import bisect_right\n from bisect import bisect_left\n\n n = int(input())\n t = list(map(int, input().split()))\n a = list(map(int, input().split()))[::-1]\n t_candidates = [1 for _ in range(n)]\n a_candidates = [1 for _ in range(n)]\n ans = 1\n\n if max(t) != max(a):\n print(0)\n exit()\n else:\n if bisect_left(t, max(t)) > (n - bisect_left(a, max(a)) - 1):\n print(0)\n exit()\n\n for i in range(1, n):\n if t[i] == t[i - 1]:\n t_candidates[i] = t[i]\n\n if a[i] == a[i - 1]:\n a_candidates[i] = a[i]\n\n for t_candidate, a_candidate in zip(t_candidates, a_candidates[::-1]):\n ans *= min(t_candidate, a_candidate)\n ans %= 10 ** 9 + 7\n\n print(ans)",
"main"
] |
# -*- coding: utf-8 -*-
def main():
from bisect import bisect_right
from bisect import bisect_left
n = int(input())
t = list(map(int, input().split()))
a = list(map(int, input().split()))[::-1]
t_candidates = [1 for _ in range(n)]
a_candidates = [1 for _ in range(n)]
ans = 1
if max(t) != max(a):
print(0)
exit()
else:
if bisect_left(t, max(t)) > (n - bisect_left(a, max(a)) - 1):
print(0)
exit()
for i in range(1, n):
if t[i] == t[i - 1]:
t_candidates[i] = t[i]
if a[i] == a[i - 1]:
a_candidates[i] = a[i]
for t_candidate, a_candidate in zip(t_candidates, a_candidates[::-1]):
ans *= min(t_candidate, a_candidate)
ans %= 10 ** 9 + 7
print(ans)
if __name__ == '__main__':
main()
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
2,
39,
17,
13,
0,
18,
13,
17,
17,
14,
2,
13,
17,
14,
40,
18,
13,
17,
18,
13,
17,
4,
13,
17,
4,
13,
28,
13,
4,
13,
17,
13,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
18,
13,
13,
17,
0,
13,
18,
13,
39,
17,
0,
13,
17,
28,
13,
4,
13,
17,
13,
0,
13,
2,
2,
13,
13,
17,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
14,
2,
18,
13,
13,
18,
13,
13,
4,
13,
17,
4,
13,
14,
2,
18,
13,
13,
17,
14,
40,
18,
13,
13,
18,
13,
13,
4,
13,
17,
4,
13,
14,
2,
18,
13,
13,
17,
14,
2,
18,
13,
13,
18,
13,
13,
4,
13,
17,
4,
13,
0,
13,
2,
2,
13,
4,
13,
18,
13,
13,
18,
13,
13,
2,
2,
17,
17,
17,
4,
13,
2,
13,
2,
2,
17,
17,
17,
10,
4,
13,
10,
17,
13,
10,
2,
13,
10,
4,
13,
10,
2,
13,
10,
2,
13,
10,
4,
13,
10,
18,
13
] |
[
[
209,
2
],
[
191,
8
],
[
200,
20
],
[
206,
32
],
[
210,
36
],
[
41,
38
],
[
207,
39
],
[
210,
44
],
[
192,
49
],
[
201,
52
],
[
61,
60
],
[
210,
64
],
[
192,
68
],
[
60,
69
],
[
192,
71
],
[
60,
73
],
[
79,
76
],
[
207,
77
],
[
60,
78
],
[
212,
81
],
[
201,
83
],
[
194,
87
],
[
91,
90
],
[
210,
94
],
[
197,
96
],
[
210,
99
],
[
90,
100
],
[
213,
105
],
[
201,
105
],
[
90,
106
],
[
213,
108
],
[
201,
108
],
[
90,
110
],
[
213,
115
],
[
201,
115
],
[
90,
116
],
[
192,
118
],
[
198,
119
],
[
207,
128
],
[
198,
129
],
[
213,
134
],
[
201,
134
],
[
90,
135
],
[
192,
137
],
[
198,
138
],
[
207,
147
],
[
198,
148
],
[
192,
153
],
[
198,
154
],
[
213,
156
],
[
201,
156
],
[
90,
157
],
[
203,
164
],
[
195,
167
],
[
204,
167
],
[
213,
171
],
[
201,
171
],
[
90,
172
],
[
192,
174
],
[
198,
175
],
[
204,
184
],
[
195,
184
],
[
191,
192
],
[
194,
195
],
[
197,
198
],
[
200,
201
],
[
203,
204
],
[
206,
207
],
[
209,
210
],
[
212,
213
]
] |
[
"n=int(input())\n\nt=list(map(int,input().split()))\na=list(map(int,input().split()))\n#nは10**5以下\n\nkakute=[0]*n\nkakute[0]=1\n\nif n==1:\n if t[0]!=a[0]:\n print(0)\n exit()\n\nfor i in range(1,n):\n if t[i]>t[i-1]:\n kakute[i]=1\n\na=a[::-1]\nans=1\n\nfor i in range(1,n):\n index=n-i-1\n #青木が確定したとき\n if a[i]>a[i-1]:\n #矛盾ないか\n if a[i]>t[index]:\n print(0)\n exit()\n #青木＆高橋確定\n elif kakute[index]==1:\n if a[i] != t[index]:\n print(0)\n exit()\n #青木は確定じゃない\n else:\n #高橋確定\n if kakute[index]==1:\n if t[index]>a[i]:\n print(0)\n exit()\n #誰も確定していない\n else:\n ans=ans*min(a[i],t[index])%(10**9+7)\n\nprint(ans%(10**9+7))\n\n\n \n\n \n\n\n\n\n\n\n",
"n=int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"t=list(map(int,input().split()))",
"t",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"a=list(map(int,input().split()))",
"a",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"kakute=[0]*n",
"kakute",
"[0]*n",
"[0]",
"0",
"n",
"kakute[0]=1",
"kakute[0]",
"kakute",
"0",
"1",
"if n==1:\n if t[0]!=a[0]:\n print(0)\n exit()",
"n==1",
"n",
"1",
"if t[0]!=a[0]:\n print(0)\n exit()",
"t[0]!=a[0]",
"t[0]",
"t",
"0",
"a[0]",
"a",
"0",
"print(0)",
"print",
"0",
"exit()",
"exit",
"for i in range(1,n):\n if t[i]>t[i-1]:\n kakute[i]=1",
"i",
"range(1,n)",
"range",
"1",
"n",
"if t[i]>t[i-1]:\n kakute[i]=1",
"t[i]>t[i-1]",
"t[i]",
"t",
"i",
"t[i-1]",
"t",
"i-1",
"i",
"1",
"kakute[i]=1",
"kakute[i]",
"kakute",
"i",
"1",
"a=a[::-1]",
"a",
"a[::-1]",
"a",
"::-1",
"-1",
"ans=1",
"ans",
"1",
"for i in range(1,n):\n index=n-i-1\n #青木が確定したとき\n if a[i]>a[i-1]:\n #矛盾ないか\n if a[i]>t[index]:\n print(0)\n exit()\n #青木＆高橋確定\n elif kakute[index]==1:\n if a[i] != t[index]:\n print(0)\n exit()\n #青木は確定じゃない\n else:\n #高橋確定\n if kakute[index]==1:\n if t[index]>a[i]:\n print(0)\n exit()\n #誰も確定していない\n else:\n ans=ans*min(a[i],t[index])%(10**9+7)",
"i",
"range(1,n)",
"range",
"1",
"n",
"index=n-i-1",
"index",
"n-i-1",
"n-i",
"n",
"i",
"1",
"if a[i]>a[i-1]:\n #矛盾ないか\n if a[i]>t[index]:\n print(0)\n exit()\n #青木＆高橋確定\n elif kakute[index]==1:\n if a[i] != t[index]:\n print(0)\n exit()\n #青木は確定じゃない\n else:\n #高橋確定\n if kakute[index]==1:\n if t[index]>a[i]:\n print(0)\n exit()\n #誰も確定していない\n else:\n ans=ans*min(a[i],t[index])%(10**9+7)",
"a[i]>a[i-1]",
"a[i]",
"a",
"i",
"a[i-1]",
"a",
"i-1",
"i",
"1",
"if a[i]>t[index]:\n print(0)\n exit()\n #青木＆高橋確定\n elif kakute[index]==1:\n if a[i] != t[index]:\n print(0)\n exit()\n #青木は確定じゃない\n ",
"a[i]>t[index]",
"a[i]",
"a",
"i",
"t[index]",
"t",
"index",
"print(0)",
"print",
"0",
"exit()",
"exit",
"elif kakute[index]==1:\n if a[i] != t[index]:\n print(0)\n exit()\n #青木は確定じゃない\n ",
"kakute[index]==1",
"kakute[index]",
"kakute",
"index",
"1",
"if a[i] != t[index]:\n print(0)\n exit()\n #青木は確定じゃない\n ",
"a[i] != t[index]",
"a[i]",
"a",
"i",
"t[index]",
"t",
"index",
"print(0)",
"print",
"0",
"exit()",
"exit",
"if kakute[index]==1:\n if t[index]>a[i]:\n print(0)\n exit()\n #誰も確定していない\n else:\n ans=ans*min(a[i],t[index])%(10**9+7)",
"kakute[index]==1",
"kakute[index]",
"kakute",
"index",
"1",
"if t[index]>a[i]:\n print(0)\n exit()\n #誰も確定していない\n ",
"t[index]>a[i]",
"t[index]",
"t",
"index",
"a[i]",
"a",
"i",
"print(0)",
"print",
"0",
"exit()",
"exit",
"ans=ans*min(a[i],t[index])%(10**9+7)",
"ans",
"ans*min(a[i],t[index])%(10**9+7)",
"ans*min(a[i],t[index])",
"ans",
"min(a[i],t[index])",
"min",
"a[i]",
"a",
"i",
"t[index]",
"t",
"index",
"10**9+7",
"10**9",
"10",
"9",
"7",
"print(ans%(10**9+7))",
"print",
"ans%(10**9+7)",
"ans",
"10**9+7",
"10**9",
"10",
"9",
"7",
"t=list(map(int,input().split()))",
"list(map(int,input().split()))",
"t",
"ans=1",
"1",
"ans",
"index=n-i-1",
"n-i-1",
"index",
"a=list(map(int,input().split()))",
"list(map(int,input().split()))",
"a",
"ans=ans*min(a[i],t[index])%(10**9+7)",
"ans*min(a[i],t[index])%(10**9+7)",
"ans",
"kakute=[0]*n",
"[0]*n",
"kakute",
"n=int(input())",
"int(input())",
"n",
"a=a[::-1]",
"a[::-1]",
"a"
] |
n=int(input())
t=list(map(int,input().split()))
a=list(map(int,input().split()))
#nは10**5以下
kakute=[0]*n
kakute[0]=1
if n==1:
if t[0]!=a[0]:
print(0)
exit()
for i in range(1,n):
if t[i]>t[i-1]:
kakute[i]=1
a=a[::-1]
ans=1
for i in range(1,n):
index=n-i-1
#青木が確定したとき
if a[i]>a[i-1]:
#矛盾ないか
if a[i]>t[index]:
print(0)
exit()
#青木＆高橋確定
elif kakute[index]==1:
if a[i] != t[index]:
print(0)
exit()
#青木は確定じゃない
else:
#高橋確定
if kakute[index]==1:
if t[index]>a[i]:
print(0)
exit()
#誰も確定していない
else:
ans=ans*min(a[i],t[index])%(10**9+7)
print(ans%(10**9+7))
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
41,
28,
13,
4,
13,
13,
4,
39,
17,
2,
17,
17,
0,
13,
13,
28,
13,
4,
13,
13,
14,
2,
13,
17,
0,
18,
18,
13,
13,
17,
18,
13,
13,
14,
40,
18,
13,
13,
18,
13,
2,
13,
17,
0,
18,
18,
13,
13,
17,
18,
13,
13,
0,
18,
18,
13,
13,
17,
18,
13,
13,
28,
13,
4,
13,
2,
13,
17,
17,
17,
14,
2,
13,
2,
13,
17,
14,
2,
40,
18,
18,
13,
13,
17,
17,
40,
18,
18,
13,
13,
17,
18,
13,
13,
4,
13,
17,
4,
13,
17,
14,
40,
18,
18,
13,
13,
17,
18,
13,
13,
0,
18,
18,
13,
13,
17,
18,
13,
13,
4,
13,
17,
4,
13,
17,
14,
40,
18,
13,
13,
18,
13,
2,
13,
17,
14,
2,
40,
18,
18,
13,
13,
17,
17,
40,
18,
18,
13,
13,
17,
18,
13,
13,
4,
13,
17,
4,
13,
17,
14,
40,
18,
13,
13,
18,
18,
13,
13,
17,
0,
18,
18,
13,
13,
17,
18,
13,
13,
4,
13,
17,
4,
13,
17,
0,
18,
18,
13,
13,
17,
4,
13,
18,
18,
13,
13,
17,
18,
13,
13,
0,
13,
17,
0,
13,
2,
2,
17,
17,
17,
28,
13,
13,
13,
14,
2,
13,
17,
0,
13,
13,
0,
13,
13,
4,
13,
13,
10,
4,
13,
10,
13,
13,
10,
13,
13,
10,
4,
13,
10,
2,
13,
10,
4,
13,
10,
13,
13,
10,
17,
13
] |
[
[
259,
2
],
[
268,
8
],
[
274,
20
],
[
34,
33
],
[
260,
36
],
[
265,
44
],
[
48,
47
],
[
260,
50
],
[
47,
53
],
[
61,
56
],
[
266,
58
],
[
47,
59
],
[
269,
62
],
[
47,
63
],
[
269,
67
],
[
47,
68
],
[
269,
70
],
[
47,
72
],
[
80,
75
],
[
266,
77
],
[
47,
78
],
[
269,
81
],
[
47,
82
],
[
89,
84
],
[
266,
86
],
[
47,
87
],
[
269,
90
],
[
47,
91
],
[
94,
93
],
[
260,
97
],
[
93,
103
],
[
260,
105
],
[
266,
112
],
[
93,
113
],
[
266,
119
],
[
93,
120
],
[
275,
123
],
[
93,
124
],
[
266,
135
],
[
93,
136
],
[
275,
139
],
[
93,
140
],
[
147,
142
],
[
266,
144
],
[
93,
145
],
[
275,
148
],
[
93,
149
],
[
275,
159
],
[
93,
160
],
[
275,
162
],
[
93,
164
],
[
266,
171
],
[
93,
172
],
[
266,
178
],
[
93,
179
],
[
275,
182
],
[
93,
183
],
[
275,
193
],
[
93,
194
],
[
266,
197
],
[
93,
198
],
[
206,
201
],
[
266,
203
],
[
93,
204
],
[
275,
207
],
[
93,
208
],
[
221,
216
],
[
266,
218
],
[
93,
219
],
[
266,
225
],
[
93,
226
],
[
275,
229
],
[
93,
230
],
[
280,
232
],
[
271,
235
],
[
277,
250
],
[
262,
253
],
[
272,
254
],
[
263,
257
],
[
278,
257
],
[
281,
257
],
[
259,
260
],
[
272,
262
],
[
262,
263
],
[
265,
266
],
[
268,
269
],
[
271,
272
],
[
274,
275
],
[
277,
278
],
[
280,
281
]
] |
[
"N = int(input())\nT = list(map(int, input().split()))\nA = list(map(int, input().split()))\n\nM = [[-1, 10**9] for i in range(N)]\n\nfor i in range(N):\n if i == 0:\n M[i][0] = T[i]\n else:\n if T[i] != T[i-1]:\n M[i][0] = T[i]\n else:\n M[i][1] = T[i]\n\nfor i in range(N-1, -1, -1):\n if i == N-1:\n if M[i][0] != -1 and M[i][0] != A[i]:\n print(0)\n exit(0)\n else:\n if M[i][1] >= A[i]:\n M[i][0] = A[i]\n else:\n print(0)\n exit(0)\n\n else:\n if A[i] != A[i+1]:\n if M[i][0] != -1 and M[i][0] != A[i]:\n print(0)\n exit(0)\n else:\n if A[i] <= M[i][1]:\n M[i][0] = A[i]\n else:\n print(0)\n exit(0)\n else:\n M[i][1] = min(M[i][1], A[i])\nans = 1\nmod = (10 ** 9) + 7\nfor x, y in M:\n if x == -1:\n ans *= y\n ans %= mod\n\nprint(ans)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"T = list(map(int, input().split()))",
"T",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"A = list(map(int, input().split()))",
"A",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"[-1, 10**9] for i in range(N)",
"for i in range(N)",
"i",
"range(N)",
"range",
"N",
"for i in range(N)",
"[-1, 10**9]",
"-1",
"10**9",
"10",
"9",
"M = [[-1, 10**9] for i in range(N)]",
"M",
"[[-1, 10**9] for i in range(N)]",
"for i in range(N):\n if i == 0:\n M[i][0] = T[i]\n else:\n if T[i] != T[i-1]:\n M[i][0] = T[i]\n else:\n M[i][1] = T[i]",
"i",
"range(N)",
"range",
"N",
"if i == 0:\n M[i][0] = T[i]\n else:\n if T[i] != T[i-1]:\n M[i][0] = T[i]\n else:\n M[i][1] = T[i]",
"i == 0",
"i",
"0",
"M[i][0] = T[i]",
"M[i][0]",
"[i]",
"M",
"i",
"0",
"T[i]",
"T",
"i",
"if T[i] != T[i-1]:\n M[i][0] = T[i]\n else:\n M[i][1] = T[i]",
"T[i] != T[i-1]",
"T[i]",
"T",
"i",
"T[i-1]",
"T",
"i-1",
"i",
"1",
"M[i][0] = T[i]",
"M[i][0]",
"[i]",
"M",
"i",
"0",
"T[i]",
"T",
"i",
"M[i][1] = T[i]",
"M[i][1]",
"[i]",
"M",
"i",
"1",
"T[i]",
"T",
"i",
"for i in range(N-1, -1, -1):\n if i == N-1:\n if M[i][0] != -1 and M[i][0] != A[i]:\n print(0)\n exit(0)\n else:\n if M[i][1] >= A[i]:\n M[i][0] = A[i]\n else:\n print(0)\n exit(0)\n\n else:\n if A[i] != A[i+1]:\n if M[i][0] != -1 and M[i][0] != A[i]:\n print(0)\n exit(0)\n else:\n if A[i] <= M[i][1]:\n M[i][0] = A[i]\n else:\n print(0)\n exit(0)\n else:\n M[i][1] = min(M[i][1], A[i])",
"i",
"range(N-1, -1, -1)",
"range",
"N-1",
"N",
"1",
"-1",
"-1",
"if i == N-1:\n if M[i][0] != -1 and M[i][0] != A[i]:\n print(0)\n exit(0)\n else:\n if M[i][1] >= A[i]:\n M[i][0] = A[i]\n else:\n print(0)\n exit(0)\n\n else:\n if A[i] != A[i+1]:\n if M[i][0] != -1 and M[i][0] != A[i]:\n print(0)\n exit(0)\n else:\n if A[i] <= M[i][1]:\n M[i][0] = A[i]\n else:\n print(0)\n exit(0)\n else:\n M[i][1] = min(M[i][1], A[i])",
"i == N-1",
"i",
"N-1",
"N",
"1",
"if M[i][0] != -1 and M[i][0] != A[i]:\n print(0)\n exit(0)\n else:\n if M[i][1] >= A[i]:\n M[i][0] = A[i]\n else:\n print(0)\n exit(0)\n\n ",
"M[i][0] != -1 and M[i][0] != A[i]",
"M[i][0] != -1",
"M[i][0]",
"[i]",
"M",
"i",
"0",
"-1",
"M[i][0] != A[i]",
"M[i][0]",
"[i]",
"M",
"i",
"0",
"A[i]",
"A",
"i",
"print(0)",
"print",
"0",
"exit(0)",
"exit",
"0",
"if M[i][1] >= A[i]:\n M[i][0] = A[i]\n else:\n print(0)\n exit(0)\n\n ",
"M[i][1] >= A[i]",
"M[i][1]",
"[i]",
"M",
"i",
"1",
"A[i]",
"A",
"i",
"M[i][0] = A[i]",
"M[i][0]",
"[i]",
"M",
"i",
"0",
"A[i]",
"A",
"i",
"print(0)",
"print",
"0",
"exit(0)",
"exit",
"0",
"if A[i] != A[i+1]:\n if M[i][0] != -1 and M[i][0] != A[i]:\n print(0)\n exit(0)\n else:\n if A[i] <= M[i][1]:\n M[i][0] = A[i]\n else:\n print(0)\n exit(0)\n else:\n M[i][1] = min(M[i][1], A[i])",
"A[i] != A[i+1]",
"A[i]",
"A",
"i",
"A[i+1]",
"A",
"i+1",
"i",
"1",
"if M[i][0] != -1 and M[i][0] != A[i]:\n print(0)\n exit(0)\n else:\n if A[i] <= M[i][1]:\n M[i][0] = A[i]\n else:\n print(0)\n exit(0)\n ",
"M[i][0] != -1 and M[i][0] != A[i]",
"M[i][0] != -1",
"M[i][0]",
"[i]",
"M",
"i",
"0",
"-1",
"M[i][0] != A[i]",
"M[i][0]",
"[i]",
"M",
"i",
"0",
"A[i]",
"A",
"i",
"print(0)",
"print",
"0",
"exit(0)",
"exit",
"0",
"if A[i] <= M[i][1]:\n M[i][0] = A[i]\n else:\n print(0)\n exit(0)\n ",
"A[i] <= M[i][1]",
"A[i]",
"A",
"i",
"M[i][1]",
"[i]",
"M",
"i",
"1",
"M[i][0] = A[i]",
"M[i][0]",
"[i]",
"M",
"i",
"0",
"A[i]",
"A",
"i",
"print(0)",
"print",
"0",
"exit(0)",
"exit",
"0",
"M[i][1] = min(M[i][1], A[i])",
"M[i][1]",
"[i]",
"M",
"i",
"1",
"min(M[i][1], A[i])",
"min",
"M[i][1]",
"[i]",
"M",
"i",
"1",
"A[i]",
"A",
"i",
"ans = 1",
"ans",
"1",
"mod = (10 ** 9) + 7",
"mod",
"(10 ** 9) + 7",
"10 ** 9",
"10",
"9",
"7",
"for x, y in M:\n if x == -1:\n ans *= y\n ans %= mod",
"x",
"y",
"M",
"if x == -1:\n ans *= y\n ans %= mod",
"x == -1",
"x",
"-1",
"ans *= y",
"ans",
"y",
"ans %= mod",
"ans",
"mod",
"print(ans)",
"print",
"ans",
"N = int(input())",
"int(input())",
"N",
"ans %= mod",
"mod",
"ans",
"M = [[-1, 10**9] for i in range(N)]",
"[[-1, 10**9] for i in range(N)]",
"M",
"T = list(map(int, input().split()))",
"list(map(int, input().split()))",
"T",
"mod = (10 ** 9) + 7",
"(10 ** 9) + 7",
"mod",
"A = list(map(int, input().split()))",
"list(map(int, input().split()))",
"A",
"ans *= y",
"y",
"ans",
"ans = 1",
"1",
"ans"
] |
N = int(input())
T = list(map(int, input().split()))
A = list(map(int, input().split()))
M = [[-1, 10**9] for i in range(N)]
for i in range(N):
if i == 0:
M[i][0] = T[i]
else:
if T[i] != T[i-1]:
M[i][0] = T[i]
else:
M[i][1] = T[i]
for i in range(N-1, -1, -1):
if i == N-1:
if M[i][0] != -1 and M[i][0] != A[i]:
print(0)
exit(0)
else:
if M[i][1] >= A[i]:
M[i][0] = A[i]
else:
print(0)
exit(0)
else:
if A[i] != A[i+1]:
if M[i][0] != -1 and M[i][0] != A[i]:
print(0)
exit(0)
else:
if A[i] <= M[i][1]:
M[i][0] = A[i]
else:
print(0)
exit(0)
else:
M[i][1] = min(M[i][1], A[i])
ans = 1
mod = (10 ** 9) + 7
for x, y in M:
if x == -1:
ans *= y
ans %= mod
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
0,
13,
13,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
0,
13,
13,
0,
13,
39,
0,
13,
39,
28,
13,
4,
13,
13,
14,
2,
13,
17,
4,
18,
13,
13,
39,
18,
13,
13,
17,
14,
2,
18,
13,
2,
13,
17,
18,
13,
13,
4,
18,
13,
13,
39,
18,
13,
13,
17,
14,
2,
18,
13,
2,
13,
17,
18,
13,
13,
4,
18,
13,
13,
39,
18,
13,
13,
18,
13,
13,
28,
13,
4,
13,
4,
13,
13,
14,
2,
13,
2,
13,
17,
4,
18,
13,
13,
39,
18,
13,
13,
17,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
4,
18,
13,
13,
39,
18,
13,
13,
17,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
4,
18,
13,
13,
39,
18,
13,
13,
18,
13,
13,
0,
13,
17,
0,
13,
2,
2,
17,
17,
17,
28,
13,
4,
13,
13,
14,
2,
2,
18,
18,
13,
13,
17,
18,
18,
13,
2,
40,
13,
17,
17,
2,
18,
18,
13,
13,
17,
17,
14,
40,
18,
18,
13,
13,
17,
18,
18,
13,
2,
40,
13,
17,
17,
4,
13,
17,
4,
13,
14,
2,
2,
2,
18,
18,
13,
13,
17,
18,
18,
13,
2,
40,
13,
17,
17,
2,
18,
18,
13,
13,
17,
17,
2,
2,
18,
18,
13,
13,
17,
18,
18,
13,
2,
40,
13,
17,
17,
2,
18,
18,
13,
2,
40,
13,
17,
17,
17,
4,
13,
17,
4,
13,
0,
13,
4,
13,
18,
18,
13,
13,
17,
18,
18,
13,
2,
40,
13,
17,
17,
0,
13,
13,
4,
13,
13,
10,
17,
13,
10,
13,
13,
10,
4,
13,
10,
2,
13,
10,
4,
13,
10,
39,
13,
10,
13,
13,
10,
13,
13,
10,
39,
13
] |
[
[
305,
2
],
[
10,
9
],
[
9,
18
],
[
320,
20
],
[
25,
24
],
[
24,
33
],
[
317,
35
],
[
323,
38
],
[
314,
41
],
[
45,
44
],
[
306,
47
],
[
44,
50
],
[
324,
54
],
[
321,
58
],
[
44,
59
],
[
321,
64
],
[
44,
66
],
[
321,
69
],
[
44,
70
],
[
324,
73
],
[
321,
77
],
[
44,
78
],
[
321,
83
],
[
44,
85
],
[
321,
88
],
[
44,
89
],
[
324,
92
],
[
321,
96
],
[
44,
97
],
[
321,
99
],
[
44,
100
],
[
103,
102
],
[
306,
107
],
[
102,
110
],
[
306,
112
],
[
315,
116
],
[
318,
120
],
[
102,
121
],
[
318,
126
],
[
102,
127
],
[
318,
129
],
[
102,
131
],
[
315,
135
],
[
318,
139
],
[
102,
140
],
[
318,
145
],
[
102,
146
],
[
318,
148
],
[
102,
150
],
[
315,
154
],
[
318,
158
],
[
102,
159
],
[
318,
161
],
[
102,
162
],
[
299,
164
],
[
308,
167
],
[
175,
174
],
[
306,
177
],
[
324,
183
],
[
174,
184
],
[
315,
188
],
[
174,
191
],
[
324,
197
],
[
174,
198
],
[
324,
205
],
[
174,
206
],
[
315,
210
],
[
174,
213
],
[
324,
227
],
[
174,
228
],
[
315,
232
],
[
174,
235
],
[
324,
241
],
[
174,
242
],
[
324,
249
],
[
174,
250
],
[
315,
254
],
[
174,
257
],
[
315,
263
],
[
174,
266
],
[
311,
276
],
[
324,
281
],
[
174,
282
],
[
315,
286
],
[
174,
289
],
[
302,
293
],
[
309,
294
],
[
303,
297
],
[
312,
297
],
[
300,
297
],
[
299,
300
],
[
309,
302
],
[
302,
303
],
[
305,
306
],
[
308,
309
],
[
311,
312
],
[
314,
315
],
[
317,
318
],
[
320,
321
],
[
323,
324
]
] |
[
"n = int(input())\nt = [int(m) for m in input().split()]\na = [int(m) for m in input().split()]\ntrcd = []\narcd = []\nfor i in range(n):\n if i == 0:\n trcd.append([t[i], 1])\n else:\n if t[i - 1] < t[i]:\n trcd.append([t[i], 1])\n elif t[i - 1] == t[i]:\n trcd.append([t[i], t[i]])\n\nfor i in reversed(range(n)):\n if i == n - 1:\n arcd.append([a[i], 1])\n else:\n if a[i] > a[i + 1]:\n arcd.append([a[i], 1])\n elif a[i] == a[i + 1]:\n arcd.append([a[i], a[i]])\n\nans = 1\nmod = 10 ** 9 + 7\nfor i in range(n):\n if trcd[i][1] == arcd[-i-1][1] and trcd[i][1] == 1:#候補がひとつしかなくて\n if trcd[i][0] != arcd[-i-1][0]:#その候補の数字が違うとき\n print(0)\n exit()\n elif (trcd[i][0] > arcd[-i-1][0] and trcd[i][1] == 1) or (trcd[i][0] < arcd[-i-1][0] and arcd[-i-1][1] == 1):\n print(0)\n exit()\n else:\n ans *= min(trcd[i][1], arcd[-i-1][1])#候補が小さいほうをとる\n ans %= mod\nprint(ans)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"int(m) for m in input().split()",
"for m in input().split()",
"m",
"input().split()",
"().split",
"()",
"input",
"split",
"for m in input().split()",
"int(m)",
"int",
"m",
"t = [int(m) for m in input().split()]",
"t",
"[int(m) for m in input().split()]",
"int(m) for m in input().split()",
"for m in input().split()",
"m",
"input().split()",
"().split",
"()",
"input",
"split",
"for m in input().split()",
"int(m)",
"int",
"m",
"a = [int(m) for m in input().split()]",
"a",
"[int(m) for m in input().split()]",
"trcd = []",
"trcd",
"[]",
"arcd = []",
"arcd",
"[]",
"for i in range(n):\n if i == 0:\n trcd.append([t[i], 1])\n else:\n if t[i - 1] < t[i]:\n trcd.append([t[i], 1])\n elif t[i - 1] == t[i]:\n trcd.append([t[i], t[i]])",
"i",
"range(n)",
"range",
"n",
"if i == 0:\n trcd.append([t[i], 1])\n else:\n if t[i - 1] < t[i]:\n trcd.append([t[i], 1])\n elif t[i - 1] == t[i]:\n trcd.append([t[i], t[i]])",
"i == 0",
"i",
"0",
"trcd.append([t[i], 1])",
"trcd.append",
"trcd",
"append",
"[t[i], 1]",
"t[i]",
"t",
"i",
"1",
"if t[i - 1] < t[i]:\n trcd.append([t[i], 1])\n elif t[i - 1] == t[i]:\n trcd.append([t[i], t[i]])",
"t[i - 1] < t[i]",
"t[i - 1]",
"t",
"i - 1",
"i",
"1",
"t[i]",
"t",
"i",
"trcd.append([t[i], 1])",
"trcd.append",
"trcd",
"append",
"[t[i], 1]",
"t[i]",
"t",
"i",
"1",
"elif t[i - 1] == t[i]:\n trcd.append([t[i], t[i]])",
"t[i - 1] == t[i]",
"t[i - 1]",
"t",
"i - 1",
"i",
"1",
"t[i]",
"t",
"i",
"trcd.append([t[i], t[i]])",
"trcd.append",
"trcd",
"append",
"[t[i], t[i]]",
"t[i]",
"t",
"i",
"t[i]",
"t",
"i",
"for i in reversed(range(n)):\n if i == n - 1:\n arcd.append([a[i], 1])\n else:\n if a[i] > a[i + 1]:\n arcd.append([a[i], 1])\n elif a[i] == a[i + 1]:\n arcd.append([a[i], a[i]])",
"i",
"reversed(range(n))",
"reversed",
"range(n)",
"range",
"n",
"if i == n - 1:\n arcd.append([a[i], 1])\n else:\n if a[i] > a[i + 1]:\n arcd.append([a[i], 1])\n elif a[i] == a[i + 1]:\n arcd.append([a[i], a[i]])",
"i == n - 1",
"i",
"n - 1",
"n",
"1",
"arcd.append([a[i], 1])",
"arcd.append",
"arcd",
"append",
"[a[i], 1]",
"a[i]",
"a",
"i",
"1",
"if a[i] > a[i + 1]:\n arcd.append([a[i], 1])\n elif a[i] == a[i + 1]:\n arcd.append([a[i], a[i]])",
"a[i] > a[i + 1]",
"a[i]",
"a",
"i",
"a[i + 1]",
"a",
"i + 1",
"i",
"1",
"arcd.append([a[i], 1])",
"arcd.append",
"arcd",
"append",
"[a[i], 1]",
"a[i]",
"a",
"i",
"1",
"elif a[i] == a[i + 1]:\n arcd.append([a[i], a[i]])",
"a[i] == a[i + 1]",
"a[i]",
"a",
"i",
"a[i + 1]",
"a",
"i + 1",
"i",
"1",
"arcd.append([a[i], a[i]])",
"arcd.append",
"arcd",
"append",
"[a[i], a[i]]",
"a[i]",
"a",
"i",
"a[i]",
"a",
"i",
"ans = 1",
"ans",
"1",
"mod = 10 ** 9 + 7",
"mod",
"10 ** 9 + 7",
"10 ** 9",
"10",
"9",
"7",
"for i in range(n):\n if trcd[i][1] == arcd[-i-1][1] and trcd[i][1] == 1:#候補がひとつしかなくて\n if trcd[i][0] != arcd[-i-1][0]:#その候補の数字が違うとき\n print(0)\n exit()\n elif (trcd[i][0] > arcd[-i-1][0] and trcd[i][1] == 1) or (trcd[i][0] < arcd[-i-1][0] and arcd[-i-1][1] == 1):\n print(0)\n exit()\n else:\n ans *= min(trcd[i][1], arcd[-i-1][1])#候補が小さいほうをとる\n ans %= mod",
"i",
"range(n)",
"range",
"n",
"if trcd[i][1] == arcd[-i-1][1] and trcd[i][1] == 1:#候補がひとつしかなくて\n if trcd[i][0] != arcd[-i-1][0]:#その候補の数字が違うとき\n print(0)\n exit()\n elif (trcd[i][0] > arcd[-i-1][0] and trcd[i][1] == 1) or (trcd[i][0] < arcd[-i-1][0] and arcd[-i-1][1] == 1):\n print(0)\n exit()\n else:\n ans *= min(trcd[i][1], arcd[-i-1][1])#候補が小さいほうをとる\n ans %= mod",
"trcd[i][1] == arcd[-i-1][1] and trcd[i][1] == 1",
"trcd[i][1] == arcd[-i-1][1]",
"trcd[i][1]",
"[i]",
"trcd",
"i",
"1",
"arcd[-i-1][1]",
"[-i-1]",
"arcd",
"-i-1",
"-i",
"i",
"1",
"1",
"trcd[i][1] == 1",
"trcd[i][1]",
"[i]",
"trcd",
"i",
"1",
"1",
"if trcd[i][0] != arcd[-i-1][0]:#その候補の数字が違うとき\n print(0)\n exit()\n ",
"trcd[i][0] != arcd[-i-1][0]",
"trcd[i][0]",
"[i]",
"trcd",
"i",
"0",
"arcd[-i-1][0]",
"[-i-1]",
"arcd",
"-i-1",
"-i",
"i",
"1",
"0",
"print(0)",
"print",
"0",
"exit()",
"exit",
"elif (trcd[i][0] > arcd[-i-1][0] and trcd[i][1] == 1) or (trcd[i][0] < arcd[-i-1][0] and arcd[-i-1][1] == 1):\n print(0)\n exit()\n ",
"(trcd[i][0] > arcd[-i-1][0] and trcd[i][1] == 1) or (trcd[i][0] < arcd[-i-1][0] and arcd[-i-1][1] == 1)",
"trcd[i][0] > arcd[-i-1][0] and trcd[i][1] == 1",
"trcd[i][0] > arcd[-i-1][0]",
"trcd[i][0]",
"[i]",
"trcd",
"i",
"0",
"arcd[-i-1][0]",
"[-i-1]",
"arcd",
"-i-1",
"-i",
"i",
"1",
"0",
"trcd[i][1] == 1",
"trcd[i][1]",
"[i]",
"trcd",
"i",
"1",
"1",
"trcd[i][0] < arcd[-i-1][0] and arcd[-i-1][1] == 1",
"trcd[i][0] < arcd[-i-1][0]",
"trcd[i][0]",
"[i]",
"trcd",
"i",
"0",
"arcd[-i-1][0]",
"[-i-1]",
"arcd",
"-i-1",
"-i",
"i",
"1",
"0",
"arcd[-i-1][1] == 1",
"arcd[-i-1][1]",
"[-i-1]",
"arcd",
"-i-1",
"-i",
"i",
"1",
"1",
"1",
"print(0)",
"print",
"0",
"exit()",
"exit",
"ans *= min(trcd[i][1], arcd[-i-1][1])",
"ans",
"min(trcd[i][1], arcd[-i-1][1])",
"min",
"trcd[i][1]",
"[i]",
"trcd",
"i",
"1",
"arcd[-i-1][1]",
"[-i-1]",
"arcd",
"-i-1",
"-i",
"i",
"1",
"1",
"ans %= mod",
"ans",
"mod",
"print(ans)",
"print",
"ans",
"ans = 1",
"1",
"ans",
"ans %= mod",
"mod",
"ans",
"n = int(input())",
"int(input())",
"n",
"mod = 10 ** 9 + 7",
"10 ** 9 + 7",
"mod",
"ans *= min(trcd[i][1], arcd[-i-1][1])",
"min(trcd[i][1], arcd[-i-1][1])",
"ans",
"arcd = []",
"[]",
"arcd",
"a = [int(m) for m in input().split()]",
"[int(m) for m in input().split()]",
"a",
"t = [int(m) for m in input().split()]",
"[int(m) for m in input().split()]",
"t",
"trcd = []",
"[]",
"trcd"
] |
n = int(input())
t = [int(m) for m in input().split()]
a = [int(m) for m in input().split()]
trcd = []
arcd = []
for i in range(n):
if i == 0:
trcd.append([t[i], 1])
else:
if t[i - 1] < t[i]:
trcd.append([t[i], 1])
elif t[i - 1] == t[i]:
trcd.append([t[i], t[i]])
for i in reversed(range(n)):
if i == n - 1:
arcd.append([a[i], 1])
else:
if a[i] > a[i + 1]:
arcd.append([a[i], 1])
elif a[i] == a[i + 1]:
arcd.append([a[i], a[i]])
ans = 1
mod = 10 ** 9 + 7
for i in range(n):
if trcd[i][1] == arcd[-i-1][1] and trcd[i][1] == 1:#候補がひとつしかなくて
if trcd[i][0] != arcd[-i-1][0]:#その候補の数字が違うとき
print(0)
exit()
elif (trcd[i][0] > arcd[-i-1][0] and trcd[i][1] == 1) or (trcd[i][0] < arcd[-i-1][0] and arcd[-i-1][1] == 1):
print(0)
exit()
else:
ans *= min(trcd[i][1], arcd[-i-1][1])#候補が小さいほうをとる
ans %= mod
print(ans)
|
[
7,
0,
13,
2,
2,
17,
17,
17,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
0,
13,
13,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
0,
13,
13,
0,
13,
2,
39,
17,
13,
0,
13,
2,
39,
17,
13,
0,
18,
13,
17,
39,
17,
18,
13,
17,
0,
18,
13,
17,
39,
17,
18,
13,
17,
28,
13,
4,
13,
17,
13,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
18,
13,
13,
39,
17,
18,
13,
13,
0,
18,
13,
13,
39,
17,
18,
13,
13,
14,
2,
18,
13,
2,
40,
13,
17,
18,
13,
40,
13,
0,
18,
13,
2,
40,
13,
17,
39,
17,
18,
13,
2,
40,
13,
17,
0,
18,
13,
2,
40,
13,
17,
39,
17,
18,
13,
2,
40,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
18,
13,
13,
13,
0,
13,
18,
13,
13,
13,
14,
2,
2,
13,
17,
2,
13,
17,
0,
13,
2,
2,
13,
4,
13,
13,
13,
13,
14,
2,
2,
2,
13,
17,
2,
13,
17,
2,
13,
13,
0,
13,
17,
14,
2,
2,
2,
13,
17,
2,
13,
17,
2,
13,
13,
0,
13,
17,
14,
2,
2,
2,
13,
17,
2,
13,
17,
40,
13,
13,
0,
13,
17,
4,
13,
2,
13,
13,
10,
17,
13,
10,
17,
13,
10,
17,
13,
10,
2,
13,
10,
18,
13,
10,
4,
13,
10,
18,
13,
10,
2,
13,
10,
2,
13,
10,
18,
13,
10,
18,
13,
10,
2,
13,
10,
13,
13,
10,
13,
13,
10,
17,
13
] |
[
[
263,
2
],
[
254,
9
],
[
17,
16
],
[
16,
25
],
[
275,
27
],
[
32,
31
],
[
31,
40
],
[
278,
42
],
[
260,
45
],
[
255,
49
],
[
248,
51
],
[
255,
55
],
[
60,
57
],
[
261,
58
],
[
276,
63
],
[
69,
66
],
[
249,
67
],
[
279,
72
],
[
76,
75
],
[
255,
79
],
[
276,
83
],
[
75,
84
],
[
276,
86
],
[
75,
88
],
[
94,
91
],
[
261,
92
],
[
75,
93
],
[
276,
97
],
[
75,
98
],
[
103,
100
],
[
261,
101
],
[
75,
102
],
[
276,
106
],
[
75,
107
],
[
279,
111
],
[
75,
114
],
[
279,
117
],
[
75,
119
],
[
127,
121
],
[
249,
122
],
[
75,
125
],
[
279,
130
],
[
75,
133
],
[
142,
136
],
[
249,
137
],
[
75,
140
],
[
279,
145
],
[
75,
148
],
[
239,
151
],
[
155,
154
],
[
255,
157
],
[
266,
159
],
[
100,
160
],
[
91,
160
],
[
261,
161
],
[
154,
162
],
[
266,
163
],
[
269,
165
],
[
249,
167
],
[
154,
168
],
[
269,
169
],
[
252,
173
],
[
270,
176
],
[
272,
179
],
[
240,
182
],
[
282,
182
],
[
246,
182
],
[
243,
182
],
[
273,
182
],
[
267,
185
],
[
258,
186
],
[
264,
187
],
[
252,
192
],
[
270,
195
],
[
267,
198
],
[
258,
199
],
[
242,
201
],
[
252,
207
],
[
270,
210
],
[
267,
213
],
[
258,
214
],
[
245,
216
],
[
252,
222
],
[
270,
225
],
[
267,
228
],
[
258,
229
],
[
281,
231
],
[
282,
236
],
[
246,
236
],
[
243,
236
],
[
273,
236
],
[
240,
236
],
[
264,
237
],
[
239,
240
],
[
242,
243
],
[
245,
246
],
[
248,
249
],
[
100,
251
],
[
91,
251
],
[
266,
252
],
[
254,
255
],
[
269,
258
],
[
260,
261
],
[
263,
264
],
[
100,
266
],
[
91,
266
],
[
266,
267
],
[
269,
270
],
[
272,
273
],
[
275,
276
],
[
278,
279
],
[
281,
282
]
] |
[
"mod=10**9+7\nn=int(input())\nT=[int(i) for i in input().split()]\nA=[int(i) for i in input().split()]\nTres=[0]*n\nAres=[0]*n\nTres[0]=[0,T[0]]\nAres[-1]=[0,A[-1]]\nfor i in range(1,n):\n if T[i]>T[i-1]:\n Tres[i]=[0,T[i]]\n else:\n Tres[i]=[1,T[i]]\n if A[-i-1]>A[-i]:\n Ares[-i-1]=[0,A[-i-1]]\n else:\n Ares[-i-1]=[1,A[-i-1]]\nans=1\nfor i in range(n):\n ta,tb=Tres[i]\n aa,ab=Ares[i] \n if ta==1 and aa==1:\n ans=ans*min(tb,ab)%mod\n elif ta==0 and aa==1 and tb>ab:\n ans=0\n elif ta==1 and aa==0 and tb<ab:\n ans=0\n elif ta==0 and aa==0 and tb!=ab:\n ans=0\nprint(ans%mod)",
"mod=10**9+7",
"mod",
"10**9+7",
"10**9",
"10",
"9",
"7",
"n=int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"int(i) for i in input().split()",
"for i in input().split()",
"i",
"input().split()",
"().split",
"()",
"input",
"split",
"for i in input().split()",
"int(i)",
"int",
"i",
"T=[int(i) for i in input().split()]",
"T",
"[int(i) for i in input().split()]",
"int(i) for i in input().split()",
"for i in input().split()",
"i",
"input().split()",
"().split",
"()",
"input",
"split",
"for i in input().split()",
"int(i)",
"int",
"i",
"A=[int(i) for i in input().split()]",
"A",
"[int(i) for i in input().split()]",
"Tres=[0]*n",
"Tres",
"[0]*n",
"[0]",
"0",
"n",
"Ares=[0]*n",
"Ares",
"[0]*n",
"[0]",
"0",
"n",
"Tres[0]=[0,T[0]]",
"Tres[0]",
"Tres",
"0",
"[0,T[0]]",
"0",
"T[0]",
"T",
"0",
"Ares[-1]=[0,A[-1]]",
"Ares[-1]",
"Ares",
"-1",
"[0,A[-1]]",
"0",
"A[-1]",
"A",
"-1",
"for i in range(1,n):\n if T[i]>T[i-1]:\n Tres[i]=[0,T[i]]\n else:\n Tres[i]=[1,T[i]]\n if A[-i-1]>A[-i]:\n Ares[-i-1]=[0,A[-i-1]]\n else:\n Ares[-i-1]=[1,A[-i-1]]",
"i",
"range(1,n)",
"range",
"1",
"n",
"if T[i]>T[i-1]:\n Tres[i]=[0,T[i]]\n else:\n Tres[i]=[1,T[i]]\n ",
"T[i]>T[i-1]",
"T[i]",
"T",
"i",
"T[i-1]",
"T",
"i-1",
"i",
"1",
"Tres[i]=[0,T[i]]",
"Tres[i]",
"Tres",
"i",
"[0,T[i]]",
"0",
"T[i]",
"T",
"i",
"Tres[i]=[1,T[i]]",
"Tres[i]",
"Tres",
"i",
"[1,T[i]]",
"1",
"T[i]",
"T",
"i",
"if A[-i-1]>A[-i]:\n Ares[-i-1]=[0,A[-i-1]]\n else:\n Ares[-i-1]=[1,A[-i-1]]",
"A[-i-1]>A[-i]",
"A[-i-1]",
"A",
"-i-1",
"-i",
"i",
"1",
"A[-i]",
"A",
"-i",
"i",
"Ares[-i-1]=[0,A[-i-1]]",
"Ares[-i-1]",
"Ares",
"-i-1",
"-i",
"i",
"1",
"[0,A[-i-1]]",
"0",
"A[-i-1]",
"A",
"-i-1",
"-i",
"i",
"1",
"Ares[-i-1]=[1,A[-i-1]]",
"Ares[-i-1]",
"Ares",
"-i-1",
"-i",
"i",
"1",
"[1,A[-i-1]]",
"1",
"A[-i-1]",
"A",
"-i-1",
"-i",
"i",
"1",
"ans=1",
"ans",
"1",
"for i in range(n):\n ta,tb=Tres[i]\n aa,ab=Ares[i] \n if ta==1 and aa==1:\n ans=ans*min(tb,ab)%mod\n elif ta==0 and aa==1 and tb>ab:\n ans=0\n elif ta==1 and aa==0 and tb<ab:\n ans=0\n elif ta==0 and aa==0 and tb!=ab:\n ans=0",
"i",
"range(n)",
"range",
"n",
"ta,tb=Tres[i]",
"ta",
"Tres[i]",
"Tres",
"i",
"tb",
"aa,ab=Ares[i]",
"aa",
"Ares[i]",
"Ares",
"i",
"ab",
"if ta==1 and aa==1:\n ans=ans*min(tb,ab)%mod\n elif ta==0 and aa==1 and tb>ab:\n ans=0\n elif ta==1 and aa==0 and tb<ab:\n ans=0\n elif ta==0 and aa==0 and tb!=ab:\n ans=0",
"ta==1 and aa==1",
"ta==1",
"ta",
"1",
"aa==1",
"aa",
"1",
"ans=ans*min(tb,ab)%mod",
"ans",
"ans*min(tb,ab)%mod",
"ans*min(tb,ab)",
"ans",
"min(tb,ab)",
"min",
"tb",
"ab",
"mod",
"elif ta==0 and aa==1 and tb>ab:\n ans=0\n ",
"ta==0 and aa==1 and tb>ab",
"ta==0 and aa==1",
"ta==0",
"ta",
"0",
"aa==1",
"aa",
"1",
"tb>ab",
"tb",
"ab",
"ans=0",
"ans",
"0",
"elif ta==1 and aa==0 and tb<ab:\n ans=0\n ",
"ta==1 and aa==0 and tb<ab",
"ta==1 and aa==0",
"ta==1",
"ta",
"1",
"aa==0",
"aa",
"0",
"tb<ab",
"tb",
"ab",
"ans=0",
"ans",
"0",
"elif ta==0 and aa==0 and tb!=ab:\n ans=0",
"ta==0 and aa==0 and tb!=ab",
"ta==0 and aa==0",
"ta==0",
"ta",
"0",
"aa==0",
"aa",
"0",
"tb!=ab",
"tb",
"ab",
"ans=0",
"ans",
"0",
"print(ans%mod)",
"print",
"ans%mod",
"ans",
"mod",
"ans=1",
"1",
"ans",
"ans=0",
"0",
"ans",
"ans=0",
"0",
"ans",
"Ares=[0]*n",
"[0]*n",
"Ares",
"ta,tb=Tres[i]",
"Tres[i]",
"ta",
"n=int(input())",
"int(input())",
"n",
"ab=Ares[i]",
"Ares[i]",
"ab",
"Tres=[0]*n",
"[0]*n",
"Tres",
"mod=10**9+7",
"10**9+7",
"mod",
"tb=Tres[i]",
"Tres[i]",
"tb",
"aa,ab=Ares[i]",
"Ares[i]",
"aa",
"ans=ans*min(tb,ab)%mod",
"ans*min(tb,ab)%mod",
"ans",
"T=[int(i) for i in input().split()]",
"[int(i) for i in input().split()]",
"T",
"A=[int(i) for i in input().split()]",
"[int(i) for i in input().split()]",
"A",
"ans=0",
"0",
"ans"
] |
mod=10**9+7
n=int(input())
T=[int(i) for i in input().split()]
A=[int(i) for i in input().split()]
Tres=[0]*n
Ares=[0]*n
Tres[0]=[0,T[0]]
Ares[-1]=[0,A[-1]]
for i in range(1,n):
if T[i]>T[i-1]:
Tres[i]=[0,T[i]]
else:
Tres[i]=[1,T[i]]
if A[-i-1]>A[-i]:
Ares[-i-1]=[0,A[-i-1]]
else:
Ares[-i-1]=[1,A[-i-1]]
ans=1
for i in range(n):
ta,tb=Tres[i]
aa,ab=Ares[i]
if ta==1 and aa==1:
ans=ans*min(tb,ab)%mod
elif ta==0 and aa==1 and tb>ab:
ans=0
elif ta==1 and aa==0 and tb<ab:
ans=0
elif ta==0 and aa==0 and tb!=ab:
ans=0
print(ans%mod)
|
[
7,
15,
13,
4,
18,
13,
13,
2,
17,
17,
0,
13,
18,
18,
13,
13,
13,
0,
13,
4,
13,
17,
0,
13,
2,
2,
17,
17,
17,
12,
13,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
2,
39,
17,
13,
0,
13,
40,
13,
28,
13,
4,
13,
13,
14,
2,
13,
18,
13,
13,
0,
18,
13,
13,
17,
0,
13,
18,
13,
13,
0,
13,
40,
13,
28,
13,
4,
13,
4,
13,
13,
14,
2,
13,
18,
13,
13,
14,
2,
40,
18,
13,
13,
17,
40,
18,
13,
13,
18,
13,
13,
4,
13,
17,
4,
13,
0,
18,
13,
13,
17,
0,
13,
18,
13,
13,
14,
2,
40,
18,
13,
13,
17,
2,
18,
13,
13,
18,
13,
13,
4,
13,
17,
4,
13,
0,
13,
17,
28,
13,
4,
13,
13,
14,
2,
18,
13,
13,
17,
0,
18,
13,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
13,
2,
2,
13,
18,
13,
13,
13,
4,
13,
13,
14,
2,
13,
17,
4,
13,
10,
18,
13,
10,
12,
13,
10,
2,
13,
10,
4,
13
] |
[
[
202,
11
],
[
211,
18
],
[
208,
23
],
[
33,
32
],
[
203,
36
],
[
39,
38
],
[
203,
47
],
[
51,
50
],
[
203,
59
],
[
63,
62
],
[
32,
66
],
[
69,
68
],
[
212,
70
],
[
73,
72
],
[
32,
75
],
[
68,
78
],
[
88,
78
],
[
38,
80
],
[
72,
81
],
[
86,
83
],
[
62,
84
],
[
72,
85
],
[
89,
88
],
[
38,
90
],
[
72,
91
],
[
94,
93
],
[
212,
95
],
[
98,
97
],
[
32,
102
],
[
93,
105
],
[
88,
105
],
[
68,
105
],
[
134,
105
],
[
50,
107
],
[
97,
108
],
[
83,
112
],
[
129,
112
],
[
62,
113
],
[
97,
114
],
[
38,
118
],
[
97,
119
],
[
50,
121
],
[
97,
122
],
[
132,
129
],
[
62,
130
],
[
97,
131
],
[
135,
134
],
[
50,
136
],
[
97,
137
],
[
83,
141
],
[
129,
141
],
[
62,
142
],
[
97,
143
],
[
38,
147
],
[
97,
148
],
[
50,
150
],
[
97,
151
],
[
159,
158
],
[
162,
161
],
[
32,
164
],
[
129,
167
],
[
83,
167
],
[
172,
167
],
[
62,
168
],
[
161,
169
],
[
175,
172
],
[
62,
173
],
[
161,
174
],
[
38,
178
],
[
161,
179
],
[
50,
181
],
[
161,
182
],
[
185,
184
],
[
158,
187
],
[
184,
187
],
[
172,
188
],
[
129,
188
],
[
83,
188
],
[
62,
189
],
[
161,
190
],
[
209,
191
],
[
184,
194
],
[
158,
194
],
[
206,
200
],
[
202,
203
],
[
208,
209
],
[
211,
212
]
] |
[
"import sys\n\nsys.setrecursionlimit(10 ** 7)\ninput = sys.stdin.readline\nf_inf = float('inf')\nmod = 10 ** 9 + 7\n\n\ndef resolve():\n n = int(input())\n T = list(map(int, input().split()))\n A = list(map(int, input().split()))\n\n pattern = [0] * n\n prev = -f_inf\n for i in range(n):\n if prev < T[i]:\n pattern[i] = 1\n prev = T[i]\n\n prev = -f_inf\n for i in reversed(range(n)):\n if prev < A[i]:\n if pattern[i] != 0 and T[i] != A[i]:\n print(0)\n exit()\n pattern[i] = 1\n prev = A[i]\n else:\n if pattern[i] != 0 and T[i] > A[i]:\n print(0)\n exit()\n\n res = 1\n for i in range(n):\n if pattern[i] == 0:\n pattern[i] = min(T[i], A[i])\n res = res * pattern[i] % mod\n print(res)\n\n\nif __name__ == '__main__':\n resolve()",
"import sys",
"sys",
"sys.setrecursionlimit(10 ** 7)",
"sys.setrecursionlimit",
"sys",
"setrecursionlimit",
"10 ** 7",
"10",
"7",
"input = sys.stdin.readline",
"input",
"sys.stdin.readline",
"sys.stdin",
"sys",
"stdin",
"readline",
"f_inf = float('inf')",
"f_inf",
"float('inf')",
"float",
"'inf'",
"mod = 10 ** 9 + 7",
"mod",
"10 ** 9 + 7",
"10 ** 9",
"10",
"9",
"7",
"def resolve():\n n = int(input())\n T = list(map(int, input().split()))\n A = list(map(int, input().split()))\n\n pattern = [0] * n\n prev = -f_inf\n for i in range(n):\n if prev < T[i]:\n pattern[i] = 1\n prev = T[i]\n\n prev = -f_inf\n for i in reversed(range(n)):\n if prev < A[i]:\n if pattern[i] != 0 and T[i] != A[i]:\n print(0)\n exit()\n pattern[i] = 1\n prev = A[i]\n else:\n if pattern[i] != 0 and T[i] > A[i]:\n print(0)\n exit()\n\n res = 1\n for i in range(n):\n if pattern[i] == 0:\n pattern[i] = min(T[i], A[i])\n res = res * pattern[i] % mod\n print(res)",
"resolve",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"T = list(map(int, input().split()))",
"T",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"A = list(map(int, input().split()))",
"A",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"pattern = [0] * n",
"pattern",
"[0] * n",
"[0]",
"0",
"n",
"prev = -f_inf",
"prev",
"-f_inf",
"f_inf",
"for i in range(n):\n if prev < T[i]:\n pattern[i] = 1\n prev = T[i]\n\n ",
"i",
"range(n)",
"range",
"n",
"if prev < T[i]:\n pattern[i] = 1\n prev = T[i]\n\n ",
"prev < T[i]",
"prev",
"T[i]",
"T",
"i",
"pattern[i] = 1",
"pattern[i]",
"pattern",
"i",
"1",
"prev = T[i]",
"prev",
"T[i]",
"T",
"i",
"prev = -f_inf",
"prev",
"-f_inf",
"f_inf",
"for i in reversed(range(n)):\n if prev < A[i]:\n if pattern[i] != 0 and T[i] != A[i]:\n print(0)\n exit()\n pattern[i] = 1\n prev = A[i]\n else:\n if pattern[i] != 0 and T[i] > A[i]:\n print(0)\n exit()\n\n ",
"i",
"reversed(range(n))",
"reversed",
"range(n)",
"range",
"n",
"if prev < A[i]:\n if pattern[i] != 0 and T[i] != A[i]:\n print(0)\n exit()\n pattern[i] = 1\n prev = A[i]\n else:\n if pattern[i] != 0 and T[i] > A[i]:\n print(0)\n exit()\n\n ",
"prev < A[i]",
"prev",
"A[i]",
"A",
"i",
"if pattern[i] != 0 and T[i] != A[i]:\n print(0)\n exit()\n ",
"pattern[i] != 0 and T[i] != A[i]",
"pattern[i] != 0",
"pattern[i]",
"pattern",
"i",
"0",
"T[i] != A[i]",
"T[i]",
"T",
"i",
"A[i]",
"A",
"i",
"print(0)",
"print",
"0",
"exit()",
"exit",
"pattern[i] = 1",
"pattern[i]",
"pattern",
"i",
"1",
"prev = A[i]",
"prev",
"A[i]",
"A",
"i",
"if pattern[i] != 0 and T[i] > A[i]:\n print(0)\n exit()\n\n ",
"pattern[i] != 0 and T[i] > A[i]",
"pattern[i] != 0",
"pattern[i]",
"pattern",
"i",
"0",
"T[i] > A[i]",
"T[i]",
"T",
"i",
"A[i]",
"A",
"i",
"print(0)",
"print",
"0",
"exit()",
"exit",
"res = 1",
"res",
"1",
"for i in range(n):\n if pattern[i] == 0:\n pattern[i] = min(T[i], A[i])\n res = res * pattern[i] % mod\n ",
"i",
"range(n)",
"range",
"n",
"if pattern[i] == 0:\n pattern[i] = min(T[i], A[i])\n ",
"pattern[i] == 0",
"pattern[i]",
"pattern",
"i",
"0",
"pattern[i] = min(T[i], A[i])",
"pattern[i]",
"pattern",
"i",
"min(T[i], A[i])",
"min",
"T[i]",
"T",
"i",
"A[i]",
"A",
"i",
"res = res * pattern[i] % mod",
"res",
"res * pattern[i] % mod",
"res * pattern[i]",
"res",
"pattern[i]",
"pattern",
"i",
"mod",
"print(res)",
"print",
"res",
"if __name__ == '__main__':\n resolve()",
"__name__ == '__main__'",
"__name__",
"'__main__'",
"resolve()",
"resolve",
"input = sys.stdin.readline",
"sys.stdin.readline",
"input",
"def resolve():\n n = int(input())\n T = list(map(int, input().split()))\n A = list(map(int, input().split()))\n\n pattern = [0] * n\n prev = -f_inf\n for i in range(n):\n if prev < T[i]:\n pattern[i] = 1\n prev = T[i]\n\n prev = -f_inf\n for i in reversed(range(n)):\n if prev < A[i]:\n if pattern[i] != 0 and T[i] != A[i]:\n print(0)\n exit()\n pattern[i] = 1\n prev = A[i]\n else:\n if pattern[i] != 0 and T[i] > A[i]:\n print(0)\n exit()\n\n res = 1\n for i in range(n):\n if pattern[i] == 0:\n pattern[i] = min(T[i], A[i])\n res = res * pattern[i] % mod\n print(res)",
"def resolve():\n n = int(input())\n T = list(map(int, input().split()))\n A = list(map(int, input().split()))\n\n pattern = [0] * n\n prev = -f_inf\n for i in range(n):\n if prev < T[i]:\n pattern[i] = 1\n prev = T[i]\n\n prev = -f_inf\n for i in reversed(range(n)):\n if prev < A[i]:\n if pattern[i] != 0 and T[i] != A[i]:\n print(0)\n exit()\n pattern[i] = 1\n prev = A[i]\n else:\n if pattern[i] != 0 and T[i] > A[i]:\n print(0)\n exit()\n\n res = 1\n for i in range(n):\n if pattern[i] == 0:\n pattern[i] = min(T[i], A[i])\n res = res * pattern[i] % mod\n print(res)",
"resolve",
"mod = 10 ** 9 + 7",
"10 ** 9 + 7",
"mod",
"f_inf = float('inf')",
"float('inf')",
"f_inf"
] |
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(input())
T = list(map(int, input().split()))
A = list(map(int, input().split()))
pattern = [0] * n
prev = -f_inf
for i in range(n):
if prev < T[i]:
pattern[i] = 1
prev = T[i]
prev = -f_inf
for i in reversed(range(n)):
if prev < A[i]:
if pattern[i] != 0 and T[i] != A[i]:
print(0)
exit()
pattern[i] = 1
prev = A[i]
else:
if pattern[i] != 0 and T[i] > A[i]:
print(0)
exit()
res = 1
for i in range(n):
if pattern[i] == 0:
pattern[i] = min(T[i], A[i])
res = res * pattern[i] % mod
print(res)
if __name__ == '__main__':
resolve()
|
[
7,
0,
13,
2,
2,
17,
17,
17,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
14,
40,
18,
13,
2,
13,
17,
18,
13,
17,
4,
13,
17,
4,
13,
0,
13,
17,
28,
13,
4,
13,
13,
14,
2,
2,
13,
17,
2,
13,
2,
13,
17,
9,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
14,
2,
2,
18,
13,
13,
18,
13,
13,
2,
18,
13,
13,
18,
13,
2,
13,
17,
4,
13,
17,
4,
13,
14,
2,
40,
18,
13,
13,
18,
13,
13,
40,
18,
13,
13,
18,
13,
2,
13,
17,
4,
13,
17,
4,
13,
14,
2,
18,
13,
13,
18,
13,
13,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
13,
2,
2,
13,
18,
13,
13,
13,
14,
2,
18,
13,
13,
18,
13,
13,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
13,
2,
2,
13,
18,
13,
13,
13,
14,
2,
18,
13,
13,
18,
13,
13,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
13,
2,
2,
13,
18,
13,
13,
13,
4,
13,
17,
4,
13,
4,
13,
2,
13,
13,
10,
2,
13,
10,
4,
13,
10,
4,
13,
10,
2,
13,
10,
2,
13,
10,
17,
13,
10,
4,
13,
10,
2,
13
] |
[
[
228,
2
],
[
219,
9
],
[
222,
15
],
[
234,
25
],
[
223,
37
],
[
220,
39
],
[
235,
42
],
[
231,
50
],
[
54,
53
],
[
220,
56
],
[
53,
60
],
[
53,
63
],
[
220,
65
],
[
223,
71
],
[
53,
72
],
[
223,
74
],
[
53,
76
],
[
235,
82
],
[
53,
83
],
[
223,
85
],
[
53,
86
],
[
235,
89
],
[
53,
90
],
[
235,
92
],
[
53,
94
],
[
235,
105
],
[
53,
106
],
[
223,
108
],
[
53,
109
],
[
235,
112
],
[
53,
113
],
[
235,
115
],
[
53,
117
],
[
223,
127
],
[
53,
128
],
[
235,
130
],
[
53,
131
],
[
235,
135
],
[
53,
136
],
[
235,
138
],
[
53,
140
],
[
225,
143
],
[
232,
146
],
[
238,
146
],
[
217,
146
],
[
226,
146
],
[
223,
148
],
[
53,
149
],
[
229,
150
],
[
223,
154
],
[
53,
155
],
[
235,
157
],
[
53,
158
],
[
235,
162
],
[
53,
163
],
[
235,
165
],
[
53,
167
],
[
216,
170
],
[
232,
173
],
[
238,
173
],
[
217,
173
],
[
226,
173
],
[
235,
175
],
[
53,
176
],
[
229,
177
],
[
235,
181
],
[
53,
182
],
[
223,
184
],
[
53,
185
],
[
235,
189
],
[
53,
190
],
[
235,
192
],
[
53,
194
],
[
237,
197
],
[
232,
200
],
[
238,
200
],
[
217,
200
],
[
226,
200
],
[
223,
202
],
[
53,
203
],
[
229,
204
],
[
238,
213
],
[
217,
213
],
[
226,
213
],
[
232,
213
],
[
229,
214
],
[
216,
217
],
[
219,
220
],
[
222,
223
],
[
225,
226
],
[
228,
229
],
[
231,
232
],
[
234,
235
],
[
237,
238
]
] |
[
"mod=10**9+7\nn=int(raw_input())\nt=map(int,raw_input().split())\na=map(int,raw_input().split())\n\nif t[n-1]!=a[0]:\n print(0)\n exit()\n\nans=1\nfor i in xrange(n):\n if i==0 or i==n-1:\n continue\n elif t[i]>t[i-1]:\n if a[i]<t[i] and a[i]==a[i+1]:\n print(0)\n exit()\n elif a[i]!=t[i] and a[i]!=a[i+1]:\n print(0)\n exit()\n else:\n if t[i]==a[i]:\n if a[i]==a[i+1]:\n ans=(ans*t[i])%mod\n elif t[i]>a[i]:\n if a[i]==a[i+1]:\n ans=(ans*a[i])%mod\n elif a[i]>t[i]:\n if a[i]==a[i+1]:\n ans=(ans*t[i])%mod\n else:\n print(0)\n exit()\nprint(ans%mod)",
"mod=10**9+7",
"mod",
"10**9+7",
"10**9",
"10",
"9",
"7",
"n=int(raw_input())",
"n",
"int(raw_input())",
"int",
"raw_input()",
"raw_input",
"t=map(int,raw_input().split())",
"t",
"map(int,raw_input().split())",
"map",
"int",
"raw_input().split()",
"().split",
"()",
"raw_input",
"split",
"a=map(int,raw_input().split())",
"a",
"map(int,raw_input().split())",
"map",
"int",
"raw_input().split()",
"().split",
"()",
"raw_input",
"split",
"if t[n-1]!=a[0]:\n print(0)\n exit()",
"t[n-1]!=a[0]",
"t[n-1]",
"t",
"n-1",
"n",
"1",
"a[0]",
"a",
"0",
"print(0)",
"print",
"0",
"exit()",
"exit",
"ans=1",
"ans",
"1",
"for i in xrange(n):\n if i==0 or i==n-1:\n continue\n elif t[i]>t[i-1]:\n if a[i]<t[i] and a[i]==a[i+1]:\n print(0)\n exit()\n elif a[i]!=t[i] and a[i]!=a[i+1]:\n print(0)\n exit()\n else:\n if t[i]==a[i]:\n if a[i]==a[i+1]:\n ans=(ans*t[i])%mod\n elif t[i]>a[i]:\n if a[i]==a[i+1]:\n ans=(ans*a[i])%mod\n elif a[i]>t[i]:\n if a[i]==a[i+1]:\n ans=(ans*t[i])%mod\n else:\n print(0)\n exit()",
"i",
"xrange(n)",
"xrange",
"n",
"if i==0 or i==n-1:\n continue\n elif t[i]>t[i-1]:\n if a[i]<t[i] and a[i]==a[i+1]:\n print(0)\n exit()\n elif a[i]!=t[i] and a[i]!=a[i+1]:\n print(0)\n exit()\n else:\n if t[i]==a[i]:\n if a[i]==a[i+1]:\n ans=(ans*t[i])%mod\n elif t[i]>a[i]:\n if a[i]==a[i+1]:\n ans=(ans*a[i])%mod\n elif a[i]>t[i]:\n if a[i]==a[i+1]:\n ans=(ans*t[i])%mod\n else:\n print(0)\n exit()",
"i==0 or i==n-1",
"i==0",
"i",
"0",
"i==n-1",
"i",
"n-1",
"n",
"1",
"continue",
"elif t[i]>t[i-1]:\n if a[i]<t[i] and a[i]==a[i+1]:\n print(0)\n exit()\n elif a[i]!=t[i] and a[i]!=a[i+1]:\n print(0)\n exit()\n ",
"t[i]>t[i-1]",
"t[i]",
"t",
"i",
"t[i-1]",
"t",
"i-1",
"i",
"1",
"if a[i]<t[i] and a[i]==a[i+1]:\n print(0)\n exit()\n elif a[i]!=t[i] and a[i]!=a[i+1]:\n print(0)\n exit()\n ",
"a[i]<t[i] and a[i]==a[i+1]",
"a[i]<t[i]",
"a[i]",
"a",
"i",
"t[i]",
"t",
"i",
"a[i]==a[i+1]",
"a[i]",
"a",
"i",
"a[i+1]",
"a",
"i+1",
"i",
"1",
"print(0)",
"print",
"0",
"exit()",
"exit",
"elif a[i]!=t[i] and a[i]!=a[i+1]:\n print(0)\n exit()\n ",
"a[i]!=t[i] and a[i]!=a[i+1]",
"a[i]!=t[i]",
"a[i]",
"a",
"i",
"t[i]",
"t",
"i",
"a[i]!=a[i+1]",
"a[i]",
"a",
"i",
"a[i+1]",
"a",
"i+1",
"i",
"1",
"print(0)",
"print",
"0",
"exit()",
"exit",
"if t[i]==a[i]:\n if a[i]==a[i+1]:\n ans=(ans*t[i])%mod\n elif t[i]>a[i]:\n if a[i]==a[i+1]:\n ans=(ans*a[i])%mod\n elif a[i]>t[i]:\n if a[i]==a[i+1]:\n ans=(ans*t[i])%mod\n else:\n print(0)\n exit()",
"t[i]==a[i]",
"t[i]",
"t",
"i",
"a[i]",
"a",
"i",
"if a[i]==a[i+1]:\n ans=(ans*t[i])%mod\n ",
"a[i]==a[i+1]",
"a[i]",
"a",
"i",
"a[i+1]",
"a",
"i+1",
"i",
"1",
"ans=(ans*t[i])%mod",
"ans",
"(ans*t[i])%mod",
"ans*t[i]",
"ans",
"t[i]",
"t",
"i",
"mod",
"elif t[i]>a[i]:\n if a[i]==a[i+1]:\n ans=(ans*a[i])%mod\n ",
"t[i]>a[i]",
"t[i]",
"t",
"i",
"a[i]",
"a",
"i",
"if a[i]==a[i+1]:\n ans=(ans*a[i])%mod\n ",
"a[i]==a[i+1]",
"a[i]",
"a",
"i",
"a[i+1]",
"a",
"i+1",
"i",
"1",
"ans=(ans*a[i])%mod",
"ans",
"(ans*a[i])%mod",
"ans*a[i]",
"ans",
"a[i]",
"a",
"i",
"mod",
"elif a[i]>t[i]:\n if a[i]==a[i+1]:\n ans=(ans*t[i])%mod\n else:\n print(0)\n exit()",
"a[i]>t[i]",
"a[i]",
"a",
"i",
"t[i]",
"t",
"i",
"if a[i]==a[i+1]:\n ans=(ans*t[i])%mod\n else:\n print(0)\n exit()",
"a[i]==a[i+1]",
"a[i]",
"a",
"i",
"a[i+1]",
"a",
"i+1",
"i",
"1",
"ans=(ans*t[i])%mod",
"ans",
"(ans*t[i])%mod",
"ans*t[i]",
"ans",
"t[i]",
"t",
"i",
"mod",
"print(0)",
"print",
"0",
"exit()",
"exit",
"print(ans%mod)",
"print",
"ans%mod",
"ans",
"mod",
"ans=(ans*a[i])%mod",
"(ans*a[i])%mod",
"ans",
"n=int(raw_input())",
"int(raw_input())",
"n",
"t=map(int,raw_input().split())",
"map(int,raw_input().split())",
"t",
"ans=(ans*t[i])%mod",
"(ans*t[i])%mod",
"ans",
"mod=10**9+7",
"10**9+7",
"mod",
"ans=1",
"1",
"ans",
"a=map(int,raw_input().split())",
"map(int,raw_input().split())",
"a",
"ans=(ans*t[i])%mod",
"(ans*t[i])%mod",
"ans"
] |
mod=10**9+7
n=int(raw_input())
t=map(int,raw_input().split())
a=map(int,raw_input().split())
if t[n-1]!=a[0]:
print(0)
exit()
ans=1
for i in xrange(n):
if i==0 or i==n-1:
continue
elif t[i]>t[i-1]:
if a[i]<t[i] and a[i]==a[i+1]:
print(0)
exit()
elif a[i]!=t[i] and a[i]!=a[i+1]:
print(0)
exit()
else:
if t[i]==a[i]:
if a[i]==a[i+1]:
ans=(ans*t[i])%mod
elif t[i]>a[i]:
if a[i]==a[i+1]:
ans=(ans*a[i])%mod
elif a[i]>t[i]:
if a[i]==a[i+1]:
ans=(ans*t[i])%mod
else:
print(0)
exit()
print(ans%mod)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
2,
39,
17,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
2,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
39,
17,
41,
28,
13,
4,
13,
17,
2,
13,
17,
4,
18,
13,
13,
0,
13,
13,
41,
28,
13,
4,
13,
13,
4,
17,
0,
13,
13,
28,
13,
4,
13,
13,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
18,
13,
13,
18,
13,
2,
13,
17,
0,
13,
17,
28,
13,
4,
13,
2,
13,
17,
17,
17,
14,
2,
18,
13,
2,
13,
17,
18,
13,
13,
14,
2,
18,
13,
13,
18,
13,
13,
0,
13,
17,
0,
18,
13,
13,
18,
13,
13,
0,
18,
13,
13,
4,
13,
18,
13,
13,
18,
13,
13,
28,
13,
4,
13,
13,
0,
13,
2,
2,
13,
2,
2,
18,
13,
13,
18,
13,
13,
17,
2,
2,
17,
17,
17,
14,
2,
18,
13,
13,
18,
13,
13,
0,
13,
17,
4,
13,
13,
10,
2,
13,
10,
13,
13,
10,
2,
13,
10,
13,
13,
10,
4,
13,
10,
17,
13,
10,
17,
13,
10,
17,
13,
10,
2,
13
] |
[
[
191,
2
],
[
203,
8
],
[
179,
23
],
[
40,
39
],
[
192,
44
],
[
204,
48
],
[
39,
49
],
[
188,
51
],
[
56,
55
],
[
192,
58
],
[
182,
62
],
[
66,
65
],
[
192,
68
],
[
204,
72
],
[
65,
73
],
[
204,
75
],
[
65,
77
],
[
83,
80
],
[
183,
81
],
[
65,
82
],
[
204,
84
],
[
65,
86
],
[
194,
89
],
[
93,
92
],
[
192,
96
],
[
180,
103
],
[
92,
105
],
[
180,
108
],
[
92,
109
],
[
80,
112
],
[
122,
112
],
[
183,
113
],
[
92,
114
],
[
180,
116
],
[
92,
117
],
[
197,
119
],
[
125,
122
],
[
183,
123
],
[
92,
124
],
[
180,
126
],
[
92,
127
],
[
132,
129
],
[
189,
130
],
[
92,
131
],
[
129,
134
],
[
189,
135
],
[
92,
136
],
[
180,
138
],
[
92,
139
],
[
142,
141
],
[
192,
144
],
[
185,
146
],
[
198,
149
],
[
195,
149
],
[
201,
149
],
[
186,
149
],
[
129,
152
],
[
189,
153
],
[
141,
154
],
[
122,
155
],
[
80,
155
],
[
183,
156
],
[
141,
157
],
[
129,
166
],
[
189,
167
],
[
141,
168
],
[
122,
169
],
[
80,
169
],
[
183,
170
],
[
141,
171
],
[
200,
173
],
[
201,
177
],
[
186,
177
],
[
198,
177
],
[
195,
177
],
[
179,
180
],
[
182,
183
],
[
185,
186
],
[
188,
189
],
[
191,
192
],
[
194,
195
],
[
197,
198
],
[
200,
201
],
[
203,
204
]
] |
[
"n=int(input())\na=[0]+list(map(int,input().split()))\nb=list(map(int,input().split()))+[0]\n\nm=[a[i] for i in range(1,n+1)]\nl=[1 for _ in range(n)]\n\nfor i in range(n):\n\tif a[i]<a[i+1]:\n\t\tl[i]=a[i+1]\n\t\t\nans=1\nfor i in range(n-1,-1,-1):\n\tif b[i+1]<b[i]:\n\t\tif l[i]>b[i]:\n\t\t\tans=0\n\t\telse:\n\t\t\tl[i]=b[i]\n\tm[i]=min(m[i],b[i])\n\t\nfor i in range(n):\n\tans=(ans*(m[i]-l[i]+1))%(10**9+7)\n\tif m[i]<l[i]:\n\t\tans=0\nprint(ans)",
"n=int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"a=[0]+list(map(int,input().split()))",
"a",
"[0]+list(map(int,input().split()))",
"[0]",
"0",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"b=list(map(int,input().split()))+[0]",
"b",
"list(map(int,input().split()))+[0]",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"[0]",
"0",
"a[i] for i in range(1,n+1)",
"for i in range(1,n+1)",
"i",
"range(1,n+1)",
"range",
"1",
"n+1",
"n",
"1",
"for i in range(1,n+1)",
"a[i]",
"a",
"i",
"m=[a[i] for i in range(1,n+1)]",
"m",
"[a[i] for i in range(1,n+1)]",
"1 for _ in range(n)",
"for _ in range(n)",
"_",
"range(n)",
"range",
"n",
"for _ in range(n)",
"1",
"l=[1 for _ in range(n)]",
"l",
"[1 for _ in range(n)]",
"for i in range(n):\n\tif a[i]<a[i+1]:\n\t\tl[i]=a[i+1]\n\t\t",
"i",
"range(n)",
"range",
"n",
"if a[i]<a[i+1]:\n\t\tl[i]=a[i+1]\n\t\t",
"a[i]<a[i+1]",
"a[i]",
"a",
"i",
"a[i+1]",
"a",
"i+1",
"i",
"1",
"l[i]=a[i+1]",
"l[i]",
"l",
"i",
"a[i+1]",
"a",
"i+1",
"i",
"1",
"ans=1",
"ans",
"1",
"for i in range(n-1,-1,-1):\n\tif b[i+1]<b[i]:\n\t\tif l[i]>b[i]:\n\t\t\tans=0\n\t\telse:\n\t\t\tl[i]=b[i]\n\tm[i]=min(m[i],b[i])\n\t",
"i",
"range(n-1,-1,-1)",
"range",
"n-1",
"n",
"1",
"-1",
"-1",
"if b[i+1]<b[i]:\n\t\tif l[i]>b[i]:\n\t\t\tans=0\n\t\telse:\n\t\t\tl[i]=b[i]\n\t",
"b[i+1]<b[i]",
"b[i+1]",
"b",
"i+1",
"i",
"1",
"b[i]",
"b",
"i",
"if l[i]>b[i]:\n\t\t\tans=0\n\t\telse:\n\t\t\tl[i]=b[i]\n\t",
"l[i]>b[i]",
"l[i]",
"l",
"i",
"b[i]",
"b",
"i",
"ans=0",
"ans",
"0",
"l[i]=b[i]",
"l[i]",
"l",
"i",
"b[i]",
"b",
"i",
"m[i]=min(m[i],b[i])",
"m[i]",
"m",
"i",
"min(m[i],b[i])",
"min",
"m[i]",
"m",
"i",
"b[i]",
"b",
"i",
"for i in range(n):\n\tans=(ans*(m[i]-l[i]+1))%(10**9+7)\n\tif m[i]<l[i]:\n\t\tans=0",
"i",
"range(n)",
"range",
"n",
"ans=(ans*(m[i]-l[i]+1))%(10**9+7)",
"ans",
"(ans*(m[i]-l[i]+1))%(10**9+7)",
"ans*(m[i]-l[i]+1)",
"ans",
"m[i]-l[i]+1",
"m[i]-l[i]",
"m[i]",
"m",
"i",
"l[i]",
"l",
"i",
"1",
"10**9+7",
"10**9",
"10",
"9",
"7",
"if m[i]<l[i]:\n\t\tans=0",
"m[i]<l[i]",
"m[i]",
"m",
"i",
"l[i]",
"l",
"i",
"ans=0",
"ans",
"0",
"print(ans)",
"print",
"ans",
"b=list(map(int,input().split()))+[0]",
"list(map(int,input().split()))+[0]",
"b",
"l=[1 for _ in range(n)]",
"[1 for _ in range(n)]",
"l",
"ans=(ans*(m[i]-l[i]+1))%(10**9+7)",
"(ans*(m[i]-l[i]+1))%(10**9+7)",
"ans",
"m=[a[i] for i in range(1,n+1)]",
"[a[i] for i in range(1,n+1)]",
"m",
"n=int(input())",
"int(input())",
"n",
"ans=1",
"1",
"ans",
"ans=0",
"0",
"ans",
"ans=0",
"0",
"ans",
"a=[0]+list(map(int,input().split()))",
"[0]+list(map(int,input().split()))",
"a"
] |
n=int(input())
a=[0]+list(map(int,input().split()))
b=list(map(int,input().split()))+[0]
m=[a[i] for i in range(1,n+1)]
l=[1 for _ in range(n)]
for i in range(n):
if a[i]<a[i+1]:
l[i]=a[i+1]
ans=1
for i in range(n-1,-1,-1):
if b[i+1]<b[i]:
if l[i]>b[i]:
ans=0
else:
l[i]=b[i]
m[i]=min(m[i],b[i])
for i in range(n):
ans=(ans*(m[i]-l[i]+1))%(10**9+7)
if m[i]<l[i]:
ans=0
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
2,
2,
39,
17,
13,
39,
18,
13,
17,
0,
13,
2,
2,
39,
18,
13,
17,
13,
39,
17,
41,
28,
13,
4,
13,
2,
13,
17,
4,
17,
0,
13,
13,
41,
28,
13,
4,
13,
2,
13,
17,
4,
17,
0,
13,
13,
28,
13,
4,
13,
17,
2,
13,
17,
14,
40,
18,
13,
2,
13,
17,
18,
13,
13,
0,
18,
13,
13,
18,
13,
13,
28,
13,
4,
13,
17,
2,
13,
17,
14,
40,
18,
13,
2,
2,
13,
13,
17,
18,
13,
2,
2,
13,
13,
17,
0,
18,
13,
2,
2,
13,
13,
17,
18,
13,
2,
2,
13,
13,
17,
0,
13,
2,
2,
17,
17,
17,
0,
13,
17,
28,
13,
4,
13,
17,
2,
13,
17,
14,
2,
2,
18,
13,
13,
18,
13,
13,
17,
0,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
13,
13,
14,
2,
2,
2,
18,
13,
13,
17,
2,
18,
13,
13,
18,
13,
13,
2,
2,
18,
13,
13,
17,
2,
18,
13,
13,
18,
13,
13,
4,
13,
17,
4,
13,
17,
4,
13,
13,
10,
4,
13,
10,
4,
13,
10,
17,
13,
10,
13,
13,
10,
13,
13,
10,
4,
13,
10,
13,
13,
10,
2,
13,
10,
2,
13,
10,
4,
13,
10,
2,
13
] |
[
[
237,
2
],
[
222,
8
],
[
249,
20
],
[
246,
32
],
[
223,
37
],
[
223,
40
],
[
252,
43
],
[
250,
48
],
[
250,
50
],
[
56,
55
],
[
238,
59
],
[
234,
64
],
[
69,
68
],
[
238,
72
],
[
240,
77
],
[
81,
80
],
[
238,
85
],
[
247,
90
],
[
223,
90
],
[
80,
92
],
[
247,
95
],
[
223,
95
],
[
80,
96
],
[
101,
98
],
[
235,
99
],
[
80,
100
],
[
247,
102
],
[
223,
102
],
[
80,
103
],
[
106,
105
],
[
238,
110
],
[
253,
115
],
[
250,
115
],
[
238,
118
],
[
105,
119
],
[
253,
122
],
[
250,
122
],
[
238,
125
],
[
105,
126
],
[
136,
129
],
[
241,
130
],
[
238,
133
],
[
105,
134
],
[
253,
137
],
[
250,
137
],
[
238,
140
],
[
105,
141
],
[
243,
144
],
[
228,
151
],
[
155,
154
],
[
238,
159
],
[
98,
164
],
[
235,
165
],
[
154,
166
],
[
241,
168
],
[
154,
169
],
[
225,
172
],
[
253,
176
],
[
250,
176
],
[
154,
177
],
[
247,
179
],
[
223,
179
],
[
154,
180
],
[
231,
182
],
[
244,
183
],
[
98,
188
],
[
235,
189
],
[
154,
190
],
[
253,
194
],
[
250,
194
],
[
154,
195
],
[
98,
196
],
[
235,
197
],
[
154,
198
],
[
241,
202
],
[
154,
203
],
[
247,
207
],
[
223,
207
],
[
154,
208
],
[
241,
210
],
[
154,
211
],
[
232,
220
],
[
226,
220
],
[
229,
220
],
[
222,
223
],
[
225,
226
],
[
228,
229
],
[
244,
231
],
[
231,
232
],
[
234,
235
],
[
237,
238
],
[
240,
241
],
[
243,
244
],
[
246,
247
],
[
249,
250
],
[
252,
253
]
] |
[
"# CODE FESTIVAL 2016 qual C C - 二人のアルピニスト / Two Alpinists\nN = int(input())\nT = list(map(int,input().split()))\nA = list(map(int,input().split()))\nT = [0] + T + [T[-1]]\nA = [A[0]] + A + [0]\n\nK = [0 for k in range(N+2)]\nL = [0 for k in range(N+2)]\nfor k in range(1,N+2):\n if T[k-1] != T[k]:\n K[k] = T[k]\nfor k in range(1,N+2):\n if A[N-k+2] != A[N-k+1]:\n L[N-k+1] = A[N-k+1]\n\nMOD = 10**9 + 7\nans = 1\nfor k in range(1,N+1):\n if K[k] == L[k] == 0:\n ans *= min(A[k],T[k])\n ans %= MOD\n elif (K[k]>0 and A[k]<K[k]) or (L[k]>0 and T[k]<L[k]):\n print(0)\n exit(0)\nprint(ans)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"T = list(map(int,input().split()))",
"T",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"A = list(map(int,input().split()))",
"A",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"T = [0] + T + [T[-1]]",
"T",
"[0] + T + [T[-1]]",
"[0] + T",
"[0]",
"0",
"T",
"[T[-1]]",
"T[-1]",
"T",
"-1",
"A = [A[0]] + A + [0]",
"A",
"[A[0]] + A + [0]",
"[A[0]] + A",
"[A[0]]",
"A[0]",
"A",
"0",
"A",
"[0]",
"0",
"0 for k in range(N+2)",
"for k in range(N+2)",
"k",
"range(N+2)",
"range",
"N+2",
"N",
"2",
"for k in range(N+2)",
"0",
"K = [0 for k in range(N+2)]",
"K",
"[0 for k in range(N+2)]",
"0 for k in range(N+2)",
"for k in range(N+2)",
"k",
"range(N+2)",
"range",
"N+2",
"N",
"2",
"for k in range(N+2)",
"0",
"L = [0 for k in range(N+2)]",
"L",
"[0 for k in range(N+2)]",
"for k in range(1,N+2):\n if T[k-1] != T[k]:\n K[k] = T[k]",
"k",
"range(1,N+2)",
"range",
"1",
"N+2",
"N",
"2",
"if T[k-1] != T[k]:\n K[k] = T[k]",
"T[k-1] != T[k]",
"T[k-1]",
"T",
"k-1",
"k",
"1",
"T[k]",
"T",
"k",
"K[k] = T[k]",
"K[k]",
"K",
"k",
"T[k]",
"T",
"k",
"for k in range(1,N+2):\n if A[N-k+2] != A[N-k+1]:\n L[N-k+1] = A[N-k+1]",
"k",
"range(1,N+2)",
"range",
"1",
"N+2",
"N",
"2",
"if A[N-k+2] != A[N-k+1]:\n L[N-k+1] = A[N-k+1]",
"A[N-k+2] != A[N-k+1]",
"A[N-k+2]",
"A",
"N-k+2",
"N-k",
"N",
"k",
"2",
"A[N-k+1]",
"A",
"N-k+1",
"N-k",
"N",
"k",
"1",
"L[N-k+1] = A[N-k+1]",
"L[N-k+1]",
"L",
"N-k+1",
"N-k",
"N",
"k",
"1",
"A[N-k+1]",
"A",
"N-k+1",
"N-k",
"N",
"k",
"1",
"MOD = 10**9 + 7",
"MOD",
"10**9 + 7",
"10**9",
"10",
"9",
"7",
"ans = 1",
"ans",
"1",
"for k in range(1,N+1):\n if K[k] == L[k] == 0:\n ans *= min(A[k],T[k])\n ans %= MOD\n elif (K[k]>0 and A[k]<K[k]) or (L[k]>0 and T[k]<L[k]):\n print(0)\n exit(0)",
"k",
"range(1,N+1)",
"range",
"1",
"N+1",
"N",
"1",
"if K[k] == L[k] == 0:\n ans *= min(A[k],T[k])\n ans %= MOD\n elif (K[k]>0 and A[k]<K[k]) or (L[k]>0 and T[k]<L[k]):\n print(0)\n exit(0)",
"K[k] == L[k] == 0",
"K[k] == L[k]",
"K[k]",
"K",
"k",
"L[k]",
"L",
"k",
"0",
"ans *= min(A[k],T[k])",
"ans",
"min(A[k],T[k])",
"min",
"A[k]",
"A",
"k",
"T[k]",
"T",
"k",
"ans %= MOD",
"ans",
"MOD",
"elif (K[k]>0 and A[k]<K[k]) or (L[k]>0 and T[k]<L[k]):\n print(0)\n exit(0)",
"(K[k]>0 and A[k]<K[k]) or (L[k]>0 and T[k]<L[k])",
"K[k]>0 and A[k]<K[k]",
"K[k]>0",
"K[k]",
"K",
"k",
"0",
"A[k]<K[k]",
"A[k]",
"A",
"k",
"K[k]",
"K",
"k",
"L[k]>0 and T[k]<L[k]",
"L[k]>0",
"L[k]",
"L",
"k",
"0",
"T[k]<L[k]",
"T[k]",
"T",
"k",
"L[k]",
"L",
"k",
"print(0)",
"print",
"0",
"exit(0)",
"exit",
"0",
"print(ans)",
"print",
"ans",
"T = list(map(int,input().split()))",
"list(map(int,input().split()))",
"T",
"ans *= min(A[k],T[k])",
"min(A[k],T[k])",
"ans",
"ans = 1",
"1",
"ans",
"ans %= MOD",
"MOD",
"ans",
"K = [0 for k in range(N+2)]",
"[0 for k in range(N+2)]",
"K",
"N = int(input())",
"int(input())",
"N",
"L = [0 for k in range(N+2)]",
"[0 for k in range(N+2)]",
"L",
"MOD = 10**9 + 7",
"10**9 + 7",
"MOD",
"T = [0] + T + [T[-1]]",
"[0] + T + [T[-1]]",
"T",
"A = list(map(int,input().split()))",
"list(map(int,input().split()))",
"A",
"A = [A[0]] + A + [0]",
"[A[0]] + A + [0]",
"A"
] |
# CODE FESTIVAL 2016 qual C C - 二人のアルピニスト / Two Alpinists
N = int(input())
T = list(map(int,input().split()))
A = list(map(int,input().split()))
T = [0] + T + [T[-1]]
A = [A[0]] + A + [0]
K = [0 for k in range(N+2)]
L = [0 for k in range(N+2)]
for k in range(1,N+2):
if T[k-1] != T[k]:
K[k] = T[k]
for k in range(1,N+2):
if A[N-k+2] != A[N-k+1]:
L[N-k+1] = A[N-k+1]
MOD = 10**9 + 7
ans = 1
for k in range(1,N+1):
if K[k] == L[k] == 0:
ans *= min(A[k],T[k])
ans %= MOD
elif (K[k]>0 and A[k]<K[k]) or (L[k]>0 and T[k]<L[k]):
print(0)
exit(0)
print(ans)
|
[
7,
12,
13,
14,
40,
18,
13,
17,
18,
13,
17,
29,
17,
0,
13,
17,
28,
13,
4,
13,
13,
14,
2,
18,
13,
13,
18,
13,
13,
14,
2,
40,
18,
13,
13,
18,
13,
17,
40,
18,
13,
13,
18,
13,
17,
29,
17,
0,
13,
13,
3,
28,
13,
4,
13,
13,
13,
14,
2,
18,
13,
13,
18,
13,
13,
29,
17,
0,
13,
2,
39,
17,
13,
0,
13,
17,
13,
2,
13,
17,
42,
2,
40,
13,
13,
2,
18,
13,
13,
18,
13,
13,
14,
2,
40,
13,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
18,
13,
13,
17,
0,
18,
13,
13,
18,
13,
13,
0,
13,
17,
0,
18,
13,
13,
17,
42,
2,
2,
13,
13,
40,
18,
13,
13,
18,
13,
13,
14,
2,
2,
13,
2,
13,
17,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
18,
13,
13,
17,
0,
18,
13,
13,
18,
13,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
2,
2,
13,
18,
13,
13,
2,
2,
17,
17,
17,
29,
13,
23,
13,
23,
13,
23,
13,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
13,
4,
13,
13,
13,
13,
10,
12,
13,
10,
4,
13,
10,
4,
13,
10,
4,
13
] |
[
[
194,
6
],
[
196,
9
],
[
15,
14
],
[
18,
17
],
[
192,
20
],
[
194,
24
],
[
17,
25
],
[
196,
27
],
[
17,
28
],
[
194,
33
],
[
17,
34
],
[
194,
36
],
[
194,
40
],
[
17,
41
],
[
196,
43
],
[
49,
48
],
[
17,
49
],
[
53,
52
],
[
48,
55
],
[
14,
55
],
[
192,
56
],
[
194,
60
],
[
52,
61
],
[
196,
63
],
[
52,
64
],
[
69,
68
],
[
192,
72
],
[
75,
74
],
[
77,
76
],
[
192,
78
],
[
74,
83
],
[
118,
83
],
[
76,
84
],
[
194,
87
],
[
74,
88
],
[
118,
88
],
[
196,
90
],
[
74,
91
],
[
118,
91
],
[
74,
95
],
[
118,
95
],
[
194,
98
],
[
74,
99
],
[
118,
99
],
[
194,
101
],
[
74,
103
],
[
118,
103
],
[
109,
106
],
[
68,
107
],
[
74,
108
],
[
118,
108
],
[
114,
111
],
[
68,
112
],
[
74,
113
],
[
118,
113
],
[
194,
115
],
[
74,
116
],
[
118,
116
],
[
119,
118
],
[
124,
121
],
[
68,
122
],
[
118,
123
],
[
74,
123
],
[
118,
128
],
[
74,
128
],
[
76,
129
],
[
166,
129
],
[
196,
132
],
[
76,
133
],
[
166,
133
],
[
194,
135
],
[
76,
136
],
[
166,
136
],
[
76,
140
],
[
166,
140
],
[
192,
142
],
[
196,
146
],
[
76,
147
],
[
166,
147
],
[
196,
149
],
[
76,
151
],
[
166,
151
],
[
157,
154
],
[
68,
155
],
[
76,
156
],
[
166,
156
],
[
162,
159
],
[
68,
160
],
[
76,
161
],
[
166,
161
],
[
196,
163
],
[
76,
164
],
[
166,
164
],
[
167,
166
],
[
170,
169
],
[
173,
172
],
[
192,
175
],
[
178,
177
],
[
169,
180
],
[
177,
180
],
[
68,
182
],
[
172,
183
],
[
177,
190
],
[
169,
190
],
[
192,
192
],
[
194,
194
],
[
196,
196
],
[
233,
198
],
[
239,
204
],
[
236,
214
],
[
231,
225
],
[
234,
226
],
[
240,
227
],
[
237,
228
],
[
233,
234
],
[
236,
237
],
[
239,
240
]
] |
[
"def work(n, t, a):\n if t[-1] != a[0]:\n return 0\n\n middle = 0\n for i in xrange(n):\n if t[i] == a[i]:\n if t[i] != t[-1] or t[i] != a[0]:\n return 0\n middle = i\n break\n for i in xrange(middle, n):\n if t[i] < a[i]:\n return 0\n\n record = [None] * n\n left, right = 0, n - 1\n\n while left <= right and t[left] < a[left]:\n if not left or t[left] > t[left-1]:\n record[left] = 1\n else:\n record[left] = t[left]\n left += 1\n \n record[left] = 1\n while left < right and a[right] <= t[right]:\n if right == n - 1 or a[right] > a[right+1]:\n record[right] = 1\n else:\n record[right] = a[right]\n right -= 1\n\n ans = 1\n for i in xrange(n):\n ans = (ans*record[i]) % (10**9+7)\n return ans\n\n\nn = int(raw_input())\nt = map(int, raw_input().split())\na = map(int, raw_input().split())\n\nprint work(n, t, a)",
"def work(n, t, a):\n if t[-1] != a[0]:\n return 0\n\n middle = 0\n for i in xrange(n):\n if t[i] == a[i]:\n if t[i] != t[-1] or t[i] != a[0]:\n return 0\n middle = i\n break\n for i in xrange(middle, n):\n if t[i] < a[i]:\n return 0\n\n record = [None] * n\n left, right = 0, n - 1\n\n while left <= right and t[left] < a[left]:\n if not left or t[left] > t[left-1]:\n record[left] = 1\n else:\n record[left] = t[left]\n left += 1\n \n record[left] = 1\n while left < right and a[right] <= t[right]:\n if right == n - 1 or a[right] > a[right+1]:\n record[right] = 1\n else:\n record[right] = a[right]\n right -= 1\n\n ans = 1\n for i in xrange(n):\n ans = (ans*record[i]) % (10**9+7)\n return ans",
"work",
"if t[-1] != a[0]:\n return 0\n\n ",
"t[-1] != a[0]",
"t[-1]",
"t",
"-1",
"a[0]",
"a",
"0",
"return 0",
"0",
"middle = 0",
"middle",
"0",
"for i in xrange(n):\n if t[i] == a[i]:\n if t[i] != t[-1] or t[i] != a[0]:\n return 0\n middle = i\n break\n ",
"i",
"xrange(n)",
"xrange",
"n",
"if t[i] == a[i]:\n if t[i] != t[-1] or t[i] != a[0]:\n return 0\n middle = i\n break\n ",
"t[i] == a[i]",
"t[i]",
"t",
"i",
"a[i]",
"a",
"i",
"if t[i] != t[-1] or t[i] != a[0]:\n return 0\n ",
"t[i] != t[-1] or t[i] != a[0]",
"t[i] != t[-1]",
"t[i]",
"t",
"i",
"t[-1]",
"t",
"-1",
"t[i] != a[0]",
"t[i]",
"t",
"i",
"a[0]",
"a",
"0",
"return 0",
"0",
"middle = i",
"middle",
"i",
"break",
"for i in xrange(middle, n):\n if t[i] < a[i]:\n return 0\n\n ",
"i",
"xrange(middle, n)",
"xrange",
"middle",
"n",
"if t[i] < a[i]:\n return 0\n\n ",
"t[i] < a[i]",
"t[i]",
"t",
"i",
"a[i]",
"a",
"i",
"return 0",
"0",
"record = [None] * n",
"record",
"[None] * n",
"[None]",
"None",
"n",
"left, right = 0, n - 1",
"left",
"0",
"right",
"n - 1",
"n",
"1",
"while left <= right and t[left] < a[left]:\n if not left or t[left] > t[left-1]:\n record[left] = 1\n else:\n record[left] = t[left]\n left += 1\n \n ",
"left <= right and t[left] < a[left]",
"left <= right",
"left",
"right",
"t[left] < a[left]",
"t[left]",
"t",
"left",
"a[left]",
"a",
"left",
"if not left or t[left] > t[left-1]:\n record[left] = 1\n else:\n record[left] = t[left]\n ",
"not left or t[left] > t[left-1]",
"not left",
"left",
"t[left] > t[left-1]",
"t[left]",
"t",
"left",
"t[left-1]",
"t",
"left-1",
"left",
"1",
"record[left] = 1",
"record[left]",
"record",
"left",
"1",
"record[left] = t[left]",
"record[left]",
"record",
"left",
"t[left]",
"t",
"left",
"left += 1",
"left",
"1",
"record[left] = 1",
"record[left]",
"record",
"left",
"1",
"while left < right and a[right] <= t[right]:\n if right == n - 1 or a[right] > a[right+1]:\n record[right] = 1\n else:\n record[right] = a[right]\n right -= 1\n\n ",
"left < right and a[right] <= t[right]",
"left < right",
"left",
"right",
"a[right] <= t[right]",
"a[right]",
"a",
"right",
"t[right]",
"t",
"right",
"if right == n - 1 or a[right] > a[right+1]:\n record[right] = 1\n else:\n record[right] = a[right]\n ",
"right == n - 1 or a[right] > a[right+1]",
"right == n - 1",
"right",
"n - 1",
"n",
"1",
"a[right] > a[right+1]",
"a[right]",
"a",
"right",
"a[right+1]",
"a",
"right+1",
"right",
"1",
"record[right] = 1",
"record[right]",
"record",
"right",
"1",
"record[right] = a[right]",
"record[right]",
"record",
"right",
"a[right]",
"a",
"right",
"right -= 1",
"right",
"1",
"ans = 1",
"ans",
"1",
"for i in xrange(n):\n ans = (ans*record[i]) % (10**9+7)\n ",
"i",
"xrange(n)",
"xrange",
"n",
"ans = (ans*record[i]) % (10**9+7)",
"ans",
"(ans*record[i]) % (10**9+7)",
"ans*record[i]",
"ans",
"record[i]",
"record",
"i",
"10**9+7",
"10**9",
"10",
"9",
"7",
"return ans",
"ans",
"n",
"n",
"t",
"t",
"a",
"a",
"n = int(raw_input())",
"n",
"int(raw_input())",
"int",
"raw_input()",
"raw_input",
"t = map(int, raw_input().split())",
"t",
"map(int, raw_input().split())",
"map",
"int",
"raw_input().split()",
"().split",
"()",
"raw_input",
"split",
"a = map(int, raw_input().split())",
"a",
"map(int, raw_input().split())",
"map",
"int",
"raw_input().split()",
"().split",
"()",
"raw_input",
"split",
"print",
"work(n, t, a)",
"work",
"n",
"t",
"a",
"def work(n, t, a):\n if t[-1] != a[0]:\n return 0\n\n middle = 0\n for i in xrange(n):\n if t[i] == a[i]:\n if t[i] != t[-1] or t[i] != a[0]:\n return 0\n middle = i\n break\n for i in xrange(middle, n):\n if t[i] < a[i]:\n return 0\n\n record = [None] * n\n left, right = 0, n - 1\n\n while left <= right and t[left] < a[left]:\n if not left or t[left] > t[left-1]:\n record[left] = 1\n else:\n record[left] = t[left]\n left += 1\n \n record[left] = 1\n while left < right and a[right] <= t[right]:\n if right == n - 1 or a[right] > a[right+1]:\n record[right] = 1\n else:\n record[right] = a[right]\n right -= 1\n\n ans = 1\n for i in xrange(n):\n ans = (ans*record[i]) % (10**9+7)\n return ans",
"def work(n, t, a):\n if t[-1] != a[0]:\n return 0\n\n middle = 0\n for i in xrange(n):\n if t[i] == a[i]:\n if t[i] != t[-1] or t[i] != a[0]:\n return 0\n middle = i\n break\n for i in xrange(middle, n):\n if t[i] < a[i]:\n return 0\n\n record = [None] * n\n left, right = 0, n - 1\n\n while left <= right and t[left] < a[left]:\n if not left or t[left] > t[left-1]:\n record[left] = 1\n else:\n record[left] = t[left]\n left += 1\n \n record[left] = 1\n while left < right and a[right] <= t[right]:\n if right == n - 1 or a[right] > a[right+1]:\n record[right] = 1\n else:\n record[right] = a[right]\n right -= 1\n\n ans = 1\n for i in xrange(n):\n ans = (ans*record[i]) % (10**9+7)\n return ans",
"work",
"n = int(raw_input())",
"int(raw_input())",
"n",
"a = map(int, raw_input().split())",
"map(int, raw_input().split())",
"a",
"t = map(int, raw_input().split())",
"map(int, raw_input().split())",
"t"
] |
def work(n, t, a):
if t[-1] != a[0]:
return 0
middle = 0
for i in xrange(n):
if t[i] == a[i]:
if t[i] != t[-1] or t[i] != a[0]:
return 0
middle = i
break
for i in xrange(middle, n):
if t[i] < a[i]:
return 0
record = [None] * n
left, right = 0, n - 1
while left <= right and t[left] < a[left]:
if not left or t[left] > t[left-1]:
record[left] = 1
else:
record[left] = t[left]
left += 1
record[left] = 1
while left < right and a[right] <= t[right]:
if right == n - 1 or a[right] > a[right+1]:
record[right] = 1
else:
record[right] = a[right]
right -= 1
ans = 1
for i in xrange(n):
ans = (ans*record[i]) % (10**9+7)
return ans
n = int(raw_input())
t = map(int, raw_input().split())
a = map(int, raw_input().split())
print work(n, t, a)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
28,
13,
4,
13,
2,
13,
17,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
4,
13,
17,
4,
13,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
4,
13,
17,
4,
13,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
17,
0,
13,
17,
14,
40,
13,
17,
14,
40,
18,
13,
13,
18,
13,
2,
13,
17,
0,
13,
17,
0,
13,
17,
14,
40,
13,
2,
13,
17,
14,
40,
18,
13,
13,
18,
13,
2,
13,
17,
0,
13,
17,
0,
13,
17,
14,
2,
13,
13,
14,
40,
18,
13,
13,
18,
13,
13,
4,
13,
17,
4,
13,
14,
13,
14,
2,
18,
13,
13,
18,
13,
13,
4,
13,
17,
4,
13,
14,
13,
14,
2,
18,
13,
13,
18,
13,
13,
4,
13,
17,
4,
13,
0,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
13,
2,
2,
17,
17,
17,
4,
13,
13,
10,
17,
13,
10,
17,
13,
10,
17,
13,
10,
4,
13,
10,
4,
13,
10,
17,
13,
10,
17,
13,
10,
2,
13,
10,
4,
13,
10,
17,
13,
10,
4,
13,
10,
17,
13
] |
[
[
204,
2
],
[
222,
8
],
[
201,
20
],
[
33,
32
],
[
205,
36
],
[
223,
41
],
[
32,
42
],
[
223,
44
],
[
32,
46
],
[
202,
56
],
[
32,
57
],
[
202,
59
],
[
32,
61
],
[
198,
69
],
[
73,
72
],
[
205,
75
],
[
192,
77
],
[
195,
80
],
[
72,
84
],
[
223,
89
],
[
72,
90
],
[
223,
92
],
[
72,
94
],
[
207,
97
],
[
210,
100
],
[
72,
104
],
[
205,
106
],
[
202,
111
],
[
72,
112
],
[
202,
114
],
[
72,
116
],
[
219,
119
],
[
225,
122
],
[
211,
126
],
[
208,
126
],
[
193,
126
],
[
226,
127
],
[
220,
127
],
[
196,
127
],
[
223,
131
],
[
72,
132
],
[
202,
134
],
[
72,
135
],
[
223,
146
],
[
72,
147
],
[
202,
149
],
[
72,
150
],
[
223,
161
],
[
72,
162
],
[
202,
164
],
[
72,
165
],
[
216,
172
],
[
223,
176
],
[
72,
177
],
[
202,
179
],
[
72,
180
],
[
213,
182
],
[
214,
190
],
[
217,
190
],
[
199,
190
],
[
192,
193
],
[
195,
196
],
[
198,
199
],
[
201,
202
],
[
204,
205
],
[
207,
208
],
[
210,
211
],
[
213,
214
],
[
216,
217
],
[
219,
220
],
[
222,
223
],
[
225,
226
]
] |
[
"n = int(input())\n\nal = list(map(int,input().split()))\ntl = list(map(int,input().split()))\n\n\nfor i in range(n-1):\n if al[i] > al[i+1]:\n print(0)\n exit()\n if tl[i] < tl[i+1]:\n print(0)\n exit()\n\nans = 1\nfor i in range(n):\n a = False\n t = False\n if i != 0:\n if al[i] != al[i-1]:\n a = True\n else:\n a = True\n if i != n-1:\n if tl[i] != tl[i+1]:\n t = True\n else:\n t = True\n if a and t:\n if al[i] != tl[i]:\n print(0)\n exit()\n elif a:\n if al[i] > tl[i]:\n print(0)\n exit()\n elif t:\n if al[i] < tl[i]:\n print(0)\n exit()\n else:\n ans *= min(al[i], tl[i])\n ans %= 10**9 + 7\n\nprint(ans)\n\n\n\n",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"al = list(map(int,input().split()))",
"al",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"tl = list(map(int,input().split()))",
"tl",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"for i in range(n-1):\n if al[i] > al[i+1]:\n print(0)\n exit()\n if tl[i] < tl[i+1]:\n print(0)\n exit()",
"i",
"range(n-1)",
"range",
"n-1",
"n",
"1",
"if al[i] > al[i+1]:\n print(0)\n exit()\n ",
"al[i] > al[i+1]",
"al[i]",
"al",
"i",
"al[i+1]",
"al",
"i+1",
"i",
"1",
"print(0)",
"print",
"0",
"exit()",
"exit",
"if tl[i] < tl[i+1]:\n print(0)\n exit()",
"tl[i] < tl[i+1]",
"tl[i]",
"tl",
"i",
"tl[i+1]",
"tl",
"i+1",
"i",
"1",
"print(0)",
"print",
"0",
"exit()",
"exit",
"ans = 1",
"ans",
"1",
"for i in range(n):\n a = False\n t = False\n if i != 0:\n if al[i] != al[i-1]:\n a = True\n else:\n a = True\n if i != n-1:\n if tl[i] != tl[i+1]:\n t = True\n else:\n t = True\n if a and t:\n if al[i] != tl[i]:\n print(0)\n exit()\n elif a:\n if al[i] > tl[i]:\n print(0)\n exit()\n elif t:\n if al[i] < tl[i]:\n print(0)\n exit()\n else:\n ans *= min(al[i], tl[i])\n ans %= 10**9 + 7",
"i",
"range(n)",
"range",
"n",
"a = False",
"a",
"False",
"t = False",
"t",
"False",
"if i != 0:\n if al[i] != al[i-1]:\n a = True\n else:\n a = True\n ",
"i != 0",
"i",
"0",
"if al[i] != al[i-1]:\n a = True\n ",
"al[i] != al[i-1]",
"al[i]",
"al",
"i",
"al[i-1]",
"al",
"i-1",
"i",
"1",
"a = True",
"a",
"True",
"a = True",
"a",
"True",
"if i != n-1:\n if tl[i] != tl[i+1]:\n t = True\n else:\n t = True\n ",
"i != n-1",
"i",
"n-1",
"n",
"1",
"if tl[i] != tl[i+1]:\n t = True\n ",
"tl[i] != tl[i+1]",
"tl[i]",
"tl",
"i",
"tl[i+1]",
"tl",
"i+1",
"i",
"1",
"t = True",
"t",
"True",
"t = True",
"t",
"True",
"if a and t:\n if al[i] != tl[i]:\n print(0)\n exit()\n elif a:\n if al[i] > tl[i]:\n print(0)\n exit()\n elif t:\n if al[i] < tl[i]:\n print(0)\n exit()\n else:\n ans *= min(al[i], tl[i])\n ans %= 10**9 + 7",
"a and t",
"a",
"t",
"if al[i] != tl[i]:\n print(0)\n exit()\n ",
"al[i] != tl[i]",
"al[i]",
"al",
"i",
"tl[i]",
"tl",
"i",
"print(0)",
"print",
"0",
"exit()",
"exit",
"elif a:\n if al[i] > tl[i]:\n print(0)\n exit()\n ",
"a",
"if al[i] > tl[i]:\n print(0)\n exit()\n ",
"al[i] > tl[i]",
"al[i]",
"al",
"i",
"tl[i]",
"tl",
"i",
"print(0)",
"print",
"0",
"exit()",
"exit",
"elif t:\n if al[i] < tl[i]:\n print(0)\n exit()\n ",
"t",
"if al[i] < tl[i]:\n print(0)\n exit()\n ",
"al[i] < tl[i]",
"al[i]",
"al",
"i",
"tl[i]",
"tl",
"i",
"print(0)",
"print",
"0",
"exit()",
"exit",
"ans *= min(al[i], tl[i])",
"ans",
"min(al[i], tl[i])",
"min",
"al[i]",
"al",
"i",
"tl[i]",
"tl",
"i",
"ans %= 10**9 + 7",
"ans",
"10**9 + 7",
"10**9",
"10",
"9",
"7",
"print(ans)",
"print",
"ans",
"a = False",
"False",
"a",
"t = False",
"False",
"t",
"ans = 1",
"1",
"ans",
"tl = list(map(int,input().split()))",
"list(map(int,input().split()))",
"tl",
"n = int(input())",
"int(input())",
"n",
"a = True",
"True",
"a",
"a = True",
"True",
"a",
"ans %= 10**9 + 7",
"10**9 + 7",
"ans",
"ans *= min(al[i], tl[i])",
"min(al[i], tl[i])",
"ans",
"t = True",
"True",
"t",
"al = list(map(int,input().split()))",
"list(map(int,input().split()))",
"al",
"t = True",
"True",
"t"
] |
n = int(input())
al = list(map(int,input().split()))
tl = list(map(int,input().split()))
for i in range(n-1):
if al[i] > al[i+1]:
print(0)
exit()
if tl[i] < tl[i+1]:
print(0)
exit()
ans = 1
for i in range(n):
a = False
t = False
if i != 0:
if al[i] != al[i-1]:
a = True
else:
a = True
if i != n-1:
if tl[i] != tl[i+1]:
t = True
else:
t = True
if a and t:
if al[i] != tl[i]:
print(0)
exit()
elif a:
if al[i] > tl[i]:
print(0)
exit()
elif t:
if al[i] < tl[i]:
print(0)
exit()
else:
ans *= min(al[i], tl[i])
ans %= 10**9 + 7
print(ans)
|
[
7,
0,
13,
2,
2,
17,
17,
17,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
2,
39,
17,
13,
13,
2,
39,
2,
17,
17,
13,
0,
13,
2,
39,
17,
13,
13,
2,
39,
2,
17,
17,
13,
0,
18,
13,
17,
18,
13,
17,
0,
18,
13,
17,
18,
28,
13,
4,
13,
17,
13,
14,
2,
18,
13,
2,
13,
17,
18,
13,
13,
0,
18,
13,
13,
18,
13,
13,
0,
18,
13,
13,
18,
0,
18,
13,
13,
18,
13,
13,
0,
18,
13,
17,
18,
13,
17,
0,
18,
13,
17,
18,
28,
13,
4,
13,
4,
13,
2,
13,
17,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
18,
13,
13,
18,
13,
13,
0,
18,
13,
13,
18,
0,
18,
13,
13,
18,
13,
13,
0,
13,
17,
28,
13,
13,
13,
13,
4,
13,
13,
13,
13,
13,
0,
13,
4,
13,
13,
13,
0,
13,
4,
13,
13,
13,
0,
13,
4,
13,
17,
2,
2,
13,
13,
17,
0,
13,
13,
4,
13,
13,
10,
17,
13,
10,
4,
13,
10,
4,
13,
10,
2,
13,
10,
2,
13,
10,
13,
13,
10,
2,
13,
10,
4,
13,
10,
4,
13,
10,
2,
13,
10,
2,
13,
10,
4,
13,
10,
4,
13
] |
[
[
222,
2
],
[
228,
9
],
[
207,
15
],
[
210,
27
],
[
213,
39
],
[
229,
43
],
[
216,
44
],
[
229,
50
],
[
231,
52
],
[
229,
56
],
[
234,
57
],
[
229,
63
],
[
75,
65
],
[
214,
66
],
[
208,
69
],
[
75,
72
],
[
217,
73
],
[
78,
77
],
[
229,
81
],
[
208,
85
],
[
77,
87
],
[
208,
90
],
[
77,
91
],
[
103,
93
],
[
214,
94
],
[
77,
95
],
[
208,
97
],
[
77,
98
],
[
103,
100
],
[
217,
101
],
[
77,
102
],
[
108,
105
],
[
217,
106
],
[
77,
107
],
[
208,
109
],
[
77,
110
],
[
122,
112
],
[
232,
113
],
[
211,
116
],
[
122,
119
],
[
235,
120
],
[
125,
124
],
[
229,
130
],
[
211,
135
],
[
124,
136
],
[
211,
138
],
[
124,
140
],
[
153,
143
],
[
232,
144
],
[
124,
145
],
[
211,
147
],
[
124,
148
],
[
153,
150
],
[
235,
151
],
[
124,
152
],
[
158,
155
],
[
235,
156
],
[
124,
157
],
[
211,
159
],
[
124,
160
],
[
204,
162
],
[
214,
171
],
[
217,
172
],
[
232,
173
],
[
235,
174
],
[
225,
176
],
[
237,
182
],
[
240,
188
],
[
238,
194
],
[
226,
195
],
[
219,
198
],
[
223,
199
],
[
220,
202
],
[
241,
202
],
[
205,
202
],
[
204,
205
],
[
207,
208
],
[
210,
211
],
[
213,
214
],
[
216,
217
],
[
223,
219
],
[
219,
220
],
[
222,
223
],
[
225,
226
],
[
228,
229
],
[
231,
232
],
[
234,
235
],
[
237,
238
],
[
240,
241
]
] |
[
"MOD = 10**9 + 7\n\nN = int(input())\nTs = list(map(int, input().split()))\nAs = list(map(int, input().split()))\n\nminTs, maxTs = [1]*N, [10**9]*N\nminAs, maxAs = [1]*N, [10**9]*N\n\nminTs[0] = maxTs[0] = Ts[0]\nfor i in range(1, N):\n if Ts[i-1] < Ts[i]:\n minTs[i] = maxTs[i] = Ts[i]\n else:\n maxTs[i] = Ts[i]\n\nminAs[-1] = maxAs[-1] = As[-1]\nfor i in reversed(range(N-1)):\n if As[i] > As[i+1]:\n minAs[i] = maxAs[i] = As[i]\n else:\n maxAs[i] = As[i]\n\nans = 1\nfor minT, maxT, minA, maxA in zip(minTs, maxTs, minAs, maxAs):\n minH = max(minT, minA)\n maxH = min(maxT, maxA)\n ans *= max(0, maxH - minH + 1)\n ans %= MOD\nprint(ans)",
"MOD = 10**9 + 7",
"MOD",
"10**9 + 7",
"10**9",
"10",
"9",
"7",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"Ts = list(map(int, input().split()))",
"Ts",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"As = list(map(int, input().split()))",
"As",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"minTs, maxTs = [1]*N, [10**9]*N",
"minTs",
"[1]*N",
"[1]",
"1",
"N",
"maxTs",
"[10**9]*N",
"[10**9]",
"10**9",
"10",
"9",
"N",
"minAs, maxAs = [1]*N, [10**9]*N",
"minAs",
"[1]*N",
"[1]",
"1",
"N",
"maxAs",
"[10**9]*N",
"[10**9]",
"10**9",
"10",
"9",
"N",
"minTs[0] = maxTs[0] = Ts[0]",
"minTs[0]",
"minTs",
"0",
"Ts[0]",
"Ts",
"0",
"= maxTs[0] = Ts[0]",
"maxTs[0]",
"maxTs",
"0",
"Ts[0]",
"for i in range(1, N):\n if Ts[i-1] < Ts[i]:\n minTs[i] = maxTs[i] = Ts[i]\n else:\n maxTs[i] = Ts[i]",
"i",
"range(1, N)",
"range",
"1",
"N",
"if Ts[i-1] < Ts[i]:\n minTs[i] = maxTs[i] = Ts[i]\n else:\n maxTs[i] = Ts[i]",
"Ts[i-1] < Ts[i]",
"Ts[i-1]",
"Ts",
"i-1",
"i",
"1",
"Ts[i]",
"Ts",
"i",
"minTs[i] = maxTs[i] = Ts[i]",
"minTs[i]",
"minTs",
"i",
"Ts[i]",
"Ts",
"i",
"= maxTs[i] = Ts[i]",
"maxTs[i]",
"maxTs",
"i",
"Ts[i]",
"maxTs[i] = Ts[i]",
"maxTs[i]",
"maxTs",
"i",
"Ts[i]",
"Ts",
"i",
"minAs[-1] = maxAs[-1] = As[-1]",
"minAs[-1]",
"minAs",
"-1",
"As[-1]",
"As",
"-1",
"= maxAs[-1] = As[-1]",
"maxAs[-1]",
"maxAs",
"-1",
"As[-1]",
"for i in reversed(range(N-1)):\n if As[i] > As[i+1]:\n minAs[i] = maxAs[i] = As[i]\n else:\n maxAs[i] = As[i]",
"i",
"reversed(range(N-1))",
"reversed",
"range(N-1)",
"range",
"N-1",
"N",
"1",
"if As[i] > As[i+1]:\n minAs[i] = maxAs[i] = As[i]\n else:\n maxAs[i] = As[i]",
"As[i] > As[i+1]",
"As[i]",
"As",
"i",
"As[i+1]",
"As",
"i+1",
"i",
"1",
"minAs[i] = maxAs[i] = As[i]",
"minAs[i]",
"minAs",
"i",
"As[i]",
"As",
"i",
"= maxAs[i] = As[i]",
"maxAs[i]",
"maxAs",
"i",
"As[i]",
"maxAs[i] = As[i]",
"maxAs[i]",
"maxAs",
"i",
"As[i]",
"As",
"i",
"ans = 1",
"ans",
"1",
"for minT, maxT, minA, maxA in zip(minTs, maxTs, minAs, maxAs):\n minH = max(minT, minA)\n maxH = min(maxT, maxA)\n ans *= max(0, maxH - minH + 1)\n ans %= MOD",
"minT",
"maxT",
"minA",
"maxA",
"zip(minTs, maxTs, minAs, maxAs)",
"zip",
"minTs",
"maxTs",
"minAs",
"maxAs",
"minH = max(minT, minA)",
"minH",
"max(minT, minA)",
"max",
"minT",
"minA",
"maxH = min(maxT, maxA)",
"maxH",
"min(maxT, maxA)",
"min",
"maxT",
"maxA",
"ans *= max(0, maxH - minH + 1)",
"ans",
"max(0, maxH - minH + 1)",
"max",
"0",
"maxH - minH + 1",
"maxH - minH",
"maxH",
"minH",
"1",
"ans %= MOD",
"ans",
"MOD",
"print(ans)",
"print",
"ans",
"ans = 1",
"1",
"ans",
"Ts = list(map(int, input().split()))",
"list(map(int, input().split()))",
"Ts",
"As = list(map(int, input().split()))",
"list(map(int, input().split()))",
"As",
"minTs, maxTs = [1]*N, [10**9]*N",
"[1]*N",
"minTs",
"maxTs = [1]*N, [10**9]*N",
"[10**9]*N",
"maxTs",
"ans %= MOD",
"MOD",
"ans",
"MOD = 10**9 + 7",
"10**9 + 7",
"MOD",
"minH = max(minT, minA)",
"max(minT, minA)",
"minH",
"N = int(input())",
"int(input())",
"N",
"minAs, maxAs = [1]*N, [10**9]*N",
"[1]*N",
"minAs",
"maxAs = [1]*N, [10**9]*N",
"[10**9]*N",
"maxAs",
"maxH = min(maxT, maxA)",
"min(maxT, maxA)",
"maxH",
"ans *= max(0, maxH - minH + 1)",
"max(0, maxH - minH + 1)",
"ans"
] |
MOD = 10**9 + 7
N = int(input())
Ts = list(map(int, input().split()))
As = list(map(int, input().split()))
minTs, maxTs = [1]*N, [10**9]*N
minAs, maxAs = [1]*N, [10**9]*N
minTs[0] = maxTs[0] = Ts[0]
for i in range(1, N):
if Ts[i-1] < Ts[i]:
minTs[i] = maxTs[i] = Ts[i]
else:
maxTs[i] = Ts[i]
minAs[-1] = maxAs[-1] = As[-1]
for i in reversed(range(N-1)):
if As[i] > As[i+1]:
minAs[i] = maxAs[i] = As[i]
else:
maxAs[i] = As[i]
ans = 1
for minT, maxT, minA, maxA in zip(minTs, maxTs, minAs, maxAs):
minH = max(minT, minA)
maxH = min(maxT, maxA)
ans *= max(0, maxH - minH + 1)
ans %= MOD
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
2,
2,
17,
17,
17,
0,
13,
2,
39,
17,
13,
0,
13,
2,
39,
17,
13,
0,
13,
17,
28,
13,
13,
4,
13,
13,
14,
2,
13,
13,
0,
18,
13,
13,
17,
0,
18,
13,
13,
13,
0,
13,
13,
0,
18,
13,
13,
13,
0,
13,
17,
28,
13,
13,
4,
13,
18,
13,
39,
17,
0,
13,
2,
2,
13,
13,
17,
14,
18,
13,
13,
14,
2,
13,
13,
14,
40,
18,
13,
13,
13,
4,
13,
17,
4,
13,
0,
13,
13,
9,
14,
40,
18,
13,
13,
13,
4,
13,
17,
4,
13,
14,
2,
13,
13,
14,
40,
13,
18,
13,
13,
0,
18,
13,
13,
17,
0,
18,
13,
13,
13,
0,
13,
13,
4,
13,
17,
4,
13,
14,
40,
13,
18,
13,
13,
0,
18,
13,
13,
13,
0,
13,
17,
28,
13,
4,
13,
13,
14,
18,
13,
13,
0,
13,
18,
13,
13,
0,
13,
13,
4,
13,
13,
10,
13,
13,
10,
4,
13,
10,
13,
13,
10,
18,
13,
10,
17,
13,
10,
4,
13,
10,
2,
13,
10,
2,
13,
10,
4,
13,
10,
17,
13,
10,
13,
13,
10,
17,
13,
10,
2,
13,
10,
13,
13,
10,
2,
13
] |
[
[
212,
2
],
[
200,
8
],
[
221,
20
],
[
218,
32
],
[
233,
39
],
[
213,
43
],
[
215,
45
],
[
213,
49
],
[
224,
51
],
[
201,
58
],
[
225,
62
],
[
237,
62
],
[
67,
64
],
[
234,
65
],
[
72,
69
],
[
216,
70
],
[
236,
74
],
[
80,
77
],
[
216,
78
],
[
209,
82
],
[
222,
90
],
[
239,
94
],
[
213,
97
],
[
234,
102
],
[
240,
103
],
[
210,
107
],
[
237,
107
],
[
225,
107
],
[
204,
107
],
[
228,
107
],
[
169,
110
],
[
150,
110
],
[
216,
111
],
[
240,
112
],
[
227,
120
],
[
169,
125
],
[
150,
125
],
[
216,
126
],
[
240,
127
],
[
210,
137
],
[
237,
137
],
[
225,
137
],
[
204,
137
],
[
228,
137
],
[
169,
141
],
[
150,
141
],
[
216,
142
],
[
240,
143
],
[
148,
145
],
[
234,
146
],
[
240,
147
],
[
153,
150
],
[
216,
151
],
[
240,
152
],
[
203,
155
],
[
169,
165
],
[
150,
165
],
[
216,
166
],
[
240,
167
],
[
172,
169
],
[
216,
170
],
[
240,
171
],
[
230,
174
],
[
178,
177
],
[
213,
180
],
[
234,
183
],
[
177,
184
],
[
206,
186
],
[
77,
187
],
[
69,
187
],
[
216,
188
],
[
177,
189
],
[
197,
191
],
[
219,
192
],
[
198,
195
],
[
207,
195
],
[
231,
195
],
[
219,
197
],
[
197,
198
],
[
200,
201
],
[
203,
204
],
[
77,
206
],
[
69,
206
],
[
206,
207
],
[
209,
210
],
[
212,
213
],
[
215,
216
],
[
218,
219
],
[
221,
222
],
[
224,
225
],
[
227,
228
],
[
230,
231
],
[
233,
234
],
[
236,
237
],
[
239,
240
]
] |
[
"n = int(input())\nT = list(map(int, input().split()))\nA = list(map(int, input().split()))\nMOD = 10**9+7\nonly = [False]*n\nh = [0]*n\nmx = 0\nfor i, t in enumerate(T):\n if t > mx:\n only[i] = True\n h[i] = t\n mx = t\n else:\n h[i] = t\n\nmx = 0\nfor i, a in enumerate(A[::-1]):\n k = n-i-1\n if only[k]:\n if a > mx:\n if h[k] != a:\n print(0)\n exit()\n else:\n mx = a\n continue\n else:\n if h[k] <= a: continue\n else:\n print(0)\n exit()\n else:\n if a > mx:\n if a <= h[k]:\n only[k] = True\n h[k] = a\n mx = a\n else:\n print(0)\n exit()\n else:\n if a <= h[k]:\n h[k] = a\n\nans = 1\nfor i in range(n):\n if only[i]: continue\n ans *= h[i]\n ans %= MOD\nprint(ans)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"T = list(map(int, input().split()))",
"T",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"A = list(map(int, input().split()))",
"A",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"MOD = 10**9+7",
"MOD",
"10**9+7",
"10**9",
"10",
"9",
"7",
"only = [False]*n",
"only",
"[False]*n",
"[False]",
"False",
"n",
"h = [0]*n",
"h",
"[0]*n",
"[0]",
"0",
"n",
"mx = 0",
"mx",
"0",
"for i, t in enumerate(T):\n if t > mx:\n only[i] = True\n h[i] = t\n mx = t\n else:\n h[i] = t",
"i",
"t",
"enumerate(T)",
"enumerate",
"T",
"if t > mx:\n only[i] = True\n h[i] = t\n mx = t\n else:\n h[i] = t",
"t > mx",
"t",
"mx",
"only[i] = True",
"only[i]",
"only",
"i",
"True",
"h[i] = t",
"h[i]",
"h",
"i",
"t",
"mx = t",
"mx",
"t",
"h[i] = t",
"h[i]",
"h",
"i",
"t",
"mx = 0",
"mx",
"0",
"for i, a in enumerate(A[::-1]):\n k = n-i-1\n if only[k]:\n if a > mx:\n if h[k] != a:\n print(0)\n exit()\n else:\n mx = a\n continue\n else:\n if h[k] <= a: continue\n else:\n print(0)\n exit()\n else:\n if a > mx:\n if a <= h[k]:\n only[k] = True\n h[k] = a\n mx = a\n else:\n print(0)\n exit()\n else:\n if a <= h[k]:\n h[k] = a",
"i",
"a",
"enumerate(A[::-1])",
"enumerate",
"A[::-1]",
"A",
"::-1",
"-1",
"k = n-i-1",
"k",
"n-i-1",
"n-i",
"n",
"i",
"1",
"if only[k]:\n if a > mx:\n if h[k] != a:\n print(0)\n exit()\n else:\n mx = a\n continue\n else:\n if h[k] <= a: continue\n else:\n print(0)\n exit()\n else:\n if a > mx:\n if a <= h[k]:\n only[k] = True\n h[k] = a\n mx = a\n else:\n print(0)\n exit()\n else:\n if a <= h[k]:\n h[k] = a",
"only[k]",
"only",
"k",
"if a > mx:\n if h[k] != a:\n print(0)\n exit()\n else:\n mx = a\n continue\n else:\n if h[k] <= a: continue\n else:\n print(0)\n exit()\n ",
"a > mx",
"a",
"mx",
"if h[k] != a:\n print(0)\n exit()\n else:\n mx = a\n continue\n ",
"h[k] != a",
"h[k]",
"h",
"k",
"a",
"print(0)",
"print",
"0",
"exit()",
"exit",
"mx = a",
"mx",
"a",
"continue",
"if h[k] <= a: continue\n else:\n print(0)\n exit()\n ",
"h[k] <= a",
"h[k]",
"h",
"k",
"a",
"print(0)",
"print",
"0",
"exit()",
"exit",
"if a > mx:\n if a <= h[k]:\n only[k] = True\n h[k] = a\n mx = a\n else:\n print(0)\n exit()\n else:\n if a <= h[k]:\n h[k] = a",
"a > mx",
"a",
"mx",
"if a <= h[k]:\n only[k] = True\n h[k] = a\n mx = a\n else:\n print(0)\n exit()\n ",
"a <= h[k]",
"a",
"h[k]",
"h",
"k",
"only[k] = True",
"only[k]",
"only",
"k",
"True",
"h[k] = a",
"h[k]",
"h",
"k",
"a",
"mx = a",
"mx",
"a",
"print(0)",
"print",
"0",
"exit()",
"exit",
"if a <= h[k]:\n h[k] = a",
"a <= h[k]",
"a",
"h[k]",
"h",
"k",
"h[k] = a",
"h[k]",
"h",
"k",
"a",
"ans = 1",
"ans",
"1",
"for i in range(n):\n if only[i]: continue\n ans *= h[i]\n ans %= MOD",
"i",
"range(n)",
"range",
"n",
"if only[i]: continue\n ",
"only[i]",
"only",
"i",
"ans *= h[i]",
"ans",
"h[i]",
"h",
"i",
"ans %= MOD",
"ans",
"MOD",
"print(ans)",
"print",
"ans",
"ans %= MOD",
"MOD",
"ans",
"T = list(map(int, input().split()))",
"list(map(int, input().split()))",
"T",
"mx = a",
"a",
"mx",
"ans *= h[i]",
"h[i]",
"ans",
"mx = 0",
"0",
"mx",
"n = int(input())",
"int(input())",
"n",
"h = [0]*n",
"[0]*n",
"h",
"MOD = 10**9+7",
"10**9+7",
"MOD",
"A = list(map(int, input().split()))",
"list(map(int, input().split()))",
"A",
"mx = 0",
"0",
"mx",
"mx = a",
"a",
"mx",
"ans = 1",
"1",
"ans",
"only = [False]*n",
"[False]*n",
"only",
"mx = t",
"t",
"mx",
"k = n-i-1",
"n-i-1",
"k"
] |
n = int(input())
T = list(map(int, input().split()))
A = list(map(int, input().split()))
MOD = 10**9+7
only = [False]*n
h = [0]*n
mx = 0
for i, t in enumerate(T):
if t > mx:
only[i] = True
h[i] = t
mx = t
else:
h[i] = t
mx = 0
for i, a in enumerate(A[::-1]):
k = n-i-1
if only[k]:
if a > mx:
if h[k] != a:
print(0)
exit()
else:
mx = a
continue
else:
if h[k] <= a: continue
else:
print(0)
exit()
else:
if a > mx:
if a <= h[k]:
only[k] = True
h[k] = a
mx = a
else:
print(0)
exit()
else:
if a <= h[k]:
h[k] = a
ans = 1
for i in range(n):
if only[i]: continue
ans *= h[i]
ans %= MOD
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
18,
13,
39,
17,
41,
28,
13,
4,
13,
13,
4,
17,
0,
13,
13,
41,
28,
13,
4,
13,
13,
4,
17,
0,
13,
13,
41,
28,
13,
4,
13,
13,
4,
17,
0,
13,
13,
41,
28,
13,
4,
13,
13,
4,
17,
0,
13,
13,
0,
13,
17,
28,
13,
4,
13,
13,
14,
2,
18,
13,
13,
13,
0,
18,
13,
13,
18,
13,
13,
0,
18,
13,
13,
17,
0,
13,
18,
13,
13,
0,
18,
13,
13,
13,
0,
13,
17,
28,
13,
4,
13,
13,
14,
2,
18,
13,
13,
13,
0,
18,
13,
13,
18,
13,
13,
0,
18,
13,
13,
17,
0,
13,
18,
13,
13,
0,
18,
13,
13,
13,
0,
13,
18,
13,
39,
17,
0,
13,
18,
13,
39,
17,
0,
13,
17,
0,
13,
2,
2,
17,
17,
17,
28,
13,
4,
13,
13,
14,
2,
18,
13,
13,
18,
13,
13,
14,
40,
2,
18,
13,
13,
18,
13,
13,
0,
13,
17,
3,
14,
2,
18,
13,
13,
18,
13,
13,
14,
2,
18,
13,
13,
18,
13,
13,
14,
40,
18,
13,
13,
0,
13,
17,
3,
14,
2,
18,
13,
13,
18,
13,
13,
0,
13,
13,
14,
40,
18,
13,
13,
0,
13,
17,
3,
0,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
13,
13,
4,
13,
13,
10,
4,
13,
10,
13,
13,
10,
17,
13,
10,
18,
13,
10,
13,
13,
10,
13,
13,
10,
18,
13,
10,
4,
13,
10,
17,
13,
10,
18,
13,
10,
18,
13,
10,
17,
13,
10,
4,
13,
10,
17,
13,
10,
18,
13,
10,
4,
13,
10,
17,
13,
10,
17,
13,
10,
13,
13,
10,
13,
13,
10,
13,
13,
10,
2,
13
] |
[
[
308,
2
],
[
263,
8
],
[
299,
20
],
[
272,
32
],
[
300,
34
],
[
40,
39
],
[
309,
42
],
[
266,
46
],
[
51,
50
],
[
309,
53
],
[
317,
57
],
[
62,
61
],
[
309,
64
],
[
275,
68
],
[
73,
72
],
[
309,
75
],
[
320,
79
],
[
311,
82
],
[
86,
85
],
[
309,
88
],
[
264,
92
],
[
85,
93
],
[
312,
94
],
[
282,
94
],
[
99,
96
],
[
267,
97
],
[
85,
98
],
[
264,
100
],
[
85,
101
],
[
106,
103
],
[
318,
104
],
[
85,
105
],
[
281,
108
],
[
264,
110
],
[
85,
111
],
[
116,
113
],
[
267,
114
],
[
85,
115
],
[
312,
116
],
[
282,
116
],
[
314,
118
],
[
122,
121
],
[
309,
124
],
[
273,
128
],
[
300,
128
],
[
121,
129
],
[
315,
130
],
[
282,
130
],
[
312,
130
],
[
291,
130
],
[
135,
132
],
[
276,
133
],
[
121,
134
],
[
273,
136
],
[
300,
136
],
[
121,
137
],
[
142,
139
],
[
321,
140
],
[
121,
141
],
[
290,
144
],
[
273,
146
],
[
300,
146
],
[
121,
147
],
[
152,
149
],
[
276,
150
],
[
121,
151
],
[
315,
152
],
[
282,
152
],
[
312,
152
],
[
291,
152
],
[
293,
154
],
[
276,
156
],
[
305,
160
],
[
321,
162
],
[
296,
166
],
[
326,
169
],
[
177,
176
],
[
309,
179
],
[
103,
182
],
[
318,
183
],
[
176,
184
],
[
139,
185
],
[
306,
186
],
[
321,
186
],
[
176,
187
],
[
113,
191
],
[
96,
191
],
[
267,
192
],
[
176,
193
],
[
149,
194
],
[
132,
194
],
[
294,
195
],
[
276,
195
],
[
176,
196
],
[
269,
198
],
[
103,
203
],
[
318,
204
],
[
176,
205
],
[
139,
206
],
[
306,
207
],
[
321,
207
],
[
176,
208
],
[
113,
211
],
[
96,
211
],
[
267,
212
],
[
176,
213
],
[
149,
214
],
[
132,
214
],
[
294,
215
],
[
276,
215
],
[
176,
216
],
[
139,
219
],
[
306,
220
],
[
321,
220
],
[
176,
221
],
[
287,
223
],
[
113,
228
],
[
96,
228
],
[
267,
229
],
[
176,
230
],
[
149,
231
],
[
132,
231
],
[
294,
232
],
[
276,
232
],
[
176,
233
],
[
323,
235
],
[
324,
236
],
[
297,
236
],
[
279,
236
],
[
285,
236
],
[
303,
236
],
[
288,
236
],
[
270,
236
],
[
103,
239
],
[
318,
240
],
[
176,
241
],
[
302,
243
],
[
284,
247
],
[
113,
250
],
[
96,
250
],
[
267,
251
],
[
176,
252
],
[
149,
253
],
[
132,
253
],
[
294,
254
],
[
276,
254
],
[
176,
255
],
[
278,
257
],
[
327,
258
],
[
279,
261
],
[
285,
261
],
[
303,
261
],
[
324,
261
],
[
288,
261
],
[
270,
261
],
[
297,
261
],
[
263,
264
],
[
266,
267
],
[
269,
270
],
[
272,
273
],
[
275,
276
],
[
327,
278
],
[
278,
279
],
[
281,
282
],
[
284,
285
],
[
287,
288
],
[
290,
291
],
[
293,
294
],
[
296,
297
],
[
299,
300
],
[
302,
303
],
[
305,
306
],
[
308,
309
],
[
311,
312
],
[
314,
315
],
[
317,
318
],
[
320,
321
],
[
324,
323
],
[
297,
323
],
[
279,
323
],
[
285,
323
],
[
303,
323
],
[
288,
323
],
[
270,
323
],
[
323,
324
],
[
326,
327
]
] |
[
"n = int(input())\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\nb = b[::-1]\n\nua = [0 for i in range(n)]\nfa = [False for i in range(n)]\nub = [0 for i in range(n)]\nfb = [False for i in range(n)]\n\n\nbm = 0\nfor i in range(n):\n if a[i] > bm:\n ua[i] = a[i]\n fa[i] = True\n bm = a[i]\n else:\n ua[i] = bm\n\nbm = 0\nfor i in range(n):\n if b[i] > bm:\n ub[i] = b[i]\n fb[i] = True\n bm = b[i]\n else:\n ub[i] = bm\nub = ub[::-1]\nfb = fb[::-1]\nans = 1\nm = 10**9+7\n\nfor i in range(n):\n if fa[i] and fb[i]:\n if not ua[i] == ub[i]:\n ans = 0\n break\n elif fa[i] or fb[i]:\n if ua[i] > ub[i]:\n if not fb[i]:\n ans = 0\n break\n elif ua[i] == ub[i]:\n ans = ans\n else:\n if not fa[i]:\n ans = 0\n break\n else:\n ans *= min(ua[i],ub[i])\n ans %= m\n # print(ans)\n\nprint(ans)\n\n# print(ua)\n# print(fa)\n# print(ub)\n# print(fb)\n\n\n\n\n\n\n\n\n",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"a = list(map(int,input().split()))",
"a",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"b = list(map(int,input().split()))",
"b",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"b = b[::-1]",
"b",
"b[::-1]",
"b",
"::-1",
"-1",
"0 for i in range(n)",
"for i in range(n)",
"i",
"range(n)",
"range",
"n",
"for i in range(n)",
"0",
"ua = [0 for i in range(n)]",
"ua",
"[0 for i in range(n)]",
"False for i in range(n)",
"for i in range(n)",
"i",
"range(n)",
"range",
"n",
"for i in range(n)",
"False",
"fa = [False for i in range(n)]",
"fa",
"[False for i in range(n)]",
"0 for i in range(n)",
"for i in range(n)",
"i",
"range(n)",
"range",
"n",
"for i in range(n)",
"0",
"ub = [0 for i in range(n)]",
"ub",
"[0 for i in range(n)]",
"False for i in range(n)",
"for i in range(n)",
"i",
"range(n)",
"range",
"n",
"for i in range(n)",
"False",
"fb = [False for i in range(n)]",
"fb",
"[False for i in range(n)]",
"bm = 0",
"bm",
"0",
"for i in range(n):\n if a[i] > bm:\n ua[i] = a[i]\n fa[i] = True\n bm = a[i]\n else:\n ua[i] = bm",
"i",
"range(n)",
"range",
"n",
"if a[i] > bm:\n ua[i] = a[i]\n fa[i] = True\n bm = a[i]\n else:\n ua[i] = bm",
"a[i] > bm",
"a[i]",
"a",
"i",
"bm",
"ua[i] = a[i]",
"ua[i]",
"ua",
"i",
"a[i]",
"a",
"i",
"fa[i] = True",
"fa[i]",
"fa",
"i",
"True",
"bm = a[i]",
"bm",
"a[i]",
"a",
"i",
"ua[i] = bm",
"ua[i]",
"ua",
"i",
"bm",
"bm = 0",
"bm",
"0",
"for i in range(n):\n if b[i] > bm:\n ub[i] = b[i]\n fb[i] = True\n bm = b[i]\n else:\n ub[i] = bm",
"i",
"range(n)",
"range",
"n",
"if b[i] > bm:\n ub[i] = b[i]\n fb[i] = True\n bm = b[i]\n else:\n ub[i] = bm",
"b[i] > bm",
"b[i]",
"b",
"i",
"bm",
"ub[i] = b[i]",
"ub[i]",
"ub",
"i",
"b[i]",
"b",
"i",
"fb[i] = True",
"fb[i]",
"fb",
"i",
"True",
"bm = b[i]",
"bm",
"b[i]",
"b",
"i",
"ub[i] = bm",
"ub[i]",
"ub",
"i",
"bm",
"ub = ub[::-1]",
"ub",
"ub[::-1]",
"ub",
"::-1",
"-1",
"fb = fb[::-1]",
"fb",
"fb[::-1]",
"fb",
"::-1",
"-1",
"ans = 1",
"ans",
"1",
"m = 10**9+7",
"m",
"10**9+7",
"10**9",
"10",
"9",
"7",
"for i in range(n):\n if fa[i] and fb[i]:\n if not ua[i] == ub[i]:\n ans = 0\n break\n elif fa[i] or fb[i]:\n if ua[i] > ub[i]:\n if not fb[i]:\n ans = 0\n break\n elif ua[i] == ub[i]:\n ans = ans\n else:\n if not fa[i]:\n ans = 0\n break\n else:\n ans *= min(ua[i],ub[i])\n ans %= m\n # print(ans)",
"i",
"range(n)",
"range",
"n",
"if fa[i] and fb[i]:\n if not ua[i] == ub[i]:\n ans = 0\n break\n elif fa[i] or fb[i]:\n if ua[i] > ub[i]:\n if not fb[i]:\n ans = 0\n break\n elif ua[i] == ub[i]:\n ans = ans\n else:\n if not fa[i]:\n ans = 0\n break\n else:\n ans *= min(ua[i],ub[i])\n ans %= m\n # print(ans)",
"fa[i] and fb[i]",
"fa[i]",
"fa",
"i",
"fb[i]",
"fb",
"i",
"if not ua[i] == ub[i]:\n ans = 0\n break\n ",
"not ua[i] == ub[i]",
"ua[i] == ub[i]",
"ua[i]",
"ua",
"i",
"ub[i]",
"ub",
"i",
"ans = 0",
"ans",
"0",
"break",
"elif fa[i] or fb[i]:\n if ua[i] > ub[i]:\n if not fb[i]:\n ans = 0\n break\n elif ua[i] == ub[i]:\n ans = ans\n else:\n if not fa[i]:\n ans = 0\n break\n ",
"fa[i] or fb[i]",
"fa[i]",
"fa",
"i",
"fb[i]",
"fb",
"i",
"if ua[i] > ub[i]:\n if not fb[i]:\n ans = 0\n break\n elif ua[i] == ub[i]:\n ans = ans\n else:\n if not fa[i]:\n ans = 0\n break\n ",
"ua[i] > ub[i]",
"ua[i]",
"ua",
"i",
"ub[i]",
"ub",
"i",
"if not fb[i]:\n ans = 0\n break\n ",
"not fb[i]",
"fb[i]",
"fb",
"i",
"ans = 0",
"ans",
"0",
"break",
"elif ua[i] == ub[i]:\n ans = ans\n ",
"ua[i] == ub[i]",
"ua[i]",
"ua",
"i",
"ub[i]",
"ub",
"i",
"ans = ans",
"ans",
"ans",
"if not fa[i]:\n ans = 0\n break\n ",
"not fa[i]",
"fa[i]",
"fa",
"i",
"ans = 0",
"ans",
"0",
"break",
"ans *= min(ua[i],ub[i])",
"ans",
"min(ua[i],ub[i])",
"min",
"ua[i]",
"ua",
"i",
"ub[i]",
"ub",
"i",
"ans %= m",
"ans",
"m",
"print(ans)",
"print",
"ans",
"a = list(map(int,input().split()))",
"list(map(int,input().split()))",
"a",
"ua = [0 for i in range(n)]",
"[0 for i in range(n)]",
"ua",
"ans = 0",
"0",
"ans",
"b = b[::-1]",
"b[::-1]",
"b",
"ub = [0 for i in range(n)]",
"[0 for i in range(n)]",
"ub",
"ans %= m",
"m",
"ans",
"bm = a[i]",
"a[i]",
"bm",
"ans *= min(ua[i],ub[i])",
"min(ua[i],ub[i])",
"ans",
"ans = 0",
"0",
"ans",
"bm = b[i]",
"b[i]",
"bm",
"ub = ub[::-1]",
"ub[::-1]",
"ub",
"ans = 1",
"1",
"ans",
"b = list(map(int,input().split()))",
"list(map(int,input().split()))",
"b",
"ans = 0",
"0",
"ans",
"fb = fb[::-1]",
"fb[::-1]",
"fb",
"n = int(input())",
"int(input())",
"n",
"bm = 0",
"0",
"bm",
"bm = 0",
"0",
"bm",
"fa = [False for i in range(n)]",
"[False for i in range(n)]",
"fa",
"fb = [False for i in range(n)]",
"[False for i in range(n)]",
"fb",
"ans = ans",
"ans",
"ans",
"m = 10**9+7",
"10**9+7",
"m"
] |
n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
b = b[::-1]
ua = [0 for i in range(n)]
fa = [False for i in range(n)]
ub = [0 for i in range(n)]
fb = [False for i in range(n)]
bm = 0
for i in range(n):
if a[i] > bm:
ua[i] = a[i]
fa[i] = True
bm = a[i]
else:
ua[i] = bm
bm = 0
for i in range(n):
if b[i] > bm:
ub[i] = b[i]
fb[i] = True
bm = b[i]
else:
ub[i] = bm
ub = ub[::-1]
fb = fb[::-1]
ans = 1
m = 10**9+7
for i in range(n):
if fa[i] and fb[i]:
if not ua[i] == ub[i]:
ans = 0
break
elif fa[i] or fb[i]:
if ua[i] > ub[i]:
if not fb[i]:
ans = 0
break
elif ua[i] == ub[i]:
ans = ans
else:
if not fa[i]:
ans = 0
break
else:
ans *= min(ua[i],ub[i])
ans %= m
# print(ans)
print(ans)
# print(ua)
# print(fa)
# print(ub)
# print(fb)
|
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
0,
13,
13,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
0,
13,
13,
41,
28,
13,
4,
13,
2,
13,
17,
4,
39,
17,
17,
0,
13,
2,
39,
39,
18,
13,
17,
18,
13,
17,
13,
13,
17,
13,
17,
13,
2,
2,
17,
17,
17,
14,
40,
4,
13,
13,
4,
13,
13,
28,
13,
4,
13,
17,
13,
14,
2,
18,
13,
2,
13,
17,
18,
13,
13,
14,
2,
18,
18,
13,
17,
17,
18,
13,
17,
0,
18,
13,
17,
39,
18,
13,
17,
18,
13,
17,
28,
13,
4,
13,
2,
13,
17,
17,
17,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
14,
40,
18,
18,
13,
13,
17,
18,
13,
13,
14,
40,
18,
18,
13,
13,
17,
18,
13,
13,
14,
13,
28,
13,
13,
13,
4,
13,
13,
10,
2,
13,
10,
17,
13,
10,
17,
13,
10,
13,
13,
10,
2,
13,
10,
13,
13,
10,
4,
13
] |
[
[
183,
2
],
[
10,
9
],
[
9,
18
],
[
174,
20
],
[
25,
24
],
[
24,
33
],
[
180,
35
],
[
40,
39
],
[
184,
43
],
[
165,
50
],
[
175,
55
],
[
175,
58
],
[
168,
61
],
[
171,
63
],
[
177,
65
],
[
175,
75
],
[
181,
78
],
[
81,
80
],
[
184,
84
],
[
175,
88
],
[
80,
90
],
[
175,
93
],
[
80,
94
],
[
166,
99
],
[
181,
103
],
[
109,
106
],
[
166,
107
],
[
181,
111
],
[
181,
114
],
[
118,
117
],
[
184,
121
],
[
181,
128
],
[
117,
129
],
[
181,
131
],
[
117,
133
],
[
166,
139
],
[
117,
140
],
[
181,
143
],
[
117,
144
],
[
166,
149
],
[
117,
150
],
[
181,
153
],
[
117,
154
],
[
172,
163
],
[
165,
166
],
[
168,
169
],
[
171,
172
],
[
174,
175
],
[
177,
178
],
[
180,
181
],
[
183,
184
]
] |
[
"n = int(input())\nt = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\nx,flag,ans,mod = [[t[0],t[0]]]+[[1,1] for _ in range(n-1)],True,1,10**9+7\nif max(t)!=max(a): flag = False\nfor i in range(1,n):\n\tif t[i-1]<t[i]: x[i] = [t[i],t[i]]\n\telse: x[i][0] = t[i]\nif x[-1][0]<a[-1]: flag = False\nelse:\n\tx[-1] = [a[-1],a[-1]]\n\tfor i in range(n-2,0,-1):\n\t\tif a[i]>a[i+1]:\n\t\t\tif x[i][0]>=a[i]: x[i]=[a[i],a[i]]\n\t\t\telse: flag = False\n\t\telse:\n\t\t\tif x[i][0]>=a[i]: x[i][0]=a[i]\n\t\t\telse: pass\nif flag:\n\tfor i,j in x: ans = (ans*(i-j+1))%mod\nelse: ans = 0\nprint(ans)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"int(i) for i in input().split()",
"for i in input().split()",
"i",
"input().split()",
"().split",
"()",
"input",
"split",
"for i in input().split()",
"int(i)",
"int",
"i",
"t = [int(i) for i in input().split()]",
"t",
"[int(i) for i in input().split()]",
"int(i) for i in input().split()",
"for i in input().split()",
"i",
"input().split()",
"().split",
"()",
"input",
"split",
"for i in input().split()",
"int(i)",
"int",
"i",
"a = [int(i) for i in input().split()]",
"a",
"[int(i) for i in input().split()]",
"[1,1] for _ in range(n-1)",
"for _ in range(n-1)",
"_",
"range(n-1)",
"range",
"n-1",
"n",
"1",
"for _ in range(n-1)",
"[1,1]",
"1",
"1",
"x,flag,ans,mod = [[t[0],t[0]]]+[[1,1] for _ in range(n-1)],True,1,10**9+7",
"x",
"[[t[0],t[0]]]+[[1,1] for _ in range(n-1)]",
"[[t[0],t[0]]]",
"[t[0],t[0]]",
"t[0]",
"t",
"0",
"t[0]",
"t",
"0",
"[[1,1] for _ in range(n-1)]",
"flag",
"True",
"ans",
"1",
"mod",
"10**9+7",
"10**9",
"10",
"9",
"7",
"if max(t)!=max(a): flag = False",
"max(t)!=max(a)",
"max(t)",
"max",
"t",
"max(a)",
"max",
"a",
"for i in range(1,n):\n\tif t[i-1]<t[i]: x[i] = [t[i],t[i]]\n\telse: x[i][0] = t[i]",
"i",
"range(1,n)",
"range",
"1",
"n",
"if t[i-1]<t[i]: x[i] = [t[i],t[i]]\n\telse: x[i][0] = t[i]",
"t[i-1]<t[i]",
"t[i-1]",
"t",
"i-1",
"i",
"1",
"t[i]",
"t",
"i",
"if x[-1][0]<a[-1]: flag = False\nelse:\n\tx[-1] = [a[-1],a[-1]]\n\tfor i in range(n-2,0,-1):\n\t\tif a[i]>a[i+1]:\n\t\t\tif x[i][0]>=a[i]: x[i]=[a[i],a[i]]\n\t\t\telse: flag = False\n\t\telse:\n\t\t\tif x[i][0]>=a[i]: x[i][0]=a[i]\n\t\t\telse: pass",
"x[-1][0]<a[-1]",
"x[-1][0]",
"[-1]",
"x",
"-1",
"0",
"a[-1]",
"a",
"-1",
"x[-1] = [a[-1],a[-1]]",
"x[-1]",
"x",
"-1",
"[a[-1],a[-1]]",
"a[-1]",
"a",
"-1",
"a[-1]",
"a",
"-1",
"for i in range(n-2,0,-1):\n\t\tif a[i]>a[i+1]:\n\t\t\tif x[i][0]>=a[i]: x[i]=[a[i],a[i]]\n\t\t\telse: flag = False\n\t\telse:\n\t\t\tif x[i][0]>=a[i]: x[i][0]=a[i]\n\t\t\telse: pass",
"i",
"range(n-2,0,-1)",
"range",
"n-2",
"n",
"2",
"0",
"-1",
"if a[i]>a[i+1]:\n\t\t\tif x[i][0]>=a[i]: x[i]=[a[i],a[i]]\n\t\t\telse: flag = False\n\t\telse:\n\t\t\tif x[i][0]>=a[i]: x[i][0]=a[i]\n\t\t\telse: pass",
"a[i]>a[i+1]",
"a[i]",
"a",
"i",
"a[i+1]",
"a",
"i+1",
"i",
"1",
"if x[i][0]>=a[i]: x[i]=[a[i],a[i]]\n\t\t\telse: flag = False\n\t\t",
"x[i][0]>=a[i]",
"x[i][0]",
"[i]",
"x",
"i",
"0",
"a[i]",
"a",
"i",
"if x[i][0]>=a[i]: x[i][0]=a[i]\n\t\t\telse: pass",
"x[i][0]>=a[i]",
"x[i][0]",
"[i]",
"x",
"i",
"0",
"a[i]",
"a",
"i",
"if flag:\n\tfor i,j in x: ans = (ans*(i-j+1))%mod\nelse: ans = 0",
"flag",
"for i,j in x: ans = (ans*(i-j+1))%mo",
"i",
"j",
"x",
"print(ans)",
"print",
"ans",
"x,flag,ans,mod = [[t[0],t[0]]]+[[1,1] for _ in range(n-1)],True,1,10**9+7",
"[[t[0],t[0]]]+[[1,1] for _ in range(n-1)]",
"x",
"flag,ans,mod = [[t[0],t[0]]]+[[1,1] for _ in range(n-1)],True,1,10**9+7",
"True",
"flag",
"ans,mod = [[t[0],t[0]]]+[[1,1] for _ in range(n-1)],True,1,10**9+7",
"1",
"ans",
"t = [int(i) for i in input().split()]",
"[int(i) for i in input().split()]",
"t",
"mod = [[t[0],t[0]]]+[[1,1] for _ in range(n-1)],True,1,10**9+7",
"10**9+7",
"mod",
"a = [int(i) for i in input().split()]",
"[int(i) for i in input().split()]",
"a",
"n = int(input())",
"int(input())",
"n"
] |
n = int(input())
t = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
x,flag,ans,mod = [[t[0],t[0]]]+[[1,1] for _ in range(n-1)],True,1,10**9+7
if max(t)!=max(a): flag = False
for i in range(1,n):
if t[i-1]<t[i]: x[i] = [t[i],t[i]]
else: x[i][0] = t[i]
if x[-1][0]<a[-1]: flag = False
else:
x[-1] = [a[-1],a[-1]]
for i in range(n-2,0,-1):
if a[i]>a[i+1]:
if x[i][0]>=a[i]: x[i]=[a[i],a[i]]
else: flag = False
else:
if x[i][0]>=a[i]: x[i][0]=a[i]
else: pass
if flag:
for i,j in x: ans = (ans*(i-j+1))%mod
else: ans = 0
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
39,
28,
13,
4,
13,
13,
14,
2,
13,
17,
4,
18,
13,
13,
17,
14,
2,
13,
2,
13,
17,
4,
18,
13,
13,
17,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
4,
18,
13,
13,
17,
14,
2,
18,
13,
13,
18,
13,
13,
0,
18,
13,
13,
17,
3,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
4,
18,
13,
13,
17,
14,
2,
18,
13,
13,
18,
13,
13,
0,
18,
13,
13,
17,
3,
4,
18,
13,
13,
4,
13,
39,
18,
13,
13,
18,
13,
13,
14,
40,
4,
13,
13,
4,
13,
13,
4,
18,
13,
13,
17,
0,
13,
17,
28,
13,
4,
13,
4,
13,
13,
0,
13,
18,
13,
13,
0,
13,
17,
4,
13,
2,
13,
17,
10,
4,
13,
10,
4,
13,
10,
18,
13,
10,
17,
13,
10,
4,
13,
10,
17,
13,
10,
39,
13
] |
[
[
167,
2
],
[
179,
8
],
[
170,
20
],
[
185,
32
],
[
36,
35
],
[
168,
38
],
[
35,
41
],
[
186,
45
],
[
35,
50
],
[
168,
52
],
[
186,
56
],
[
180,
62
],
[
35,
63
],
[
180,
65
],
[
35,
67
],
[
186,
71
],
[
180,
77
],
[
35,
78
],
[
171,
80
],
[
35,
81
],
[
86,
83
],
[
186,
84
],
[
35,
85
],
[
171,
91
],
[
35,
92
],
[
171,
94
],
[
35,
96
],
[
186,
100
],
[
171,
106
],
[
35,
107
],
[
180,
109
],
[
35,
110
],
[
115,
112
],
[
186,
113
],
[
35,
114
],
[
186,
119
],
[
171,
125
],
[
35,
126
],
[
180,
128
],
[
35,
129
],
[
180,
134
],
[
171,
137
],
[
186,
140
],
[
182,
144
],
[
148,
147
],
[
186,
152
],
[
173,
154
],
[
112,
155
],
[
83,
155
],
[
186,
156
],
[
147,
157
],
[
176,
159
],
[
177,
164
],
[
174,
164
],
[
183,
164
],
[
167,
168
],
[
170,
171
],
[
112,
173
],
[
83,
173
],
[
173,
174
],
[
176,
177
],
[
179,
180
],
[
182,
183
],
[
185,
186
]
] |
[
"N = int(input())\nT = list(map(int, input().split()))\nA = list(map(int, input().split()))\nh = []\nfor i in range(N):\n if i == 0:\n h.append(1)\n elif i == N - 1:\n h.append(1)\n else:\n if T[i] > T[i - 1]:\n h.append(1)\n if T[i] > A[i]:\n h[i] = 0\n break\n elif A[i] > A[i + 1]:\n h.append(1)\n if A[i] > T[i]:\n h[i] = 0\n break\n else:\n h.append(min([A[i], T[i]]))\n\nif max(T) != max(A):\n h.append(0)\n \ncnt = 1\nfor i in range(len(h)):\n cnt *= h[i]\n cnt %= 1000000007\n \nprint(cnt % 1000000007)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"T = list(map(int, input().split()))",
"T",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"A = list(map(int, input().split()))",
"A",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"h = []",
"h",
"[]",
"for i in range(N):\n if i == 0:\n h.append(1)\n elif i == N - 1:\n h.append(1)\n else:\n if T[i] > T[i - 1]:\n h.append(1)\n if T[i] > A[i]:\n h[i] = 0\n break\n elif A[i] > A[i + 1]:\n h.append(1)\n if A[i] > T[i]:\n h[i] = 0\n break\n else:\n h.append(min([A[i], T[i]]))",
"i",
"range(N)",
"range",
"N",
"if i == 0:\n h.append(1)\n elif i == N - 1:\n h.append(1)\n else:\n if T[i] > T[i - 1]:\n h.append(1)\n if T[i] > A[i]:\n h[i] = 0\n break\n elif A[i] > A[i + 1]:\n h.append(1)\n if A[i] > T[i]:\n h[i] = 0\n break\n else:\n h.append(min([A[i], T[i]]))",
"i == 0",
"i",
"0",
"h.append(1)",
"h.append",
"h",
"append",
"1",
"elif i == N - 1:\n h.append(1)\n ",
"i == N - 1",
"i",
"N - 1",
"N",
"1",
"h.append(1)",
"h.append",
"h",
"append",
"1",
"if T[i] > T[i - 1]:\n h.append(1)\n if T[i] > A[i]:\n h[i] = 0\n break\n elif A[i] > A[i + 1]:\n h.append(1)\n if A[i] > T[i]:\n h[i] = 0\n break\n else:\n h.append(min([A[i], T[i]]))",
"T[i] > T[i - 1]",
"T[i]",
"T",
"i",
"T[i - 1]",
"T",
"i - 1",
"i",
"1",
"h.append(1)",
"h.append",
"h",
"append",
"1",
"if T[i] > A[i]:\n h[i] = 0\n break\n ",
"T[i] > A[i]",
"T[i]",
"T",
"i",
"A[i]",
"A",
"i",
"h[i] = 0",
"h[i]",
"h",
"i",
"0",
"break",
"elif A[i] > A[i + 1]:\n h.append(1)\n if A[i] > T[i]:\n h[i] = 0\n break\n ",
"A[i] > A[i + 1]",
"A[i]",
"A",
"i",
"A[i + 1]",
"A",
"i + 1",
"i",
"1",
"h.append(1)",
"h.append",
"h",
"append",
"1",
"if A[i] > T[i]:\n h[i] = 0\n break\n ",
"A[i] > T[i]",
"A[i]",
"A",
"i",
"T[i]",
"T",
"i",
"h[i] = 0",
"h[i]",
"h",
"i",
"0",
"break",
"h.append(min([A[i], T[i]]))",
"h.append",
"h",
"append",
"min([A[i], T[i]])",
"min",
"[A[i], T[i]]",
"A[i]",
"A",
"i",
"T[i]",
"T",
"i",
"if max(T) != max(A):\n h.append(0)\n ",
"max(T) != max(A)",
"max(T)",
"max",
"T",
"max(A)",
"max",
"A",
"h.append(0)",
"h.append",
"h",
"append",
"0",
"cnt = 1",
"cnt",
"1",
"for i in range(len(h)):\n cnt *= h[i]\n cnt %= 1000000007\n ",
"i",
"range(len(h))",
"range",
"len(h)",
"len",
"h",
"cnt *= h[i]",
"cnt",
"h[i]",
"h",
"i",
"cnt %= 1000000007",
"cnt",
"1000000007",
"print(cnt % 1000000007)",
"print",
"cnt % 1000000007",
"cnt",
"1000000007",
"N = int(input())",
"int(input())",
"N",
"A = list(map(int, input().split()))",
"list(map(int, input().split()))",
"A",
"cnt *= h[i]",
"h[i]",
"cnt",
"cnt %= 1000000007",
"1000000007",
"cnt",
"T = list(map(int, input().split()))",
"list(map(int, input().split()))",
"T",
"cnt = 1",
"1",
"cnt",
"h = []",
"[]",
"h"
] |
N = int(input())
T = list(map(int, input().split()))
A = list(map(int, input().split()))
h = []
for i in range(N):
if i == 0:
h.append(1)
elif i == N - 1:
h.append(1)
else:
if T[i] > T[i - 1]:
h.append(1)
if T[i] > A[i]:
h[i] = 0
break
elif A[i] > A[i + 1]:
h.append(1)
if A[i] > T[i]:
h[i] = 0
break
else:
h.append(min([A[i], T[i]]))
if max(T) != max(A):
h.append(0)
cnt = 1
for i in range(len(h)):
cnt *= h[i]
cnt %= 1000000007
print(cnt % 1000000007)
|
[
7,
0,
13,
2,
17,
17,
0,
13,
2,
2,
17,
17,
17,
0,
13,
4,
13,
4,
13,
0,
13,
2,
2,
39,
17,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
39,
13,
0,
13,
2,
2,
39,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
39,
17,
0,
13,
17,
28,
13,
4,
13,
17,
2,
13,
17,
14,
2,
18,
13,
2,
13,
17,
18,
13,
13,
0,
13,
8,
2,
18,
13,
13,
18,
13,
13,
17,
17,
14,
2,
18,
13,
2,
13,
17,
18,
13,
13,
0,
13,
8,
2,
18,
13,
13,
18,
13,
13,
17,
17,
14,
2,
2,
18,
13,
2,
13,
17,
18,
13,
13,
2,
18,
13,
2,
13,
17,
18,
13,
13,
0,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
13,
13,
4,
13,
13,
10,
2,
13,
10,
8,
13,
10,
17,
13,
10,
4,
13,
10,
2,
13,
10,
4,
13,
10,
2,
13,
10,
8,
13,
10,
13,
13,
10,
2,
13
] |
[
[
147,
2
],
[
159,
7
],
[
162,
14
],
[
165,
20
],
[
174,
38
],
[
153,
56
],
[
60,
59
],
[
163,
64
],
[
166,
69
],
[
59,
71
],
[
166,
74
],
[
59,
75
],
[
168,
77
],
[
166,
81
],
[
59,
82
],
[
175,
84
],
[
59,
85
],
[
175,
91
],
[
59,
93
],
[
175,
96
],
[
59,
97
],
[
150,
99
],
[
166,
103
],
[
59,
104
],
[
175,
106
],
[
59,
107
],
[
166,
114
],
[
59,
116
],
[
166,
119
],
[
59,
120
],
[
175,
123
],
[
59,
125
],
[
175,
128
],
[
59,
129
],
[
156,
131
],
[
166,
135
],
[
59,
136
],
[
175,
138
],
[
59,
139
],
[
171,
141
],
[
160,
142
],
[
172,
145
],
[
157,
145
],
[
151,
145
],
[
169,
145
],
[
154,
145
],
[
147,
148
],
[
150,
151
],
[
153,
154
],
[
156,
157
],
[
159,
160
],
[
162,
163
],
[
165,
166
],
[
168,
169
],
[
160,
171
],
[
171,
172
],
[
174,
175
]
] |
[
"inf = 10 ** 18\nmod = 10 ** 9 + 7\nn = int(input())\nt = [0] + list(map(int, input().split())) + [inf]\na = [inf] + list(map(int, input().split())) + [0]\nans = 1\nfor i in range(1, n + 1):\n if t[i - 1] < t[i]:\n ans *= 0 if t[i] > a[i] else 1\n if a[i + 1] < a[i]:\n ans *= 0 if t[i] < a[i] else 1\n if t[i - 1] == t[i] and a[i + 1] == a[i]:\n ans *= min(t[i], a[i])\n ans %= mod\nprint(ans)",
"inf = 10 ** 18",
"inf",
"10 ** 18",
"10",
"18",
"mod = 10 ** 9 + 7",
"mod",
"10 ** 9 + 7",
"10 ** 9",
"10",
"9",
"7",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"t = [0] + list(map(int, input().split())) + [inf]",
"t",
"[0] + list(map(int, input().split())) + [inf]",
"[0] + list(map(int, input().split()))",
"[0]",
"0",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"[inf]",
"inf",
"a = [inf] + list(map(int, input().split())) + [0]",
"a",
"[inf] + list(map(int, input().split())) + [0]",
"[inf] + list(map(int, input().split()))",
"[inf]",
"inf",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"[0]",
"0",
"ans = 1",
"ans",
"1",
"for i in range(1, n + 1):\n if t[i - 1] < t[i]:\n ans *= 0 if t[i] > a[i] else 1\n if a[i + 1] < a[i]:\n ans *= 0 if t[i] < a[i] else 1\n if t[i - 1] == t[i] and a[i + 1] == a[i]:\n ans *= min(t[i], a[i])\n ans %= mod",
"i",
"range(1, n + 1)",
"range",
"1",
"n + 1",
"n",
"1",
"if t[i - 1] < t[i]:\n ans *= 0 if t[i] > a[i] else 1\n ",
"t[i - 1] < t[i]",
"t[i - 1]",
"t",
"i - 1",
"i",
"1",
"t[i]",
"t",
"i",
"ans *= 0 if t[i] > a[i] else 1",
"ans",
"0 if t[i] > a[i] else 1",
"t[i] > a[i]",
"t[i]",
"t",
"i",
"a[i]",
"a",
"i",
"0",
"1",
"if a[i + 1] < a[i]:\n ans *= 0 if t[i] < a[i] else 1\n ",
"a[i + 1] < a[i]",
"a[i + 1]",
"a",
"i + 1",
"i",
"1",
"a[i]",
"a",
"i",
"ans *= 0 if t[i] < a[i] else 1",
"ans",
"0 if t[i] < a[i] else 1",
"t[i] < a[i]",
"t[i]",
"t",
"i",
"a[i]",
"a",
"i",
"0",
"1",
"if t[i - 1] == t[i] and a[i + 1] == a[i]:\n ans *= min(t[i], a[i])\n ans %= mod",
"t[i - 1] == t[i] and a[i + 1] == a[i]",
"t[i - 1] == t[i]",
"t[i - 1]",
"t",
"i - 1",
"i",
"1",
"t[i]",
"t",
"i",
"a[i + 1] == a[i]",
"a[i + 1]",
"a",
"i + 1",
"i",
"1",
"a[i]",
"a",
"i",
"ans *= min(t[i], a[i])",
"ans",
"min(t[i], a[i])",
"min",
"t[i]",
"t",
"i",
"a[i]",
"a",
"i",
"ans %= mod",
"ans",
"mod",
"print(ans)",
"print",
"ans",
"inf = 10 ** 18",
"10 ** 18",
"inf",
"ans *= 0 if t[i] < a[i] else 1",
"0 if t[i] < a[i] else 1",
"ans",
"ans = 1",
"1",
"ans",
"ans *= min(t[i], a[i])",
"min(t[i], a[i])",
"ans",
"mod = 10 ** 9 + 7",
"10 ** 9 + 7",
"mod",
"n = int(input())",
"int(input())",
"n",
"t = [0] + list(map(int, input().split())) + [inf]",
"[0] + list(map(int, input().split())) + [inf]",
"t",
"ans *= 0 if t[i] > a[i] else 1",
"0 if t[i] > a[i] else 1",
"ans",
"ans %= mod",
"mod",
"ans",
"a = [inf] + list(map(int, input().split())) + [0]",
"[inf] + list(map(int, input().split())) + [0]",
"a"
] |
inf = 10 ** 18
mod = 10 ** 9 + 7
n = int(input())
t = [0] + list(map(int, input().split())) + [inf]
a = [inf] + list(map(int, input().split())) + [0]
ans = 1
for i in range(1, n + 1):
if t[i - 1] < t[i]:
ans *= 0 if t[i] > a[i] else 1
if a[i + 1] < a[i]:
ans *= 0 if t[i] < a[i] else 1
if t[i - 1] == t[i] and a[i + 1] == a[i]:
ans *= min(t[i], a[i])
ans %= mod
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
2,
39,
17,
13,
0,
13,
2,
39,
17,
13,
0,
18,
13,
17,
18,
13,
17,
28,
13,
4,
13,
17,
13,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
18,
13,
13,
18,
13,
13,
4,
18,
13,
13,
0,
18,
13,
17,
18,
13,
17,
28,
13,
4,
13,
17,
13,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
18,
13,
13,
18,
13,
13,
4,
18,
13,
13,
4,
18,
13,
13,
0,
13,
39,
0,
13,
39,
28,
13,
4,
13,
13,
4,
18,
13,
13,
4,
13,
18,
13,
13,
18,
13,
13,
4,
18,
13,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
13,
17,
0,
13,
2,
2,
17,
17,
17,
28,
13,
4,
13,
13,
0,
13,
4,
13,
17,
2,
2,
18,
13,
13,
18,
13,
13,
17,
0,
13,
13,
4,
13,
13,
10,
2,
13,
10,
4,
13,
10,
2,
13,
10,
4,
13,
10,
4,
13,
10,
39,
13,
10,
39,
13,
10,
4,
13,
10,
13,
13,
10,
2,
13,
10,
17,
13
] |
[
[
189,
2
],
[
207,
8
],
[
198,
20
],
[
186,
32
],
[
190,
36
],
[
192,
38
],
[
190,
42
],
[
47,
44
],
[
187,
45
],
[
208,
48
],
[
52,
51
],
[
190,
55
],
[
208,
59
],
[
51,
60
],
[
208,
62
],
[
51,
64
],
[
70,
67
],
[
187,
68
],
[
51,
69
],
[
208,
71
],
[
51,
72
],
[
199,
75
],
[
81,
78
],
[
193,
79
],
[
199,
82
],
[
86,
85
],
[
190,
89
],
[
199,
93
],
[
85,
94
],
[
199,
96
],
[
85,
98
],
[
104,
101
],
[
193,
102
],
[
85,
103
],
[
199,
105
],
[
85,
106
],
[
199,
109
],
[
193,
113
],
[
201,
116
],
[
204,
119
],
[
123,
122
],
[
190,
125
],
[
202,
128
],
[
67,
132
],
[
187,
133
],
[
122,
134
],
[
101,
135
],
[
193,
136
],
[
122,
137
],
[
205,
140
],
[
208,
145
],
[
122,
146
],
[
199,
148
],
[
122,
149
],
[
216,
151
],
[
213,
154
],
[
162,
161
],
[
190,
164
],
[
195,
166
],
[
205,
173
],
[
161,
174
],
[
202,
176
],
[
161,
177
],
[
210,
180
],
[
214,
181
],
[
211,
184
],
[
196,
184
],
[
217,
184
],
[
186,
187
],
[
189,
190
],
[
192,
193
],
[
195,
196
],
[
198,
199
],
[
201,
202
],
[
204,
205
],
[
207,
208
],
[
214,
210
],
[
210,
211
],
[
213,
214
],
[
216,
217
]
] |
[
"n=int(input())\ntM=list(map(int,input().split()))\naM=list(map(int,input().split()))\ntm=[1]*n\nam=[1]*n\n\ntm[0]=tM[0]\nfor i in range(1,n):\n if tM[i]>tM[i-1]:\n tm[i]=tM[i]\n\naM.reverse()\nam[0]=aM[0]\nfor i in range(1,n):\n if aM[i]>aM[i-1]:\n am[i]=aM[i]\naM.reverse()\nam.reverse()\n\nm=[]\nM=[]\nfor i in range(n):\n m.append(max(tm[i],am[i]))\n M.append(min(tM[i],aM[i]))\n\nans=1\nmod=10**9+7\nfor i in range(n):\n ans*=max(0,M[i]-m[i]+1)\n ans%=mod\n\nprint(ans)",
"n=int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"tM=list(map(int,input().split()))",
"tM",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"aM=list(map(int,input().split()))",
"aM",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"tm=[1]*n",
"tm",
"[1]*n",
"[1]",
"1",
"n",
"am=[1]*n",
"am",
"[1]*n",
"[1]",
"1",
"n",
"tm[0]=tM[0]",
"tm[0]",
"tm",
"0",
"tM[0]",
"tM",
"0",
"for i in range(1,n):\n if tM[i]>tM[i-1]:\n tm[i]=tM[i]",
"i",
"range(1,n)",
"range",
"1",
"n",
"if tM[i]>tM[i-1]:\n tm[i]=tM[i]",
"tM[i]>tM[i-1]",
"tM[i]",
"tM",
"i",
"tM[i-1]",
"tM",
"i-1",
"i",
"1",
"tm[i]=tM[i]",
"tm[i]",
"tm",
"i",
"tM[i]",
"tM",
"i",
"aM.reverse()",
"aM.reverse",
"aM",
"reverse",
"am[0]=aM[0]",
"am[0]",
"am",
"0",
"aM[0]",
"aM",
"0",
"for i in range(1,n):\n if aM[i]>aM[i-1]:\n am[i]=aM[i]",
"i",
"range(1,n)",
"range",
"1",
"n",
"if aM[i]>aM[i-1]:\n am[i]=aM[i]",
"aM[i]>aM[i-1]",
"aM[i]",
"aM",
"i",
"aM[i-1]",
"aM",
"i-1",
"i",
"1",
"am[i]=aM[i]",
"am[i]",
"am",
"i",
"aM[i]",
"aM",
"i",
"aM.reverse()",
"aM.reverse",
"aM",
"reverse",
"am.reverse()",
"am.reverse",
"am",
"reverse",
"m=[]",
"m",
"[]",
"M=[]",
"M",
"[]",
"for i in range(n):\n m.append(max(tm[i],am[i]))\n M.append(min(tM[i],aM[i]))",
"i",
"range(n)",
"range",
"n",
"m.append(max(tm[i],am[i]))",
"m.append",
"m",
"append",
"max(tm[i],am[i])",
"max",
"tm[i]",
"tm",
"i",
"am[i]",
"am",
"i",
"M.append(min(tM[i],aM[i]))",
"M.append",
"M",
"append",
"min(tM[i],aM[i])",
"min",
"tM[i]",
"tM",
"i",
"aM[i]",
"aM",
"i",
"ans=1",
"ans",
"1",
"mod=10**9+7",
"mod",
"10**9+7",
"10**9",
"10",
"9",
"7",
"for i in range(n):\n ans*=max(0,M[i]-m[i]+1)\n ans%=mod",
"i",
"range(n)",
"range",
"n",
"ans*=max(0,M[i]-m[i]+1)",
"ans",
"max(0,M[i]-m[i]+1)",
"max",
"0",
"M[i]-m[i]+1",
"M[i]-m[i]",
"M[i]",
"M",
"i",
"m[i]",
"m",
"i",
"1",
"ans%=mod",
"ans",
"mod",
"print(ans)",
"print",
"ans",
"tm=[1]*n",
"[1]*n",
"tm",
"n=int(input())",
"int(input())",
"n",
"am=[1]*n",
"[1]*n",
"am",
"ans*=max(0,M[i]-m[i]+1)",
"max(0,M[i]-m[i]+1)",
"ans",
"aM=list(map(int,input().split()))",
"list(map(int,input().split()))",
"aM",
"m=[]",
"[]",
"m",
"M=[]",
"[]",
"M",
"tM=list(map(int,input().split()))",
"list(map(int,input().split()))",
"tM",
"ans%=mod",
"mod",
"ans",
"mod=10**9+7",
"10**9+7",
"mod",
"ans=1",
"1",
"ans"
] |
n=int(input())
tM=list(map(int,input().split()))
aM=list(map(int,input().split()))
tm=[1]*n
am=[1]*n
tm[0]=tM[0]
for i in range(1,n):
if tM[i]>tM[i-1]:
tm[i]=tM[i]
aM.reverse()
am[0]=aM[0]
for i in range(1,n):
if aM[i]>aM[i-1]:
am[i]=aM[i]
aM.reverse()
am.reverse()
m=[]
M=[]
for i in range(n):
m.append(max(tm[i],am[i]))
M.append(min(tM[i],aM[i]))
ans=1
mod=10**9+7
for i in range(n):
ans*=max(0,M[i]-m[i]+1)
ans%=mod
print(ans)
|
[
7,
15,
13,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
0,
13,
13,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
0,
13,
13,
14,
40,
18,
13,
17,
18,
13,
17,
4,
13,
17,
4,
18,
13,
13,
0,
13,
18,
13,
17,
41,
28,
13,
4,
13,
13,
4,
13,
0,
13,
13,
41,
28,
13,
4,
13,
13,
4,
17,
0,
13,
13,
41,
28,
13,
4,
13,
13,
4,
13,
0,
13,
13,
41,
28,
13,
4,
13,
13,
4,
17,
0,
13,
13,
0,
18,
13,
17,
18,
13,
17,
0,
18,
13,
17,
18,
13,
17,
28,
13,
4,
13,
17,
13,
0,
18,
13,
13,
18,
13,
13,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
18,
13,
13,
18,
13,
13,
0,
18,
13,
13,
17,
0,
18,
13,
17,
18,
13,
17,
0,
18,
13,
17,
18,
13,
17,
28,
13,
18,
4,
13,
17,
2,
13,
17,
39,
17,
0,
18,
13,
13,
4,
13,
18,
13,
13,
18,
13,
13,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
18,
13,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
18,
13,
13,
4,
13,
17,
18,
13,
13,
0,
13,
17,
0,
13,
2,
2,
17,
17,
17,
28,
13,
4,
13,
13,
14,
2,
2,
18,
13,
13,
18,
13,
13,
2,
18,
13,
13,
18,
13,
13,
4,
13,
17,
4,
18,
13,
13,
0,
13,
2,
2,
13,
2,
2,
4,
13,
18,
13,
13,
18,
13,
13,
4,
13,
18,
13,
13,
18,
13,
13,
17,
13,
4,
13,
13,
10,
17,
13,
10,
13,
13,
10,
13,
13,
10,
13,
13,
10,
13,
13,
10,
13,
13,
10,
2,
13,
10,
2,
13,
10,
4,
13,
10,
13,
13,
10,
18,
13
] |
[
[
312,
4
],
[
12,
11
],
[
11,
20
],
[
291,
22
],
[
27,
26
],
[
26,
35
],
[
297,
37
],
[
292,
42
],
[
298,
45
],
[
318,
55
],
[
292,
57
],
[
62,
61
],
[
313,
64
],
[
319,
66
],
[
303,
68
],
[
73,
72
],
[
313,
75
],
[
294,
79
],
[
84,
83
],
[
313,
86
],
[
319,
88
],
[
315,
90
],
[
95,
94
],
[
313,
97
],
[
300,
101
],
[
107,
104
],
[
304,
105
],
[
292,
108
],
[
114,
111
],
[
295,
112
],
[
292,
115
],
[
119,
118
],
[
313,
122
],
[
127,
124
],
[
304,
125
],
[
118,
126
],
[
292,
128
],
[
118,
129
],
[
292,
133
],
[
118,
134
],
[
292,
136
],
[
118,
138
],
[
144,
141
],
[
295,
142
],
[
118,
143
],
[
292,
145
],
[
118,
146
],
[
151,
148
],
[
295,
149
],
[
118,
150
],
[
156,
153
],
[
316,
154
],
[
298,
157
],
[
163,
160
],
[
301,
161
],
[
298,
164
],
[
168,
167
],
[
313,
173
],
[
181,
178
],
[
316,
179
],
[
167,
180
],
[
178,
183
],
[
316,
184
],
[
167,
185
],
[
298,
187
],
[
167,
188
],
[
298,
192
],
[
167,
193
],
[
298,
195
],
[
167,
197
],
[
203,
200
],
[
301,
201
],
[
167,
202
],
[
178,
205
],
[
316,
206
],
[
167,
207
],
[
298,
209
],
[
167,
210
],
[
215,
212
],
[
301,
213
],
[
167,
214
],
[
212,
218
],
[
200,
218
],
[
301,
219
],
[
167,
220
],
[
288,
222
],
[
309,
225
],
[
233,
232
],
[
313,
235
],
[
124,
239
],
[
304,
240
],
[
232,
241
],
[
212,
242
],
[
200,
242
],
[
301,
243
],
[
232,
244
],
[
178,
246
],
[
316,
247
],
[
232,
248
],
[
148,
249
],
[
141,
249
],
[
295,
250
],
[
232,
251
],
[
306,
260
],
[
289,
263
],
[
307,
263
],
[
124,
268
],
[
304,
269
],
[
232,
270
],
[
178,
271
],
[
316,
272
],
[
232,
273
],
[
148,
276
],
[
141,
276
],
[
295,
277
],
[
232,
278
],
[
212,
279
],
[
200,
279
],
[
301,
280
],
[
232,
281
],
[
310,
283
],
[
307,
286
],
[
289,
286
],
[
288,
289
],
[
291,
292
],
[
294,
295
],
[
297,
298
],
[
300,
301
],
[
303,
304
],
[
306,
307
],
[
309,
310
],
[
312,
313
],
[
315,
316
],
[
318,
319
]
] |
[
"import sys\nN=int(input())\nT=[int(i) for i in input().split()]\nA=[int(i) for i in input().split()]\n\nif T[-1] != A[0]:\n print(0)\n sys.exit()\n\nmax_=T[-1]\nMAX_T=[max_ for _ in range(N)]\nMIN_T=[1 for _ in range(N)]\nMAX_A=[max_ for _ in range(N)]\nMIN_A=[1 for _ in range(N)]\n\nMAX_T[0] = T[0]\nMIN_T[0] = T[0]\nfor i in range(1,N):\n MAX_T[i] = T[i]\n if T[i] > T[i-1]:\n MIN_T[i] = T[i]\n else:\n MIN_T[i] = 1 \n\n#print(MAX_T)\n#print(MIN_T) \n \nMAX_A[-1] = A[-1]\nMIN_A[-1] = A[-1]\nfor i in range(0,N-1)[::-1]:\n MAX_A[i] = min(MAX_A[i],A[i])\n if A[i] > A[i+1]:\n MIN_A[i] = min(MAX_A[i],A[i])\n else:\n MIN_A[i] = max(1,MIN_A[i])\n \n#print(MAX_A)\n#print(MIN_A)\n\nsum_= 1\nlim = 10**9 + 7\nfor i in range(N):\n if (MAX_T[i] < MIN_A[i]) or (MAX_A[i] < MIN_T[i]):\n print(0)\n sys.exit()\n else:\n sum_ = (sum_ * (min(MAX_T[i],MAX_A[i]) - max(MIN_T[i],MIN_A[i]) +1 )) % lim\nprint(sum_)",
"import sys",
"sys",
"N=int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"int(i) for i in input().split()",
"for i in input().split()",
"i",
"input().split()",
"().split",
"()",
"input",
"split",
"for i in input().split()",
"int(i)",
"int",
"i",
"T=[int(i) for i in input().split()]",
"T",
"[int(i) for i in input().split()]",
"int(i) for i in input().split()",
"for i in input().split()",
"i",
"input().split()",
"().split",
"()",
"input",
"split",
"for i in input().split()",
"int(i)",
"int",
"i",
"A=[int(i) for i in input().split()]",
"A",
"[int(i) for i in input().split()]",
"if T[-1] != A[0]:\n print(0)\n sys.exit()",
"T[-1] != A[0]",
"T[-1]",
"T",
"-1",
"A[0]",
"A",
"0",
"print(0)",
"print",
"0",
"sys.exit()",
"sys.exit",
"sys",
"exit",
"max_=T[-1]",
"max_",
"T[-1]",
"T",
"-1",
"max_ for _ in range(N)",
"for _ in range(N)",
"_",
"range(N)",
"range",
"N",
"for _ in range(N)",
"max_",
"MAX_T=[max_ for _ in range(N)]",
"MAX_T",
"[max_ for _ in range(N)]",
"1 for _ in range(N)",
"for _ in range(N)",
"_",
"range(N)",
"range",
"N",
"for _ in range(N)",
"1",
"MIN_T=[1 for _ in range(N)]",
"MIN_T",
"[1 for _ in range(N)]",
"max_ for _ in range(N)",
"for _ in range(N)",
"_",
"range(N)",
"range",
"N",
"for _ in range(N)",
"max_",
"MAX_A=[max_ for _ in range(N)]",
"MAX_A",
"[max_ for _ in range(N)]",
"1 for _ in range(N)",
"for _ in range(N)",
"_",
"range(N)",
"range",
"N",
"for _ in range(N)",
"1",
"MIN_A=[1 for _ in range(N)]",
"MIN_A",
"[1 for _ in range(N)]",
"MAX_T[0] = T[0]",
"MAX_T[0]",
"MAX_T",
"0",
"T[0]",
"T",
"0",
"MIN_T[0] = T[0]",
"MIN_T[0]",
"MIN_T",
"0",
"T[0]",
"T",
"0",
"for i in range(1,N):\n MAX_T[i] = T[i]\n if T[i] > T[i-1]:\n MIN_T[i] = T[i]\n else:\n MIN_T[i] = 1 \n\n#print(MAX_T)\n#print(MIN_T) \n ",
"i",
"range(1,N)",
"range",
"1",
"N",
"MAX_T[i] = T[i]",
"MAX_T[i]",
"MAX_T",
"i",
"T[i]",
"T",
"i",
"if T[i] > T[i-1]:\n MIN_T[i] = T[i]\n else:\n MIN_T[i] = 1 \n\n#print(MAX_T)\n#print(MIN_T) \n ",
"T[i] > T[i-1]",
"T[i]",
"T",
"i",
"T[i-1]",
"T",
"i-1",
"i",
"1",
"MIN_T[i] = T[i]",
"MIN_T[i]",
"MIN_T",
"i",
"T[i]",
"T",
"i",
"MIN_T[i] = 1",
"MIN_T[i]",
"MIN_T",
"i",
"1",
"MAX_A[-1] = A[-1]",
"MAX_A[-1]",
"MAX_A",
"-1",
"A[-1]",
"A",
"-1",
"MIN_A[-1] = A[-1]",
"MIN_A[-1]",
"MIN_A",
"-1",
"A[-1]",
"A",
"-1",
"for i in range(0,N-1)[::-1]:\n MAX_A[i] = min(MAX_A[i],A[i])\n if A[i] > A[i+1]:\n MIN_A[i] = min(MAX_A[i],A[i])\n else:\n MIN_A[i] = max(1,MIN_A[i])\n \n#print(MAX_A)\n#print(MIN_A)",
"i",
"range(0,N-1)[::-1]",
"(0,N-1)",
"range",
"0",
"N-1",
"N",
"1",
"::-1",
"-1",
"MAX_A[i] = min(MAX_A[i],A[i])",
"MAX_A[i]",
"MAX_A",
"i",
"min(MAX_A[i],A[i])",
"min",
"MAX_A[i]",
"MAX_A",
"i",
"A[i]",
"A",
"i",
"if A[i] > A[i+1]:\n MIN_A[i] = min(MAX_A[i],A[i])\n else:\n MIN_A[i] = max(1,MIN_A[i])\n \n#print(MAX_A)\n#print(MIN_A)",
"A[i] > A[i+1]",
"A[i]",
"A",
"i",
"A[i+1]",
"A",
"i+1",
"i",
"1",
"MIN_A[i] = min(MAX_A[i],A[i])",
"MIN_A[i]",
"MIN_A",
"i",
"min(MAX_A[i],A[i])",
"min",
"MAX_A[i]",
"MAX_A",
"i",
"A[i]",
"A",
"i",
"MIN_A[i] = max(1,MIN_A[i])",
"MIN_A[i]",
"MIN_A",
"i",
"max(1,MIN_A[i])",
"max",
"1",
"MIN_A[i]",
"MIN_A",
"i",
"sum_= 1",
"sum_",
"1",
"lim = 10**9 + 7",
"lim",
"10**9 + 7",
"10**9",
"10",
"9",
"7",
"for i in range(N):\n if (MAX_T[i] < MIN_A[i]) or (MAX_A[i] < MIN_T[i]):\n print(0)\n sys.exit()\n else:\n sum_ = (sum_ * (min(MAX_T[i],MAX_A[i]) - max(MIN_T[i],MIN_A[i]) +1 )) % lim",
"i",
"range(N)",
"range",
"N",
"if (MAX_T[i] < MIN_A[i]) or (MAX_A[i] < MIN_T[i]):\n print(0)\n sys.exit()\n else:\n sum_ = (sum_ * (min(MAX_T[i],MAX_A[i]) - max(MIN_T[i],MIN_A[i]) +1 )) % lim",
"(MAX_T[i] < MIN_A[i]) or (MAX_A[i] < MIN_T[i])",
"MAX_T[i] < MIN_A[i]",
"MAX_T[i]",
"MAX_T",
"i",
"MIN_A[i]",
"MIN_A",
"i",
"MAX_A[i] < MIN_T[i]",
"MAX_A[i]",
"MAX_A",
"i",
"MIN_T[i]",
"MIN_T",
"i",
"print(0)",
"print",
"0",
"sys.exit()",
"sys.exit",
"sys",
"exit",
"sum_ = (sum_ * (min(MAX_T[i],MAX_A[i]) - max(MIN_T[i],MIN_A[i]) +1 )) % lim",
"sum_",
"(sum_ * (min(MAX_T[i],MAX_A[i]) - max(MIN_T[i],MIN_A[i]) +1 )) % lim",
"sum_ * (min(MAX_T[i],MAX_A[i]) - max(MIN_T[i],MIN_A[i]) +1 )",
"sum_",
"min(MAX_T[i],MAX_A[i]) - max(MIN_T[i],MIN_A[i]) +1",
"min(MAX_T[i],MAX_A[i]) - max(MIN_T[i],MIN_A[i])",
"min(MAX_T[i],MAX_A[i])",
"min",
"MAX_T[i]",
"MAX_T",
"i",
"MAX_A[i]",
"MAX_A",
"i",
"max(MIN_T[i],MIN_A[i])",
"max",
"MIN_T[i]",
"MIN_T",
"i",
"MIN_A[i]",
"MIN_A",
"i",
"1",
"lim",
"print(sum_)",
"print",
"sum_",
"sum_= 1",
"1",
"sum_",
"T=[int(i) for i in input().split()]",
"[int(i) for i in input().split()]",
"T",
"MIN_T=[1 for _ in range(N)]",
"[1 for _ in range(N)]",
"MIN_T",
"A=[int(i) for i in input().split()]",
"[int(i) for i in input().split()]",
"A",
"MIN_A=[1 for _ in range(N)]",
"[1 for _ in range(N)]",
"MIN_A",
"MAX_T=[max_ for _ in range(N)]",
"[max_ for _ in range(N)]",
"MAX_T",
"sum_ = (sum_ * (min(MAX_T[i],MAX_A[i]) - max(MIN_T[i],MIN_A[i]) +1 )) % lim",
"(sum_ * (min(MAX_T[i],MAX_A[i]) - max(MIN_T[i],MIN_A[i]) +1 )) % lim",
"sum_",
"lim = 10**9 + 7",
"10**9 + 7",
"lim",
"N=int(input())",
"int(input())",
"N",
"MAX_A=[max_ for _ in range(N)]",
"[max_ for _ in range(N)]",
"MAX_A",
"max_=T[-1]",
"T[-1]",
"max_"
] |
import sys
N=int(input())
T=[int(i) for i in input().split()]
A=[int(i) for i in input().split()]
if T[-1] != A[0]:
print(0)
sys.exit()
max_=T[-1]
MAX_T=[max_ for _ in range(N)]
MIN_T=[1 for _ in range(N)]
MAX_A=[max_ for _ in range(N)]
MIN_A=[1 for _ in range(N)]
MAX_T[0] = T[0]
MIN_T[0] = T[0]
for i in range(1,N):
MAX_T[i] = T[i]
if T[i] > T[i-1]:
MIN_T[i] = T[i]
else:
MIN_T[i] = 1
#print(MAX_T)
#print(MIN_T)
MAX_A[-1] = A[-1]
MIN_A[-1] = A[-1]
for i in range(0,N-1)[::-1]:
MAX_A[i] = min(MAX_A[i],A[i])
if A[i] > A[i+1]:
MIN_A[i] = min(MAX_A[i],A[i])
else:
MIN_A[i] = max(1,MIN_A[i])
#print(MAX_A)
#print(MIN_A)
sum_= 1
lim = 10**9 + 7
for i in range(N):
if (MAX_T[i] < MIN_A[i]) or (MAX_A[i] < MIN_T[i]):
print(0)
sys.exit()
else:
sum_ = (sum_ * (min(MAX_T[i],MAX_A[i]) - max(MIN_T[i],MIN_A[i]) +1 )) % lim
print(sum_)
|
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
0,
13,
2,
2,
39,
17,
13,
39,
17,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
0,
13,
2,
2,
39,
17,
13,
39,
17,
0,
13,
17,
0,
13,
2,
2,
17,
17,
17,
28,
13,
4,
13,
17,
2,
13,
17,
14,
2,
2,
18,
13,
2,
13,
17,
18,
13,
13,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
13,
4,
13,
2,
18,
13,
13,
18,
13,
13,
14,
2,
2,
18,
13,
2,
13,
17,
18,
13,
13,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
13,
4,
13,
40,
18,
13,
13,
18,
13,
13,
14,
2,
2,
18,
13,
2,
13,
17,
18,
13,
13,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
13,
4,
13,
40,
18,
13,
13,
18,
13,
13,
0,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
13,
13,
4,
13,
13,
10,
4,
13,
10,
4,
13,
10,
4,
13,
10,
2,
13,
10,
4,
13,
10,
4,
13,
10,
13,
13,
10,
17,
13,
10,
2,
13,
10,
2,
13
] |
[
[
192,
2
],
[
10,
9
],
[
9,
18
],
[
201,
20
],
[
31,
30
],
[
30,
39
],
[
186,
41
],
[
198,
50
],
[
204,
53
],
[
61,
60
],
[
193,
65
],
[
202,
71
],
[
60,
73
],
[
202,
76
],
[
60,
77
],
[
187,
80
],
[
60,
81
],
[
187,
83
],
[
60,
85
],
[
180,
88
],
[
202,
93
],
[
60,
94
],
[
187,
96
],
[
60,
97
],
[
202,
102
],
[
60,
104
],
[
202,
107
],
[
60,
108
],
[
187,
111
],
[
60,
112
],
[
187,
114
],
[
60,
116
],
[
177,
119
],
[
202,
124
],
[
60,
125
],
[
187,
127
],
[
60,
128
],
[
202,
133
],
[
60,
135
],
[
202,
138
],
[
60,
139
],
[
187,
142
],
[
60,
143
],
[
187,
145
],
[
60,
147
],
[
183,
150
],
[
202,
155
],
[
60,
156
],
[
187,
158
],
[
60,
159
],
[
189,
161
],
[
187,
165
],
[
60,
166
],
[
202,
168
],
[
60,
169
],
[
195,
171
],
[
205,
172
],
[
196,
175
],
[
190,
175
],
[
184,
175
],
[
178,
175
],
[
181,
175
],
[
199,
175
],
[
177,
178
],
[
180,
181
],
[
183,
184
],
[
186,
187
],
[
189,
190
],
[
192,
193
],
[
205,
195
],
[
195,
196
],
[
198,
199
],
[
201,
202
],
[
204,
205
]
] |
[
"n = int(input())\ntn = [0]+[int(i) for i in input().split()]+[0]\nan = [0]+[int(i) for i in input().split()]+[0]\nans = 1\nmod = 10**9+7\n\nfor i in range(1,n+1):\n if tn[i-1] < tn[i] and an[i] > an[i+1]:\n ans *= int(tn[i] == an[i])\n elif tn[i-1] < tn[i] and an[i] == an[i+1]:\n ans *= int(tn[i] <= an[i])\n elif tn[i-1] == tn[i] and an[i] > an[i+1]:\n ans *= int(tn[i] >= an[i])\n else:\n ans *= min(an[i],tn[i])\n ans %= mod\nprint(ans)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"int(i) for i in input().split()",
"for i in input().split()",
"i",
"input().split()",
"().split",
"()",
"input",
"split",
"for i in input().split()",
"int(i)",
"int",
"i",
"tn = [0]+[int(i) for i in input().split()]+[0]",
"tn",
"[0]+[int(i) for i in input().split()]+[0]",
"[0]+[int(i) for i in input().split()]",
"[0]",
"0",
"[int(i) for i in input().split()]",
"[0]",
"0",
"int(i) for i in input().split()",
"for i in input().split()",
"i",
"input().split()",
"().split",
"()",
"input",
"split",
"for i in input().split()",
"int(i)",
"int",
"i",
"an = [0]+[int(i) for i in input().split()]+[0]",
"an",
"[0]+[int(i) for i in input().split()]+[0]",
"[0]+[int(i) for i in input().split()]",
"[0]",
"0",
"[int(i) for i in input().split()]",
"[0]",
"0",
"ans = 1",
"ans",
"1",
"mod = 10**9+7",
"mod",
"10**9+7",
"10**9",
"10",
"9",
"7",
"for i in range(1,n+1):\n if tn[i-1] < tn[i] and an[i] > an[i+1]:\n ans *= int(tn[i] == an[i])\n elif tn[i-1] < tn[i] and an[i] == an[i+1]:\n ans *= int(tn[i] <= an[i])\n elif tn[i-1] == tn[i] and an[i] > an[i+1]:\n ans *= int(tn[i] >= an[i])\n else:\n ans *= min(an[i],tn[i])\n ans %= mod",
"i",
"range(1,n+1)",
"range",
"1",
"n+1",
"n",
"1",
"if tn[i-1] < tn[i] and an[i] > an[i+1]:\n ans *= int(tn[i] == an[i])\n elif tn[i-1] < tn[i] and an[i] == an[i+1]:\n ans *= int(tn[i] <= an[i])\n elif tn[i-1] == tn[i] and an[i] > an[i+1]:\n ans *= int(tn[i] >= an[i])\n else:\n ans *= min(an[i],tn[i])\n ans %= mod",
"tn[i-1] < tn[i] and an[i] > an[i+1]",
"tn[i-1] < tn[i]",
"tn[i-1]",
"tn",
"i-1",
"i",
"1",
"tn[i]",
"tn",
"i",
"an[i] > an[i+1]",
"an[i]",
"an",
"i",
"an[i+1]",
"an",
"i+1",
"i",
"1",
"ans *= int(tn[i] == an[i])",
"ans",
"int(tn[i] == an[i])",
"int",
"tn[i] == an[i]",
"tn[i]",
"tn",
"i",
"an[i]",
"an",
"i",
"elif tn[i-1] < tn[i] and an[i] == an[i+1]:\n ans *= int(tn[i] <= an[i])\n ",
"tn[i-1] < tn[i] and an[i] == an[i+1]",
"tn[i-1] < tn[i]",
"tn[i-1]",
"tn",
"i-1",
"i",
"1",
"tn[i]",
"tn",
"i",
"an[i] == an[i+1]",
"an[i]",
"an",
"i",
"an[i+1]",
"an",
"i+1",
"i",
"1",
"ans *= int(tn[i] <= an[i])",
"ans",
"int(tn[i] <= an[i])",
"int",
"tn[i] <= an[i]",
"tn[i]",
"tn",
"i",
"an[i]",
"an",
"i",
"elif tn[i-1] == tn[i] and an[i] > an[i+1]:\n ans *= int(tn[i] >= an[i])\n ",
"tn[i-1] == tn[i] and an[i] > an[i+1]",
"tn[i-1] == tn[i]",
"tn[i-1]",
"tn",
"i-1",
"i",
"1",
"tn[i]",
"tn",
"i",
"an[i] > an[i+1]",
"an[i]",
"an",
"i",
"an[i+1]",
"an",
"i+1",
"i",
"1",
"ans *= int(tn[i] >= an[i])",
"ans",
"int(tn[i] >= an[i])",
"int",
"tn[i] >= an[i]",
"tn[i]",
"tn",
"i",
"an[i]",
"an",
"i",
"ans *= min(an[i],tn[i])",
"ans",
"min(an[i],tn[i])",
"min",
"an[i]",
"an",
"i",
"tn[i]",
"tn",
"i",
"ans %= mod",
"ans",
"mod",
"print(ans)",
"print",
"ans",
"ans *= int(tn[i] <= an[i])",
"int(tn[i] <= an[i])",
"ans",
"ans *= int(tn[i] == an[i])",
"int(tn[i] == an[i])",
"ans",
"ans *= int(tn[i] >= an[i])",
"int(tn[i] >= an[i])",
"ans",
"an = [0]+[int(i) for i in input().split()]+[0]",
"[0]+[int(i) for i in input().split()]+[0]",
"an",
"ans *= min(an[i],tn[i])",
"min(an[i],tn[i])",
"ans",
"n = int(input())",
"int(input())",
"n",
"ans %= mod",
"mod",
"ans",
"ans = 1",
"1",
"ans",
"tn = [0]+[int(i) for i in input().split()]+[0]",
"[0]+[int(i) for i in input().split()]+[0]",
"tn",
"mod = 10**9+7",
"10**9+7",
"mod"
] |
n = int(input())
tn = [0]+[int(i) for i in input().split()]+[0]
an = [0]+[int(i) for i in input().split()]+[0]
ans = 1
mod = 10**9+7
for i in range(1,n+1):
if tn[i-1] < tn[i] and an[i] > an[i+1]:
ans *= int(tn[i] == an[i])
elif tn[i-1] < tn[i] and an[i] == an[i+1]:
ans *= int(tn[i] <= an[i])
elif tn[i-1] == tn[i] and an[i] > an[i+1]:
ans *= int(tn[i] >= an[i])
else:
ans *= min(an[i],tn[i])
ans %= mod
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
2,
2,
39,
17,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
39,
17,
0,
13,
2,
2,
39,
17,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
39,
17,
0,
13,
2,
2,
17,
17,
17,
12,
13,
4,
13,
17,
4,
13,
0,
13,
17,
28,
13,
4,
13,
17,
2,
13,
17,
14,
2,
18,
13,
2,
13,
17,
18,
13,
13,
14,
2,
18,
13,
13,
18,
13,
13,
4,
13,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
14,
2,
18,
13,
13,
18,
13,
13,
4,
13,
0,
13,
2,
2,
13,
4,
13,
18,
13,
13,
18,
13,
13,
13,
4,
13,
13,
10,
2,
13,
10,
2,
13,
10,
12,
13,
10,
2,
13,
10,
17,
13,
10,
4,
13,
10,
2,
13
] |
[
[
141,
2
],
[
126,
8
],
[
129,
26
],
[
135,
44
],
[
138,
58
],
[
62,
61
],
[
142,
66
],
[
127,
71
],
[
61,
73
],
[
127,
76
],
[
61,
77
],
[
130,
81
],
[
61,
82
],
[
127,
84
],
[
61,
85
],
[
133,
87
],
[
130,
91
],
[
61,
92
],
[
130,
94
],
[
61,
96
],
[
127,
101
],
[
61,
102
],
[
130,
104
],
[
61,
105
],
[
133,
107
],
[
144,
109
],
[
139,
112
],
[
145,
112
],
[
127,
116
],
[
61,
117
],
[
130,
119
],
[
61,
120
],
[
136,
121
],
[
145,
124
],
[
139,
124
],
[
126,
127
],
[
129,
130
],
[
135,
136
],
[
138,
139
],
[
141,
142
],
[
144,
145
]
] |
[
"N = int(input())\nT = [0] + list(map(int, input().split())) + [0]\nA = [0] + list(map(int, input().split())) + [0]\n\nMOD = 10 ** 9 + 7\n\n\ndef imp():\n print(0)\n exit()\n\n\nans = 1\nfor i in range(1, N + 1):\n if T[i - 1] < T[i]:\n if A[i] < T[i]:\n imp()\n elif A[i] > A[i + 1]:\n if T[i] < A[i]:\n imp()\n else:\n ans = (ans * min(T[i], A[i]) % MOD)\nprint(ans)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"T = [0] + list(map(int, input().split())) + [0]",
"T",
"[0] + list(map(int, input().split())) + [0]",
"[0] + list(map(int, input().split()))",
"[0]",
"0",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"[0]",
"0",
"A = [0] + list(map(int, input().split())) + [0]",
"A",
"[0] + list(map(int, input().split())) + [0]",
"[0] + list(map(int, input().split()))",
"[0]",
"0",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"[0]",
"0",
"MOD = 10 ** 9 + 7",
"MOD",
"10 ** 9 + 7",
"10 ** 9",
"10",
"9",
"7",
"def imp():\n print(0)\n exit()",
"imp",
"print(0)",
"print",
"0",
"exit()",
"exit",
"ans = 1",
"ans",
"1",
"for i in range(1, N + 1):\n if T[i - 1] < T[i]:\n if A[i] < T[i]:\n imp()\n elif A[i] > A[i + 1]:\n if T[i] < A[i]:\n imp()\n else:\n ans = (ans * min(T[i], A[i]) % MOD)",
"i",
"range(1, N + 1)",
"range",
"1",
"N + 1",
"N",
"1",
"if T[i - 1] < T[i]:\n if A[i] < T[i]:\n imp()\n elif A[i] > A[i + 1]:\n if T[i] < A[i]:\n imp()\n else:\n ans = (ans * min(T[i], A[i]) % MOD)",
"T[i - 1] < T[i]",
"T[i - 1]",
"T",
"i - 1",
"i",
"1",
"T[i]",
"T",
"i",
"if A[i] < T[i]:\n imp()\n ",
"A[i] < T[i]",
"A[i]",
"A",
"i",
"T[i]",
"T",
"i",
"imp()",
"imp",
"elif A[i] > A[i + 1]:\n if T[i] < A[i]:\n imp()\n ",
"A[i] > A[i + 1]",
"A[i]",
"A",
"i",
"A[i + 1]",
"A",
"i + 1",
"i",
"1",
"if T[i] < A[i]:\n imp()\n ",
"T[i] < A[i]",
"T[i]",
"T",
"i",
"A[i]",
"A",
"i",
"imp()",
"imp",
"ans = (ans * min(T[i], A[i]) % MOD)",
"ans",
"ans * min(T[i], A[i]) % MOD",
"ans * min(T[i], A[i])",
"ans",
"min(T[i], A[i])",
"min",
"T[i]",
"T",
"i",
"A[i]",
"A",
"i",
"MOD",
"print(ans)",
"print",
"ans",
"T = [0] + list(map(int, input().split())) + [0]",
"[0] + list(map(int, input().split())) + [0]",
"T",
"A = [0] + list(map(int, input().split())) + [0]",
"[0] + list(map(int, input().split())) + [0]",
"A",
"def imp():\n print(0)\n exit()",
"def imp():\n print(0)\n exit()",
"imp",
"MOD = 10 ** 9 + 7",
"10 ** 9 + 7",
"MOD",
"ans = 1",
"1",
"ans",
"N = int(input())",
"int(input())",
"N",
"ans = (ans * min(T[i], A[i]) % MOD)",
"ans * min(T[i], A[i]) % MOD",
"ans"
] |
N = int(input())
T = [0] + list(map(int, input().split())) + [0]
A = [0] + list(map(int, input().split())) + [0]
MOD = 10 ** 9 + 7
def imp():
print(0)
exit()
ans = 1
for i in range(1, N + 1):
if T[i - 1] < T[i]:
if A[i] < T[i]:
imp()
elif A[i] > A[i + 1]:
if T[i] < A[i]:
imp()
else:
ans = (ans * min(T[i], A[i]) % MOD)
print(ans)
|
[
7,
41,
28,
13,
4,
13,
4,
13,
4,
13,
4,
17,
0,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
17,
28,
13,
4,
13,
4,
13,
13,
14,
40,
13,
18,
13,
13,
0,
13,
18,
13,
13,
0,
18,
13,
13,
13,
0,
18,
13,
13,
40,
13,
0,
13,
17,
28,
13,
4,
13,
4,
13,
13,
14,
2,
2,
18,
13,
2,
2,
4,
13,
13,
13,
17,
17,
2,
18,
13,
2,
2,
4,
13,
13,
13,
17,
18,
13,
2,
2,
4,
13,
13,
13,
17,
4,
13,
17,
4,
13,
14,
40,
13,
18,
13,
2,
2,
4,
13,
13,
13,
17,
0,
13,
18,
13,
2,
2,
4,
13,
13,
13,
17,
14,
2,
2,
18,
13,
2,
2,
4,
13,
13,
13,
17,
17,
2,
18,
13,
2,
2,
4,
13,
13,
13,
17,
13,
4,
13,
17,
4,
13,
0,
18,
13,
2,
2,
4,
13,
13,
13,
17,
13,
14,
2,
18,
13,
2,
2,
4,
13,
13,
13,
17,
17,
0,
18,
13,
2,
2,
4,
13,
13,
13,
17,
4,
13,
40,
13,
18,
13,
2,
2,
4,
13,
13,
13,
17,
0,
13,
17,
28,
13,
13,
14,
2,
13,
17,
0,
13,
2,
2,
13,
40,
13,
17,
4,
13,
13,
10,
17,
13,
10,
4,
13,
10,
4,
13,
10,
18,
13,
10,
13,
13,
10,
18,
13,
10,
17,
13,
10,
17,
13,
10,
2,
13
] |
[
[
4,
3
],
[
250,
13
],
[
244,
16
],
[
241,
28
],
[
238,
40
],
[
44,
43
],
[
251,
48
],
[
239,
51
],
[
254,
51
],
[
245,
53
],
[
43,
54
],
[
253,
56
],
[
245,
58
],
[
43,
59
],
[
64,
61
],
[
251,
62
],
[
43,
63
],
[
254,
64
],
[
239,
64
],
[
69,
66
],
[
251,
67
],
[
43,
68
],
[
239,
70
],
[
254,
70
],
[
256,
72
],
[
76,
75
],
[
251,
80
],
[
251,
85
],
[
251,
90
],
[
75,
91
],
[
251,
96
],
[
251,
101
],
[
75,
102
],
[
242,
105
],
[
251,
110
],
[
75,
111
],
[
257,
120
],
[
254,
120
],
[
239,
120
],
[
248,
120
],
[
242,
122
],
[
251,
127
],
[
75,
128
],
[
247,
131
],
[
242,
133
],
[
251,
138
],
[
75,
139
],
[
251,
145
],
[
251,
150
],
[
75,
151
],
[
251,
156
],
[
251,
161
],
[
75,
162
],
[
248,
164
],
[
257,
164
],
[
254,
164
],
[
239,
164
],
[
180,
171
],
[
251,
172
],
[
251,
177
],
[
75,
178
],
[
248,
180
],
[
257,
180
],
[
254,
180
],
[
239,
180
],
[
251,
184
],
[
251,
189
],
[
75,
190
],
[
203,
194
],
[
251,
195
],
[
251,
200
],
[
75,
201
],
[
257,
206
],
[
254,
206
],
[
239,
206
],
[
248,
206
],
[
251,
208
],
[
251,
213
],
[
75,
214
],
[
259,
217
],
[
221,
220
],
[
251,
220
],
[
220,
224
],
[
262,
227
],
[
260,
230
],
[
263,
230
],
[
220,
232
],
[
263,
236
],
[
260,
236
],
[
238,
239
],
[
241,
242
],
[
244,
245
],
[
247,
248
],
[
250,
251
],
[
253,
254
],
[
256,
257
],
[
259,
260
],
[
262,
263
]
] |
[
"# coding: utf-8\nyama=[0 for i in range(int(input()))]\nt=list(map(int,input().split()))\na=list(map(int,input().split()))\n\ncheck=0\nfor i in range(len(yama)):\n if check!=t[i]:\n check=t[i]\n yama[i]=check\n else:\n yama[i]=-check\ncheck=0\nfor i in range(len(yama)):\n if yama[len(yama)-i-1]>0 and yama[len(yama)-i-1]>a[len(yama)-i-1]:\n print(0)\n exit()\n if check!=a[len(yama)-i-1]:\n check=a[len(yama)-i-1]\n if yama[len(yama)-i-1]>0 and yama[len(yama)-i-1]>check:\n print(0)\n exit()\n yama[len(yama)-i-1]=check\n else:\n if yama[len(yama)-i-1]<0:\n yama[len(yama)-i-1]=max(-check,yama[len(yama)-i-1])\n\nx=1\nfor i in yama:\n if i<0:\n x=(x*-i)%1000000007\n\nprint(x)",
"0 for i in range(int(input()))",
"for i in range(int(input()))",
"i",
"range(int(input()))",
"range",
"int(input())",
"int",
"input()",
"input",
"for i in range(int(input()))",
"0",
"yama=[0 for i in range(int(input()))]",
"yama",
"[0 for i in range(int(input()))]",
"t=list(map(int,input().split()))",
"t",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"a=list(map(int,input().split()))",
"a",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"check=0",
"check",
"0",
"for i in range(len(yama)):\n if check!=t[i]:\n check=t[i]\n yama[i]=check\n else:\n yama[i]=-check",
"i",
"range(len(yama))",
"range",
"len(yama)",
"len",
"yama",
"if check!=t[i]:\n check=t[i]\n yama[i]=check\n else:\n yama[i]=-check",
"check!=t[i]",
"check",
"t[i]",
"t",
"i",
"check=t[i]",
"check",
"t[i]",
"t",
"i",
"yama[i]=check",
"yama[i]",
"yama",
"i",
"check",
"yama[i]=-check",
"yama[i]",
"yama",
"i",
"-check",
"check",
"check=0",
"check",
"0",
"for i in range(len(yama)):\n if yama[len(yama)-i-1]>0 and yama[len(yama)-i-1]>a[len(yama)-i-1]:\n print(0)\n exit()\n if check!=a[len(yama)-i-1]:\n check=a[len(yama)-i-1]\n if yama[len(yama)-i-1]>0 and yama[len(yama)-i-1]>check:\n print(0)\n exit()\n yama[len(yama)-i-1]=check\n else:\n if yama[len(yama)-i-1]<0:\n yama[len(yama)-i-1]=max(-check,yama[len(yama)-i-1])",
"i",
"range(len(yama))",
"range",
"len(yama)",
"len",
"yama",
"if yama[len(yama)-i-1]>0 and yama[len(yama)-i-1]>a[len(yama)-i-1]:\n print(0)\n exit()\n ",
"yama[len(yama)-i-1]>0 and yama[len(yama)-i-1]>a[len(yama)-i-1]",
"yama[len(yama)-i-1]>0",
"yama[len(yama)-i-1]",
"yama",
"len(yama)-i-1",
"len(yama)-i",
"len(yama)",
"len",
"yama",
"i",
"1",
"0",
"yama[len(yama)-i-1]>a[len(yama)-i-1]",
"yama[len(yama)-i-1]",
"yama",
"len(yama)-i-1",
"len(yama)-i",
"len(yama)",
"len",
"yama",
"i",
"1",
"a[len(yama)-i-1]",
"a",
"len(yama)-i-1",
"len(yama)-i",
"len(yama)",
"len",
"yama",
"i",
"1",
"print(0)",
"print",
"0",
"exit()",
"exit",
"if check!=a[len(yama)-i-1]:\n check=a[len(yama)-i-1]\n if yama[len(yama)-i-1]>0 and yama[len(yama)-i-1]>check:\n print(0)\n exit()\n yama[len(yama)-i-1]=check\n else:\n if yama[len(yama)-i-1]<0:\n yama[len(yama)-i-1]=max(-check,yama[len(yama)-i-1])",
"check!=a[len(yama)-i-1]",
"check",
"a[len(yama)-i-1]",
"a",
"len(yama)-i-1",
"len(yama)-i",
"len(yama)",
"len",
"yama",
"i",
"1",
"check=a[len(yama)-i-1]",
"check",
"a[len(yama)-i-1]",
"a",
"len(yama)-i-1",
"len(yama)-i",
"len(yama)",
"len",
"yama",
"i",
"1",
"if yama[len(yama)-i-1]>0 and yama[len(yama)-i-1]>check:\n print(0)\n exit()\n ",
"yama[len(yama)-i-1]>0 and yama[len(yama)-i-1]>check",
"yama[len(yama)-i-1]>0",
"yama[len(yama)-i-1]",
"yama",
"len(yama)-i-1",
"len(yama)-i",
"len(yama)",
"len",
"yama",
"i",
"1",
"0",
"yama[len(yama)-i-1]>check",
"yama[len(yama)-i-1]",
"yama",
"len(yama)-i-1",
"len(yama)-i",
"len(yama)",
"len",
"yama",
"i",
"1",
"check",
"print(0)",
"print",
"0",
"exit()",
"exit",
"yama[len(yama)-i-1]=check",
"yama[len(yama)-i-1]",
"yama",
"len(yama)-i-1",
"len(yama)-i",
"len(yama)",
"len",
"yama",
"i",
"1",
"check",
"if yama[len(yama)-i-1]<0:\n yama[len(yama)-i-1]=max(-check,yama[len(yama)-i-1])",
"yama[len(yama)-i-1]<0",
"yama[len(yama)-i-1]",
"yama",
"len(yama)-i-1",
"len(yama)-i",
"len(yama)",
"len",
"yama",
"i",
"1",
"0",
"yama[len(yama)-i-1]=max(-check,yama[len(yama)-i-1])",
"yama[len(yama)-i-1]",
"yama",
"len(yama)-i-1",
"len(yama)-i",
"len(yama)",
"len",
"yama",
"i",
"1",
"max(-check,yama[len(yama)-i-1])",
"max",
"-check",
"check",
"yama[len(yama)-i-1]",
"yama",
"len(yama)-i-1",
"len(yama)-i",
"len(yama)",
"len",
"yama",
"i",
"1",
"x=1",
"x",
"1",
"for i in yama:\n if i<0:\n x=(x*-i)%1000000007",
"i",
"yama",
"if i<0:\n x=(x*-i)%1000000007",
"i<0",
"i",
"0",
"x=(x*-i)%1000000007",
"x",
"(x*-i)%1000000007",
"x*-i",
"x",
"-i",
"i",
"1000000007",
"print(x)",
"print",
"x",
"check=0",
"0",
"check",
"a=list(map(int,input().split()))",
"list(map(int,input().split()))",
"a",
"t=list(map(int,input().split()))",
"list(map(int,input().split()))",
"t",
"check=a[len(yama)-i-1]",
"a[len(yama)-i-1]",
"check",
"yama=[0 for i in range(int(input()))]",
"[0 for i in range(int(input()))]",
"yama",
"check=t[i]",
"t[i]",
"check",
"check=0",
"0",
"check",
"x=1",
"1",
"x",
"x=(x*-i)%1000000007",
"(x*-i)%1000000007",
"x"
] |
# coding: utf-8
yama=[0 for i in range(int(input()))]
t=list(map(int,input().split()))
a=list(map(int,input().split()))
check=0
for i in range(len(yama)):
if check!=t[i]:
check=t[i]
yama[i]=check
else:
yama[i]=-check
check=0
for i in range(len(yama)):
if yama[len(yama)-i-1]>0 and yama[len(yama)-i-1]>a[len(yama)-i-1]:
print(0)
exit()
if check!=a[len(yama)-i-1]:
check=a[len(yama)-i-1]
if yama[len(yama)-i-1]>0 and yama[len(yama)-i-1]>check:
print(0)
exit()
yama[len(yama)-i-1]=check
else:
if yama[len(yama)-i-1]<0:
yama[len(yama)-i-1]=max(-check,yama[len(yama)-i-1])
x=1
for i in yama:
if i<0:
x=(x*-i)%1000000007
print(x)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
17,
0,
13,
2,
2,
17,
17,
17,
14,
40,
2,
18,
13,
17,
18,
13,
2,
13,
17,
4,
13,
17,
4,
13,
28,
13,
4,
13,
17,
2,
13,
17,
14,
2,
2,
40,
2,
18,
13,
13,
18,
13,
2,
13,
17,
2,
18,
13,
13,
18,
13,
13,
2,
40,
2,
18,
13,
13,
18,
13,
2,
13,
17,
2,
18,
13,
13,
18,
13,
13,
4,
13,
17,
4,
13,
14,
2,
2,
18,
13,
13,
18,
13,
2,
13,
17,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
13,
2,
2,
13,
4,
13,
18,
13,
13,
18,
13,
13,
13,
4,
13,
13,
10,
17,
13,
10,
4,
13,
10,
4,
13,
10,
4,
13,
10,
2,
13,
10,
2,
13
] |
[
[
149,
2
],
[
152,
8
],
[
155,
20
],
[
146,
32
],
[
161,
35
],
[
156,
45
],
[
153,
48
],
[
150,
50
],
[
59,
58
],
[
150,
63
],
[
153,
71
],
[
58,
72
],
[
153,
74
],
[
58,
76
],
[
153,
80
],
[
58,
81
],
[
156,
83
],
[
58,
84
],
[
156,
89
],
[
58,
90
],
[
156,
92
],
[
58,
94
],
[
156,
98
],
[
58,
99
],
[
153,
101
],
[
58,
102
],
[
153,
112
],
[
58,
113
],
[
153,
115
],
[
58,
117
],
[
156,
121
],
[
58,
122
],
[
156,
124
],
[
58,
126
],
[
158,
129
],
[
147,
132
],
[
159,
132
],
[
153,
136
],
[
58,
137
],
[
156,
139
],
[
58,
140
],
[
162,
141
],
[
159,
144
],
[
147,
144
],
[
146,
147
],
[
149,
150
],
[
152,
153
],
[
155,
156
],
[
158,
159
],
[
161,
162
]
] |
[
"n = int(input())\nt = list(map(int,input().split()))\na = list(map(int,input().split()))\nans = 1\nmod = 10**9+7\nif (not a[0] == t[n-1]):\n print(0)\n exit()\n\nfor i in range(1,n-1):\n if ((not t[i] == t[i-1]) and t[i] > a[i]) or ((not a[i] == a[i+1]) and a[i] > t[i]):\n print(0)\n exit()\n elif t[i] == t[i-1] and a[i] == a[i+1]:\n ans = (ans*min(t[i],a[i]))%mod\n\nprint(ans)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"t = list(map(int,input().split()))",
"t",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"a = list(map(int,input().split()))",
"a",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"ans = 1",
"ans",
"1",
"mod = 10**9+7",
"mod",
"10**9+7",
"10**9",
"10",
"9",
"7",
"if (not a[0] == t[n-1]):\n print(0)\n exit()",
"not a[0] == t[n-1]",
"a[0] == t[n-1]",
"a[0]",
"a",
"0",
"t[n-1]",
"t",
"n-1",
"n",
"1",
"print(0)",
"print",
"0",
"exit()",
"exit",
"for i in range(1,n-1):\n if ((not t[i] == t[i-1]) and t[i] > a[i]) or ((not a[i] == a[i+1]) and a[i] > t[i]):\n print(0)\n exit()\n elif t[i] == t[i-1] and a[i] == a[i+1]:\n ans = (ans*min(t[i],a[i]))%mod",
"i",
"range(1,n-1)",
"range",
"1",
"n-1",
"n",
"1",
"if ((not t[i] == t[i-1]) and t[i] > a[i]) or ((not a[i] == a[i+1]) and a[i] > t[i]):\n print(0)\n exit()\n elif t[i] == t[i-1] and a[i] == a[i+1]:\n ans = (ans*min(t[i],a[i]))%mod",
"((not t[i] == t[i-1]) and t[i] > a[i]) or ((not a[i] == a[i+1]) and a[i] > t[i])",
"(not t[i] == t[i-1]) and t[i] > a[i]",
"not t[i] == t[i-1]",
"t[i] == t[i-1]",
"t[i]",
"t",
"i",
"t[i-1]",
"t",
"i-1",
"i",
"1",
"t[i] > a[i]",
"t[i]",
"t",
"i",
"a[i]",
"a",
"i",
"(not a[i] == a[i+1]) and a[i] > t[i]",
"not a[i] == a[i+1]",
"a[i] == a[i+1]",
"a[i]",
"a",
"i",
"a[i+1]",
"a",
"i+1",
"i",
"1",
"a[i] > t[i]",
"a[i]",
"a",
"i",
"t[i]",
"t",
"i",
"print(0)",
"print",
"0",
"exit()",
"exit",
"elif t[i] == t[i-1] and a[i] == a[i+1]:\n ans = (ans*min(t[i],a[i]))%mod",
"t[i] == t[i-1] and a[i] == a[i+1]",
"t[i] == t[i-1]",
"t[i]",
"t",
"i",
"t[i-1]",
"t",
"i-1",
"i",
"1",
"a[i] == a[i+1]",
"a[i]",
"a",
"i",
"a[i+1]",
"a",
"i+1",
"i",
"1",
"ans = (ans*min(t[i],a[i]))%mod",
"ans",
"(ans*min(t[i],a[i]))%mod",
"ans*min(t[i],a[i])",
"ans",
"min(t[i],a[i])",
"min",
"t[i]",
"t",
"i",
"a[i]",
"a",
"i",
"mod",
"print(ans)",
"print",
"ans",
"ans = 1",
"1",
"ans",
"n = int(input())",
"int(input())",
"n",
"t = list(map(int,input().split()))",
"list(map(int,input().split()))",
"t",
"a = list(map(int,input().split()))",
"list(map(int,input().split()))",
"a",
"ans = (ans*min(t[i],a[i]))%mod",
"(ans*min(t[i],a[i]))%mod",
"ans",
"mod = 10**9+7",
"10**9+7",
"mod"
] |
n = int(input())
t = list(map(int,input().split()))
a = list(map(int,input().split()))
ans = 1
mod = 10**9+7
if (not a[0] == t[n-1]):
print(0)
exit()
for i in range(1,n-1):
if ((not t[i] == t[i-1]) and t[i] > a[i]) or ((not a[i] == a[i+1]) and a[i] > t[i]):
print(0)
exit()
elif t[i] == t[i-1] and a[i] == a[i+1]:
ans = (ans*min(t[i],a[i]))%mod
print(ans)
|
[
7,
15,
12,
13,
17,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
18,
13,
17,
13,
18,
13,
17,
0,
13,
4,
18,
13,
13,
13,
13,
2,
2,
13,
4,
18,
18,
13,
39,
17,
13,
13,
17,
14,
2,
40,
13,
13,
2,
13,
13,
4,
13,
17,
29,
0,
13,
2,
2,
17,
17,
17,
0,
13,
17,
13,
17,
28,
13,
18,
13,
39,
2,
13,
17,
14,
2,
13,
13,
0,
13,
13,
0,
13,
2,
2,
13,
13,
13,
28,
13,
4,
13,
2,
13,
17,
13,
0,
13,
2,
2,
13,
13,
13,
28,
13,
18,
13,
39,
2,
13,
17,
14,
2,
13,
13,
0,
13,
13,
0,
13,
2,
2,
13,
13,
13,
4,
13,
13,
14,
2,
13,
17,
4,
13,
10,
12,
13
] |
[
[
7,
6
],
[
13,
12
],
[
25,
24
],
[
37,
36
],
[
12,
38
],
[
41,
40
],
[
24,
42
],
[
46,
45
],
[
12,
48
],
[
36,
50
],
[
52,
51
],
[
6,
54
],
[
24,
58
],
[
40,
62
],
[
36,
67
],
[
40,
68
],
[
45,
70
],
[
51,
71
],
[
78,
77
],
[
85,
84
],
[
87,
86
],
[
90,
89
],
[
12,
91
],
[
45,
94
],
[
89,
98
],
[
86,
99
],
[
101,
99
],
[
102,
101
],
[
89,
102
],
[
105,
104
],
[
84,
107
],
[
104,
107
],
[
86,
108
],
[
101,
108
],
[
77,
109
],
[
112,
111
],
[
45,
115
],
[
51,
117
],
[
120,
119
],
[
104,
122
],
[
84,
122
],
[
119,
122
],
[
101,
123
],
[
86,
123
],
[
77,
124
],
[
127,
126
],
[
24,
128
],
[
51,
131
],
[
126,
135
],
[
101,
136
],
[
86,
136
],
[
138,
136
],
[
139,
138
],
[
126,
139
],
[
142,
141
],
[
119,
144
],
[
104,
144
],
[
84,
144
],
[
141,
144
],
[
101,
145
],
[
86,
145
],
[
138,
145
],
[
77,
146
],
[
141,
149
],
[
119,
149
],
[
104,
149
],
[
84,
149
],
[
158,
155
]
] |
[
"# code-festival-2016-qualcC - 二人のアルピニスト / Two Alpinists\nfrom bisect import bisect_left as bs\n\n\ndef main():\n \"\"\"\n /----\\ <- xi (= yi)\n / \\--\\\n / \\\n xi yi\n 0 ~ xi / xi ~ yi / yi+1 ~ N-1\n \"\"\"\n N = int(input())\n T = tuple(map(int, input().split()))\n A = tuple(map(int, input().split()))\n x, y = T[-1], A[0] # max of x, y\n xi, yi = T.index(x), N - A[::-1].index(y) - 1 # indices of x, y\n if x != y or xi > yi:\n print(0)\n return\n MOD = 10 ** 9 + 7\n ans, cur = 1, 0\n for i in T[: xi + 1]:\n if i > cur: # point of new altitude -> no choice (ans * 1)\n cur = i\n else:\n ans = (ans * cur) % MOD # mulitple choices (1, 2, ..., cur)\n for _ in range(xi + 1, yi):\n ans = (ans * cur) % MOD\n for i in A[yi + 1 :]:\n if i < cur:\n cur = i\n else:\n ans = (ans * cur) % MOD\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()",
"from bisect import bisect_left as bs",
"def main():\n \"\"\"\n /----\\ <- xi (= yi)\n / \\--\\\n / \\\n xi yi\n 0 ~ xi / xi ~ yi / yi+1 ~ N-1\n \"\"\"\n N = int(input())\n T = tuple(map(int, input().split()))\n A = tuple(map(int, input().split()))\n x, y = T[-1], A[0] # max of x, y\n xi, yi = T.index(x), N - A[::-1].index(y) - 1 # indices of x, y\n if x != y or xi > yi:\n print(0)\n return\n MOD = 10 ** 9 + 7\n ans, cur = 1, 0\n for i in T[: xi + 1]:\n if i > cur: # point of new altitude -> no choice (ans * 1)\n cur = i\n else:\n ans = (ans * cur) % MOD # mulitple choices (1, 2, ..., cur)\n for _ in range(xi + 1, yi):\n ans = (ans * cur) % MOD\n for i in A[yi + 1 :]:\n if i < cur:\n cur = i\n else:\n ans = (ans * cur) % MOD\n print(ans)",
"main",
"\"\"\"\n /----\\ <- xi (= yi)\n / \\--\\\n / \\\n xi yi\n 0 ~ xi / xi ~ yi / yi+1 ~ N-1\n \"\"\"",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"T = tuple(map(int, input().split()))",
"T",
"tuple(map(int, input().split()))",
"tuple",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"A = tuple(map(int, input().split()))",
"A",
"tuple(map(int, input().split()))",
"tuple",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"x, y = T[-1], A[0]",
"x",
"T[-1]",
"T",
"-1",
"y",
"A[0]",
"A",
"0",
"xi, yi = T.index(x), N - A[::-1].index(y) - 1",
"xi",
"T.index(x)",
"T.index",
"T",
"index",
"x",
"yi",
"N - A[::-1].index(y) - 1",
"N - A[::-1].index(y)",
"N",
"A[::-1].index(y)",
"[::-1].index",
"[::-1]",
"A",
"::-1",
"-1",
"index",
"y",
"1",
"if x != y or xi > yi:\n print(0)\n return\n ",
"x != y or xi > yi",
"x != y",
"x",
"y",
"xi > yi",
"xi",
"yi",
"print(0)",
"print",
"0",
"return",
"MOD = 10 ** 9 + 7",
"MOD",
"10 ** 9 + 7",
"10 ** 9",
"10",
"9",
"7",
"ans, cur = 1, 0",
"ans",
"1",
"cur",
"0",
"for i in T[: xi + 1]:\n if i > cur: # point of new altitude -> no choice (ans * 1)\n cur = i\n else:\n ans = (ans * cur) % MOD # mulitple choices (1, 2, ..., cur)\n ",
"i",
"T[: xi + 1]",
"T",
": xi + 1",
"xi + 1",
"xi",
"1",
"if i > cur: # point of new altitude -> no choice (ans * 1)\n cur = i\n else:\n ans = (ans * cur) % MOD # mulitple choices (1, 2, ..., cur)\n ",
"i > cur",
"i",
"cur",
"cur = i",
"cur",
"i",
"ans = (ans * cur) % MOD",
"ans",
"(ans * cur) % MOD",
"ans * cur",
"ans",
"cur",
"MOD",
"for _ in range(xi + 1, yi):\n ans = (ans * cur) % MOD\n ",
"_",
"range(xi + 1, yi)",
"range",
"xi + 1",
"xi",
"1",
"yi",
"ans = (ans * cur) % MOD",
"ans",
"(ans * cur) % MOD",
"ans * cur",
"ans",
"cur",
"MOD",
"for i in A[yi + 1 :]:\n if i < cur:\n cur = i\n else:\n ans = (ans * cur) % MOD\n ",
"i",
"A[yi + 1 :]",
"A",
"yi + 1 :",
"yi + 1",
"yi",
"1",
"if i < cur:\n cur = i\n else:\n ans = (ans * cur) % MOD\n ",
"i < cur",
"i",
"cur",
"cur = i",
"cur",
"i",
"ans = (ans * cur) % MOD",
"ans",
"(ans * cur) % MOD",
"ans * cur",
"ans",
"cur",
"MOD",
"print(ans)",
"print",
"ans",
"if __name__ == \"__main__\":\n main()",
"__name__ == \"__main__\"",
"__name__",
"\"__main__\"",
"main()",
"main",
"def main():\n \"\"\"\n /----\\ <- xi (= yi)\n / \\--\\\n / \\\n xi yi\n 0 ~ xi / xi ~ yi / yi+1 ~ N-1\n \"\"\"\n N = int(input())\n T = tuple(map(int, input().split()))\n A = tuple(map(int, input().split()))\n x, y = T[-1], A[0] # max of x, y\n xi, yi = T.index(x), N - A[::-1].index(y) - 1 # indices of x, y\n if x != y or xi > yi:\n print(0)\n return\n MOD = 10 ** 9 + 7\n ans, cur = 1, 0\n for i in T[: xi + 1]:\n if i > cur: # point of new altitude -> no choice (ans * 1)\n cur = i\n else:\n ans = (ans * cur) % MOD # mulitple choices (1, 2, ..., cur)\n for _ in range(xi + 1, yi):\n ans = (ans * cur) % MOD\n for i in A[yi + 1 :]:\n if i < cur:\n cur = i\n else:\n ans = (ans * cur) % MOD\n print(ans)",
"def main():\n \"\"\"\n /----\\ <- xi (= yi)\n / \\--\\\n / \\\n xi yi\n 0 ~ xi / xi ~ yi / yi+1 ~ N-1\n \"\"\"\n N = int(input())\n T = tuple(map(int, input().split()))\n A = tuple(map(int, input().split()))\n x, y = T[-1], A[0] # max of x, y\n xi, yi = T.index(x), N - A[::-1].index(y) - 1 # indices of x, y\n if x != y or xi > yi:\n print(0)\n return\n MOD = 10 ** 9 + 7\n ans, cur = 1, 0\n for i in T[: xi + 1]:\n if i > cur: # point of new altitude -> no choice (ans * 1)\n cur = i\n else:\n ans = (ans * cur) % MOD # mulitple choices (1, 2, ..., cur)\n for _ in range(xi + 1, yi):\n ans = (ans * cur) % MOD\n for i in A[yi + 1 :]:\n if i < cur:\n cur = i\n else:\n ans = (ans * cur) % MOD\n print(ans)",
"main"
] |
# code-festival-2016-qualcC - 二人のアルピニスト / Two Alpinists
from bisect import bisect_left as bs
def main():
"""
/----\ <- xi (= yi)
/ \--\
/ \
xi yi
0 ~ xi / xi ~ yi / yi+1 ~ N-1
"""
N = int(input())
T = tuple(map(int, input().split()))
A = tuple(map(int, input().split()))
x, y = T[-1], A[0] # max of x, y
xi, yi = T.index(x), N - A[::-1].index(y) - 1 # indices of x, y
if x != y or xi > yi:
print(0)
return
MOD = 10 ** 9 + 7
ans, cur = 1, 0
for i in T[: xi + 1]:
if i > cur: # point of new altitude -> no choice (ans * 1)
cur = i
else:
ans = (ans * cur) % MOD # mulitple choices (1, 2, ..., cur)
for _ in range(xi + 1, yi):
ans = (ans * cur) % MOD
for i in A[yi + 1 :]:
if i < cur:
cur = i
else:
ans = (ans * cur) % MOD
print(ans)
if __name__ == "__main__":
main()
|
[
7,
17,
15,
13,
0,
13,
18,
18,
18,
13,
13,
13,
13,
12,
13,
23,
13,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
2,
2,
17,
17,
17,
0,
13,
17,
0,
13,
39,
28,
13,
4,
13,
13,
14,
2,
13,
18,
13,
13,
4,
18,
13,
13,
39,
17,
18,
13,
13,
0,
13,
18,
13,
13,
4,
18,
13,
13,
39,
17,
18,
13,
13,
0,
13,
39,
0,
13,
17,
28,
13,
4,
13,
2,
13,
17,
17,
17,
14,
2,
13,
18,
13,
13,
4,
18,
13,
13,
39,
17,
18,
13,
13,
0,
13,
18,
13,
13,
4,
18,
13,
13,
39,
17,
18,
13,
13,
4,
18,
13,
13,
0,
13,
17,
28,
13,
4,
13,
13,
14,
2,
18,
18,
13,
13,
17,
17,
14,
2,
18,
18,
13,
13,
17,
17,
14,
40,
18,
18,
13,
13,
17,
18,
18,
13,
13,
17,
0,
13,
17,
3,
14,
2,
18,
18,
13,
13,
17,
18,
18,
13,
13,
17,
0,
13,
17,
3,
14,
2,
18,
18,
13,
13,
17,
17,
14,
2,
18,
18,
13,
13,
17,
18,
18,
13,
13,
17,
0,
13,
17,
3,
0,
13,
4,
13,
18,
18,
13,
13,
17,
18,
18,
13,
13,
17,
0,
13,
13,
4,
13,
13,
10,
17,
13,
10,
39,
13,
10,
4,
13,
10,
4,
13,
10,
17,
13,
10,
4,
13,
10,
13,
13,
10,
17,
13,
10,
2,
13,
10,
18,
13,
10,
17,
13,
10,
4,
13,
10,
18,
13,
10,
17,
13,
10,
18,
13,
10,
12,
13,
10,
17,
13,
10,
39,
13
] |
[
[
279,
5
],
[
16,
16
],
[
249,
18
],
[
280,
22
],
[
252,
24
],
[
280,
33
],
[
276,
36
],
[
280,
45
],
[
267,
48
],
[
255,
55
],
[
246,
58
],
[
62,
61
],
[
250,
64
],
[
256,
67
],
[
271,
67
],
[
253,
69
],
[
61,
70
],
[
247,
73
],
[
253,
78
],
[
61,
79
],
[
270,
81
],
[
253,
83
],
[
61,
84
],
[
247,
87
],
[
253,
92
],
[
61,
93
],
[
294,
95
],
[
282,
98
],
[
102,
101
],
[
250,
105
],
[
283,
111
],
[
271,
111
],
[
256,
111
],
[
286,
111
],
[
277,
113
],
[
101,
114
],
[
295,
117
],
[
277,
122
],
[
101,
123
],
[
285,
125
],
[
277,
127
],
[
101,
128
],
[
295,
131
],
[
277,
136
],
[
101,
137
],
[
295,
140
],
[
273,
143
],
[
147,
146
],
[
250,
149
],
[
247,
154
],
[
146,
155
],
[
295,
162
],
[
146,
163
],
[
247,
170
],
[
146,
171
],
[
295,
175
],
[
146,
176
],
[
291,
179
],
[
247,
186
],
[
146,
187
],
[
295,
191
],
[
146,
192
],
[
264,
195
],
[
295,
202
],
[
146,
203
],
[
295,
210
],
[
146,
211
],
[
247,
215
],
[
146,
216
],
[
243,
219
],
[
258,
223
],
[
247,
228
],
[
146,
229
],
[
295,
233
],
[
146,
234
],
[
261,
237
],
[
268,
238
],
[
262,
241
],
[
259,
241
],
[
244,
241
],
[
265,
241
],
[
292,
241
],
[
274,
241
],
[
243,
244
],
[
246,
247
],
[
249,
250
],
[
252,
253
],
[
255,
256
],
[
258,
259
],
[
268,
261
],
[
261,
262
],
[
264,
265
],
[
267,
268
],
[
270,
271
],
[
273,
274
],
[
276,
277
],
[
279,
280
],
[
282,
283
],
[
285,
286
],
[
291,
292
],
[
294,
295
]
] |
[
"#CODE FESTIVAL 2016 qual C-C 二人のアルピニスト\n\"\"\"\n左右一列に並んでいる山を、左右から見ていった時に今まで見た中の最大値が分かる。\nこの状態で、山の高さの列が何通りあるか求めよ。\n\n単純に、山の高さの\"幅\"を求めて、その分だけかけ合わせれば良さそう。\n\n辻褄が合わないのは\n1.高さが確定している場所同士で、辻褄が合わない\n2.片方の高さが確定している場所で、もう片方の値がそれより小さい\nこのとき0\n\"\"\"\nimport sys\nreadline = sys.stdin.buffer.readline\ndef even(n): return 1 if n%2==0 else 0\nn = int(readline())\nL = list(map(int,readline().split()))\nR = list(map(int,readline().split()))\nmod = 10**9 + 7\n\nmx = 0\nL1 = []\nfor i in range(n):\n if mx < L[i]:\n L1.append((1,L[i]))\n mx = L[i]\n else:\n L1.append((0,L[i]))\n\nR1 = []\nmx = 0\nfor i in range(n-1,-1,-1):\n if mx < R[i]:\n R1.append((1,R[i]))\n mx = R[i]\n else:\n R1.append((0,R[i]))\nR1.reverse()\nans = 1\nfor i in range(n):\n if L1[i][0] == 1:\n if R1[i][0] == 1:\n if L1[i][1] != R1[i][1]:\n ans = 0\n break\n else:\n if L1[i][1] > R1[i][1]:\n ans = 0\n break\n elif R1[i][0] == 1:\n if R1[i][1] > L1[i][1]:\n ans = 0\n break\n else:\n ans *= min(L1[i][1],R1[i][1])\n ans %= mod\n\nprint(ans)",
"\"\"\"\n左右一列に並んでいる山を、左右から見ていった時に今まで見た中の最大値が分かる。\nこの状態で、山の高さの列が何通りあるか求めよ。\n\n単純に、山の高さの\"幅\"を求めて、その分だけかけ合わせれば良さそう。\n\n辻褄が合わないのは\n1.高さが確定している場所同士で、辻褄が合わない\n2.片方の高さが確定している場所で、もう片方の値がそれより小さい\nこのとき0\n\"\"\"",
"import sys",
"sys",
"readline = sys.stdin.buffer.readline",
"readline",
"sys.stdin.buffer.readline",
"sys.stdin.buffer",
"sys.stdin",
"sys",
"stdin",
"buffer",
"readline",
"def even(n): return 1 if n%2==0 else 0",
"even",
"n",
"n",
"n = int(readline())",
"n",
"int(readline())",
"int",
"readline()",
"readline",
"L = list(map(int,readline().split()))",
"L",
"list(map(int,readline().split()))",
"list",
"map(int,readline().split())",
"map",
"int",
"readline().split()",
"().split",
"()",
"readline",
"split",
"R = list(map(int,readline().split()))",
"R",
"list(map(int,readline().split()))",
"list",
"map(int,readline().split())",
"map",
"int",
"readline().split()",
"().split",
"()",
"readline",
"split",
"mod = 10**9 + 7",
"mod",
"10**9 + 7",
"10**9",
"10",
"9",
"7",
"mx = 0",
"mx",
"0",
"L1 = []",
"L1",
"[]",
"for i in range(n):\n if mx < L[i]:\n L1.append((1,L[i]))\n mx = L[i]\n else:\n L1.append((0,L[i]))",
"i",
"range(n)",
"range",
"n",
"if mx < L[i]:\n L1.append((1,L[i]))\n mx = L[i]\n else:\n L1.append((0,L[i]))",
"mx < L[i]",
"mx",
"L[i]",
"L",
"i",
"L1.append((1,L[i]))",
"L1.append",
"L1",
"append",
"(1,L[i])",
"1",
"L[i]",
"L",
"i",
"mx = L[i]",
"mx",
"L[i]",
"L",
"i",
"L1.append((0,L[i]))",
"L1.append",
"L1",
"append",
"(0,L[i])",
"0",
"L[i]",
"L",
"i",
"R1 = []",
"R1",
"[]",
"mx = 0",
"mx",
"0",
"for i in range(n-1,-1,-1):\n if mx < R[i]:\n R1.append((1,R[i]))\n mx = R[i]\n else:\n R1.append((0,R[i]))",
"i",
"range(n-1,-1,-1)",
"range",
"n-1",
"n",
"1",
"-1",
"-1",
"if mx < R[i]:\n R1.append((1,R[i]))\n mx = R[i]\n else:\n R1.append((0,R[i]))",
"mx < R[i]",
"mx",
"R[i]",
"R",
"i",
"R1.append((1,R[i]))",
"R1.append",
"R1",
"append",
"(1,R[i])",
"1",
"R[i]",
"R",
"i",
"mx = R[i]",
"mx",
"R[i]",
"R",
"i",
"R1.append((0,R[i]))",
"R1.append",
"R1",
"append",
"(0,R[i])",
"0",
"R[i]",
"R",
"i",
"R1.reverse()",
"R1.reverse",
"R1",
"reverse",
"ans = 1",
"ans",
"1",
"for i in range(n):\n if L1[i][0] == 1:\n if R1[i][0] == 1:\n if L1[i][1] != R1[i][1]:\n ans = 0\n break\n else:\n if L1[i][1] > R1[i][1]:\n ans = 0\n break\n elif R1[i][0] == 1:\n if R1[i][1] > L1[i][1]:\n ans = 0\n break\n else:\n ans *= min(L1[i][1],R1[i][1])\n ans %= mod",
"i",
"range(n)",
"range",
"n",
"if L1[i][0] == 1:\n if R1[i][0] == 1:\n if L1[i][1] != R1[i][1]:\n ans = 0\n break\n else:\n if L1[i][1] > R1[i][1]:\n ans = 0\n break\n elif R1[i][0] == 1:\n if R1[i][1] > L1[i][1]:\n ans = 0\n break\n else:\n ans *= min(L1[i][1],R1[i][1])\n ans %= mod",
"L1[i][0] == 1",
"L1[i][0]",
"[i]",
"L1",
"i",
"0",
"1",
"if R1[i][0] == 1:\n if L1[i][1] != R1[i][1]:\n ans = 0\n break\n else:\n if L1[i][1] > R1[i][1]:\n ans = 0\n break\n ",
"R1[i][0] == 1",
"R1[i][0]",
"[i]",
"R1",
"i",
"0",
"1",
"if L1[i][1] != R1[i][1]:\n ans = 0\n break\n ",
"L1[i][1] != R1[i][1]",
"L1[i][1]",
"[i]",
"L1",
"i",
"1",
"R1[i][1]",
"[i]",
"R1",
"i",
"1",
"ans = 0",
"ans",
"0",
"break",
"if L1[i][1] > R1[i][1]:\n ans = 0\n break\n ",
"L1[i][1] > R1[i][1]",
"L1[i][1]",
"[i]",
"L1",
"i",
"1",
"R1[i][1]",
"[i]",
"R1",
"i",
"1",
"ans = 0",
"ans",
"0",
"break",
"elif R1[i][0] == 1:\n if R1[i][1] > L1[i][1]:\n ans = 0\n break\n ",
"R1[i][0] == 1",
"R1[i][0]",
"[i]",
"R1",
"i",
"0",
"1",
"if R1[i][1] > L1[i][1]:\n ans = 0\n break\n ",
"R1[i][1] > L1[i][1]",
"R1[i][1]",
"[i]",
"R1",
"i",
"1",
"L1[i][1]",
"[i]",
"L1",
"i",
"1",
"ans = 0",
"ans",
"0",
"break",
"ans *= min(L1[i][1],R1[i][1])",
"ans",
"min(L1[i][1],R1[i][1])",
"min",
"L1[i][1]",
"[i]",
"L1",
"i",
"1",
"R1[i][1]",
"[i]",
"R1",
"i",
"1",
"ans %= mod",
"ans",
"mod",
"print(ans)",
"print",
"ans",
"ans = 0",
"0",
"ans",
"L1 = []",
"[]",
"L1",
"n = int(readline())",
"int(readline())",
"n",
"L = list(map(int,readline().split()))",
"list(map(int,readline().split()))",
"L",
"mx = 0",
"0",
"mx",
"ans *= min(L1[i][1],R1[i][1])",
"min(L1[i][1],R1[i][1])",
"ans",
"ans %= mod",
"mod",
"ans",
"ans = 0",
"0",
"ans",
"mod = 10**9 + 7",
"10**9 + 7",
"mod",
"mx = L[i]",
"L[i]",
"mx",
"ans = 1",
"1",
"ans",
"R = list(map(int,readline().split()))",
"list(map(int,readline().split()))",
"R",
"readline = sys.stdin.buffer.readline",
"sys.stdin.buffer.readline",
"readline",
"mx = 0",
"0",
"mx",
"mx = R[i]",
"R[i]",
"mx",
"def even(n): return 1 if n%2==0 else 0",
"def even(n): return 1 if n%2==0 else 0",
"even",
"ans = 0",
"0",
"ans",
"R1 = []",
"[]",
"R1"
] |
#CODE FESTIVAL 2016 qual C-C 二人のアルピニスト
"""
左右一列に並んでいる山を、左右から見ていった時に今まで見た中の最大値が分かる。
この状態で、山の高さの列が何通りあるか求めよ。
単純に、山の高さの"幅"を求めて、その分だけかけ合わせれば良さそう。
辻褄が合わないのは
1.高さが確定している場所同士で、辻褄が合わない
2.片方の高さが確定している場所で、もう片方の値がそれより小さい
このとき0
"""
import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0
n = int(readline())
L = list(map(int,readline().split()))
R = list(map(int,readline().split()))
mod = 10**9 + 7
mx = 0
L1 = []
for i in range(n):
if mx < L[i]:
L1.append((1,L[i]))
mx = L[i]
else:
L1.append((0,L[i]))
R1 = []
mx = 0
for i in range(n-1,-1,-1):
if mx < R[i]:
R1.append((1,R[i]))
mx = R[i]
else:
R1.append((0,R[i]))
R1.reverse()
ans = 1
for i in range(n):
if L1[i][0] == 1:
if R1[i][0] == 1:
if L1[i][1] != R1[i][1]:
ans = 0
break
else:
if L1[i][1] > R1[i][1]:
ans = 0
break
elif R1[i][0] == 1:
if R1[i][1] > L1[i][1]:
ans = 0
break
else:
ans *= min(L1[i][1],R1[i][1])
ans %= mod
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
0,
13,
13,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
0,
13,
13,
0,
13,
2,
2,
17,
17,
17,
12,
13,
14,
40,
18,
13,
17,
18,
13,
17,
29,
17,
28,
13,
4,
13,
13,
14,
2,
18,
13,
13,
18,
13,
17,
3,
28,
13,
4,
13,
2,
13,
17,
17,
17,
14,
2,
18,
13,
13,
18,
13,
17,
3,
14,
2,
13,
13,
29,
17,
0,
13,
2,
39,
17,
13,
0,
18,
13,
17,
17,
0,
18,
13,
17,
17,
28,
13,
4,
13,
17,
13,
14,
40,
18,
13,
13,
18,
13,
2,
13,
17,
0,
18,
13,
13,
17,
14,
40,
18,
13,
2,
2,
13,
17,
13,
18,
13,
2,
13,
13,
0,
18,
13,
2,
2,
13,
17,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
14,
18,
13,
13,
0,
13,
2,
2,
13,
4,
13,
18,
13,
13,
18,
13,
13,
13,
29,
13,
4,
13,
4,
13,
10,
13,
13,
10,
2,
13,
10,
12,
13,
10,
4,
13,
10,
13,
13
] |
[
[
196,
2
],
[
10,
9
],
[
9,
18
],
[
199,
20
],
[
25,
24
],
[
24,
33
],
[
187,
35
],
[
190,
38
],
[
200,
49
],
[
188,
52
],
[
58,
57
],
[
197,
60
],
[
200,
64
],
[
57,
65
],
[
200,
67
],
[
72,
71
],
[
197,
75
],
[
188,
82
],
[
71,
83
],
[
188,
85
],
[
96,
95
],
[
197,
99
],
[
109,
101
],
[
95,
102
],
[
109,
106
],
[
95,
107
],
[
112,
111
],
[
197,
115
],
[
200,
119
],
[
111,
120
],
[
200,
122
],
[
111,
124
],
[
130,
127
],
[
95,
128
],
[
111,
129
],
[
188,
134
],
[
197,
137
],
[
111,
139
],
[
188,
141
],
[
197,
143
],
[
111,
144
],
[
153,
146
],
[
95,
147
],
[
197,
150
],
[
111,
152
],
[
156,
155
],
[
159,
158
],
[
197,
161
],
[
95,
164
],
[
158,
165
],
[
168,
167
],
[
155,
170
],
[
167,
170
],
[
200,
174
],
[
158,
175
],
[
188,
177
],
[
158,
178
],
[
191,
179
],
[
167,
181
],
[
155,
181
],
[
194,
185
],
[
187,
188
],
[
190,
191
],
[
196,
197
],
[
199,
200
]
] |
[
"N = int(input())\nT = [int(i) for i in input().split()]\nA = [int(i) for i in input().split()]\nmod = 10 ** 9 + 7\n\ndef solve() :\n if T[-1] != A[0] :\n return 0\n \n for i in range(N) :\n if T[i] == T[-1] :\n break\n for j in range(N - 1, -1, -1) :\n if A[j] == A[0] :\n break\n \n if i > j :\n return 0\n \n ok = [False] * N\n ok[0] = ok[-1] = True\n for i in range(1, N) :\n if T[i] != T[i-1] :\n ok[i] = True\n if A[N-1-i] != A[N-i] :\n ok[N-1-i] = True\n\n ret = 1\n for i in range(N) :\n if ok[i] : continue\n ret = ret * min(T[i], A[i]) % mod \n \n return ret\n \nprint(solve())",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"int(i) for i in input().split()",
"for i in input().split()",
"i",
"input().split()",
"().split",
"()",
"input",
"split",
"for i in input().split()",
"int(i)",
"int",
"i",
"T = [int(i) for i in input().split()]",
"T",
"[int(i) for i in input().split()]",
"int(i) for i in input().split()",
"for i in input().split()",
"i",
"input().split()",
"().split",
"()",
"input",
"split",
"for i in input().split()",
"int(i)",
"int",
"i",
"A = [int(i) for i in input().split()]",
"A",
"[int(i) for i in input().split()]",
"mod = 10 ** 9 + 7",
"mod",
"10 ** 9 + 7",
"10 ** 9",
"10",
"9",
"7",
"def solve() :\n if T[-1] != A[0] :\n return 0\n \n for i in range(N) :\n if T[i] == T[-1] :\n break\n for j in range(N - 1, -1, -1) :\n if A[j] == A[0] :\n break\n \n if i > j :\n return 0\n \n ok = [False] * N\n ok[0] = ok[-1] = True\n for i in range(1, N) :\n if T[i] != T[i-1] :\n ok[i] = True\n if A[N-1-i] != A[N-i] :\n ok[N-1-i] = True\n\n ret = 1\n for i in range(N) :\n if ok[i] : continue\n ret = ret * min(T[i], A[i]) % mod \n \n return ret\n ",
"solve",
"if T[-1] != A[0] :\n return 0\n \n ",
"T[-1] != A[0]",
"T[-1]",
"T",
"-1",
"A[0]",
"A",
"0",
"return 0",
"0",
"for i in range(N) :\n if T[i] == T[-1] :\n break\n ",
"i",
"range(N)",
"range",
"N",
"if T[i] == T[-1] :\n break\n ",
"T[i] == T[-1]",
"T[i]",
"T",
"i",
"T[-1]",
"T",
"-1",
"break",
"for j in range(N - 1, -1, -1) :\n if A[j] == A[0] :\n break\n \n ",
"j",
"range(N - 1, -1, -1)",
"range",
"N - 1",
"N",
"1",
"-1",
"-1",
"if A[j] == A[0] :\n break\n \n ",
"A[j] == A[0]",
"A[j]",
"A",
"j",
"A[0]",
"A",
"0",
"break",
"if i > j :\n return 0\n \n ",
"i > j",
"i",
"j",
"return 0",
"0",
"ok = [False] * N",
"ok",
"[False] * N",
"[False]",
"False",
"N",
"ok[0] = ok[-1] = True",
"ok[0]",
"ok",
"0",
"True",
"= ok[-1] = True",
"ok[-1]",
"ok",
"-1",
"True",
"for i in range(1, N) :\n if T[i] != T[i-1] :\n ok[i] = True\n if A[N-1-i] != A[N-i] :\n ok[N-1-i] = True\n\n ",
"i",
"range(1, N)",
"range",
"1",
"N",
"if T[i] != T[i-1] :\n ok[i] = True\n ",
"T[i] != T[i-1]",
"T[i]",
"T",
"i",
"T[i-1]",
"T",
"i-1",
"i",
"1",
"ok[i] = True",
"ok[i]",
"ok",
"i",
"True",
"if A[N-1-i] != A[N-i] :\n ok[N-1-i] = True\n\n ",
"A[N-1-i] != A[N-i]",
"A[N-1-i]",
"A",
"N-1-i",
"N-1",
"N",
"1",
"i",
"A[N-i]",
"A",
"N-i",
"N",
"i",
"ok[N-1-i] = True",
"ok[N-1-i]",
"ok",
"N-1-i",
"N-1",
"N",
"1",
"i",
"True",
"ret = 1",
"ret",
"1",
"for i in range(N) :\n if ok[i] : continue\n ret = ret * min(T[i], A[i]) % mod \n \n ",
"i",
"range(N)",
"range",
"N",
"if ok[i] : continue\n ",
"ok[i]",
"ok",
"i",
"ret = ret * min(T[i], A[i]) % mod",
"ret",
"ret * min(T[i], A[i]) % mod",
"ret * min(T[i], A[i])",
"ret",
"min(T[i], A[i])",
"min",
"T[i]",
"T",
"i",
"A[i]",
"A",
"i",
"mod",
"return ret",
"ret",
"print(solve())",
"print",
"solve()",
"solve",
"A = [int(i) for i in input().split()]",
"[int(i) for i in input().split()]",
"A",
"mod = 10 ** 9 + 7",
"10 ** 9 + 7",
"mod",
"def solve() :\n if T[-1] != A[0] :\n return 0\n \n for i in range(N) :\n if T[i] == T[-1] :\n break\n for j in range(N - 1, -1, -1) :\n if A[j] == A[0] :\n break\n \n if i > j :\n return 0\n \n ok = [False] * N\n ok[0] = ok[-1] = True\n for i in range(1, N) :\n if T[i] != T[i-1] :\n ok[i] = True\n if A[N-1-i] != A[N-i] :\n ok[N-1-i] = True\n\n ret = 1\n for i in range(N) :\n if ok[i] : continue\n ret = ret * min(T[i], A[i]) % mod \n \n return ret\n ",
"def solve() :\n if T[-1] != A[0] :\n return 0\n \n for i in range(N) :\n if T[i] == T[-1] :\n break\n for j in range(N - 1, -1, -1) :\n if A[j] == A[0] :\n break\n \n if i > j :\n return 0\n \n ok = [False] * N\n ok[0] = ok[-1] = True\n for i in range(1, N) :\n if T[i] != T[i-1] :\n ok[i] = True\n if A[N-1-i] != A[N-i] :\n ok[N-1-i] = True\n\n ret = 1\n for i in range(N) :\n if ok[i] : continue\n ret = ret * min(T[i], A[i]) % mod \n \n return ret\n ",
"solve",
"N = int(input())",
"int(input())",
"N",
"T = [int(i) for i in input().split()]",
"[int(i) for i in input().split()]",
"T"
] |
N = int(input())
T = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
mod = 10 ** 9 + 7
def solve() :
if T[-1] != A[0] :
return 0
for i in range(N) :
if T[i] == T[-1] :
break
for j in range(N - 1, -1, -1) :
if A[j] == A[0] :
break
if i > j :
return 0
ok = [False] * N
ok[0] = ok[-1] = True
for i in range(1, N) :
if T[i] != T[i-1] :
ok[i] = True
if A[N-1-i] != A[N-i] :
ok[N-1-i] = True
ret = 1
for i in range(N) :
if ok[i] : continue
ret = ret * min(T[i], A[i]) % mod
return ret
print(solve())
|
[
7,
0,
13,
17,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
41,
28,
13,
4,
13,
13,
4,
17,
0,
13,
13,
41,
28,
13,
4,
13,
13,
4,
17,
0,
13,
13,
41,
28,
13,
4,
13,
13,
4,
17,
0,
13,
13,
41,
28,
13,
4,
13,
13,
4,
17,
0,
13,
13,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
13,
14,
2,
13,
18,
13,
13,
0,
18,
13,
13,
18,
13,
13,
0,
18,
13,
13,
18,
13,
13,
0,
13,
18,
13,
13,
14,
2,
13,
18,
13,
13,
0,
18,
13,
13,
17,
0,
18,
13,
13,
13,
4,
13,
17,
3,
14,
2,
13,
18,
13,
40,
13,
0,
18,
13,
40,
13,
18,
13,
40,
13,
0,
18,
13,
40,
13,
18,
13,
40,
13,
0,
13,
18,
13,
40,
13,
14,
2,
13,
18,
13,
40,
13,
0,
18,
13,
40,
13,
17,
0,
18,
13,
40,
13,
13,
4,
13,
17,
3,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
4,
13,
2,
2,
4,
13,
18,
13,
13,
18,
13,
13,
4,
13,
18,
13,
13,
18,
13,
13,
17,
17,
0,
13,
13,
4,
13,
13,
10,
13,
13,
10,
13,
13,
10,
13,
13,
10,
17,
13,
10,
17,
13,
10,
4,
13,
10,
18,
13,
10,
17,
13,
10,
4,
13,
10,
4,
13,
10,
18,
13,
10,
17,
13,
10,
4,
13,
10,
13,
13,
10,
13,
13
] |
[
[
260,
2
],
[
251,
5
],
[
254,
11
],
[
263,
23
],
[
37,
36
],
[
252,
39
],
[
266,
43
],
[
48,
47
],
[
252,
50
],
[
230,
54
],
[
59,
58
],
[
252,
61
],
[
227,
65
],
[
70,
69
],
[
252,
72
],
[
233,
76
],
[
236,
79
],
[
248,
82
],
[
86,
85
],
[
252,
88
],
[
237,
91
],
[
246,
91
],
[
255,
93
],
[
85,
94
],
[
99,
96
],
[
267,
97
],
[
85,
98
],
[
255,
100
],
[
85,
101
],
[
106,
103
],
[
231,
104
],
[
85,
105
],
[
255,
107
],
[
85,
108
],
[
245,
110
],
[
255,
112
],
[
85,
113
],
[
237,
116
],
[
246,
116
],
[
255,
118
],
[
85,
119
],
[
124,
121
],
[
267,
122
],
[
85,
123
],
[
129,
126
],
[
231,
127
],
[
85,
128
],
[
237,
129
],
[
246,
129
],
[
249,
136
],
[
258,
136
],
[
264,
138
],
[
85,
140
],
[
146,
142
],
[
228,
143
],
[
85,
145
],
[
264,
147
],
[
85,
149
],
[
155,
151
],
[
234,
152
],
[
85,
154
],
[
264,
156
],
[
85,
158
],
[
257,
160
],
[
264,
162
],
[
85,
164
],
[
249,
167
],
[
258,
167
],
[
264,
169
],
[
85,
171
],
[
177,
173
],
[
228,
174
],
[
85,
176
],
[
183,
179
],
[
234,
180
],
[
85,
182
],
[
249,
183
],
[
258,
183
],
[
239,
189
],
[
193,
192
],
[
252,
195
],
[
242,
197
],
[
126,
204
],
[
103,
204
],
[
231,
205
],
[
192,
206
],
[
234,
208
],
[
192,
209
],
[
121,
212
],
[
96,
212
],
[
267,
213
],
[
192,
214
],
[
228,
216
],
[
192,
217
],
[
269,
221
],
[
261,
222
],
[
270,
225
],
[
243,
225
],
[
240,
225
],
[
227,
228
],
[
230,
231
],
[
233,
234
],
[
236,
237
],
[
239,
240
],
[
242,
243
],
[
245,
246
],
[
248,
249
],
[
251,
252
],
[
254,
255
],
[
257,
258
],
[
260,
261
],
[
263,
264
],
[
266,
267
],
[
261,
269
],
[
269,
270
]
] |
[
"MOD = 1000000007\n\nN = int(input())\nT = list(map(int, input().split()))\nA = list(map(int, input().split()))\n\nL1 = [0 for _ in range(N)]\nR1 = [0 for _ in range(N)]\nL2 = [0 for _ in range(N)]\nR2 = [0 for _ in range(N)]\n\ntmp1 = 1\ntmp2 = 1\n\nfor i in range(N):\n if tmp1 < T[i]:\n L1[i] = T[i]\n R1[i] = T[i]\n tmp1 = T[i]\n elif tmp1 == T[i]:\n L1[i] = 1\n R1[i] = tmp1\n else:\n print(0)\n break\n if tmp2 < A[~i]:\n L2[~i] = A[~i]\n R2[~i] = A[~i]\n tmp2 = A[~i]\n elif tmp2 == A[~i]:\n L2[~i] = 1\n R2[~i] = tmp2\n else:\n print(0)\n break\nelse:\n res = 1\n for i in range(N):\n res *= max(min(R1[i], R2[i]) - max(L1[i], L2[i]) + 1, 0)\n res %= MOD\n print(res)",
"MOD = 1000000007",
"MOD",
"1000000007",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"T = list(map(int, input().split()))",
"T",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"A = list(map(int, input().split()))",
"A",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"0 for _ in range(N)",
"for _ in range(N)",
"_",
"range(N)",
"range",
"N",
"for _ in range(N)",
"0",
"L1 = [0 for _ in range(N)]",
"L1",
"[0 for _ in range(N)]",
"0 for _ in range(N)",
"for _ in range(N)",
"_",
"range(N)",
"range",
"N",
"for _ in range(N)",
"0",
"R1 = [0 for _ in range(N)]",
"R1",
"[0 for _ in range(N)]",
"0 for _ in range(N)",
"for _ in range(N)",
"_",
"range(N)",
"range",
"N",
"for _ in range(N)",
"0",
"L2 = [0 for _ in range(N)]",
"L2",
"[0 for _ in range(N)]",
"0 for _ in range(N)",
"for _ in range(N)",
"_",
"range(N)",
"range",
"N",
"for _ in range(N)",
"0",
"R2 = [0 for _ in range(N)]",
"R2",
"[0 for _ in range(N)]",
"tmp1 = 1",
"tmp1",
"1",
"tmp2 = 1",
"tmp2",
"1",
"for i in range(N):\n if tmp1 < T[i]:\n L1[i] = T[i]\n R1[i] = T[i]\n tmp1 = T[i]\n elif tmp1 == T[i]:\n L1[i] = 1\n R1[i] = tmp1\n else:\n print(0)\n break\n if tmp2 < A[~i]:\n L2[~i] = A[~i]\n R2[~i] = A[~i]\n tmp2 = A[~i]\n elif tmp2 == A[~i]:\n L2[~i] = 1\n R2[~i] = tmp2\n else:\n print(0)\n break\nelse:\n res = 1\n for i in range(N):\n res *= max(min(R1[i], R2[i]) - max(L1[i], L2[i]) + 1, 0)\n res %= MOD\n print(res)",
"i",
"range(N)",
"range",
"N",
"if tmp1 < T[i]:\n L1[i] = T[i]\n R1[i] = T[i]\n tmp1 = T[i]\n elif tmp1 == T[i]:\n L1[i] = 1\n R1[i] = tmp1\n else:\n print(0)\n break\n ",
"tmp1 < T[i]",
"tmp1",
"T[i]",
"T",
"i",
"L1[i] = T[i]",
"L1[i]",
"L1",
"i",
"T[i]",
"T",
"i",
"R1[i] = T[i]",
"R1[i]",
"R1",
"i",
"T[i]",
"T",
"i",
"tmp1 = T[i]",
"tmp1",
"T[i]",
"T",
"i",
"elif tmp1 == T[i]:\n L1[i] = 1\n R1[i] = tmp1\n ",
"tmp1 == T[i]",
"tmp1",
"T[i]",
"T",
"i",
"L1[i] = 1",
"L1[i]",
"L1",
"i",
"1",
"R1[i] = tmp1",
"R1[i]",
"R1",
"i",
"tmp1",
"print(0)",
"print",
"0",
"break",
"if tmp2 < A[~i]:\n L2[~i] = A[~i]\n R2[~i] = A[~i]\n tmp2 = A[~i]\n elif tmp2 == A[~i]:\n L2[~i] = 1\n R2[~i] = tmp2\n else:\n print(0)\n break",
"tmp2 < A[~i]",
"tmp2",
"A[~i]",
"A",
"~i",
"i",
"L2[~i] = A[~i]",
"L2[~i]",
"L2",
"~i",
"i",
"A[~i]",
"A",
"~i",
"i",
"R2[~i] = A[~i]",
"R2[~i]",
"R2",
"~i",
"i",
"A[~i]",
"A",
"~i",
"i",
"tmp2 = A[~i]",
"tmp2",
"A[~i]",
"A",
"~i",
"i",
"elif tmp2 == A[~i]:\n L2[~i] = 1\n R2[~i] = tmp2\n ",
"tmp2 == A[~i]",
"tmp2",
"A[~i]",
"A",
"~i",
"i",
"L2[~i] = 1",
"L2[~i]",
"L2",
"~i",
"i",
"1",
"R2[~i] = tmp2",
"R2[~i]",
"R2",
"~i",
"i",
"tmp2",
"print(0)",
"print",
"0",
"break",
"res = 1",
"res",
"1",
"for i in range(N):\n res *= max(min(R1[i], R2[i]) - max(L1[i], L2[i]) + 1, 0)\n res %= MOD\n ",
"i",
"range(N)",
"range",
"N",
"res *= max(min(R1[i], R2[i]) - max(L1[i], L2[i]) + 1, 0)",
"res",
"max(min(R1[i], R2[i]) - max(L1[i], L2[i]) + 1, 0)",
"max",
"min(R1[i], R2[i]) - max(L1[i], L2[i]) + 1",
"min(R1[i], R2[i]) - max(L1[i], L2[i])",
"min(R1[i], R2[i])",
"min",
"R1[i]",
"R1",
"i",
"R2[i]",
"R2",
"i",
"max(L1[i], L2[i])",
"max",
"L1[i]",
"L1",
"i",
"L2[i]",
"L2",
"i",
"1",
"0",
"res %= MOD",
"res",
"MOD",
"print(res)",
"print",
"res",
"L2 = [0 for _ in range(N)]",
"[0 for _ in range(N)]",
"L2",
"R1 = [0 for _ in range(N)]",
"[0 for _ in range(N)]",
"R1",
"R2 = [0 for _ in range(N)]",
"[0 for _ in range(N)]",
"R2",
"tmp1 = 1",
"1",
"tmp1",
"res = 1",
"1",
"res",
"res *= max(min(R1[i], R2[i]) - max(L1[i], L2[i]) + 1, 0)",
"max(min(R1[i], R2[i]) - max(L1[i], L2[i]) + 1, 0)",
"res",
"tmp1 = T[i]",
"T[i]",
"tmp1",
"tmp2 = 1",
"1",
"tmp2",
"N = int(input())",
"int(input())",
"N",
"T = list(map(int, input().split()))",
"list(map(int, input().split()))",
"T",
"tmp2 = A[~i]",
"A[~i]",
"tmp2",
"MOD = 1000000007",
"1000000007",
"MOD",
"A = list(map(int, input().split()))",
"list(map(int, input().split()))",
"A",
"L1 = [0 for _ in range(N)]",
"[0 for _ in range(N)]",
"L1",
"res %= MOD",
"MOD",
"res"
] |
MOD = 1000000007
N = int(input())
T = list(map(int, input().split()))
A = list(map(int, input().split()))
L1 = [0 for _ in range(N)]
R1 = [0 for _ in range(N)]
L2 = [0 for _ in range(N)]
R2 = [0 for _ in range(N)]
tmp1 = 1
tmp2 = 1
for i in range(N):
if tmp1 < T[i]:
L1[i] = T[i]
R1[i] = T[i]
tmp1 = T[i]
elif tmp1 == T[i]:
L1[i] = 1
R1[i] = tmp1
else:
print(0)
break
if tmp2 < A[~i]:
L2[~i] = A[~i]
R2[~i] = A[~i]
tmp2 = A[~i]
elif tmp2 == A[~i]:
L2[~i] = 1
R2[~i] = tmp2
else:
print(0)
break
else:
res = 1
for i in range(N):
res *= max(min(R1[i], R2[i]) - max(L1[i], L2[i]) + 1, 0)
res %= MOD
print(res)
|
[
7,
15,
13,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
0,
13,
13,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
0,
13,
13,
14,
40,
18,
13,
2,
13,
17,
18,
13,
17,
4,
13,
17,
4,
18,
13,
13,
0,
13,
39,
28,
13,
4,
13,
13,
0,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
13,
17,
14,
2,
13,
17,
0,
13,
18,
13,
13,
14,
2,
13,
2,
13,
17,
0,
13,
18,
13,
13,
14,
40,
18,
13,
13,
18,
13,
2,
13,
17,
14,
2,
18,
13,
2,
13,
17,
18,
13,
2,
13,
17,
4,
13,
17,
4,
13,
14,
2,
13,
18,
13,
13,
0,
13,
18,
13,
13,
14,
40,
18,
13,
13,
18,
13,
2,
13,
17,
14,
2,
18,
13,
13,
18,
13,
13,
4,
13,
17,
4,
13,
14,
2,
13,
18,
13,
13,
0,
13,
18,
13,
13,
4,
18,
13,
13,
39,
13,
4,
13,
13,
13,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
2,
2,
13,
2,
2,
18,
18,
13,
13,
17,
18,
18,
13,
13,
17,
17,
2,
2,
17,
17,
17,
4,
13,
13,
10,
4,
13,
10,
13,
13,
10,
2,
13,
10,
17,
13,
10,
17,
13,
10,
39,
13,
10,
18,
13,
10,
18,
13,
10,
18,
13,
10,
4,
13,
10,
13,
13,
10,
18,
13
] |
[
[
241,
4
],
[
12,
11
],
[
11,
20
],
[
217,
22
],
[
27,
26
],
[
26,
35
],
[
244,
37
],
[
218,
42
],
[
242,
44
],
[
245,
47
],
[
229,
57
],
[
61,
60
],
[
242,
63
],
[
214,
65
],
[
218,
69
],
[
60,
70
],
[
245,
72
],
[
60,
73
],
[
223,
75
],
[
60,
79
],
[
232,
82
],
[
218,
84
],
[
60,
85
],
[
60,
88
],
[
242,
90
],
[
238,
93
],
[
245,
95
],
[
60,
96
],
[
218,
100
],
[
60,
101
],
[
218,
103
],
[
60,
105
],
[
218,
110
],
[
60,
112
],
[
245,
115
],
[
60,
117
],
[
215,
126
],
[
218,
128
],
[
60,
129
],
[
235,
131
],
[
218,
133
],
[
60,
134
],
[
245,
138
],
[
60,
139
],
[
245,
141
],
[
60,
143
],
[
245,
148
],
[
60,
149
],
[
218,
151
],
[
60,
152
],
[
215,
160
],
[
245,
162
],
[
60,
163
],
[
247,
165
],
[
245,
167
],
[
60,
168
],
[
230,
171
],
[
215,
177
],
[
248,
178
],
[
236,
178
],
[
239,
178
],
[
233,
178
],
[
224,
178
],
[
226,
180
],
[
184,
183
],
[
242,
186
],
[
220,
188
],
[
227,
191
],
[
221,
191
],
[
230,
196
],
[
183,
197
],
[
230,
201
],
[
183,
202
],
[
221,
212
],
[
227,
212
],
[
214,
215
],
[
217,
218
],
[
220,
221
],
[
223,
224
],
[
226,
227
],
[
229,
230
],
[
232,
233
],
[
235,
236
],
[
238,
239
],
[
241,
242
],
[
244,
245
],
[
247,
248
]
] |
[
"import sys\n\nn = int(input())\nt = [int(x) for x in input().split()]\na = [int(x) for x in input().split()]\nif t[n-1]!=a[0]:\n print(0)\n sys.exit()\n\nm =[]\nfor i in range(n):\n mx = min(t[i],a[i])\n mn = 1\n if i == 0:\n mn = t[i]\n elif i == n-1:\n mn = a[i]\n else :\n if t[i]!=t[i-1] :\n if t[i-1] > a[i-1]:\n print(0)\n exit()\n if mx == t[i]:\n mn=t[i]\n if a[i]!=a[i+1] :\n if a[i] > t[i]:\n print(0)\n exit()\n if mx == a[i]:\n mn=a[i]\n m.append([mx,min(mx,mn)])\nans = 1\nfor i in range(n):\n ans = (ans * (m[i][0]-m[i][1]+1))%(10**9+7)\nprint(ans)",
"import sys",
"sys",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"int(x) for x in input().split()",
"for x in input().split()",
"x",
"input().split()",
"().split",
"()",
"input",
"split",
"for x in input().split()",
"int(x)",
"int",
"x",
"t = [int(x) for x in input().split()]",
"t",
"[int(x) for x in input().split()]",
"int(x) for x in input().split()",
"for x in input().split()",
"x",
"input().split()",
"().split",
"()",
"input",
"split",
"for x in input().split()",
"int(x)",
"int",
"x",
"a = [int(x) for x in input().split()]",
"a",
"[int(x) for x in input().split()]",
"if t[n-1]!=a[0]:\n print(0)\n sys.exit()",
"t[n-1]!=a[0]",
"t[n-1]",
"t",
"n-1",
"n",
"1",
"a[0]",
"a",
"0",
"print(0)",
"print",
"0",
"sys.exit()",
"sys.exit",
"sys",
"exit",
"m =[]",
"m",
"[]",
"for i in range(n):\n mx = min(t[i],a[i])\n mn = 1\n if i == 0:\n mn = t[i]\n elif i == n-1:\n mn = a[i]\n else :\n if t[i]!=t[i-1] :\n if t[i-1] > a[i-1]:\n print(0)\n exit()\n if mx == t[i]:\n mn=t[i]\n if a[i]!=a[i+1] :\n if a[i] > t[i]:\n print(0)\n exit()\n if mx == a[i]:\n mn=a[i]\n m.append([mx,min(mx,mn)])",
"i",
"range(n)",
"range",
"n",
"mx = min(t[i],a[i])",
"mx",
"min(t[i],a[i])",
"min",
"t[i]",
"t",
"i",
"a[i]",
"a",
"i",
"mn = 1",
"mn",
"1",
"if i == 0:\n mn = t[i]\n elif i == n-1:\n mn = a[i]\n else :\n if t[i]!=t[i-1] :\n if t[i-1] > a[i-1]:\n print(0)\n exit()\n if mx == t[i]:\n mn=t[i]\n if a[i]!=a[i+1] :\n if a[i] > t[i]:\n print(0)\n exit()\n if mx == a[i]:\n mn=a[i]\n ",
"i == 0",
"i",
"0",
"mn = t[i]",
"mn",
"t[i]",
"t",
"i",
"elif i == n-1:\n mn = a[i]\n ",
"i == n-1",
"i",
"n-1",
"n",
"1",
"mn = a[i]",
"mn",
"a[i]",
"a",
"i",
"if t[i]!=t[i-1] :\n if t[i-1] > a[i-1]:\n print(0)\n exit()\n if mx == t[i]:\n mn=t[i]\n ",
"t[i]!=t[i-1]",
"t[i]",
"t",
"i",
"t[i-1]",
"t",
"i-1",
"i",
"1",
"if t[i-1] > a[i-1]:\n print(0)\n exit()\n ",
"t[i-1] > a[i-1]",
"t[i-1]",
"t",
"i-1",
"i",
"1",
"a[i-1]",
"a",
"i-1",
"i",
"1",
"print(0)",
"print",
"0",
"exit()",
"exit",
"if mx == t[i]:\n mn=t[i]\n ",
"mx == t[i]",
"mx",
"t[i]",
"t",
"i",
"mn=t[i]",
"mn",
"t[i]",
"t",
"i",
"if a[i]!=a[i+1] :\n if a[i] > t[i]:\n print(0)\n exit()\n if mx == a[i]:\n mn=a[i]\n ",
"a[i]!=a[i+1]",
"a[i]",
"a",
"i",
"a[i+1]",
"a",
"i+1",
"i",
"1",
"if a[i] > t[i]:\n print(0)\n exit()\n ",
"a[i] > t[i]",
"a[i]",
"a",
"i",
"t[i]",
"t",
"i",
"print(0)",
"print",
"0",
"exit()",
"exit",
"if mx == a[i]:\n mn=a[i]\n ",
"mx == a[i]",
"mx",
"a[i]",
"a",
"i",
"mn=a[i]",
"mn",
"a[i]",
"a",
"i",
"m.append([mx,min(mx,mn)])",
"m.append",
"m",
"append",
"[mx,min(mx,mn)]",
"mx",
"min(mx,mn)",
"min",
"mx",
"mn",
"ans = 1",
"ans",
"1",
"for i in range(n):\n ans = (ans * (m[i][0]-m[i][1]+1))%(10**9+7)",
"i",
"range(n)",
"range",
"n",
"ans = (ans * (m[i][0]-m[i][1]+1))%(10**9+7)",
"ans",
"(ans * (m[i][0]-m[i][1]+1))%(10**9+7)",
"ans * (m[i][0]-m[i][1]+1)",
"ans",
"m[i][0]-m[i][1]+1",
"m[i][0]-m[i][1]",
"m[i][0]",
"[i]",
"m",
"i",
"0",
"m[i][1]",
"[i]",
"m",
"i",
"1",
"1",
"10**9+7",
"10**9",
"10",
"9",
"7",
"print(ans)",
"print",
"ans",
"mx = min(t[i],a[i])",
"min(t[i],a[i])",
"mx",
"t = [int(x) for x in input().split()]",
"[int(x) for x in input().split()]",
"t",
"ans = (ans * (m[i][0]-m[i][1]+1))%(10**9+7)",
"(ans * (m[i][0]-m[i][1]+1))%(10**9+7)",
"ans",
"mn = 1",
"1",
"mn",
"ans = 1",
"1",
"ans",
"m =[]",
"[]",
"m",
"mn = t[i]",
"t[i]",
"mn",
"mn=t[i]",
"t[i]",
"mn",
"mn = a[i]",
"a[i]",
"mn",
"n = int(input())",
"int(input())",
"n",
"a = [int(x) for x in input().split()]",
"[int(x) for x in input().split()]",
"a",
"mn=a[i]",
"a[i]",
"mn"
] |
import sys
n = int(input())
t = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
if t[n-1]!=a[0]:
print(0)
sys.exit()
m =[]
for i in range(n):
mx = min(t[i],a[i])
mn = 1
if i == 0:
mn = t[i]
elif i == n-1:
mn = a[i]
else :
if t[i]!=t[i-1] :
if t[i-1] > a[i-1]:
print(0)
exit()
if mx == t[i]:
mn=t[i]
if a[i]!=a[i+1] :
if a[i] > t[i]:
print(0)
exit()
if mx == a[i]:
mn=a[i]
m.append([mx,min(mx,mn)])
ans = 1
for i in range(n):
ans = (ans * (m[i][0]-m[i][1]+1))%(10**9+7)
print(ans)
|
[
7,
0,
13,
4,
13,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
17,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
17,
41,
28,
13,
4,
13,
13,
4,
17,
0,
13,
13,
41,
28,
13,
4,
13,
13,
4,
17,
0,
13,
13,
12,
13,
41,
14,
40,
18,
13,
17,
18,
13,
17,
29,
17,
0,
13,
17,
28,
13,
4,
13,
13,
14,
2,
13,
18,
13,
13,
29,
17,
14,
2,
13,
18,
13,
13,
0,
18,
13,
13,
13,
0,
18,
13,
13,
17,
0,
13,
18,
13,
13,
0,
18,
13,
13,
18,
13,
13,
0,
13,
17,
28,
13,
4,
13,
2,
13,
17,
17,
17,
14,
2,
13,
18,
13,
13,
29,
17,
14,
2,
13,
18,
13,
13,
14,
40,
18,
13,
13,
0,
18,
13,
13,
4,
13,
18,
13,
13,
13,
14,
2,
18,
13,
13,
18,
13,
13,
29,
17,
14,
2,
18,
13,
13,
40,
18,
13,
13,
18,
13,
13,
29,
17,
0,
18,
13,
13,
17,
0,
13,
18,
13,
13,
0,
13,
17,
28,
13,
4,
13,
13,
14,
40,
18,
13,
13,
0,
13,
2,
2,
13,
18,
13,
13,
2,
2,
17,
17,
17,
29,
13,
13,
4,
13,
10,
4,
13,
10,
4,
13,
10,
13,
13,
10,
4,
13,
10,
13,
13,
10,
12,
13
] |
[
[
222,
2
],
[
216,
6
],
[
213,
17
],
[
30,
29
],
[
223,
32
],
[
225,
36
],
[
41,
40
],
[
223,
43
],
[
219,
47
],
[
217,
55
],
[
214,
58
],
[
64,
63
],
[
67,
66
],
[
223,
69
],
[
63,
72
],
[
95,
72
],
[
217,
74
],
[
66,
75
],
[
63,
80
],
[
95,
80
],
[
217,
82
],
[
66,
83
],
[
88,
85
],
[
66,
87
],
[
63,
88
],
[
95,
88
],
[
93,
90
],
[
66,
92
],
[
96,
95
],
[
217,
97
],
[
66,
98
],
[
103,
100
],
[
220,
101
],
[
66,
102
],
[
217,
104
],
[
66,
105
],
[
108,
107
],
[
111,
110
],
[
223,
114
],
[
107,
120
],
[
95,
120
],
[
63,
120
],
[
177,
120
],
[
214,
122
],
[
110,
123
],
[
107,
128
],
[
95,
128
],
[
63,
128
],
[
177,
128
],
[
214,
130
],
[
110,
131
],
[
100,
134
],
[
220,
135
],
[
110,
136
],
[
141,
138
],
[
110,
140
],
[
90,
143
],
[
85,
143
],
[
172,
143
],
[
138,
143
],
[
110,
145
],
[
107,
146
],
[
95,
146
],
[
63,
146
],
[
177,
146
],
[
100,
149
],
[
220,
150
],
[
110,
151
],
[
214,
153
],
[
110,
154
],
[
100,
159
],
[
220,
160
],
[
110,
161
],
[
100,
163
],
[
220,
164
],
[
110,
165
],
[
214,
167
],
[
110,
168
],
[
175,
172
],
[
110,
174
],
[
178,
177
],
[
214,
179
],
[
110,
180
],
[
183,
182
],
[
186,
185
],
[
223,
188
],
[
100,
191
],
[
220,
192
],
[
185,
193
],
[
196,
195
],
[
182,
198
],
[
195,
198
],
[
172,
199
],
[
138,
199
],
[
90,
199
],
[
85,
199
],
[
185,
201
],
[
195,
208
],
[
182,
208
],
[
229,
211
],
[
213,
214
],
[
216,
217
],
[
219,
220
],
[
222,
223
],
[
225,
226
]
] |
[
"N = input()\nT = map(int,raw_input().split(\" \"))\nA = map(int,raw_input().split(\" \"))\n\n\n\n\nnote = [1 for i in range(N)]\nfx = [0 for i in range(N)]\n\ndef solve():\n global note\n if T[-1] != A[0]:\n return 0\n \n prev = 0\n for i in range(N):\n if prev > T[i]:\n return 0\n elif prev == T[i]:\n note[i] = prev\n else:\n note[i] = 1\n prev = T[i]\n fx[i] = T[i]\n prev = 0\n for i in range(N-1,-1,-1):\n if prev > A[i]:\n return 0\n elif prev == A[i]:\n if not fx[i]:\n note[i] = min(note[i],prev)\n else:\n if fx[i] > A[i]:\n return 0\n\n else:\n if fx[i] and fx[i] != A[i]:\n return 0\n note[i] = 1\n prev = A[i]\n\n ans = 1\n for i in range(N):\n if not fx[i]:\n ans = (ans * note[i])%(10**9+7)\n return ans\n\n\n\n \n\n\n\n\n\nprint solve()",
"N = input()",
"N",
"input()",
"input",
"T = map(int,raw_input().split(\" \"))",
"T",
"map(int,raw_input().split(\" \"))",
"map",
"int",
"raw_input().split(\" \")",
"().split",
"()",
"raw_input",
"split",
"\" \"",
"A = map(int,raw_input().split(\" \"))",
"A",
"map(int,raw_input().split(\" \"))",
"map",
"int",
"raw_input().split(\" \")",
"().split",
"()",
"raw_input",
"split",
"\" \"",
"1 for i in range(N)",
"for i in range(N)",
"i",
"range(N)",
"range",
"N",
"for i in range(N)",
"1",
"note = [1 for i in range(N)]",
"note",
"[1 for i in range(N)]",
"0 for i in range(N)",
"for i in range(N)",
"i",
"range(N)",
"range",
"N",
"for i in range(N)",
"0",
"fx = [0 for i in range(N)]",
"fx",
"[0 for i in range(N)]",
"def solve():\n global note\n if T[-1] != A[0]:\n return 0\n \n prev = 0\n for i in range(N):\n if prev > T[i]:\n return 0\n elif prev == T[i]:\n note[i] = prev\n else:\n note[i] = 1\n prev = T[i]\n fx[i] = T[i]\n prev = 0\n for i in range(N-1,-1,-1):\n if prev > A[i]:\n return 0\n elif prev == A[i]:\n if not fx[i]:\n note[i] = min(note[i],prev)\n else:\n if fx[i] > A[i]:\n return 0\n\n else:\n if fx[i] and fx[i] != A[i]:\n return 0\n note[i] = 1\n prev = A[i]\n\n ans = 1\n for i in range(N):\n if not fx[i]:\n ans = (ans * note[i])%(10**9+7)\n return ans\n\n\n\n ",
"solve",
"global note",
"if T[-1] != A[0]:\n return 0\n \n ",
"T[-1] != A[0]",
"T[-1]",
"T",
"-1",
"A[0]",
"A",
"0",
"return 0",
"0",
"prev = 0",
"prev",
"0",
"for i in range(N):\n if prev > T[i]:\n return 0\n elif prev == T[i]:\n note[i] = prev\n else:\n note[i] = 1\n prev = T[i]\n fx[i] = T[i]\n ",
"i",
"range(N)",
"range",
"N",
"if prev > T[i]:\n return 0\n elif prev == T[i]:\n note[i] = prev\n else:\n note[i] = 1\n prev = T[i]\n fx[i] = T[i]\n ",
"prev > T[i]",
"prev",
"T[i]",
"T",
"i",
"return 0",
"0",
"elif prev == T[i]:\n note[i] = prev\n ",
"prev == T[i]",
"prev",
"T[i]",
"T",
"i",
"note[i] = prev",
"note[i]",
"note",
"i",
"prev",
"note[i] = 1",
"note[i]",
"note",
"i",
"1",
"prev = T[i]",
"prev",
"T[i]",
"T",
"i",
"fx[i] = T[i]",
"fx[i]",
"fx",
"i",
"T[i]",
"T",
"i",
"prev = 0",
"prev",
"0",
"for i in range(N-1,-1,-1):\n if prev > A[i]:\n return 0\n elif prev == A[i]:\n if not fx[i]:\n note[i] = min(note[i],prev)\n else:\n if fx[i] > A[i]:\n return 0\n\n else:\n if fx[i] and fx[i] != A[i]:\n return 0\n note[i] = 1\n prev = A[i]\n\n ",
"i",
"range(N-1,-1,-1)",
"range",
"N-1",
"N",
"1",
"-1",
"-1",
"if prev > A[i]:\n return 0\n elif prev == A[i]:\n if not fx[i]:\n note[i] = min(note[i],prev)\n else:\n if fx[i] > A[i]:\n return 0\n\n else:\n if fx[i] and fx[i] != A[i]:\n return 0\n note[i] = 1\n prev = A[i]\n\n ",
"prev > A[i]",
"prev",
"A[i]",
"A",
"i",
"return 0",
"0",
"elif prev == A[i]:\n if not fx[i]:\n note[i] = min(note[i],prev)\n else:\n if fx[i] > A[i]:\n return 0\n\n ",
"prev == A[i]",
"prev",
"A[i]",
"A",
"i",
"if not fx[i]:\n note[i] = min(note[i],prev)\n else:\n if fx[i] > A[i]:\n return 0\n\n ",
"not fx[i]",
"fx[i]",
"fx",
"i",
"note[i] = min(note[i],prev)",
"note[i]",
"note",
"i",
"min(note[i],prev)",
"min",
"note[i]",
"note",
"i",
"prev",
"if fx[i] > A[i]:\n return 0\n\n ",
"fx[i] > A[i]",
"fx[i]",
"fx",
"i",
"A[i]",
"A",
"i",
"return 0",
"0",
"if fx[i] and fx[i] != A[i]:\n return 0\n ",
"fx[i] and fx[i] != A[i]",
"fx[i]",
"fx",
"i",
"fx[i] != A[i]",
"fx[i]",
"fx",
"i",
"A[i]",
"A",
"i",
"return 0",
"0",
"note[i] = 1",
"note[i]",
"note",
"i",
"1",
"prev = A[i]",
"prev",
"A[i]",
"A",
"i",
"ans = 1",
"ans",
"1",
"for i in range(N):\n if not fx[i]:\n ans = (ans * note[i])%(10**9+7)\n ",
"i",
"range(N)",
"range",
"N",
"if not fx[i]:\n ans = (ans * note[i])%(10**9+7)\n ",
"not fx[i]",
"fx[i]",
"fx",
"i",
"ans = (ans * note[i])%(10**9+7)",
"ans",
"(ans * note[i])%(10**9+7)",
"ans * note[i]",
"ans",
"note[i]",
"note",
"i",
"10**9+7",
"10**9",
"10",
"9",
"7",
"return ans",
"ans",
"print",
"solve()",
"solve",
"A = map(int,raw_input().split(\" \"))",
"map(int,raw_input().split(\" \"))",
"A",
"T = map(int,raw_input().split(\" \"))",
"map(int,raw_input().split(\" \"))",
"T",
"fx = [0 for i in range(N)]",
"[0 for i in range(N)]",
"fx",
"N = input()",
"input()",
"N",
"note = [1 for i in range(N)]",
"[1 for i in range(N)]",
"note",
"def solve():\n global note\n if T[-1] != A[0]:\n return 0\n \n prev = 0\n for i in range(N):\n if prev > T[i]:\n return 0\n elif prev == T[i]:\n note[i] = prev\n else:\n note[i] = 1\n prev = T[i]\n fx[i] = T[i]\n prev = 0\n for i in range(N-1,-1,-1):\n if prev > A[i]:\n return 0\n elif prev == A[i]:\n if not fx[i]:\n note[i] = min(note[i],prev)\n else:\n if fx[i] > A[i]:\n return 0\n\n else:\n if fx[i] and fx[i] != A[i]:\n return 0\n note[i] = 1\n prev = A[i]\n\n ans = 1\n for i in range(N):\n if not fx[i]:\n ans = (ans * note[i])%(10**9+7)\n return ans\n\n\n\n ",
"def solve():\n global note\n if T[-1] != A[0]:\n return 0\n \n prev = 0\n for i in range(N):\n if prev > T[i]:\n return 0\n elif prev == T[i]:\n note[i] = prev\n else:\n note[i] = 1\n prev = T[i]\n fx[i] = T[i]\n prev = 0\n for i in range(N-1,-1,-1):\n if prev > A[i]:\n return 0\n elif prev == A[i]:\n if not fx[i]:\n note[i] = min(note[i],prev)\n else:\n if fx[i] > A[i]:\n return 0\n\n else:\n if fx[i] and fx[i] != A[i]:\n return 0\n note[i] = 1\n prev = A[i]\n\n ans = 1\n for i in range(N):\n if not fx[i]:\n ans = (ans * note[i])%(10**9+7)\n return ans\n\n\n\n ",
"solve"
] |
N = input()
T = map(int,raw_input().split(" "))
A = map(int,raw_input().split(" "))
note = [1 for i in range(N)]
fx = [0 for i in range(N)]
def solve():
global note
if T[-1] != A[0]:
return 0
prev = 0
for i in range(N):
if prev > T[i]:
return 0
elif prev == T[i]:
note[i] = prev
else:
note[i] = 1
prev = T[i]
fx[i] = T[i]
prev = 0
for i in range(N-1,-1,-1):
if prev > A[i]:
return 0
elif prev == A[i]:
if not fx[i]:
note[i] = min(note[i],prev)
else:
if fx[i] > A[i]:
return 0
else:
if fx[i] and fx[i] != A[i]:
return 0
note[i] = 1
prev = A[i]
ans = 1
for i in range(N):
if not fx[i]:
ans = (ans * note[i])%(10**9+7)
return ans
print solve()
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
2,
39,
17,
13,
0,
13,
2,
39,
17,
13,
0,
13,
17,
28,
13,
4,
13,
13,
14,
2,
18,
13,
13,
13,
0,
13,
18,
13,
13,
0,
18,
13,
13,
18,
13,
13,
0,
18,
13,
13,
18,
13,
13,
0,
18,
13,
13,
18,
13,
13,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
2,
2,
13,
17,
13,
14,
2,
18,
13,
13,
13,
0,
13,
18,
13,
13,
0,
18,
13,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
18,
13,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
18,
13,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
13,
17,
28,
13,
4,
13,
13,
14,
2,
18,
13,
13,
18,
13,
13,
0,
13,
17,
3,
0,
13,
2,
2,
13,
2,
2,
18,
13,
13,
18,
13,
13,
17,
17,
13,
10,
4,
13,
10,
2,
13,
10,
4,
13,
10,
17,
13,
10,
18,
13,
10,
18,
13,
10,
4,
13,
10,
17,
13,
10,
17,
13,
10,
2,
13,
10,
2,
13,
10,
2,
13,
10,
17,
13
] |
[
[
196,
2
],
[
178,
8
],
[
184,
18
],
[
211,
28
],
[
197,
32
],
[
181,
34
],
[
197,
38
],
[
199,
40
],
[
44,
43
],
[
197,
46
],
[
179,
50
],
[
43,
51
],
[
200,
52
],
[
191,
52
],
[
190,
54
],
[
179,
56
],
[
43,
57
],
[
62,
59
],
[
212,
60
],
[
43,
61
],
[
179,
63
],
[
43,
64
],
[
69,
66
],
[
182,
67
],
[
43,
68
],
[
179,
70
],
[
43,
71
],
[
76,
73
],
[
182,
74
],
[
43,
75
],
[
179,
77
],
[
43,
78
],
[
214,
80
],
[
84,
83
],
[
197,
86
],
[
205,
88
],
[
197,
91
],
[
83,
93
],
[
185,
97
],
[
206,
98
],
[
215,
99
],
[
194,
99
],
[
193,
101
],
[
185,
103
],
[
206,
104
],
[
109,
106
],
[
212,
107
],
[
206,
108
],
[
185,
112
],
[
206,
113
],
[
59,
114
],
[
106,
114
],
[
212,
115
],
[
206,
116
],
[
121,
118
],
[
182,
119
],
[
206,
120
],
[
185,
124
],
[
206,
125
],
[
73,
126
],
[
66,
126
],
[
130,
126
],
[
118,
126
],
[
182,
127
],
[
206,
128
],
[
133,
130
],
[
182,
131
],
[
206,
132
],
[
185,
136
],
[
206,
137
],
[
73,
138
],
[
66,
138
],
[
130,
138
],
[
118,
138
],
[
182,
139
],
[
206,
140
],
[
202,
142
],
[
146,
145
],
[
197,
148
],
[
130,
151
],
[
118,
151
],
[
73,
151
],
[
66,
151
],
[
182,
152
],
[
145,
153
],
[
106,
154
],
[
59,
154
],
[
212,
155
],
[
145,
156
],
[
187,
158
],
[
208,
162
],
[
203,
165
],
[
209,
165
],
[
188,
165
],
[
130,
168
],
[
118,
168
],
[
73,
168
],
[
66,
168
],
[
182,
169
],
[
145,
170
],
[
106,
171
],
[
59,
171
],
[
212,
172
],
[
145,
173
],
[
178,
179
],
[
181,
182
],
[
184,
185
],
[
187,
188
],
[
190,
191
],
[
193,
194
],
[
196,
197
],
[
199,
200
],
[
202,
203
],
[
205,
206
],
[
208,
209
],
[
211,
212
],
[
214,
215
]
] |
[
"N = int(raw_input())\nT_list = map(int, raw_input().split())\nA_list = map(int, raw_input().split())\n\nlow_list = [1]*N\nhigh_list = [1]*N\n\nt_now = 0\nfor i in range(N):\n if T_list[i] > t_now:\n t_now = T_list[i]\n low_list[i] = T_list[i]\n high_list[i] = T_list[i]\n else:\n high_list[i] = T_list[i]\na_now = 0\nfor j in range(N):\n i = N - 1 - j\n if A_list[i] > a_now:\n a_now = A_list[i]\n low_list[i] = max(A_list[i], low_list[i])\n high_list[i] = min(A_list[i], high_list[i])\n else:\n high_list[i] = min(A_list[i], high_list[i])\n \nres = 1\nfor i in range(N):\n if high_list[i] < low_list[i]:\n res = 0\n break\n else:\n res = res*(high_list[i] - low_list[i] + 1) % 1000000007\n\nprint res",
"N = int(raw_input())",
"N",
"int(raw_input())",
"int",
"raw_input()",
"raw_input",
"T_list = map(int, raw_input().split())",
"T_list",
"map(int, raw_input().split())",
"map",
"int",
"raw_input().split()",
"().split",
"()",
"raw_input",
"split",
"A_list = map(int, raw_input().split())",
"A_list",
"map(int, raw_input().split())",
"map",
"int",
"raw_input().split()",
"().split",
"()",
"raw_input",
"split",
"low_list = [1]*N",
"low_list",
"[1]*N",
"[1]",
"1",
"N",
"high_list = [1]*N",
"high_list",
"[1]*N",
"[1]",
"1",
"N",
"t_now = 0",
"t_now",
"0",
"for i in range(N):\n if T_list[i] > t_now:\n t_now = T_list[i]\n low_list[i] = T_list[i]\n high_list[i] = T_list[i]\n else:\n high_list[i] = T_list[i]",
"i",
"range(N)",
"range",
"N",
"if T_list[i] > t_now:\n t_now = T_list[i]\n low_list[i] = T_list[i]\n high_list[i] = T_list[i]\n else:\n high_list[i] = T_list[i]",
"T_list[i] > t_now",
"T_list[i]",
"T_list",
"i",
"t_now",
"t_now = T_list[i]",
"t_now",
"T_list[i]",
"T_list",
"i",
"low_list[i] = T_list[i]",
"low_list[i]",
"low_list",
"i",
"T_list[i]",
"T_list",
"i",
"high_list[i] = T_list[i]",
"high_list[i]",
"high_list",
"i",
"T_list[i]",
"T_list",
"i",
"high_list[i] = T_list[i]",
"high_list[i]",
"high_list",
"i",
"T_list[i]",
"T_list",
"i",
"a_now = 0",
"a_now",
"0",
"for j in range(N):\n i = N - 1 - j\n if A_list[i] > a_now:\n a_now = A_list[i]\n low_list[i] = max(A_list[i], low_list[i])\n high_list[i] = min(A_list[i], high_list[i])\n else:\n high_list[i] = min(A_list[i], high_list[i])\n ",
"j",
"range(N)",
"range",
"N",
"i = N - 1 - j",
"i",
"N - 1 - j",
"N - 1",
"N",
"1",
"j",
"if A_list[i] > a_now:\n a_now = A_list[i]\n low_list[i] = max(A_list[i], low_list[i])\n high_list[i] = min(A_list[i], high_list[i])\n else:\n high_list[i] = min(A_list[i], high_list[i])\n ",
"A_list[i] > a_now",
"A_list[i]",
"A_list",
"i",
"a_now",
"a_now = A_list[i]",
"a_now",
"A_list[i]",
"A_list",
"i",
"low_list[i] = max(A_list[i], low_list[i])",
"low_list[i]",
"low_list",
"i",
"max(A_list[i], low_list[i])",
"max",
"A_list[i]",
"A_list",
"i",
"low_list[i]",
"low_list",
"i",
"high_list[i] = min(A_list[i], high_list[i])",
"high_list[i]",
"high_list",
"i",
"min(A_list[i], high_list[i])",
"min",
"A_list[i]",
"A_list",
"i",
"high_list[i]",
"high_list",
"i",
"high_list[i] = min(A_list[i], high_list[i])",
"high_list[i]",
"high_list",
"i",
"min(A_list[i], high_list[i])",
"min",
"A_list[i]",
"A_list",
"i",
"high_list[i]",
"high_list",
"i",
"res = 1",
"res",
"1",
"for i in range(N):\n if high_list[i] < low_list[i]:\n res = 0\n break\n else:\n res = res*(high_list[i] - low_list[i] + 1) % 1000000007",
"i",
"range(N)",
"range",
"N",
"if high_list[i] < low_list[i]:\n res = 0\n break\n else:\n res = res*(high_list[i] - low_list[i] + 1) % 1000000007",
"high_list[i] < low_list[i]",
"high_list[i]",
"high_list",
"i",
"low_list[i]",
"low_list",
"i",
"res = 0",
"res",
"0",
"break",
"res = res*(high_list[i] - low_list[i] + 1) % 1000000007",
"res",
"res*(high_list[i] - low_list[i] + 1) % 1000000007",
"res*(high_list[i] - low_list[i] + 1)",
"res",
"high_list[i] - low_list[i] + 1",
"high_list[i] - low_list[i]",
"high_list[i]",
"high_list",
"i",
"low_list[i]",
"low_list",
"i",
"1",
"1000000007",
"print",
"T_list = map(int, raw_input().split())",
"map(int, raw_input().split())",
"T_list",
"high_list = [1]*N",
"[1]*N",
"high_list",
"A_list = map(int, raw_input().split())",
"map(int, raw_input().split())",
"A_list",
"res = 0",
"0",
"res",
"t_now = T_list[i]",
"T_list[i]",
"t_now",
"a_now = A_list[i]",
"A_list[i]",
"a_now",
"N = int(raw_input())",
"int(raw_input())",
"N",
"t_now = 0",
"0",
"t_now",
"res = 1",
"1",
"res",
"i = N - 1 - j",
"N - 1 - j",
"i",
"res = res*(high_list[i] - low_list[i] + 1) % 1000000007",
"res*(high_list[i] - low_list[i] + 1) % 1000000007",
"res",
"low_list = [1]*N",
"[1]*N",
"low_list",
"a_now = 0",
"0",
"a_now"
] |
N = int(raw_input())
T_list = map(int, raw_input().split())
A_list = map(int, raw_input().split())
low_list = [1]*N
high_list = [1]*N
t_now = 0
for i in range(N):
if T_list[i] > t_now:
t_now = T_list[i]
low_list[i] = T_list[i]
high_list[i] = T_list[i]
else:
high_list[i] = T_list[i]
a_now = 0
for j in range(N):
i = N - 1 - j
if A_list[i] > a_now:
a_now = A_list[i]
low_list[i] = max(A_list[i], low_list[i])
high_list[i] = min(A_list[i], high_list[i])
else:
high_list[i] = min(A_list[i], high_list[i])
res = 1
for i in range(N):
if high_list[i] < low_list[i]:
res = 0
break
else:
res = res*(high_list[i] - low_list[i] + 1) % 1000000007
print res
|
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
0,
13,
13,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
0,
13,
13,
0,
13,
2,
2,
17,
17,
17,
0,
13,
4,
13,
0,
13,
4,
13,
28,
13,
4,
13,
13,
14,
2,
2,
13,
17,
2,
18,
13,
2,
13,
17,
18,
13,
13,
4,
18,
13,
13,
13,
14,
2,
2,
13,
2,
13,
17,
2,
18,
13,
13,
18,
13,
2,
13,
17,
4,
18,
13,
13,
13,
0,
13,
17,
28,
13,
4,
13,
13,
14,
2,
13,
13,
14,
2,
18,
13,
13,
18,
13,
13,
0,
13,
17,
3,
14,
2,
13,
13,
14,
2,
18,
13,
13,
18,
13,
13,
0,
13,
17,
3,
0,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
13,
13,
4,
13,
13,
10,
4,
13,
10,
13,
13,
10,
17,
13,
10,
4,
13,
10,
4,
13,
10,
13,
13,
10,
4,
13,
10,
13,
13,
10,
2,
13,
10,
17,
13,
10,
17,
13
] |
[
[
154,
2
],
[
10,
9
],
[
9,
18
],
[
169,
20
],
[
25,
24
],
[
24,
33
],
[
157,
35
],
[
178,
38
],
[
166,
45
],
[
163,
49
],
[
54,
53
],
[
155,
56
],
[
53,
60
],
[
170,
64
],
[
53,
66
],
[
170,
69
],
[
53,
70
],
[
167,
73
],
[
53,
75
],
[
53,
79
],
[
155,
81
],
[
158,
85
],
[
53,
86
],
[
158,
88
],
[
53,
90
],
[
164,
94
],
[
53,
96
],
[
181,
98
],
[
102,
101
],
[
155,
104
],
[
101,
107
],
[
167,
108
],
[
170,
112
],
[
101,
113
],
[
158,
115
],
[
101,
116
],
[
160,
118
],
[
101,
123
],
[
164,
124
],
[
170,
128
],
[
101,
129
],
[
158,
131
],
[
101,
132
],
[
184,
134
],
[
172,
138
],
[
170,
142
],
[
101,
143
],
[
158,
145
],
[
101,
146
],
[
175,
148
],
[
179,
149
],
[
176,
152
],
[
173,
152
],
[
185,
152
],
[
161,
152
],
[
182,
152
],
[
154,
155
],
[
157,
158
],
[
160,
161
],
[
163,
164
],
[
166,
167
],
[
169,
170
],
[
172,
173
],
[
179,
175
],
[
175,
176
],
[
178,
179
],
[
181,
182
],
[
184,
185
]
] |
[
"N = int(input())\nT = [int(_) for _ in input().split()]\nA = [int(_) for _ in input().split()]\nmod = 10**9 + 7\nupT = set()\nupA = set()\nfor i in range(N):\n if i == 0 or T[i - 1] < T[i]:\n upT.add(i)\n if i == N - 1 or A[i] > A[i + 1]:\n upA.add(i)\nans = 1\nfor i in range(N):\n if i in upT:\n if T[i] > A[i]:\n ans = 0\n break\n elif i in upA:\n if T[i] < A[i]:\n ans = 0\n break\n else:\n ans *= min(T[i], A[i])\n ans %= mod\nprint(ans)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"int(_) for _ in input().split()",
"for _ in input().split()",
"_",
"input().split()",
"().split",
"()",
"input",
"split",
"for _ in input().split()",
"int(_)",
"int",
"_",
"T = [int(_) for _ in input().split()]",
"T",
"[int(_) for _ in input().split()]",
"int(_) for _ in input().split()",
"for _ in input().split()",
"_",
"input().split()",
"().split",
"()",
"input",
"split",
"for _ in input().split()",
"int(_)",
"int",
"_",
"A = [int(_) for _ in input().split()]",
"A",
"[int(_) for _ in input().split()]",
"mod = 10**9 + 7",
"mod",
"10**9 + 7",
"10**9",
"10",
"9",
"7",
"upT = set()",
"upT",
"set()",
"set",
"upA = set()",
"upA",
"set()",
"set",
"for i in range(N):\n if i == 0 or T[i - 1] < T[i]:\n upT.add(i)\n if i == N - 1 or A[i] > A[i + 1]:\n upA.add(i)",
"i",
"range(N)",
"range",
"N",
"if i == 0 or T[i - 1] < T[i]:\n upT.add(i)\n ",
"i == 0 or T[i - 1] < T[i]",
"i == 0",
"i",
"0",
"T[i - 1] < T[i]",
"T[i - 1]",
"T",
"i - 1",
"i",
"1",
"T[i]",
"T",
"i",
"upT.add(i)",
"upT.add",
"upT",
"add",
"i",
"if i == N - 1 or A[i] > A[i + 1]:\n upA.add(i)",
"i == N - 1 or A[i] > A[i + 1]",
"i == N - 1",
"i",
"N - 1",
"N",
"1",
"A[i] > A[i + 1]",
"A[i]",
"A",
"i",
"A[i + 1]",
"A",
"i + 1",
"i",
"1",
"upA.add(i)",
"upA.add",
"upA",
"add",
"i",
"ans = 1",
"ans",
"1",
"for i in range(N):\n if i in upT:\n if T[i] > A[i]:\n ans = 0\n break\n elif i in upA:\n if T[i] < A[i]:\n ans = 0\n break\n else:\n ans *= min(T[i], A[i])\n ans %= mod",
"i",
"range(N)",
"range",
"N",
"if i in upT:\n if T[i] > A[i]:\n ans = 0\n break\n elif i in upA:\n if T[i] < A[i]:\n ans = 0\n break\n else:\n ans *= min(T[i], A[i])\n ans %= mod",
"i in upT",
"i",
"upT",
"if T[i] > A[i]:\n ans = 0\n break\n ",
"T[i] > A[i]",
"T[i]",
"T",
"i",
"A[i]",
"A",
"i",
"ans = 0",
"ans",
"0",
"break",
"elif i in upA:\n if T[i] < A[i]:\n ans = 0\n break\n ",
"i in upA",
"i",
"upA",
"if T[i] < A[i]:\n ans = 0\n break\n ",
"T[i] < A[i]",
"T[i]",
"T",
"i",
"A[i]",
"A",
"i",
"ans = 0",
"ans",
"0",
"break",
"ans *= min(T[i], A[i])",
"ans",
"min(T[i], A[i])",
"min",
"T[i]",
"T",
"i",
"A[i]",
"A",
"i",
"ans %= mod",
"ans",
"mod",
"print(ans)",
"print",
"ans",
"N = int(input())",
"int(input())",
"N",
"A = [int(_) for _ in input().split()]",
"[int(_) for _ in input().split()]",
"A",
"ans = 0",
"0",
"ans",
"upA = set()",
"set()",
"upA",
"upT = set()",
"set()",
"upT",
"T = [int(_) for _ in input().split()]",
"[int(_) for _ in input().split()]",
"T",
"ans *= min(T[i], A[i])",
"min(T[i], A[i])",
"ans",
"ans %= mod",
"mod",
"ans",
"mod = 10**9 + 7",
"10**9 + 7",
"mod",
"ans = 1",
"1",
"ans",
"ans = 0",
"0",
"ans"
] |
N = int(input())
T = [int(_) for _ in input().split()]
A = [int(_) for _ in input().split()]
mod = 10**9 + 7
upT = set()
upA = set()
for i in range(N):
if i == 0 or T[i - 1] < T[i]:
upT.add(i)
if i == N - 1 or A[i] > A[i + 1]:
upA.add(i)
ans = 1
for i in range(N):
if i in upT:
if T[i] > A[i]:
ans = 0
break
elif i in upA:
if T[i] < A[i]:
ans = 0
break
else:
ans *= min(T[i], A[i])
ans %= mod
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
2,
2,
39,
17,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
39,
17,
0,
13,
4,
13,
2,
2,
39,
17,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
39,
17,
14,
2,
2,
13,
17,
40,
18,
13,
17,
18,
13,
17,
4,
13,
17,
4,
13,
0,
13,
17,
0,
13,
2,
2,
17,
17,
17,
28,
13,
4,
13,
17,
13,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
14,
2,
2,
2,
18,
13,
13,
18,
13,
2,
13,
17,
40,
18,
13,
13,
18,
13,
13,
2,
2,
18,
13,
13,
18,
13,
2,
13,
17,
2,
18,
13,
13,
18,
13,
13,
4,
13,
17,
4,
13,
14,
2,
2,
18,
13,
13,
18,
13,
2,
13,
17,
2,
18,
13,
13,
18,
13,
13,
4,
13,
17,
4,
13,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
13,
2,
2,
4,
13,
18,
13,
13,
18,
13,
13,
13,
13,
4,
13,
13,
10,
17,
13,
10,
2,
13,
10,
4,
13,
10,
4,
13,
10,
2,
13,
10,
4,
13
] |
[
[
188,
2
],
[
191,
8
],
[
197,
28
],
[
189,
50
],
[
192,
54
],
[
198,
57
],
[
182,
65
],
[
185,
68
],
[
76,
75
],
[
189,
79
],
[
192,
83
],
[
75,
84
],
[
192,
86
],
[
75,
88
],
[
198,
95
],
[
75,
96
],
[
198,
98
],
[
75,
100
],
[
198,
104
],
[
75,
105
],
[
192,
107
],
[
75,
108
],
[
198,
112
],
[
75,
113
],
[
198,
115
],
[
75,
117
],
[
198,
121
],
[
75,
122
],
[
192,
124
],
[
75,
125
],
[
198,
135
],
[
75,
136
],
[
198,
138
],
[
75,
140
],
[
198,
144
],
[
75,
145
],
[
192,
147
],
[
75,
148
],
[
198,
157
],
[
75,
158
],
[
198,
160
],
[
75,
162
],
[
194,
165
],
[
192,
171
],
[
75,
172
],
[
198,
174
],
[
75,
175
],
[
183,
176
],
[
195,
176
],
[
186,
177
],
[
195,
180
],
[
183,
180
],
[
182,
183
],
[
185,
186
],
[
188,
189
],
[
191,
192
],
[
194,
195
],
[
197,
198
]
] |
[
"n=int(input())\nt=tuple([0]+list(map(int,input().split()))+[0])\na=tuple([0]+list(map(int,input().split()))+[0])\nif n==1 and t[1]!=a[1]:\n print(0)\n exit()\nc=1\nm=10**9+7\nfor i in range(1,n):\n if t[i]>t[i-1]:\n if a[i]>a[i+1]and a[i]!=t[i]or a[i]==a[i+1]and a[i]<t[i]:\n print(0)\n exit()\n else:\n if a[i]>a[i+1]and a[i]>t[i]:\n print(0)\n exit()\n if a[i]==a[i+1]:\n c=min(t[i],a[i])*c%m\nprint(c)",
"n=int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"t=tuple([0]+list(map(int,input().split()))+[0])",
"t",
"tuple([0]+list(map(int,input().split()))+[0])",
"tuple",
"[0]+list(map(int,input().split()))+[0]",
"[0]+list(map(int,input().split()))",
"[0]",
"0",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"[0]",
"0",
"a=tuple([0]+list(map(int,input().split()))+[0])",
"a",
"tuple([0]+list(map(int,input().split()))+[0])",
"tuple",
"[0]+list(map(int,input().split()))+[0]",
"[0]+list(map(int,input().split()))",
"[0]",
"0",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"[0]",
"0",
"if n==1 and t[1]!=a[1]:\n print(0)\n exit()",
"n==1 and t[1]!=a[1]",
"n==1",
"n",
"1",
"t[1]!=a[1]",
"t[1]",
"t",
"1",
"a[1]",
"a",
"1",
"print(0)",
"print",
"0",
"exit()",
"exit",
"c=1",
"c",
"1",
"m=10**9+7",
"m",
"10**9+7",
"10**9",
"10",
"9",
"7",
"for i in range(1,n):\n if t[i]>t[i-1]:\n if a[i]>a[i+1]and a[i]!=t[i]or a[i]==a[i+1]and a[i]<t[i]:\n print(0)\n exit()\n else:\n if a[i]>a[i+1]and a[i]>t[i]:\n print(0)\n exit()\n if a[i]==a[i+1]:\n c=min(t[i],a[i])*c%m",
"i",
"range(1,n)",
"range",
"1",
"n",
"if t[i]>t[i-1]:\n if a[i]>a[i+1]and a[i]!=t[i]or a[i]==a[i+1]and a[i]<t[i]:\n print(0)\n exit()\n else:\n if a[i]>a[i+1]and a[i]>t[i]:\n print(0)\n exit()\n if a[i]==a[i+1]:\n c=min(t[i],a[i])*c%m",
"t[i]>t[i-1]",
"t[i]",
"t",
"i",
"t[i-1]",
"t",
"i-1",
"i",
"1",
"if a[i]>a[i+1]and a[i]!=t[i]or a[i]==a[i+1]and a[i]<t[i]:\n print(0)\n exit()\n ",
"a[i]>a[i+1]and a[i]!=t[i]or a[i]==a[i+1]and a[i]<t[i]",
"a[i]>a[i+1]and a[i]!=t[i]",
"a[i]>a[i+1]",
"a[i]",
"a",
"i",
"a[i+1]",
"a",
"i+1",
"i",
"1",
"a[i]!=t[i]",
"a[i]",
"a",
"i",
"t[i]",
"t",
"i",
"a[i]==a[i+1]and a[i]<t[i]",
"a[i]==a[i+1]",
"a[i]",
"a",
"i",
"a[i+1]",
"a",
"i+1",
"i",
"1",
"a[i]<t[i]",
"a[i]",
"a",
"i",
"t[i]",
"t",
"i",
"print(0)",
"print",
"0",
"exit()",
"exit",
"if a[i]>a[i+1]and a[i]>t[i]:\n print(0)\n exit()\n ",
"a[i]>a[i+1]and a[i]>t[i]",
"a[i]>a[i+1]",
"a[i]",
"a",
"i",
"a[i+1]",
"a",
"i+1",
"i",
"1",
"a[i]>t[i]",
"a[i]",
"a",
"i",
"t[i]",
"t",
"i",
"print(0)",
"print",
"0",
"exit()",
"exit",
"if a[i]==a[i+1]:\n c=min(t[i],a[i])*c%m",
"a[i]==a[i+1]",
"a[i]",
"a",
"i",
"a[i+1]",
"a",
"i+1",
"i",
"1",
"c=min(t[i],a[i])*c%m",
"c",
"min(t[i],a[i])*c%m",
"min(t[i],a[i])*c",
"min(t[i],a[i])",
"min",
"t[i]",
"t",
"i",
"a[i]",
"a",
"i",
"c",
"m",
"print(c)",
"print",
"c",
"c=1",
"1",
"c",
"m=10**9+7",
"10**9+7",
"m",
"n=int(input())",
"int(input())",
"n",
"t=tuple([0]+list(map(int,input().split()))+[0])",
"tuple([0]+list(map(int,input().split()))+[0])",
"t",
"c=min(t[i],a[i])*c%m",
"min(t[i],a[i])*c%m",
"c",
"a=tuple([0]+list(map(int,input().split()))+[0])",
"tuple([0]+list(map(int,input().split()))+[0])",
"a"
] |
n=int(input())
t=tuple([0]+list(map(int,input().split()))+[0])
a=tuple([0]+list(map(int,input().split()))+[0])
if n==1 and t[1]!=a[1]:
print(0)
exit()
c=1
m=10**9+7
for i in range(1,n):
if t[i]>t[i-1]:
if a[i]>a[i+1]and a[i]!=t[i]or a[i]==a[i+1]and a[i]<t[i]:
print(0)
exit()
else:
if a[i]>a[i+1]and a[i]>t[i]:
print(0)
exit()
if a[i]==a[i+1]:
c=min(t[i],a[i])*c%m
print(c)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
2,
2,
17,
17,
17,
14,
40,
13,
17,
4,
13,
4,
13,
2,
13,
13,
4,
13,
0,
13,
17,
28,
13,
4,
13,
17,
2,
13,
17,
0,
13,
17,
13,
17,
14,
2,
2,
18,
13,
2,
13,
17,
18,
13,
13,
2,
18,
13,
13,
18,
13,
2,
13,
17,
14,
40,
18,
13,
13,
18,
13,
13,
4,
13,
17,
3,
14,
2,
18,
13,
2,
13,
17,
18,
13,
13,
14,
2,
18,
13,
13,
18,
13,
13,
4,
13,
17,
3,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
14,
2,
18,
13,
13,
18,
13,
13,
4,
13,
17,
3,
0,
13,
2,
2,
13,
4,
13,
18,
13,
13,
18,
13,
13,
13,
4,
13,
13,
10,
2,
13,
10,
17,
13,
10,
2,
13,
10,
4,
13,
10,
4,
13,
10,
17,
13,
10,
4,
13,
10,
17,
13
] |
[
[
170,
2
],
[
179,
8
],
[
173,
20
],
[
161,
32
],
[
171,
40
],
[
180,
47
],
[
174,
48
],
[
164,
52
],
[
56,
55
],
[
171,
60
],
[
176,
63
],
[
182,
65
],
[
180,
71
],
[
55,
73
],
[
180,
76
],
[
55,
77
],
[
174,
80
],
[
55,
81
],
[
174,
83
],
[
55,
85
],
[
180,
90
],
[
55,
91
],
[
174,
93
],
[
55,
94
],
[
180,
102
],
[
55,
104
],
[
180,
107
],
[
55,
108
],
[
180,
112
],
[
55,
113
],
[
174,
115
],
[
55,
116
],
[
174,
124
],
[
55,
125
],
[
174,
127
],
[
55,
129
],
[
180,
134
],
[
55,
135
],
[
174,
137
],
[
55,
138
],
[
167,
144
],
[
165,
147
],
[
168,
147
],
[
180,
151
],
[
55,
152
],
[
174,
154
],
[
55,
155
],
[
162,
156
],
[
168,
159
],
[
165,
159
],
[
161,
162
],
[
164,
165
],
[
167,
168
],
[
170,
171
],
[
173,
174
],
[
176,
177
],
[
179,
180
],
[
182,
183
]
] |
[
"n = int(input())\nt = list(map(int, input().split()))\na = list(map(int, input().split()))\nmod = 10 ** 9 + 7\n\n# 解説AC\nif n <= 2:\n print(int(t == a))\n exit()\n\nans = 1\nfor i in range(1, n - 1):\n ht, ha = 0, 0\n if t[i - 1] < t[i] and a[i] > a[i + 1]:\n if t[i] != a[i]:\n print(0)\n break\n if t[i - 1] < t[i]:\n if t[i] > a[i]:\n print(0)\n break\n elif a[i] > a[i + 1]:\n if t[i] < a[i]:\n print(0)\n break\n else:\n ans = ans * min(t[i], a[i]) % mod\nelse:\n print(ans)",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"t = list(map(int, input().split()))",
"t",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"a = list(map(int, input().split()))",
"a",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"mod = 10 ** 9 + 7",
"mod",
"10 ** 9 + 7",
"10 ** 9",
"10",
"9",
"7",
"if n <= 2:\n print(int(t == a))\n exit()",
"n <= 2",
"n",
"2",
"print(int(t == a))",
"print",
"int(t == a)",
"int",
"t == a",
"t",
"a",
"exit()",
"exit",
"ans = 1",
"ans",
"1",
"for i in range(1, n - 1):\n ht, ha = 0, 0\n if t[i - 1] < t[i] and a[i] > a[i + 1]:\n if t[i] != a[i]:\n print(0)\n break\n if t[i - 1] < t[i]:\n if t[i] > a[i]:\n print(0)\n break\n elif a[i] > a[i + 1]:\n if t[i] < a[i]:\n print(0)\n break\n else:\n ans = ans * min(t[i], a[i]) % mod\nelse:\n print(ans)",
"i",
"range(1, n - 1)",
"range",
"1",
"n - 1",
"n",
"1",
"ht, ha = 0, 0",
"ht",
"0",
"ha",
"0",
"if t[i - 1] < t[i] and a[i] > a[i + 1]:\n if t[i] != a[i]:\n print(0)\n break\n ",
"t[i - 1] < t[i] and a[i] > a[i + 1]",
"t[i - 1] < t[i]",
"t[i - 1]",
"t",
"i - 1",
"i",
"1",
"t[i]",
"t",
"i",
"a[i] > a[i + 1]",
"a[i]",
"a",
"i",
"a[i + 1]",
"a",
"i + 1",
"i",
"1",
"if t[i] != a[i]:\n print(0)\n break\n ",
"t[i] != a[i]",
"t[i]",
"t",
"i",
"a[i]",
"a",
"i",
"print(0)",
"print",
"0",
"break",
"if t[i - 1] < t[i]:\n if t[i] > a[i]:\n print(0)\n break\n elif a[i] > a[i + 1]:\n if t[i] < a[i]:\n print(0)\n break\n else:\n ans = ans * min(t[i], a[i]) % mod",
"t[i - 1] < t[i]",
"t[i - 1]",
"t",
"i - 1",
"i",
"1",
"t[i]",
"t",
"i",
"if t[i] > a[i]:\n print(0)\n break\n ",
"t[i] > a[i]",
"t[i]",
"t",
"i",
"a[i]",
"a",
"i",
"print(0)",
"print",
"0",
"break",
"elif a[i] > a[i + 1]:\n if t[i] < a[i]:\n print(0)\n break\n ",
"a[i] > a[i + 1]",
"a[i]",
"a",
"i",
"a[i + 1]",
"a",
"i + 1",
"i",
"1",
"if t[i] < a[i]:\n print(0)\n break\n ",
"t[i] < a[i]",
"t[i]",
"t",
"i",
"a[i]",
"a",
"i",
"print(0)",
"print",
"0",
"break",
"ans = ans * min(t[i], a[i]) % mod",
"ans",
"ans * min(t[i], a[i]) % mod",
"ans * min(t[i], a[i])",
"ans",
"min(t[i], a[i])",
"min",
"t[i]",
"t",
"i",
"a[i]",
"a",
"i",
"mod",
"print(ans)",
"print",
"ans",
"mod = 10 ** 9 + 7",
"10 ** 9 + 7",
"mod",
"ans = 1",
"1",
"ans",
"ans = ans * min(t[i], a[i]) % mod",
"ans * min(t[i], a[i]) % mod",
"ans",
"n = int(input())",
"int(input())",
"n",
"a = list(map(int, input().split()))",
"list(map(int, input().split()))",
"a",
"ht, ha = 0, 0",
"0",
"ht",
"t = list(map(int, input().split()))",
"list(map(int, input().split()))",
"t",
"ha = 0, 0",
"0",
"ha"
] |
n = int(input())
t = list(map(int, input().split()))
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
# 解説AC
if n <= 2:
print(int(t == a))
exit()
ans = 1
for i in range(1, n - 1):
ht, ha = 0, 0
if t[i - 1] < t[i] and a[i] > a[i + 1]:
if t[i] != a[i]:
print(0)
break
if t[i - 1] < t[i]:
if t[i] > a[i]:
print(0)
break
elif a[i] > a[i + 1]:
if t[i] < a[i]:
print(0)
break
else:
ans = ans * min(t[i], a[i]) % mod
else:
print(ans)
|
[
7,
15,
13,
0,
13,
18,
18,
13,
13,
13,
12,
13,
12,
13,
12,
13,
12,
13,
0,
13,
2,
2,
17,
17,
17,
0,
13,
4,
13,
0,
13,
4,
13,
0,
13,
4,
13,
0,
13,
2,
2,
17,
17,
17,
0,
13,
2,
39,
13,
13,
0,
13,
2,
39,
13,
13,
0,
13,
2,
39,
17,
13,
0,
13,
2,
39,
17,
13,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
18,
13,
13,
14,
2,
13,
13,
0,
18,
13,
13,
13,
0,
18,
13,
13,
13,
0,
13,
13,
0,
18,
13,
13,
13,
0,
13,
17,
28,
13,
4,
13,
2,
13,
17,
17,
17,
0,
13,
18,
13,
13,
14,
2,
13,
13,
0,
18,
13,
13,
13,
0,
18,
13,
13,
13,
0,
13,
13,
0,
18,
13,
13,
13,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
13,
4,
13,
18,
13,
13,
18,
13,
13,
14,
2,
13,
13,
0,
13,
17,
3,
0,
13,
2,
2,
13,
2,
2,
13,
13,
17,
13,
4,
13,
13,
4,
13,
10,
12,
13,
10,
12,
13,
10,
12,
13,
10,
18,
13,
10,
12,
13
] |
[
[
204,
4
],
[
20,
19
],
[
27,
26
],
[
196,
28
],
[
31,
30
],
[
199,
32
],
[
35,
34
],
[
199,
36
],
[
39,
38
],
[
46,
45
],
[
26,
49
],
[
52,
51
],
[
26,
55
],
[
58,
57
],
[
26,
61
],
[
64,
63
],
[
26,
67
],
[
70,
69
],
[
73,
72
],
[
26,
75
],
[
78,
77
],
[
30,
79
],
[
72,
80
],
[
77,
83
],
[
69,
84
],
[
96,
84
],
[
89,
86
],
[
57,
87
],
[
72,
88
],
[
77,
89
],
[
94,
91
],
[
45,
92
],
[
72,
93
],
[
77,
94
],
[
97,
96
],
[
77,
97
],
[
102,
99
],
[
45,
100
],
[
72,
101
],
[
69,
102
],
[
96,
102
],
[
105,
104
],
[
108,
107
],
[
26,
111
],
[
117,
116
],
[
34,
118
],
[
107,
119
],
[
116,
122
],
[
77,
122
],
[
104,
123
],
[
96,
123
],
[
69,
123
],
[
135,
123
],
[
128,
125
],
[
63,
126
],
[
107,
127
],
[
116,
128
],
[
77,
128
],
[
133,
130
],
[
51,
131
],
[
107,
132
],
[
116,
133
],
[
77,
133
],
[
136,
135
],
[
116,
136
],
[
77,
136
],
[
141,
138
],
[
51,
139
],
[
107,
140
],
[
104,
141
],
[
96,
141
],
[
69,
141
],
[
135,
141
],
[
144,
143
],
[
147,
146
],
[
26,
149
],
[
152,
151
],
[
99,
154
],
[
91,
154
],
[
45,
155
],
[
146,
156
],
[
138,
157
],
[
130,
157
],
[
51,
158
],
[
146,
159
],
[
162,
161
],
[
86,
164
],
[
57,
165
],
[
146,
166
],
[
125,
167
],
[
63,
168
],
[
146,
169
],
[
161,
172
],
[
151,
173
],
[
176,
175
],
[
180,
179
],
[
143,
182
],
[
179,
182
],
[
175,
182
],
[
151,
185
],
[
161,
186
],
[
19,
188
],
[
179,
191
],
[
175,
191
],
[
143,
191
],
[
202,
193
],
[
204,
205
]
] |
[
"import sys\ninput = sys.stdin.readline\n\ndef I(): return int(input())\ndef MI(): return map(int, input().split())\ndef LI(): return list(map(int, input().split()))\n\ndef main():\n mod=10**9+7\n N=I()\n T=LI()\n A=LI()\n inf=10**9+1\n M1=[inf]*N\n M2=[inf]*N\n m1=[1]*N\n m2=[1]*N\n \n now=1\n for i in range(N):\n t=T[i]\n if t>now:\n m1[i]=t\n M1[i]=t\n now=t\n else:\n M1[i]=now\n \n now=1\n for i in range(N-1,-1,-1):\n t=A[i]\n if t>now:\n m2[i]=t\n M2[i]=t\n now=t\n else:\n M2[i]=now\n \n ans=1\n for i in range(N):\n M=min(M1[i],M2[i])\n m=max(m1[i],m2[i])\n if m>M:\n ans=0\n break\n else:\n ans=(ans*(M-m+1))%mod\n \n print(ans)\n \n \nmain()",
"import sys",
"sys",
"input = sys.stdin.readline",
"input",
"sys.stdin.readline",
"sys.stdin",
"sys",
"stdin",
"readline",
"def I(): return int(input())",
"I",
"def MI(): return map(int, input().split())",
"MI",
"def LI(): return list(map(int, input().split()))",
"LI",
"def main():\n mod=10**9+7\n N=I()\n T=LI()\n A=LI()\n inf=10**9+1\n M1=[inf]*N\n M2=[inf]*N\n m1=[1]*N\n m2=[1]*N\n \n now=1\n for i in range(N):\n t=T[i]\n if t>now:\n m1[i]=t\n M1[i]=t\n now=t\n else:\n M1[i]=now\n \n now=1\n for i in range(N-1,-1,-1):\n t=A[i]\n if t>now:\n m2[i]=t\n M2[i]=t\n now=t\n else:\n M2[i]=now\n \n ans=1\n for i in range(N):\n M=min(M1[i],M2[i])\n m=max(m1[i],m2[i])\n if m>M:\n ans=0\n break\n else:\n ans=(ans*(M-m+1))%mod\n \n print(ans)\n \n ",
"main",
"mod=10**9+7",
"mod",
"10**9+7",
"10**9",
"10",
"9",
"7",
"N=I()",
"N",
"I()",
"I",
"T=LI()",
"T",
"LI()",
"LI",
"A=LI()",
"A",
"LI()",
"LI",
"inf=10**9+1",
"inf",
"10**9+1",
"10**9",
"10",
"9",
"1",
"M1=[inf]*N",
"M1",
"[inf]*N",
"[inf]",
"inf",
"N",
"M2=[inf]*N",
"M2",
"[inf]*N",
"[inf]",
"inf",
"N",
"m1=[1]*N",
"m1",
"[1]*N",
"[1]",
"1",
"N",
"m2=[1]*N",
"m2",
"[1]*N",
"[1]",
"1",
"N",
"now=1",
"now",
"1",
"for i in range(N):\n t=T[i]\n if t>now:\n m1[i]=t\n M1[i]=t\n now=t\n else:\n M1[i]=now\n \n ",
"i",
"range(N)",
"range",
"N",
"t=T[i]",
"t",
"T[i]",
"T",
"i",
"if t>now:\n m1[i]=t\n M1[i]=t\n now=t\n else:\n M1[i]=now\n \n ",
"t>now",
"t",
"now",
"m1[i]=t",
"m1[i]",
"m1",
"i",
"t",
"M1[i]=t",
"M1[i]",
"M1",
"i",
"t",
"now=t",
"now",
"t",
"M1[i]=now",
"M1[i]",
"M1",
"i",
"now",
"now=1",
"now",
"1",
"for i in range(N-1,-1,-1):\n t=A[i]\n if t>now:\n m2[i]=t\n M2[i]=t\n now=t\n else:\n M2[i]=now\n \n ",
"i",
"range(N-1,-1,-1)",
"range",
"N-1",
"N",
"1",
"-1",
"-1",
"t=A[i]",
"t",
"A[i]",
"A",
"i",
"if t>now:\n m2[i]=t\n M2[i]=t\n now=t\n else:\n M2[i]=now\n \n ",
"t>now",
"t",
"now",
"m2[i]=t",
"m2[i]",
"m2",
"i",
"t",
"M2[i]=t",
"M2[i]",
"M2",
"i",
"t",
"now=t",
"now",
"t",
"M2[i]=now",
"M2[i]",
"M2",
"i",
"now",
"ans=1",
"ans",
"1",
"for i in range(N):\n M=min(M1[i],M2[i])\n m=max(m1[i],m2[i])\n if m>M:\n ans=0\n break\n else:\n ans=(ans*(M-m+1))%mod\n \n ",
"i",
"range(N)",
"range",
"N",
"M=min(M1[i],M2[i])",
"M",
"min(M1[i],M2[i])",
"min",
"M1[i]",
"M1",
"i",
"M2[i]",
"M2",
"i",
"m=max(m1[i],m2[i])",
"m",
"max(m1[i],m2[i])",
"max",
"m1[i]",
"m1",
"i",
"m2[i]",
"m2",
"i",
"if m>M:\n ans=0\n break\n else:\n ans=(ans*(M-m+1))%mod\n \n ",
"m>M",
"m",
"M",
"ans=0",
"ans",
"0",
"break",
"ans=(ans*(M-m+1))%mod",
"ans",
"(ans*(M-m+1))%mod",
"ans*(M-m+1)",
"ans",
"M-m+1",
"M-m",
"M",
"m",
"1",
"mod",
"print(ans)",
"print",
"ans",
"main()",
"main",
"def I(): return int(input())",
"def I(): return int(input())",
"I",
"def LI(): return list(map(int, input().split()))",
"def LI(): return list(map(int, input().split()))",
"LI",
"def main():\n mod=10**9+7\n N=I()\n T=LI()\n A=LI()\n inf=10**9+1\n M1=[inf]*N\n M2=[inf]*N\n m1=[1]*N\n m2=[1]*N\n \n now=1\n for i in range(N):\n t=T[i]\n if t>now:\n m1[i]=t\n M1[i]=t\n now=t\n else:\n M1[i]=now\n \n now=1\n for i in range(N-1,-1,-1):\n t=A[i]\n if t>now:\n m2[i]=t\n M2[i]=t\n now=t\n else:\n M2[i]=now\n \n ans=1\n for i in range(N):\n M=min(M1[i],M2[i])\n m=max(m1[i],m2[i])\n if m>M:\n ans=0\n break\n else:\n ans=(ans*(M-m+1))%mod\n \n print(ans)\n \n ",
"def main():\n mod=10**9+7\n N=I()\n T=LI()\n A=LI()\n inf=10**9+1\n M1=[inf]*N\n M2=[inf]*N\n m1=[1]*N\n m2=[1]*N\n \n now=1\n for i in range(N):\n t=T[i]\n if t>now:\n m1[i]=t\n M1[i]=t\n now=t\n else:\n M1[i]=now\n \n now=1\n for i in range(N-1,-1,-1):\n t=A[i]\n if t>now:\n m2[i]=t\n M2[i]=t\n now=t\n else:\n M2[i]=now\n \n ans=1\n for i in range(N):\n M=min(M1[i],M2[i])\n m=max(m1[i],m2[i])\n if m>M:\n ans=0\n break\n else:\n ans=(ans*(M-m+1))%mod\n \n print(ans)\n \n ",
"main",
"input = sys.stdin.readline",
"sys.stdin.readline",
"input",
"def MI(): return map(int, input().split())",
"def MI(): return map(int, input().split())",
"MI"
] |
import sys
input = sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
N=I()
T=LI()
A=LI()
inf=10**9+1
M1=[inf]*N
M2=[inf]*N
m1=[1]*N
m2=[1]*N
now=1
for i in range(N):
t=T[i]
if t>now:
m1[i]=t
M1[i]=t
now=t
else:
M1[i]=now
now=1
for i in range(N-1,-1,-1):
t=A[i]
if t>now:
m2[i]=t
M2[i]=t
now=t
else:
M2[i]=now
ans=1
for i in range(N):
M=min(M1[i],M2[i])
m=max(m1[i],m2[i])
if m>M:
ans=0
break
else:
ans=(ans*(M-m+1))%mod
print(ans)
main()
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
0,
13,
4,
18,
13,
13,
17,
41,
28,
13,
13,
4,
4,
13,
13,
0,
13,
13,
0,
13,
4,
13,
0,
13,
4,
18,
13,
13,
17,
41,
28,
13,
13,
4,
4,
13,
13,
0,
13,
13,
0,
13,
39,
0,
13,
17,
28,
13,
4,
13,
17,
13,
17,
14,
2,
18,
13,
13,
13,
0,
13,
18,
13,
13,
4,
18,
13,
13,
39,
13,
13,
4,
18,
13,
13,
39,
13,
17,
0,
13,
2,
39,
17,
13,
0,
13,
17,
28,
13,
4,
13,
2,
13,
17,
17,
17,
14,
2,
18,
13,
13,
13,
0,
13,
18,
13,
13,
0,
18,
13,
13,
39,
13,
13,
0,
18,
13,
13,
39,
13,
17,
0,
13,
17,
0,
13,
17,
28,
13,
4,
13,
17,
13,
17,
0,
13,
4,
13,
18,
18,
13,
13,
17,
18,
18,
13,
13,
17,
0,
13,
4,
13,
18,
18,
13,
13,
17,
18,
18,
13,
13,
17,
0,
13,
2,
2,
13,
4,
13,
2,
2,
13,
13,
17,
17,
13,
4,
13,
13,
10,
2,
13,
10,
4,
13,
10,
4,
13,
10,
4,
13,
10,
13,
13,
10,
18,
13,
10,
4,
13,
10,
17,
13,
10,
17,
13,
10,
4,
13,
10,
39,
13,
10,
2,
13,
10,
17,
13,
10,
18,
13,
10,
17,
13,
10,
4,
13,
10,
4,
13,
10,
13,
13
] |
[
[
194,
2
],
[
197,
8
],
[
239,
12
],
[
198,
15
],
[
21,
20
],
[
240,
20
],
[
20,
25
],
[
242,
27
],
[
236,
30
],
[
200,
34
],
[
237,
37
],
[
198,
37
],
[
43,
42
],
[
201,
42
],
[
240,
42
],
[
42,
47
],
[
203,
49
],
[
221,
52
],
[
233,
55
],
[
59,
58
],
[
195,
62
],
[
243,
67
],
[
58,
68
],
[
234,
69
],
[
231,
69
],
[
230,
71
],
[
243,
73
],
[
58,
74
],
[
222,
77
],
[
222,
84
],
[
224,
90
],
[
195,
94
],
[
212,
96
],
[
100,
99
],
[
195,
103
],
[
204,
110
],
[
99,
111
],
[
213,
112
],
[
231,
112
],
[
234,
112
],
[
207,
112
],
[
206,
114
],
[
204,
116
],
[
99,
117
],
[
122,
119
],
[
225,
120
],
[
99,
121
],
[
129,
126
],
[
225,
127
],
[
99,
128
],
[
215,
133
],
[
227,
136
],
[
140,
139
],
[
195,
143
],
[
209,
146
],
[
126,
150
],
[
119,
150
],
[
225,
151
],
[
139,
152
],
[
222,
156
],
[
139,
157
],
[
218,
160
],
[
126,
164
],
[
119,
164
],
[
225,
165
],
[
139,
166
],
[
222,
170
],
[
139,
171
],
[
191,
174
],
[
216,
177
],
[
192,
177
],
[
210,
182
],
[
219,
183
],
[
228,
186
],
[
192,
189
],
[
216,
189
],
[
191,
192
],
[
194,
195
],
[
197,
198
],
[
200,
201
],
[
203,
204
],
[
206,
207
],
[
209,
210
],
[
212,
213
],
[
215,
216
],
[
218,
219
],
[
221,
222
],
[
224,
225
],
[
227,
228
],
[
230,
231
],
[
233,
234
],
[
236,
237
],
[
239,
240
],
[
242,
243
]
] |
[
"#coding=UTF-8\n\nN=int(input())\nmozir=input()\nhyo=mozir.split(' ')\n\nRec_LTR=[int(mono) for mono in hyo]\n\nmozir=input()\nhyo=mozir.split(' ')\n\nRec_RTL=[int(mono) for mono in hyo]\n\nLTR_hani=[]\nhighest=0\nfor idx in range(0,N,1):\n if Rec_LTR[idx]>highest:\n highest=Rec_LTR[idx]\n LTR_hani.append([highest,highest])\n else:\n LTR_hani.append([highest,1])\n\nRTL_hani=[None]*N\nhighest=0\nfor idx in range(N-1,-1,-1):\n if Rec_RTL[idx]>highest:\n highest=Rec_RTL[idx]\n RTL_hani[idx]=[highest,highest]\n else:\n RTL_hani[idx]=[highest,1]\n\n#concat\nans=1\nhou=1000000007\nfor idx in range(0,N,1):\n # prod set\n ue=min(RTL_hani[idx][0],LTR_hani[idx][0])\n shita=max(RTL_hani[idx][1],LTR_hani[idx][1])\n ans=(ans*max((ue-shita+1),0))%hou\n\nprint(ans)",
"N=int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"mozir=input()",
"mozir",
"input()",
"input",
"hyo=mozir.split(' ')",
"hyo",
"mozir.split(' ')",
"mozir.split",
"mozir",
"split",
"' '",
"int(mono) for mono in hyo",
"for mono in hyo",
"mono",
"hyo",
"for mono in hyo",
"int(mono)",
"int",
"mono",
"Rec_LTR=[int(mono) for mono in hyo]",
"Rec_LTR",
"[int(mono) for mono in hyo]",
"mozir=input()",
"mozir",
"input()",
"input",
"hyo=mozir.split(' ')",
"hyo",
"mozir.split(' ')",
"mozir.split",
"mozir",
"split",
"' '",
"int(mono) for mono in hyo",
"for mono in hyo",
"mono",
"hyo",
"for mono in hyo",
"int(mono)",
"int",
"mono",
"Rec_RTL=[int(mono) for mono in hyo]",
"Rec_RTL",
"[int(mono) for mono in hyo]",
"LTR_hani=[]",
"LTR_hani",
"[]",
"highest=0",
"highest",
"0",
"for idx in range(0,N,1):\n if Rec_LTR[idx]>highest:\n highest=Rec_LTR[idx]\n LTR_hani.append([highest,highest])\n else:\n LTR_hani.append([highest,1])",
"idx",
"range(0,N,1)",
"range",
"0",
"N",
"1",
"if Rec_LTR[idx]>highest:\n highest=Rec_LTR[idx]\n LTR_hani.append([highest,highest])\n else:\n LTR_hani.append([highest,1])",
"Rec_LTR[idx]>highest",
"Rec_LTR[idx]",
"Rec_LTR",
"idx",
"highest",
"highest=Rec_LTR[idx]",
"highest",
"Rec_LTR[idx]",
"Rec_LTR",
"idx",
"LTR_hani.append([highest,highest])",
"LTR_hani.append",
"LTR_hani",
"append",
"[highest,highest]",
"highest",
"highest",
"LTR_hani.append([highest,1])",
"LTR_hani.append",
"LTR_hani",
"append",
"[highest,1]",
"highest",
"1",
"RTL_hani=[None]*N",
"RTL_hani",
"[None]*N",
"[None]",
"None",
"N",
"highest=0",
"highest",
"0",
"for idx in range(N-1,-1,-1):\n if Rec_RTL[idx]>highest:\n highest=Rec_RTL[idx]\n RTL_hani[idx]=[highest,highest]\n else:\n RTL_hani[idx]=[highest,1]\n\n#concat",
"idx",
"range(N-1,-1,-1)",
"range",
"N-1",
"N",
"1",
"-1",
"-1",
"if Rec_RTL[idx]>highest:\n highest=Rec_RTL[idx]\n RTL_hani[idx]=[highest,highest]\n else:\n RTL_hani[idx]=[highest,1]\n\n#concat",
"Rec_RTL[idx]>highest",
"Rec_RTL[idx]",
"Rec_RTL",
"idx",
"highest",
"highest=Rec_RTL[idx]",
"highest",
"Rec_RTL[idx]",
"Rec_RTL",
"idx",
"RTL_hani[idx]=[highest,highest]",
"RTL_hani[idx]",
"RTL_hani",
"idx",
"[highest,highest]",
"highest",
"highest",
"RTL_hani[idx]=[highest,1]",
"RTL_hani[idx]",
"RTL_hani",
"idx",
"[highest,1]",
"highest",
"1",
"ans=1",
"ans",
"1",
"hou=1000000007",
"hou",
"1000000007",
"for idx in range(0,N,1):\n # prod set\n ue=min(RTL_hani[idx][0],LTR_hani[idx][0])\n shita=max(RTL_hani[idx][1],LTR_hani[idx][1])\n ans=(ans*max((ue-shita+1),0))%hou",
"idx",
"range(0,N,1)",
"range",
"0",
"N",
"1",
"ue=min(RTL_hani[idx][0],LTR_hani[idx][0])",
"ue",
"min(RTL_hani[idx][0],LTR_hani[idx][0])",
"min",
"RTL_hani[idx][0]",
"[idx]",
"RTL_hani",
"idx",
"0",
"LTR_hani[idx][0]",
"[idx]",
"LTR_hani",
"idx",
"0",
"shita=max(RTL_hani[idx][1],LTR_hani[idx][1])",
"shita",
"max(RTL_hani[idx][1],LTR_hani[idx][1])",
"max",
"RTL_hani[idx][1]",
"[idx]",
"RTL_hani",
"idx",
"1",
"LTR_hani[idx][1]",
"[idx]",
"LTR_hani",
"idx",
"1",
"ans=(ans*max((ue-shita+1),0))%hou",
"ans",
"(ans*max((ue-shita+1),0))%hou",
"ans*max((ue-shita+1),0)",
"ans",
"max((ue-shita+1),0)",
"max",
"ue-shita+1",
"ue-shita",
"ue",
"shita",
"1",
"0",
"hou",
"print(ans)",
"print",
"ans",
"ans=(ans*max((ue-shita+1),0))%hou",
"(ans*max((ue-shita+1),0))%hou",
"ans",
"N=int(input())",
"int(input())",
"N",
"mozir=input()",
"input()",
"mozir",
"hyo=mozir.split(' ')",
"mozir.split(' ')",
"hyo",
"Rec_RTL=[int(mono) for mono in hyo]",
"[int(mono) for mono in hyo]",
"Rec_RTL",
"highest=Rec_RTL[idx]",
"Rec_RTL[idx]",
"highest",
"ue=min(RTL_hani[idx][0],LTR_hani[idx][0])",
"min(RTL_hani[idx][0],LTR_hani[idx][0])",
"ue",
"highest=0",
"0",
"highest",
"ans=1",
"1",
"ans",
"shita=max(RTL_hani[idx][1],LTR_hani[idx][1])",
"max(RTL_hani[idx][1],LTR_hani[idx][1])",
"shita",
"LTR_hani=[]",
"[]",
"LTR_hani",
"RTL_hani=[None]*N",
"[None]*N",
"RTL_hani",
"hou=1000000007",
"1000000007",
"hou",
"highest=Rec_LTR[idx]",
"Rec_LTR[idx]",
"highest",
"highest=0",
"0",
"highest",
"mozir=input()",
"input()",
"mozir",
"hyo=mozir.split(' ')",
"mozir.split(' ')",
"hyo",
"Rec_LTR=[int(mono) for mono in hyo]",
"[int(mono) for mono in hyo]",
"Rec_LTR"
] |
#coding=UTF-8
N=int(input())
mozir=input()
hyo=mozir.split(' ')
Rec_LTR=[int(mono) for mono in hyo]
mozir=input()
hyo=mozir.split(' ')
Rec_RTL=[int(mono) for mono in hyo]
LTR_hani=[]
highest=0
for idx in range(0,N,1):
if Rec_LTR[idx]>highest:
highest=Rec_LTR[idx]
LTR_hani.append([highest,highest])
else:
LTR_hani.append([highest,1])
RTL_hani=[None]*N
highest=0
for idx in range(N-1,-1,-1):
if Rec_RTL[idx]>highest:
highest=Rec_RTL[idx]
RTL_hani[idx]=[highest,highest]
else:
RTL_hani[idx]=[highest,1]
#concat
ans=1
hou=1000000007
for idx in range(0,N,1):
# prod set
ue=min(RTL_hani[idx][0],LTR_hani[idx][0])
shita=max(RTL_hani[idx][1],LTR_hani[idx][1])
ans=(ans*max((ue-shita+1),0))%hou
print(ans)
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
2,
39,
17,
13,
0,
13,
17,
0,
18,
13,
17,
18,
13,
17,
28,
13,
4,
13,
17,
13,
14,
40,
18,
13,
13,
18,
13,
2,
13,
17,
0,
18,
13,
13,
18,
13,
13,
0,
18,
13,
13,
2,
17,
18,
13,
13,
0,
18,
13,
2,
13,
17,
18,
13,
2,
13,
17,
28,
13,
4,
13,
17,
13,
14,
40,
18,
13,
2,
2,
13,
13,
17,
18,
13,
2,
13,
13,
14,
2,
2,
2,
18,
13,
2,
2,
13,
13,
17,
17,
2,
18,
13,
2,
2,
13,
13,
17,
2,
17,
18,
13,
2,
2,
13,
13,
17,
2,
2,
18,
13,
2,
2,
13,
13,
17,
17,
2,
18,
13,
2,
2,
13,
13,
17,
18,
13,
2,
2,
13,
13,
17,
0,
13,
17,
3,
0,
18,
13,
2,
2,
13,
13,
17,
18,
13,
2,
2,
13,
13,
17,
0,
18,
13,
2,
2,
13,
13,
17,
4,
13,
2,
17,
18,
13,
2,
2,
13,
13,
17,
18,
13,
2,
2,
13,
13,
17,
14,
2,
13,
17,
14,
2,
18,
13,
17,
18,
13,
17,
4,
13,
17,
4,
13,
17,
14,
2,
13,
17,
0,
13,
2,
2,
17,
17,
17,
0,
13,
17,
28,
13,
4,
13,
13,
14,
2,
18,
13,
13,
17,
0,
13,
2,
2,
13,
2,
17,
18,
13,
13,
13,
4,
13,
13,
4,
13,
17,
10,
2,
13,
10,
4,
13,
10,
4,
13,
10,
17,
13,
10,
17,
13,
10,
2,
13,
10,
2,
13,
10,
4,
13,
10,
17,
13
] |
[
[
291,
2
],
[
273,
8
],
[
276,
20
],
[
270,
32
],
[
292,
36
],
[
279,
38
],
[
44,
41
],
[
271,
42
],
[
274,
45
],
[
49,
48
],
[
292,
52
],
[
274,
56
],
[
48,
57
],
[
274,
59
],
[
48,
61
],
[
67,
64
],
[
271,
65
],
[
48,
66
],
[
274,
68
],
[
48,
69
],
[
74,
71
],
[
271,
72
],
[
48,
73
],
[
274,
77
],
[
48,
78
],
[
85,
80
],
[
271,
81
],
[
292,
83
],
[
277,
86
],
[
292,
88
],
[
92,
91
],
[
292,
95
],
[
277,
99
],
[
292,
102
],
[
91,
103
],
[
277,
106
],
[
292,
108
],
[
91,
109
],
[
271,
115
],
[
292,
118
],
[
91,
119
],
[
277,
124
],
[
292,
127
],
[
91,
128
],
[
271,
133
],
[
292,
136
],
[
91,
137
],
[
271,
142
],
[
292,
145
],
[
91,
146
],
[
277,
151
],
[
292,
154
],
[
91,
155
],
[
271,
158
],
[
292,
161
],
[
91,
162
],
[
282,
165
],
[
176,
169
],
[
271,
170
],
[
292,
173
],
[
91,
174
],
[
277,
177
],
[
292,
180
],
[
91,
181
],
[
191,
184
],
[
271,
185
],
[
292,
188
],
[
91,
189
],
[
277,
196
],
[
292,
199
],
[
91,
200
],
[
271,
203
],
[
292,
206
],
[
91,
207
],
[
292,
211
],
[
277,
216
],
[
274,
219
],
[
283,
229
],
[
280,
229
],
[
288,
232
],
[
294,
239
],
[
243,
242
],
[
292,
245
],
[
71,
248
],
[
64,
248
],
[
271,
249
],
[
242,
250
],
[
285,
253
],
[
295,
256
],
[
286,
256
],
[
71,
259
],
[
64,
259
],
[
271,
260
],
[
242,
261
],
[
289,
262
],
[
286,
265
],
[
295,
265
],
[
270,
271
],
[
273,
274
],
[
276,
277
],
[
279,
280
],
[
282,
283
],
[
285,
286
],
[
288,
289
],
[
291,
292
],
[
294,
295
]
] |
[
"N = int(input())\nT = list(map(int,input().split()))\nA = list(map(int,input().split()))\nH = [0]*N\nflag=0\n\nH[0]=T[0]\nfor i in range(1,N):\n if T[i]!=T[i-1]:\n H[i]=T[i]\n else:\n H[i] = -1*T[i]\n\nH[N-1]=A[N-1]\n\nfor i in range(1,N):\n if A[N-i-1]!=A[N-i]:\n if (H[N-i-1]<0 and A[N-i-1] > -1*H[N-i-1]) or (H[N-i-1]>0 and A[N-i-1] > H[N-i-1]):\n flag=1\n break\n H[N-i-1]=A[N-i-1]\n else:\n H[N-i-1]=max(-1*A[N-i-1],H[N-i-1])\nif N==1:\n if A[0]==T[0]:\n print(1)\n else:\n print(0)\n\nelif flag==0:\n p = 10**9+7\n out = 1\n for i in range(N):\n if H[i]<0:\n out = out * (-1*H[i]) % p\n print(out)\nelse:\n print(0)",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"T = list(map(int,input().split()))",
"T",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"A = list(map(int,input().split()))",
"A",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"H = [0]*N",
"H",
"[0]*N",
"[0]",
"0",
"N",
"flag=0",
"flag",
"0",
"H[0]=T[0]",
"H[0]",
"H",
"0",
"T[0]",
"T",
"0",
"for i in range(1,N):\n if T[i]!=T[i-1]:\n H[i]=T[i]\n else:\n H[i] = -1*T[i]",
"i",
"range(1,N)",
"range",
"1",
"N",
"if T[i]!=T[i-1]:\n H[i]=T[i]\n else:\n H[i] = -1*T[i]",
"T[i]!=T[i-1]",
"T[i]",
"T",
"i",
"T[i-1]",
"T",
"i-1",
"i",
"1",
"H[i]=T[i]",
"H[i]",
"H",
"i",
"T[i]",
"T",
"i",
"H[i] = -1*T[i]",
"H[i]",
"H",
"i",
"-1*T[i]",
"-1",
"T[i]",
"T",
"i",
"H[N-1]=A[N-1]",
"H[N-1]",
"H",
"N-1",
"N",
"1",
"A[N-1]",
"A",
"N-1",
"N",
"1",
"for i in range(1,N):\n if A[N-i-1]!=A[N-i]:\n if (H[N-i-1]<0 and A[N-i-1] > -1*H[N-i-1]) or (H[N-i-1]>0 and A[N-i-1] > H[N-i-1]):\n flag=1\n break\n H[N-i-1]=A[N-i-1]\n else:\n H[N-i-1]=max(-1*A[N-i-1],H[N-i-1])",
"i",
"range(1,N)",
"range",
"1",
"N",
"if A[N-i-1]!=A[N-i]:\n if (H[N-i-1]<0 and A[N-i-1] > -1*H[N-i-1]) or (H[N-i-1]>0 and A[N-i-1] > H[N-i-1]):\n flag=1\n break\n H[N-i-1]=A[N-i-1]\n else:\n H[N-i-1]=max(-1*A[N-i-1],H[N-i-1])",
"A[N-i-1]!=A[N-i]",
"A[N-i-1]",
"A",
"N-i-1",
"N-i",
"N",
"i",
"1",
"A[N-i]",
"A",
"N-i",
"N",
"i",
"if (H[N-i-1]<0 and A[N-i-1] > -1*H[N-i-1]) or (H[N-i-1]>0 and A[N-i-1] > H[N-i-1]):\n flag=1\n break\n ",
"(H[N-i-1]<0 and A[N-i-1] > -1*H[N-i-1]) or (H[N-i-1]>0 and A[N-i-1] > H[N-i-1])",
"H[N-i-1]<0 and A[N-i-1] > -1*H[N-i-1]",
"H[N-i-1]<0",
"H[N-i-1]",
"H",
"N-i-1",
"N-i",
"N",
"i",
"1",
"0",
"A[N-i-1] > -1*H[N-i-1]",
"A[N-i-1]",
"A",
"N-i-1",
"N-i",
"N",
"i",
"1",
"-1*H[N-i-1]",
"-1",
"H[N-i-1]",
"H",
"N-i-1",
"N-i",
"N",
"i",
"1",
"H[N-i-1]>0 and A[N-i-1] > H[N-i-1]",
"H[N-i-1]>0",
"H[N-i-1]",
"H",
"N-i-1",
"N-i",
"N",
"i",
"1",
"0",
"A[N-i-1] > H[N-i-1]",
"A[N-i-1]",
"A",
"N-i-1",
"N-i",
"N",
"i",
"1",
"H[N-i-1]",
"H",
"N-i-1",
"N-i",
"N",
"i",
"1",
"flag=1",
"flag",
"1",
"break",
"H[N-i-1]=A[N-i-1]",
"H[N-i-1]",
"H",
"N-i-1",
"N-i",
"N",
"i",
"1",
"A[N-i-1]",
"A",
"N-i-1",
"N-i",
"N",
"i",
"1",
"H[N-i-1]=max(-1*A[N-i-1],H[N-i-1])",
"H[N-i-1]",
"H",
"N-i-1",
"N-i",
"N",
"i",
"1",
"max(-1*A[N-i-1],H[N-i-1])",
"max",
"-1*A[N-i-1]",
"-1",
"A[N-i-1]",
"A",
"N-i-1",
"N-i",
"N",
"i",
"1",
"H[N-i-1]",
"H",
"N-i-1",
"N-i",
"N",
"i",
"1",
"if N==1:\n if A[0]==T[0]:\n print(1)\n else:\n print(0)\n\nelif flag==0:\n p = 10**9+7\n out = 1\n for i in range(N):\n if H[i]<0:\n out = out * (-1*H[i]) % p\n print(out)\nelse:\n print(0)",
"N==1",
"N",
"1",
"if A[0]==T[0]:\n print(1)\n else:\n print(0)",
"A[0]==T[0]",
"A[0]",
"A",
"0",
"T[0]",
"T",
"0",
"print(1)",
"print",
"1",
"print(0)",
"print",
"0",
"elif flag==0:\n p = 10**9+7\n out = 1\n for i in range(N):\n if H[i]<0:\n out = out * (-1*H[i]) % p\n print(out)",
"flag==0",
"flag",
"0",
"p = 10**9+7",
"p",
"10**9+7",
"10**9",
"10",
"9",
"7",
"out = 1",
"out",
"1",
"for i in range(N):\n if H[i]<0:\n out = out * (-1*H[i]) % p\n ",
"i",
"range(N)",
"range",
"N",
"if H[i]<0:\n out = out * (-1*H[i]) % p\n ",
"H[i]<0",
"H[i]",
"H",
"i",
"0",
"out = out * (-1*H[i]) % p",
"out",
"out * (-1*H[i]) % p",
"out * (-1*H[i])",
"out",
"-1*H[i]",
"-1",
"H[i]",
"H",
"i",
"p",
"print(out)",
"print",
"out",
"print(0)",
"print",
"0",
"H = [0]*N",
"[0]*N",
"H",
"T = list(map(int,input().split()))",
"list(map(int,input().split()))",
"T",
"A = list(map(int,input().split()))",
"list(map(int,input().split()))",
"A",
"flag=0",
"0",
"flag",
"flag=1",
"1",
"flag",
"out = out * (-1*H[i]) % p",
"out * (-1*H[i]) % p",
"out",
"p = 10**9+7",
"10**9+7",
"p",
"N = int(input())",
"int(input())",
"N",
"out = 1",
"1",
"out"
] |
N = int(input())
T = list(map(int,input().split()))
A = list(map(int,input().split()))
H = [0]*N
flag=0
H[0]=T[0]
for i in range(1,N):
if T[i]!=T[i-1]:
H[i]=T[i]
else:
H[i] = -1*T[i]
H[N-1]=A[N-1]
for i in range(1,N):
if A[N-i-1]!=A[N-i]:
if (H[N-i-1]<0 and A[N-i-1] > -1*H[N-i-1]) or (H[N-i-1]>0 and A[N-i-1] > H[N-i-1]):
flag=1
break
H[N-i-1]=A[N-i-1]
else:
H[N-i-1]=max(-1*A[N-i-1],H[N-i-1])
if N==1:
if A[0]==T[0]:
print(1)
else:
print(0)
elif flag==0:
p = 10**9+7
out = 1
for i in range(N):
if H[i]<0:
out = out * (-1*H[i]) % p
print(out)
else:
print(0)
|
[
7,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
0,
13,
13,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
0,
13,
13,
0,
13,
4,
13,
4,
13,
13,
41,
28,
13,
4,
13,
2,
13,
17,
4,
17,
0,
13,
2,
39,
18,
13,
17,
13,
41,
28,
13,
4,
13,
2,
13,
17,
4,
17,
0,
13,
2,
39,
18,
13,
17,
13,
28,
13,
4,
13,
2,
13,
17,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
18,
13,
2,
13,
17,
18,
13,
2,
13,
17,
14,
2,
18,
13,
13,
18,
13,
2,
13,
17,
0,
18,
13,
2,
13,
17,
18,
13,
2,
13,
17,
4,
18,
13,
13,
0,
13,
2,
2,
17,
17,
17,
0,
13,
17,
28,
13,
4,
13,
13,
14,
2,
40,
18,
13,
13,
17,
40,
18,
13,
13,
17,
14,
40,
18,
13,
13,
18,
13,
13,
0,
13,
17,
14,
2,
2,
18,
13,
13,
17,
2,
18,
13,
13,
17,
0,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
13,
13,
14,
2,
40,
18,
13,
13,
17,
2,
18,
13,
13,
18,
13,
13,
0,
13,
17,
14,
2,
40,
18,
13,
13,
17,
2,
18,
13,
13,
18,
13,
13,
0,
13,
17,
4,
13,
13,
10,
17,
13,
10,
17,
13,
10,
13,
13,
10,
13,
13,
10,
4,
13,
10,
2,
13,
10,
13,
13,
10,
17,
13,
10,
2,
13,
10,
17,
13,
10,
4,
13,
10,
4,
13,
10,
2,
13
] |
[
[
246,
2
],
[
10,
9
],
[
9,
18
],
[
243,
20
],
[
25,
24
],
[
24,
33
],
[
252,
35
],
[
264,
38
],
[
253,
43
],
[
47,
46
],
[
247,
50
],
[
270,
55
],
[
244,
59
],
[
65,
64
],
[
247,
68
],
[
258,
73
],
[
265,
77
],
[
82,
81
],
[
247,
85
],
[
244,
90
],
[
81,
91
],
[
244,
93
],
[
81,
95
],
[
103,
98
],
[
271,
99
],
[
81,
101
],
[
244,
104
],
[
81,
106
],
[
265,
111
],
[
81,
112
],
[
265,
114
],
[
81,
116
],
[
124,
119
],
[
259,
120
],
[
81,
122
],
[
265,
125
],
[
81,
127
],
[
259,
131
],
[
249,
134
],
[
261,
141
],
[
145,
144
],
[
247,
147
],
[
259,
152
],
[
144,
153
],
[
271,
157
],
[
144,
158
],
[
259,
163
],
[
144,
164
],
[
271,
166
],
[
144,
167
],
[
234,
169
],
[
259,
175
],
[
144,
176
],
[
271,
180
],
[
144,
181
],
[
267,
184
],
[
253,
188
],
[
144,
189
],
[
244,
191
],
[
144,
192
],
[
240,
194
],
[
250,
195
],
[
259,
200
],
[
144,
201
],
[
259,
205
],
[
144,
206
],
[
244,
208
],
[
144,
209
],
[
255,
211
],
[
271,
217
],
[
144,
218
],
[
271,
222
],
[
144,
223
],
[
253,
225
],
[
144,
226
],
[
237,
228
],
[
238,
232
],
[
256,
232
],
[
241,
232
],
[
268,
232
],
[
235,
232
],
[
262,
232
],
[
234,
235
],
[
237,
238
],
[
250,
240
],
[
240,
241
],
[
243,
244
],
[
246,
247
],
[
249,
250
],
[
252,
253
],
[
255,
256
],
[
258,
259
],
[
261,
262
],
[
264,
265
],
[
267,
268
],
[
270,
271
]
] |
[
"n = int(input())\n\nt_list = [ int(v) for v in input().split() ]\na_list = [ int(v) for v in input().split() ]\na_list_reverse = list(reversed(a_list))\n\nt_confirm_list = [t_list[0]] + [None for i in range(n-1)]\na_confirm_list = [a_list_reverse[0]] + [None for i in range(n-1)]\n\n\nfor i in range(n-1):\n if t_list[i] < t_list[i+1]:\n t_confirm_list[i+1] = t_list[i+1]\n if a_list_reverse[i] < a_list_reverse[i+1]:\n a_confirm_list[i+1] = a_list_reverse[i+1]\n\na_confirm_list.reverse()\n\n\nmod = 10**9+7\nans = 1\nfor i in range(n):\n if a_confirm_list[i] != None and t_confirm_list[i] != None:\n if a_confirm_list[i] != t_confirm_list[i]:\n ans = 0\n elif a_confirm_list[i] == None and t_confirm_list[i] == None:\n ans *= min(a_list[i],t_list[i])\n ans %= mod\n elif a_confirm_list[i] is not None and a_confirm_list[i] > t_list[i]:\n ans = 0\n elif t_confirm_list[i] is not None and t_confirm_list[i] > a_list[i]:\n ans = 0\n\nprint(ans) ",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"int(v) for v in input().split()",
"for v in input().split()",
"v",
"input().split()",
"().split",
"()",
"input",
"split",
"for v in input().split()",
"int(v)",
"int",
"v",
"t_list = [ int(v) for v in input().split() ]",
"t_list",
"[ int(v) for v in input().split() ]",
"int(v) for v in input().split()",
"for v in input().split()",
"v",
"input().split()",
"().split",
"()",
"input",
"split",
"for v in input().split()",
"int(v)",
"int",
"v",
"a_list = [ int(v) for v in input().split() ]",
"a_list",
"[ int(v) for v in input().split() ]",
"a_list_reverse = list(reversed(a_list))",
"a_list_reverse",
"list(reversed(a_list))",
"list",
"reversed(a_list)",
"reversed",
"a_list",
"None for i in range(n-1)",
"for i in range(n-1)",
"i",
"range(n-1)",
"range",
"n-1",
"n",
"1",
"for i in range(n-1)",
"None",
"t_confirm_list = [t_list[0]] + [None for i in range(n-1)]",
"t_confirm_list",
"[t_list[0]] + [None for i in range(n-1)]",
"[t_list[0]]",
"t_list[0]",
"t_list",
"0",
"[None for i in range(n-1)]",
"None for i in range(n-1)",
"for i in range(n-1)",
"i",
"range(n-1)",
"range",
"n-1",
"n",
"1",
"for i in range(n-1)",
"None",
"a_confirm_list = [a_list_reverse[0]] + [None for i in range(n-1)]",
"a_confirm_list",
"[a_list_reverse[0]] + [None for i in range(n-1)]",
"[a_list_reverse[0]]",
"a_list_reverse[0]",
"a_list_reverse",
"0",
"[None for i in range(n-1)]",
"for i in range(n-1):\n if t_list[i] < t_list[i+1]:\n t_confirm_list[i+1] = t_list[i+1]\n if a_list_reverse[i] < a_list_reverse[i+1]:\n a_confirm_list[i+1] = a_list_reverse[i+1]",
"i",
"range(n-1)",
"range",
"n-1",
"n",
"1",
"if t_list[i] < t_list[i+1]:\n t_confirm_list[i+1] = t_list[i+1]\n ",
"t_list[i] < t_list[i+1]",
"t_list[i]",
"t_list",
"i",
"t_list[i+1]",
"t_list",
"i+1",
"i",
"1",
"t_confirm_list[i+1] = t_list[i+1]",
"t_confirm_list[i+1]",
"t_confirm_list",
"i+1",
"i",
"1",
"t_list[i+1]",
"t_list",
"i+1",
"i",
"1",
"if a_list_reverse[i] < a_list_reverse[i+1]:\n a_confirm_list[i+1] = a_list_reverse[i+1]",
"a_list_reverse[i] < a_list_reverse[i+1]",
"a_list_reverse[i]",
"a_list_reverse",
"i",
"a_list_reverse[i+1]",
"a_list_reverse",
"i+1",
"i",
"1",
"a_confirm_list[i+1] = a_list_reverse[i+1]",
"a_confirm_list[i+1]",
"a_confirm_list",
"i+1",
"i",
"1",
"a_list_reverse[i+1]",
"a_list_reverse",
"i+1",
"i",
"1",
"a_confirm_list.reverse()",
"a_confirm_list.reverse",
"a_confirm_list",
"reverse",
"mod = 10**9+7",
"mod",
"10**9+7",
"10**9",
"10",
"9",
"7",
"ans = 1",
"ans",
"1",
"for i in range(n):\n if a_confirm_list[i] != None and t_confirm_list[i] != None:\n if a_confirm_list[i] != t_confirm_list[i]:\n ans = 0\n elif a_confirm_list[i] == None and t_confirm_list[i] == None:\n ans *= min(a_list[i],t_list[i])\n ans %= mod\n elif a_confirm_list[i] is not None and a_confirm_list[i] > t_list[i]:\n ans = 0\n elif t_confirm_list[i] is not None and t_confirm_list[i] > a_list[i]:\n ans = 0",
"i",
"range(n)",
"range",
"n",
"if a_confirm_list[i] != None and t_confirm_list[i] != None:\n if a_confirm_list[i] != t_confirm_list[i]:\n ans = 0\n elif a_confirm_list[i] == None and t_confirm_list[i] == None:\n ans *= min(a_list[i],t_list[i])\n ans %= mod\n elif a_confirm_list[i] is not None and a_confirm_list[i] > t_list[i]:\n ans = 0\n elif t_confirm_list[i] is not None and t_confirm_list[i] > a_list[i]:\n ans = 0",
"a_confirm_list[i] != None and t_confirm_list[i] != None",
"a_confirm_list[i] != None",
"a_confirm_list[i]",
"a_confirm_list",
"i",
"None",
"t_confirm_list[i] != None",
"t_confirm_list[i]",
"t_confirm_list",
"i",
"None",
"if a_confirm_list[i] != t_confirm_list[i]:\n ans = 0\n ",
"a_confirm_list[i] != t_confirm_list[i]",
"a_confirm_list[i]",
"a_confirm_list",
"i",
"t_confirm_list[i]",
"t_confirm_list",
"i",
"ans = 0",
"ans",
"0",
"elif a_confirm_list[i] == None and t_confirm_list[i] == None:\n ans *= min(a_list[i],t_list[i])\n ans %= mod\n ",
"a_confirm_list[i] == None and t_confirm_list[i] == None",
"a_confirm_list[i] == None",
"a_confirm_list[i]",
"a_confirm_list",
"i",
"None",
"t_confirm_list[i] == None",
"t_confirm_list[i]",
"t_confirm_list",
"i",
"None",
"ans *= min(a_list[i],t_list[i])",
"ans",
"min(a_list[i],t_list[i])",
"min",
"a_list[i]",
"a_list",
"i",
"t_list[i]",
"t_list",
"i",
"ans %= mod",
"ans",
"mod",
"elif a_confirm_list[i] is not None and a_confirm_list[i] > t_list[i]:\n ans = 0\n ",
"a_confirm_list[i] is not None and a_confirm_list[i] > t_list[i]",
"a_confirm_list[i] is not None",
"a_confirm_list[i]",
"a_confirm_list",
"i",
"None",
"a_confirm_list[i] > t_list[i]",
"a_confirm_list[i]",
"a_confirm_list",
"i",
"t_list[i]",
"t_list",
"i",
"ans = 0",
"ans",
"0",
"elif t_confirm_list[i] is not None and t_confirm_list[i] > a_list[i]:\n ans = 0",
"t_confirm_list[i] is not None and t_confirm_list[i] > a_list[i]",
"t_confirm_list[i] is not None",
"t_confirm_list[i]",
"t_confirm_list",
"i",
"None",
"t_confirm_list[i] > a_list[i]",
"t_confirm_list[i]",
"t_confirm_list",
"i",
"a_list[i]",
"a_list",
"i",
"ans = 0",
"ans",
"0",
"print(ans)",
"print",
"ans",
"ans = 0",
"0",
"ans",
"ans = 0",
"0",
"ans",
"ans %= mod",
"mod",
"ans",
"t_list = [ int(v) for v in input().split() ]",
"[ int(v) for v in input().split() ]",
"t_list",
"n = int(input())",
"int(input())",
"n",
"mod = 10**9+7",
"10**9+7",
"mod",
"a_list = [ int(v) for v in input().split() ]",
"[ int(v) for v in input().split() ]",
"a_list",
"ans = 0",
"0",
"ans",
"a_confirm_list = [a_list_reverse[0]] + [None for i in range(n-1)]",
"[a_list_reverse[0]] + [None for i in range(n-1)]",
"a_confirm_list",
"ans = 1",
"1",
"ans",
"a_list_reverse = list(reversed(a_list))",
"list(reversed(a_list))",
"a_list_reverse",
"ans *= min(a_list[i],t_list[i])",
"min(a_list[i],t_list[i])",
"ans",
"t_confirm_list = [t_list[0]] + [None for i in range(n-1)]",
"[t_list[0]] + [None for i in range(n-1)]",
"t_confirm_list"
] |
n = int(input())
t_list = [ int(v) for v in input().split() ]
a_list = [ int(v) for v in input().split() ]
a_list_reverse = list(reversed(a_list))
t_confirm_list = [t_list[0]] + [None for i in range(n-1)]
a_confirm_list = [a_list_reverse[0]] + [None for i in range(n-1)]
for i in range(n-1):
if t_list[i] < t_list[i+1]:
t_confirm_list[i+1] = t_list[i+1]
if a_list_reverse[i] < a_list_reverse[i+1]:
a_confirm_list[i+1] = a_list_reverse[i+1]
a_confirm_list.reverse()
mod = 10**9+7
ans = 1
for i in range(n):
if a_confirm_list[i] != None and t_confirm_list[i] != None:
if a_confirm_list[i] != t_confirm_list[i]:
ans = 0
elif a_confirm_list[i] == None and t_confirm_list[i] == None:
ans *= min(a_list[i],t_list[i])
ans %= mod
elif a_confirm_list[i] is not None and a_confirm_list[i] > t_list[i]:
ans = 0
elif t_confirm_list[i] is not None and t_confirm_list[i] > a_list[i]:
ans = 0
print(ans)
|
[
7,
15,
13,
15,
13,
15,
13,
15,
13,
15,
13,
4,
18,
13,
13,
2,
17,
17,
0,
13,
2,
17,
17,
0,
13,
2,
2,
17,
17,
17,
0,
13,
12,
4,
13,
4,
18,
4,
18,
18,
13,
13,
13,
13,
0,
13,
12,
4,
13,
13,
4,
18,
4,
18,
4,
18,
18,
13,
13,
13,
13,
13,
0,
13,
12,
4,
13,
4,
13,
13,
4,
18,
4,
18,
4,
18,
18,
13,
13,
13,
13,
13,
0,
13,
12,
4,
13,
4,
13,
12,
2,
4,
13,
13,
17,
23,
4,
18,
4,
18,
4,
18,
18,
13,
13,
13,
13,
13,
12,
13,
0,
13,
4,
13,
0,
13,
4,
13,
0,
13,
4,
13,
41,
28,
13,
4,
13,
13,
4,
39,
17,
17,
0,
13,
13,
41,
28,
13,
4,
13,
13,
4,
39,
17,
17,
0,
13,
13,
0,
13,
17,
0,
13,
17,
28,
13,
13,
4,
13,
13,
14,
2,
13,
13,
0,
18,
13,
13,
39,
13,
17,
14,
2,
13,
13,
0,
18,
18,
13,
13,
17,
13,
0,
13,
17,
3,
0,
13,
13,
0,
13,
17,
28,
13,
13,
4,
13,
4,
13,
13,
14,
2,
13,
13,
0,
18,
13,
2,
17,
13,
39,
13,
17,
14,
2,
13,
13,
0,
18,
18,
13,
2,
17,
13,
17,
13,
0,
13,
17,
3,
0,
13,
13,
41,
28,
13,
4,
13,
13,
4,
39,
17,
17,
0,
13,
13,
28,
13,
4,
13,
13,
14,
2,
18,
18,
13,
13,
17,
18,
18,
13,
13,
17,
14,
40,
18,
18,
13,
13,
17,
18,
18,
13,
13,
17,
0,
13,
17,
3,
0,
18,
13,
13,
39,
18,
18,
13,
13,
17,
17,
14,
2,
18,
18,
13,
13,
17,
18,
18,
13,
13,
17,
0,
13,
8,
18,
18,
13,
13,
17,
18,
18,
13,
13,
17,
18,
18,
13,
13,
17,
0,
13,
8,
40,
18,
18,
13,
13,
17,
18,
18,
13,
13,
17,
18,
18,
13,
13,
17,
14,
2,
13,
13,
0,
13,
17,
3,
0,
18,
13,
13,
39,
13,
17,
0,
18,
13,
13,
39,
4,
13,
18,
18,
13,
13,
17,
18,
18,
13,
13,
17,
17,
0,
13,
17,
28,
13,
13,
13,
14,
13,
9,
0,
13,
13,
0,
13,
13,
4,
13,
8,
13,
13,
17,
14,
2,
13,
17,
4,
13,
10,
12,
13,
10,
12,
13,
10,
2,
13,
10,
12,
13,
10,
12,
13,
10,
12,
13,
10,
2,
13
] |
[
[
407,
19
],
[
419,
24
],
[
404,
31
],
[
401,
45
],
[
413,
63
],
[
410,
83
],
[
112,
111
],
[
405,
113
],
[
116,
115
],
[
414,
117
],
[
120,
119
],
[
414,
121
],
[
125,
124
],
[
111,
127
],
[
134,
133
],
[
138,
137
],
[
111,
140
],
[
147,
146
],
[
150,
149
],
[
153,
152
],
[
115,
159
],
[
152,
163
],
[
187,
163
],
[
168,
165
],
[
133,
166
],
[
152,
174
],
[
187,
174
],
[
181,
176
],
[
165,
177
],
[
133,
178
],
[
152,
181
],
[
187,
181
],
[
184,
183
],
[
188,
187
],
[
191,
190
],
[
119,
199
],
[
190,
203
],
[
187,
203
],
[
152,
203
],
[
231,
203
],
[
210,
205
],
[
146,
206
],
[
190,
216
],
[
187,
216
],
[
152,
216
],
[
231,
216
],
[
225,
218
],
[
146,
220
],
[
190,
225
],
[
187,
225
],
[
152,
225
],
[
231,
225
],
[
228,
227
],
[
232,
231
],
[
236,
235
],
[
111,
238
],
[
245,
244
],
[
248,
247
],
[
111,
250
],
[
165,
254
],
[
133,
255
],
[
247,
256
],
[
146,
260
],
[
247,
261
],
[
165,
266
],
[
133,
267
],
[
247,
268
],
[
146,
272
],
[
247,
273
],
[
277,
276
],
[
283,
280
],
[
244,
281
],
[
247,
282
],
[
165,
285
],
[
133,
286
],
[
247,
287
],
[
165,
293
],
[
133,
294
],
[
247,
295
],
[
146,
299
],
[
247,
300
],
[
304,
303
],
[
165,
306
],
[
133,
307
],
[
247,
308
],
[
165,
311
],
[
133,
312
],
[
247,
313
],
[
146,
317
],
[
247,
318
],
[
322,
321
],
[
165,
325
],
[
133,
326
],
[
247,
327
],
[
165,
330
],
[
133,
331
],
[
247,
332
],
[
146,
336
],
[
247,
337
],
[
303,
341
],
[
321,
342
],
[
345,
344
],
[
351,
348
],
[
244,
349
],
[
247,
350
],
[
358,
355
],
[
244,
356
],
[
247,
357
],
[
165,
362
],
[
133,
363
],
[
247,
364
],
[
146,
368
],
[
247,
369
],
[
374,
373
],
[
384,
383
],
[
387,
386
],
[
420,
387
],
[
344,
391
],
[
276,
391
],
[
227,
391
],
[
183,
391
],
[
149,
391
],
[
386,
392
],
[
383,
392
],
[
373,
392
],
[
417,
399
],
[
401,
402
],
[
404,
405
],
[
407,
408
],
[
410,
411
],
[
413,
414
],
[
419,
420
]
] |
[
"import sys\nimport math\nimport collections\nimport bisect\nimport itertools\n\n# import numpy as np\n\nsys.setrecursionlimit(10 ** 7)\nINF = 10 ** 20\nMOD = 10 ** 9 + 7\n# MOD = 998244353\n\nni = lambda: int(sys.stdin.readline().rstrip())\nns = lambda: map(int, sys.stdin.readline().rstrip().split())\nna = lambda: list(map(int, sys.stdin.readline().rstrip().split()))\nna1 = lambda: list(map(lambda x: int(x) - 1, sys.stdin.readline().rstrip().split()))\n\n\n# ===CODE===\n\ndef main():\n n = ni()\n l = na()\n r = na()\n\n res_l = [[0, False] for _ in range(n)]\n res_r = [[0, False] for _ in range(n)]\n\n checker = True\n\n tmp = 0\n for i, li in enumerate(l):\n if li > tmp:\n res_l[i] = li, True\n elif li == tmp:\n res_l[i][0] = tmp\n else:\n checker = False\n break\n tmp = li\n\n tmp = 0\n for i, ri in enumerate(reversed(r)):\n if ri > tmp:\n res_r[-1 - i] = ri, True\n elif ri == tmp:\n res_r[-1 - i][0] = tmp\n else:\n checker = False\n break\n tmp = ri\n\n res = [[0, False] for _ in range(n)]\n\n for i in range(n):\n if res_l[i][1] and res_r[i][1]:\n if res_l[i][0] != res_r[i][0]:\n checker = False\n break\n else:\n res[i] = res_l[i][0], True\n elif res_l[i][1] or res_r[i][1]:\n t_num = res_l[i][0] if res_l[i][1] else res_r[i][0]\n f_num = res_l[i][0] if not res_l[i][1] else res_r[i][0]\n if t_num > f_num:\n checker = False\n break\n else:\n res[i] = t_num, True\n else:\n res[i] = min(res_l[i][0], res_r[i][0]), False\n\n ans = 1\n for num, flg in res:\n if flg:\n continue\n ans *= num\n ans %= MOD\n\n print(ans if checker else 0)\n\n\nif __name__ == '__main__':\n main()",
"import sys",
"sys",
"import math",
"math",
"import collections",
"collections",
"import bisect",
"bisect",
"import itertools",
"itertools",
"sys.setrecursionlimit(10 ** 7)",
"sys.setrecursionlimit",
"sys",
"setrecursionlimit",
"10 ** 7",
"10",
"7",
"INF = 10 ** 20",
"INF",
"10 ** 20",
"10",
"20",
"MOD = 10 ** 9 + 7",
"MOD",
"10 ** 9 + 7",
"10 ** 9",
"10",
"9",
"7",
"ni = lambda: int(sys.stdin.readline().rstrip())",
"ni",
"lambda: int(sys.stdin.readline().rstrip())",
"int(sys.stdin.readline().rstrip())",
"int",
"sys.stdin.readline().rstrip()",
"sys.stdin.readline().rstrip",
"sys.stdin.readline()",
"sys.stdin.readline",
"sys.stdin",
"sys",
"stdin",
"readline",
"rstrip",
"ns = lambda: map(int, sys.stdin.readline().rstrip().split())",
"ns",
"lambda: map(int, sys.stdin.readline().rstrip().split())",
"map(int, sys.stdin.readline().rstrip().split())",
"map",
"int",
"sys.stdin.readline().rstrip().split()",
"sys.stdin.readline().rstrip().split",
"sys.stdin.readline().rstrip()",
"sys.stdin.readline().rstrip",
"sys.stdin.readline()",
"sys.stdin.readline",
"sys.stdin",
"sys",
"stdin",
"readline",
"rstrip",
"split",
"na = lambda: list(map(int, sys.stdin.readline().rstrip().split()))",
"na",
"lambda: list(map(int, sys.stdin.readline().rstrip().split()))",
"list(map(int, sys.stdin.readline().rstrip().split()))",
"list",
"map(int, sys.stdin.readline().rstrip().split())",
"map",
"int",
"sys.stdin.readline().rstrip().split()",
"sys.stdin.readline().rstrip().split",
"sys.stdin.readline().rstrip()",
"sys.stdin.readline().rstrip",
"sys.stdin.readline()",
"sys.stdin.readline",
"sys.stdin",
"sys",
"stdin",
"readline",
"rstrip",
"split",
"na1 = lambda: list(map(lambda x: int(x) - 1, sys.stdin.readline().rstrip().split()))",
"na1",
"lambda: list(map(lambda x: int(x) - 1, sys.stdin.readline().rstrip().split()))",
"list(map(lambda x: int(x) - 1, sys.stdin.readline().rstrip().split()))",
"list",
"map(lambda x: int(x) - 1, sys.stdin.readline().rstrip().split())",
"map",
"lambda x: int(x) - 1",
"int(x) - 1",
"int(x)",
"int",
"x",
"1",
"x",
"sys.stdin.readline().rstrip().split()",
"sys.stdin.readline().rstrip().split",
"sys.stdin.readline().rstrip()",
"sys.stdin.readline().rstrip",
"sys.stdin.readline()",
"sys.stdin.readline",
"sys.stdin",
"sys",
"stdin",
"readline",
"rstrip",
"split",
"def main():\n n = ni()\n l = na()\n r = na()\n\n res_l = [[0, False] for _ in range(n)]\n res_r = [[0, False] for _ in range(n)]\n\n checker = True\n\n tmp = 0\n for i, li in enumerate(l):\n if li > tmp:\n res_l[i] = li, True\n elif li == tmp:\n res_l[i][0] = tmp\n else:\n checker = False\n break\n tmp = li\n\n tmp = 0\n for i, ri in enumerate(reversed(r)):\n if ri > tmp:\n res_r[-1 - i] = ri, True\n elif ri == tmp:\n res_r[-1 - i][0] = tmp\n else:\n checker = False\n break\n tmp = ri\n\n res = [[0, False] for _ in range(n)]\n\n for i in range(n):\n if res_l[i][1] and res_r[i][1]:\n if res_l[i][0] != res_r[i][0]:\n checker = False\n break\n else:\n res[i] = res_l[i][0], True\n elif res_l[i][1] or res_r[i][1]:\n t_num = res_l[i][0] if res_l[i][1] else res_r[i][0]\n f_num = res_l[i][0] if not res_l[i][1] else res_r[i][0]\n if t_num > f_num:\n checker = False\n break\n else:\n res[i] = t_num, True\n else:\n res[i] = min(res_l[i][0], res_r[i][0]), False\n\n ans = 1\n for num, flg in res:\n if flg:\n continue\n ans *= num\n ans %= MOD\n\n print(ans if checker else 0)",
"main",
"n = ni()",
"n",
"ni()",
"ni",
"l = na()",
"l",
"na()",
"na",
"r = na()",
"r",
"na()",
"na",
"[0, False] for _ in range(n)",
"for _ in range(n)",
"_",
"range(n)",
"range",
"n",
"for _ in range(n)",
"[0, False]",
"0",
"False",
"res_l = [[0, False] for _ in range(n)]",
"res_l",
"[[0, False] for _ in range(n)]",
"[0, False] for _ in range(n)",
"for _ in range(n)",
"_",
"range(n)",
"range",
"n",
"for _ in range(n)",
"[0, False]",
"0",
"False",
"res_r = [[0, False] for _ in range(n)]",
"res_r",
"[[0, False] for _ in range(n)]",
"checker = True",
"checker",
"True",
"tmp = 0",
"tmp",
"0",
"for i, li in enumerate(l):\n if li > tmp:\n res_l[i] = li, True\n elif li == tmp:\n res_l[i][0] = tmp\n else:\n checker = False\n break\n tmp = li\n\n ",
"i",
"li",
"enumerate(l)",
"enumerate",
"l",
"if li > tmp:\n res_l[i] = li, True\n elif li == tmp:\n res_l[i][0] = tmp\n else:\n checker = False\n break\n ",
"li > tmp",
"li",
"tmp",
"res_l[i] = li, True",
"res_l[i]",
"res_l",
"i",
"res_l[i] = li, True",
"li",
"True",
"elif li == tmp:\n res_l[i][0] = tmp\n ",
"li == tmp",
"li",
"tmp",
"res_l[i][0] = tmp",
"res_l[i][0]",
"[i]",
"res_l",
"i",
"0",
"tmp",
"checker = False",
"checker",
"False",
"break",
"tmp = li",
"tmp",
"li",
"tmp = 0",
"tmp",
"0",
"for i, ri in enumerate(reversed(r)):\n if ri > tmp:\n res_r[-1 - i] = ri, True\n elif ri == tmp:\n res_r[-1 - i][0] = tmp\n else:\n checker = False\n break\n tmp = ri\n\n ",
"i",
"ri",
"enumerate(reversed(r))",
"enumerate",
"reversed(r)",
"reversed",
"r",
"if ri > tmp:\n res_r[-1 - i] = ri, True\n elif ri == tmp:\n res_r[-1 - i][0] = tmp\n else:\n checker = False\n break\n ",
"ri > tmp",
"ri",
"tmp",
"res_r[-1 - i] = ri, True",
"res_r[-1 - i]",
"res_r",
"-1 - i",
"-1",
"i",
"res_r[-1 - i] = ri, True",
"ri",
"True",
"elif ri == tmp:\n res_r[-1 - i][0] = tmp\n ",
"ri == tmp",
"ri",
"tmp",
"res_r[-1 - i][0] = tmp",
"res_r[-1 - i][0]",
"[-1 - i]",
"res_r",
"-1 - i",
"-1",
"i",
"0",
"tmp",
"checker = False",
"checker",
"False",
"break",
"tmp = ri",
"tmp",
"ri",
"[0, False] for _ in range(n)",
"for _ in range(n)",
"_",
"range(n)",
"range",
"n",
"for _ in range(n)",
"[0, False]",
"0",
"False",
"res = [[0, False] for _ in range(n)]",
"res",
"[[0, False] for _ in range(n)]",
"for i in range(n):\n if res_l[i][1] and res_r[i][1]:\n if res_l[i][0] != res_r[i][0]:\n checker = False\n break\n else:\n res[i] = res_l[i][0], True\n elif res_l[i][1] or res_r[i][1]:\n t_num = res_l[i][0] if res_l[i][1] else res_r[i][0]\n f_num = res_l[i][0] if not res_l[i][1] else res_r[i][0]\n if t_num > f_num:\n checker = False\n break\n else:\n res[i] = t_num, True\n else:\n res[i] = min(res_l[i][0], res_r[i][0]), False\n\n ",
"i",
"range(n)",
"range",
"n",
"if res_l[i][1] and res_r[i][1]:\n if res_l[i][0] != res_r[i][0]:\n checker = False\n break\n else:\n res[i] = res_l[i][0], True\n elif res_l[i][1] or res_r[i][1]:\n t_num = res_l[i][0] if res_l[i][1] else res_r[i][0]\n f_num = res_l[i][0] if not res_l[i][1] else res_r[i][0]\n if t_num > f_num:\n checker = False\n break\n else:\n res[i] = t_num, True\n else:\n res[i] = min(res_l[i][0], res_r[i][0]), False\n\n ",
"res_l[i][1] and res_r[i][1]",
"res_l[i][1]",
"[i]",
"res_l",
"i",
"1",
"res_r[i][1]",
"[i]",
"res_r",
"i",
"1",
"if res_l[i][0] != res_r[i][0]:\n checker = False\n break\n else:\n res[i] = res_l[i][0], True\n ",
"res_l[i][0] != res_r[i][0]",
"res_l[i][0]",
"[i]",
"res_l",
"i",
"0",
"res_r[i][0]",
"[i]",
"res_r",
"i",
"0",
"checker = False",
"checker",
"False",
"break",
"res[i] = res_l[i][0], True",
"res[i]",
"res",
"i",
"res[i] = res_l[i][0], True",
"res_l[i][0]",
"[i]",
"res_l",
"i",
"0",
"True",
"elif res_l[i][1] or res_r[i][1]:\n t_num = res_l[i][0] if res_l[i][1] else res_r[i][0]\n f_num = res_l[i][0] if not res_l[i][1] else res_r[i][0]\n if t_num > f_num:\n checker = False\n break\n else:\n res[i] = t_num, True\n ",
"res_l[i][1] or res_r[i][1]",
"res_l[i][1]",
"[i]",
"res_l",
"i",
"1",
"res_r[i][1]",
"[i]",
"res_r",
"i",
"1",
"t_num = res_l[i][0] if res_l[i][1] else res_r[i][0]",
"t_num",
"res_l[i][0] if res_l[i][1] else res_r[i][0]",
"res_l[i][1]",
"[i]",
"res_l",
"i",
"1",
"res_l[i][0]",
"[i]",
"res_l",
"i",
"0",
"res_r[i][0]",
"[i]",
"res_r",
"i",
"0",
"f_num = res_l[i][0] if not res_l[i][1] else res_r[i][0]",
"f_num",
"res_l[i][0] if not res_l[i][1] else res_r[i][0]",
"not res_l[i][1]",
"res_l[i][1]",
"[i]",
"res_l",
"i",
"1",
"res_l[i][0]",
"[i]",
"res_l",
"i",
"0",
"res_r[i][0]",
"[i]",
"res_r",
"i",
"0",
"if t_num > f_num:\n checker = False\n break\n else:\n res[i] = t_num, True\n ",
"t_num > f_num",
"t_num",
"f_num",
"checker = False",
"checker",
"False",
"break",
"res[i] = t_num, True",
"res[i]",
"res",
"i",
"res[i] = t_num, True",
"t_num",
"True",
"res[i] = min(res_l[i][0], res_r[i][0]), False",
"res[i]",
"res",
"i",
"res[i] = min(res_l[i][0], res_r[i][0]), False",
"min(res_l[i][0], res_r[i][0])",
"min",
"res_l[i][0]",
"[i]",
"res_l",
"i",
"0",
"res_r[i][0]",
"[i]",
"res_r",
"i",
"0",
"False",
"ans = 1",
"ans",
"1",
"for num, flg in res:\n if flg:\n continue\n ans *= num\n ans %= MOD\n\n ",
"num",
"flg",
"res",
"if flg:\n continue\n ",
"flg",
"continue",
"ans *= num",
"ans",
"num",
"ans %= MOD",
"ans",
"MOD",
"print(ans if checker else 0)",
"print",
"ans if checker else 0",
"checker",
"ans",
"0",
"if __name__ == '__main__':\n main()",
"__name__ == '__main__'",
"__name__",
"'__main__'",
"main()",
"main",
"ns = lambda: map(int, sys.stdin.readline().rstrip().split())",
"lambda: map(int, sys.stdin.readline().rstrip().split())",
"ns",
"ni = lambda: int(sys.stdin.readline().rstrip())",
"lambda: int(sys.stdin.readline().rstrip())",
"ni",
"INF = 10 ** 20",
"10 ** 20",
"INF",
"na1 = lambda: list(map(lambda x: int(x) - 1, sys.stdin.readline().rstrip().split()))",
"lambda: list(map(lambda x: int(x) - 1, sys.stdin.readline().rstrip().split()))",
"na1",
"na = lambda: list(map(int, sys.stdin.readline().rstrip().split()))",
"lambda: list(map(int, sys.stdin.readline().rstrip().split()))",
"na",
"def main():\n n = ni()\n l = na()\n r = na()\n\n res_l = [[0, False] for _ in range(n)]\n res_r = [[0, False] for _ in range(n)]\n\n checker = True\n\n tmp = 0\n for i, li in enumerate(l):\n if li > tmp:\n res_l[i] = li, True\n elif li == tmp:\n res_l[i][0] = tmp\n else:\n checker = False\n break\n tmp = li\n\n tmp = 0\n for i, ri in enumerate(reversed(r)):\n if ri > tmp:\n res_r[-1 - i] = ri, True\n elif ri == tmp:\n res_r[-1 - i][0] = tmp\n else:\n checker = False\n break\n tmp = ri\n\n res = [[0, False] for _ in range(n)]\n\n for i in range(n):\n if res_l[i][1] and res_r[i][1]:\n if res_l[i][0] != res_r[i][0]:\n checker = False\n break\n else:\n res[i] = res_l[i][0], True\n elif res_l[i][1] or res_r[i][1]:\n t_num = res_l[i][0] if res_l[i][1] else res_r[i][0]\n f_num = res_l[i][0] if not res_l[i][1] else res_r[i][0]\n if t_num > f_num:\n checker = False\n break\n else:\n res[i] = t_num, True\n else:\n res[i] = min(res_l[i][0], res_r[i][0]), False\n\n ans = 1\n for num, flg in res:\n if flg:\n continue\n ans *= num\n ans %= MOD\n\n print(ans if checker else 0)",
"def main():\n n = ni()\n l = na()\n r = na()\n\n res_l = [[0, False] for _ in range(n)]\n res_r = [[0, False] for _ in range(n)]\n\n checker = True\n\n tmp = 0\n for i, li in enumerate(l):\n if li > tmp:\n res_l[i] = li, True\n elif li == tmp:\n res_l[i][0] = tmp\n else:\n checker = False\n break\n tmp = li\n\n tmp = 0\n for i, ri in enumerate(reversed(r)):\n if ri > tmp:\n res_r[-1 - i] = ri, True\n elif ri == tmp:\n res_r[-1 - i][0] = tmp\n else:\n checker = False\n break\n tmp = ri\n\n res = [[0, False] for _ in range(n)]\n\n for i in range(n):\n if res_l[i][1] and res_r[i][1]:\n if res_l[i][0] != res_r[i][0]:\n checker = False\n break\n else:\n res[i] = res_l[i][0], True\n elif res_l[i][1] or res_r[i][1]:\n t_num = res_l[i][0] if res_l[i][1] else res_r[i][0]\n f_num = res_l[i][0] if not res_l[i][1] else res_r[i][0]\n if t_num > f_num:\n checker = False\n break\n else:\n res[i] = t_num, True\n else:\n res[i] = min(res_l[i][0], res_r[i][0]), False\n\n ans = 1\n for num, flg in res:\n if flg:\n continue\n ans *= num\n ans %= MOD\n\n print(ans if checker else 0)",
"main",
"MOD = 10 ** 9 + 7",
"10 ** 9 + 7",
"MOD"
] |
import sys
import math
import collections
import bisect
import itertools
# import numpy as np
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 20
MOD = 10 ** 9 + 7
# MOD = 998244353
ni = lambda: int(sys.stdin.readline().rstrip())
ns = lambda: map(int, sys.stdin.readline().rstrip().split())
na = lambda: list(map(int, sys.stdin.readline().rstrip().split()))
na1 = lambda: list(map(lambda x: int(x) - 1, sys.stdin.readline().rstrip().split()))
# ===CODE===
def main():
n = ni()
l = na()
r = na()
res_l = [[0, False] for _ in range(n)]
res_r = [[0, False] for _ in range(n)]
checker = True
tmp = 0
for i, li in enumerate(l):
if li > tmp:
res_l[i] = li, True
elif li == tmp:
res_l[i][0] = tmp
else:
checker = False
break
tmp = li
tmp = 0
for i, ri in enumerate(reversed(r)):
if ri > tmp:
res_r[-1 - i] = ri, True
elif ri == tmp:
res_r[-1 - i][0] = tmp
else:
checker = False
break
tmp = ri
res = [[0, False] for _ in range(n)]
for i in range(n):
if res_l[i][1] and res_r[i][1]:
if res_l[i][0] != res_r[i][0]:
checker = False
break
else:
res[i] = res_l[i][0], True
elif res_l[i][1] or res_r[i][1]:
t_num = res_l[i][0] if res_l[i][1] else res_r[i][0]
f_num = res_l[i][0] if not res_l[i][1] else res_r[i][0]
if t_num > f_num:
checker = False
break
else:
res[i] = t_num, True
else:
res[i] = min(res_l[i][0], res_r[i][0]), False
ans = 1
for num, flg in res:
if flg:
continue
ans *= num
ans %= MOD
print(ans if checker else 0)
if __name__ == '__main__':
main()
|
[
7,
15,
13,
4,
18,
13,
13,
2,
17,
17,
0,
13,
4,
13,
17,
0,
13,
2,
2,
17,
17,
17,
12,
13,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
2,
39,
17,
13,
0,
18,
13,
17,
17,
0,
18,
13,
17,
17,
0,
13,
2,
39,
13,
13,
0,
18,
13,
17,
18,
13,
17,
0,
18,
13,
17,
18,
13,
17,
28,
13,
4,
13,
17,
13,
14,
2,
40,
18,
13,
2,
13,
17,
18,
13,
13,
2,
18,
13,
13,
17,
0,
18,
13,
13,
17,
0,
18,
13,
13,
4,
13,
18,
13,
13,
18,
13,
13,
28,
13,
4,
13,
4,
13,
2,
13,
17,
14,
2,
40,
18,
13,
2,
13,
17,
18,
13,
13,
2,
18,
13,
13,
17,
0,
18,
13,
13,
17,
0,
18,
13,
13,
4,
13,
18,
13,
13,
18,
13,
13,
0,
13,
17,
28,
13,
4,
13,
13,
14,
18,
13,
13,
14,
2,
18,
13,
13,
13,
0,
13,
18,
13,
13,
14,
2,
18,
13,
13,
13,
4,
13,
17,
4,
13,
0,
13,
17,
28,
13,
4,
13,
4,
13,
13,
14,
18,
13,
13,
14,
2,
18,
13,
13,
13,
0,
13,
18,
13,
13,
14,
2,
18,
13,
13,
13,
4,
13,
17,
4,
13,
0,
13,
17,
28,
13,
4,
13,
13,
14,
40,
18,
13,
13,
0,
13,
18,
13,
13,
0,
13,
13,
4,
13,
13,
14,
2,
13,
17,
4,
13,
10,
2,
13,
10,
4,
13,
10,
12,
13
] |
[
[
275,
11
],
[
272,
16
],
[
26,
25
],
[
32,
31
],
[
44,
43
],
[
56,
55
],
[
25,
59
],
[
69,
61
],
[
55,
62
],
[
69,
66
],
[
55,
67
],
[
72,
71
],
[
25,
75
],
[
80,
77
],
[
71,
78
],
[
31,
81
],
[
87,
84
],
[
71,
85
],
[
43,
88
],
[
92,
91
],
[
25,
95
],
[
31,
100
],
[
91,
102
],
[
31,
105
],
[
91,
106
],
[
31,
109
],
[
91,
110
],
[
116,
113
],
[
55,
114
],
[
91,
115
],
[
121,
118
],
[
71,
119
],
[
91,
120
],
[
118,
123
],
[
71,
124
],
[
91,
125
],
[
31,
127
],
[
91,
128
],
[
131,
130
],
[
25,
136
],
[
43,
142
],
[
130,
144
],
[
43,
147
],
[
130,
148
],
[
43,
151
],
[
130,
152
],
[
158,
155
],
[
55,
156
],
[
130,
157
],
[
163,
160
],
[
71,
161
],
[
130,
162
],
[
160,
165
],
[
71,
166
],
[
130,
167
],
[
43,
169
],
[
130,
170
],
[
173,
172
],
[
176,
175
],
[
25,
178
],
[
55,
181
],
[
175,
182
],
[
118,
185
],
[
71,
186
],
[
175,
187
],
[
172,
188
],
[
190,
188
],
[
191,
190
],
[
118,
191
],
[
71,
192
],
[
175,
193
],
[
31,
197
],
[
175,
198
],
[
190,
199
],
[
172,
199
],
[
207,
206
],
[
210,
209
],
[
25,
214
],
[
55,
217
],
[
209,
218
],
[
118,
221
],
[
71,
222
],
[
209,
223
],
[
206,
224
],
[
190,
224
],
[
172,
224
],
[
226,
224
],
[
227,
226
],
[
118,
227
],
[
71,
228
],
[
209,
229
],
[
43,
233
],
[
209,
234
],
[
226,
235
],
[
206,
235
],
[
190,
235
],
[
172,
235
],
[
243,
242
],
[
246,
245
],
[
25,
248
],
[
55,
252
],
[
245,
253
],
[
256,
255
],
[
71,
257
],
[
245,
258
],
[
261,
260
],
[
273,
261
],
[
260,
264
],
[
255,
264
],
[
242,
264
],
[
279,
270
],
[
272,
273
],
[
275,
276
]
] |
[
"import sys\n\nsys.setrecursionlimit(10 ** 7)\nf_inf = float('inf')\nmod = 10 ** 9 + 7\n\n\ndef resolve():\n n = int(input())\n T = list(map(int, input().split()))\n A = list(map(int, input().split()))\n\n check = [False] * n\n check[0] = check[-1] = True\n res = [f_inf] * n\n res[0] = T[0]\n res[-1] = A[-1]\n for i in range(1, n):\n if T[i - 1] != T[i] or T[i] == 1:\n check[i] = True\n res[i] = min(res[i], T[i])\n\n for j in reversed(range(n - 1)):\n if A[j + 1] != A[j] or A[j] == 1:\n check[j] = True\n res[j] = min(res[j], A[j])\n\n ma = 0\n for i in range(n):\n if check[i]:\n if res[i] > ma:\n ma = res[i]\n if T[i] > ma:\n print(0)\n exit()\n\n ma = 0\n for i in reversed(range(n)):\n if check[i]:\n if res[i] > ma:\n ma = res[i]\n if A[i] > ma:\n print(0)\n exit()\n\n ans = 1\n for k in range(n):\n if not check[k]:\n ans *= res[k]\n ans %= mod\n print(ans)\n\n\nif __name__ == '__main__':\n resolve()",
"import sys",
"sys",
"sys.setrecursionlimit(10 ** 7)",
"sys.setrecursionlimit",
"sys",
"setrecursionlimit",
"10 ** 7",
"10",
"7",
"f_inf = float('inf')",
"f_inf",
"float('inf')",
"float",
"'inf'",
"mod = 10 ** 9 + 7",
"mod",
"10 ** 9 + 7",
"10 ** 9",
"10",
"9",
"7",
"def resolve():\n n = int(input())\n T = list(map(int, input().split()))\n A = list(map(int, input().split()))\n\n check = [False] * n\n check[0] = check[-1] = True\n res = [f_inf] * n\n res[0] = T[0]\n res[-1] = A[-1]\n for i in range(1, n):\n if T[i - 1] != T[i] or T[i] == 1:\n check[i] = True\n res[i] = min(res[i], T[i])\n\n for j in reversed(range(n - 1)):\n if A[j + 1] != A[j] or A[j] == 1:\n check[j] = True\n res[j] = min(res[j], A[j])\n\n ma = 0\n for i in range(n):\n if check[i]:\n if res[i] > ma:\n ma = res[i]\n if T[i] > ma:\n print(0)\n exit()\n\n ma = 0\n for i in reversed(range(n)):\n if check[i]:\n if res[i] > ma:\n ma = res[i]\n if A[i] > ma:\n print(0)\n exit()\n\n ans = 1\n for k in range(n):\n if not check[k]:\n ans *= res[k]\n ans %= mod\n print(ans)",
"resolve",
"n = int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"T = list(map(int, input().split()))",
"T",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"A = list(map(int, input().split()))",
"A",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"check = [False] * n",
"check",
"[False] * n",
"[False]",
"False",
"n",
"check[0] = check[-1] = True",
"check[0]",
"check",
"0",
"True",
"= check[-1] = True",
"check[-1]",
"check",
"-1",
"True",
"res = [f_inf] * n",
"res",
"[f_inf] * n",
"[f_inf]",
"f_inf",
"n",
"res[0] = T[0]",
"res[0]",
"res",
"0",
"T[0]",
"T",
"0",
"res[-1] = A[-1]",
"res[-1]",
"res",
"-1",
"A[-1]",
"A",
"-1",
"for i in range(1, n):\n if T[i - 1] != T[i] or T[i] == 1:\n check[i] = True\n res[i] = min(res[i], T[i])\n\n ",
"i",
"range(1, n)",
"range",
"1",
"n",
"if T[i - 1] != T[i] or T[i] == 1:\n check[i] = True\n ",
"T[i - 1] != T[i] or T[i] == 1",
"T[i - 1] != T[i]",
"T[i - 1]",
"T",
"i - 1",
"i",
"1",
"T[i]",
"T",
"i",
"T[i] == 1",
"T[i]",
"T",
"i",
"1",
"check[i] = True",
"check[i]",
"check",
"i",
"True",
"res[i] = min(res[i], T[i])",
"res[i]",
"res",
"i",
"min(res[i], T[i])",
"min",
"res[i]",
"res",
"i",
"T[i]",
"T",
"i",
"for j in reversed(range(n - 1)):\n if A[j + 1] != A[j] or A[j] == 1:\n check[j] = True\n res[j] = min(res[j], A[j])\n\n ",
"j",
"reversed(range(n - 1))",
"reversed",
"range(n - 1)",
"range",
"n - 1",
"n",
"1",
"if A[j + 1] != A[j] or A[j] == 1:\n check[j] = True\n ",
"A[j + 1] != A[j] or A[j] == 1",
"A[j + 1] != A[j]",
"A[j + 1]",
"A",
"j + 1",
"j",
"1",
"A[j]",
"A",
"j",
"A[j] == 1",
"A[j]",
"A",
"j",
"1",
"check[j] = True",
"check[j]",
"check",
"j",
"True",
"res[j] = min(res[j], A[j])",
"res[j]",
"res",
"j",
"min(res[j], A[j])",
"min",
"res[j]",
"res",
"j",
"A[j]",
"A",
"j",
"ma = 0",
"ma",
"0",
"for i in range(n):\n if check[i]:\n if res[i] > ma:\n ma = res[i]\n if T[i] > ma:\n print(0)\n exit()\n\n ",
"i",
"range(n)",
"range",
"n",
"if check[i]:\n if res[i] > ma:\n ma = res[i]\n ",
"check[i]",
"check",
"i",
"if res[i] > ma:\n ma = res[i]\n ",
"res[i] > ma",
"res[i]",
"res",
"i",
"ma",
"ma = res[i]",
"ma",
"res[i]",
"res",
"i",
"if T[i] > ma:\n print(0)\n exit()\n\n ",
"T[i] > ma",
"T[i]",
"T",
"i",
"ma",
"print(0)",
"print",
"0",
"exit()",
"exit",
"ma = 0",
"ma",
"0",
"for i in reversed(range(n)):\n if check[i]:\n if res[i] > ma:\n ma = res[i]\n if A[i] > ma:\n print(0)\n exit()\n\n ",
"i",
"reversed(range(n))",
"reversed",
"range(n)",
"range",
"n",
"if check[i]:\n if res[i] > ma:\n ma = res[i]\n ",
"check[i]",
"check",
"i",
"if res[i] > ma:\n ma = res[i]\n ",
"res[i] > ma",
"res[i]",
"res",
"i",
"ma",
"ma = res[i]",
"ma",
"res[i]",
"res",
"i",
"if A[i] > ma:\n print(0)\n exit()\n\n ",
"A[i] > ma",
"A[i]",
"A",
"i",
"ma",
"print(0)",
"print",
"0",
"exit()",
"exit",
"ans = 1",
"ans",
"1",
"for k in range(n):\n if not check[k]:\n ans *= res[k]\n ans %= mod\n ",
"k",
"range(n)",
"range",
"n",
"if not check[k]:\n ans *= res[k]\n ans %= mod\n ",
"not check[k]",
"check[k]",
"check",
"k",
"ans *= res[k]",
"ans",
"res[k]",
"res",
"k",
"ans %= mod",
"ans",
"mod",
"print(ans)",
"print",
"ans",
"if __name__ == '__main__':\n resolve()",
"__name__ == '__main__'",
"__name__",
"'__main__'",
"resolve()",
"resolve",
"mod = 10 ** 9 + 7",
"10 ** 9 + 7",
"mod",
"f_inf = float('inf')",
"float('inf')",
"f_inf",
"def resolve():\n n = int(input())\n T = list(map(int, input().split()))\n A = list(map(int, input().split()))\n\n check = [False] * n\n check[0] = check[-1] = True\n res = [f_inf] * n\n res[0] = T[0]\n res[-1] = A[-1]\n for i in range(1, n):\n if T[i - 1] != T[i] or T[i] == 1:\n check[i] = True\n res[i] = min(res[i], T[i])\n\n for j in reversed(range(n - 1)):\n if A[j + 1] != A[j] or A[j] == 1:\n check[j] = True\n res[j] = min(res[j], A[j])\n\n ma = 0\n for i in range(n):\n if check[i]:\n if res[i] > ma:\n ma = res[i]\n if T[i] > ma:\n print(0)\n exit()\n\n ma = 0\n for i in reversed(range(n)):\n if check[i]:\n if res[i] > ma:\n ma = res[i]\n if A[i] > ma:\n print(0)\n exit()\n\n ans = 1\n for k in range(n):\n if not check[k]:\n ans *= res[k]\n ans %= mod\n print(ans)",
"def resolve():\n n = int(input())\n T = list(map(int, input().split()))\n A = list(map(int, input().split()))\n\n check = [False] * n\n check[0] = check[-1] = True\n res = [f_inf] * n\n res[0] = T[0]\n res[-1] = A[-1]\n for i in range(1, n):\n if T[i - 1] != T[i] or T[i] == 1:\n check[i] = True\n res[i] = min(res[i], T[i])\n\n for j in reversed(range(n - 1)):\n if A[j + 1] != A[j] or A[j] == 1:\n check[j] = True\n res[j] = min(res[j], A[j])\n\n ma = 0\n for i in range(n):\n if check[i]:\n if res[i] > ma:\n ma = res[i]\n if T[i] > ma:\n print(0)\n exit()\n\n ma = 0\n for i in reversed(range(n)):\n if check[i]:\n if res[i] > ma:\n ma = res[i]\n if A[i] > ma:\n print(0)\n exit()\n\n ans = 1\n for k in range(n):\n if not check[k]:\n ans *= res[k]\n ans %= mod\n print(ans)",
"resolve"
] |
import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(input())
T = list(map(int, input().split()))
A = list(map(int, input().split()))
check = [False] * n
check[0] = check[-1] = True
res = [f_inf] * n
res[0] = T[0]
res[-1] = A[-1]
for i in range(1, n):
if T[i - 1] != T[i] or T[i] == 1:
check[i] = True
res[i] = min(res[i], T[i])
for j in reversed(range(n - 1)):
if A[j + 1] != A[j] or A[j] == 1:
check[j] = True
res[j] = min(res[j], A[j])
ma = 0
for i in range(n):
if check[i]:
if res[i] > ma:
ma = res[i]
if T[i] > ma:
print(0)
exit()
ma = 0
for i in reversed(range(n)):
if check[i]:
if res[i] > ma:
ma = res[i]
if A[i] > ma:
print(0)
exit()
ans = 1
for k in range(n):
if not check[k]:
ans *= res[k]
ans %= mod
print(ans)
if __name__ == '__main__':
resolve()
|
[
7,
0,
13,
4,
13,
4,
13,
0,
13,
2,
39,
17,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
2,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
39,
17,
41,
28,
13,
4,
13,
13,
4,
39,
17,
17,
0,
13,
13,
0,
13,
17,
0,
13,
2,
2,
17,
17,
17,
0,
13,
17,
28,
13,
4,
13,
13,
17,
17,
14,
40,
18,
13,
2,
13,
17,
18,
13,
13,
0,
18,
13,
2,
13,
17,
39,
17,
18,
13,
13,
0,
18,
13,
2,
13,
17,
39,
17,
18,
13,
13,
28,
13,
4,
13,
13,
14,
40,
18,
13,
13,
18,
13,
2,
13,
17,
14,
2,
18,
18,
13,
13,
17,
17,
14,
40,
18,
13,
13,
18,
18,
13,
13,
17,
4,
13,
17,
3,
14,
40,
18,
13,
13,
18,
18,
13,
13,
17,
0,
18,
13,
13,
39,
17,
18,
13,
13,
4,
13,
17,
3,
14,
40,
18,
18,
13,
13,
17,
17,
0,
18,
13,
13,
39,
17,
4,
13,
18,
13,
13,
18,
18,
13,
13,
17,
14,
2,
18,
18,
13,
13,
17,
18,
13,
13,
4,
13,
17,
3,
14,
40,
18,
18,
13,
13,
17,
17,
0,
13,
2,
2,
13,
18,
18,
13,
13,
17,
13,
4,
13,
13,
10,
17,
13,
10,
4,
13,
10,
2,
13,
10,
13,
13,
10,
17,
13,
10,
2,
13,
10,
2,
13,
10,
2,
13
] |
[
[
226,
2
],
[
238,
8
],
[
241,
23
],
[
40,
39
],
[
227,
42
],
[
232,
48
],
[
235,
51
],
[
244,
54
],
[
223,
61
],
[
65,
64
],
[
227,
67
],
[
239,
73
],
[
64,
75
],
[
239,
78
],
[
64,
79
],
[
86,
81
],
[
233,
82
],
[
64,
84
],
[
239,
89
],
[
64,
90
],
[
97,
92
],
[
233,
93
],
[
64,
95
],
[
239,
100
],
[
64,
101
],
[
104,
103
],
[
227,
106
],
[
242,
110
],
[
103,
111
],
[
242,
113
],
[
103,
115
],
[
171,
120
],
[
150,
120
],
[
233,
121
],
[
103,
122
],
[
242,
128
],
[
103,
129
],
[
171,
131
],
[
150,
131
],
[
233,
132
],
[
103,
133
],
[
242,
142
],
[
103,
143
],
[
171,
145
],
[
150,
145
],
[
233,
146
],
[
103,
147
],
[
153,
150
],
[
233,
151
],
[
103,
152
],
[
242,
156
],
[
103,
157
],
[
171,
165
],
[
150,
165
],
[
233,
166
],
[
103,
167
],
[
174,
171
],
[
233,
172
],
[
103,
173
],
[
242,
179
],
[
103,
180
],
[
171,
182
],
[
150,
182
],
[
233,
183
],
[
103,
184
],
[
171,
189
],
[
150,
189
],
[
233,
190
],
[
103,
191
],
[
242,
194
],
[
103,
195
],
[
171,
203
],
[
150,
203
],
[
233,
204
],
[
103,
205
],
[
229,
209
],
[
224,
212
],
[
230,
212
],
[
171,
214
],
[
150,
214
],
[
233,
215
],
[
103,
216
],
[
245,
218
],
[
230,
221
],
[
224,
221
],
[
223,
224
],
[
226,
227
],
[
229,
230
],
[
232,
233
],
[
235,
236
],
[
238,
239
],
[
241,
242
],
[
244,
245
]
] |
[
"n=int(input())\na=[0]+list(map(int,input().split()))\nb=list(map(int,input().split()))+[0]\nc=[[0,0]for i in range(n)]\np=0\nmod=10**9+7\nd=1\nfor i in range(n,0,-1):\n if a[i-1]!=a[i]:\n c[i-1]=[1,a[i]]\n else:\n c[i-1]=[0,a[i]]\nfor i in range(n):\n if b[i]!=b[i+1]:\n if c[i][0]==1:\n if b[i]!=c[i][1]:\n print(0)\n break\n else:\n if b[i]<=c[i][1]:\n c[i]=[1,b[i]]\n else:\n print(0)\n break\n else:\n if c[i][0]!=1:\n c[i]=[0,min(b[i],c[i][1])]\n else:\n if c[i][1]>b[i]:\n print(0)\n break\n if c[i][0]!=1:\n d=d*c[i][1]%mod\nelse:\n print(d)",
"n=int(input())",
"n",
"int(input())",
"int",
"input()",
"input",
"a=[0]+list(map(int,input().split()))",
"a",
"[0]+list(map(int,input().split()))",
"[0]",
"0",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"b=list(map(int,input().split()))+[0]",
"b",
"list(map(int,input().split()))+[0]",
"list(map(int,input().split()))",
"list",
"map(int,input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"[0]",
"0",
"[0,0]for i in range(n)",
"for i in range(n)",
"i",
"range(n)",
"range",
"n",
"for i in range(n)",
"[0,0]",
"0",
"0",
"c=[[0,0]for i in range(n)]",
"c",
"[[0,0]for i in range(n)]",
"p=0",
"p",
"0",
"mod=10**9+7",
"mod",
"10**9+7",
"10**9",
"10",
"9",
"7",
"d=1",
"d",
"1",
"for i in range(n,0,-1):\n if a[i-1]!=a[i]:\n c[i-1]=[1,a[i]]\n else:\n c[i-1]=[0,a[i]]",
"i",
"range(n,0,-1)",
"range",
"n",
"0",
"-1",
"if a[i-1]!=a[i]:\n c[i-1]=[1,a[i]]\n else:\n c[i-1]=[0,a[i]]",
"a[i-1]!=a[i]",
"a[i-1]",
"a",
"i-1",
"i",
"1",
"a[i]",
"a",
"i",
"c[i-1]=[1,a[i]]",
"c[i-1]",
"c",
"i-1",
"i",
"1",
"[1,a[i]]",
"1",
"a[i]",
"a",
"i",
"c[i-1]=[0,a[i]]",
"c[i-1]",
"c",
"i-1",
"i",
"1",
"[0,a[i]]",
"0",
"a[i]",
"a",
"i",
"for i in range(n):\n if b[i]!=b[i+1]:\n if c[i][0]==1:\n if b[i]!=c[i][1]:\n print(0)\n break\n else:\n if b[i]<=c[i][1]:\n c[i]=[1,b[i]]\n else:\n print(0)\n break\n else:\n if c[i][0]!=1:\n c[i]=[0,min(b[i],c[i][1])]\n else:\n if c[i][1]>b[i]:\n print(0)\n break\n if c[i][0]!=1:\n d=d*c[i][1]%mod\nelse:\n print(d)",
"i",
"range(n)",
"range",
"n",
"if b[i]!=b[i+1]:\n if c[i][0]==1:\n if b[i]!=c[i][1]:\n print(0)\n break\n else:\n if b[i]<=c[i][1]:\n c[i]=[1,b[i]]\n else:\n print(0)\n break\n else:\n if c[i][0]!=1:\n c[i]=[0,min(b[i],c[i][1])]\n else:\n if c[i][1]>b[i]:\n print(0)\n break\n ",
"b[i]!=b[i+1]",
"b[i]",
"b",
"i",
"b[i+1]",
"b",
"i+1",
"i",
"1",
"if c[i][0]==1:\n if b[i]!=c[i][1]:\n print(0)\n break\n else:\n if b[i]<=c[i][1]:\n c[i]=[1,b[i]]\n else:\n print(0)\n break\n ",
"c[i][0]==1",
"c[i][0]",
"[i]",
"c",
"i",
"0",
"1",
"if b[i]!=c[i][1]:\n print(0)\n break\n ",
"b[i]!=c[i][1]",
"b[i]",
"b",
"i",
"c[i][1]",
"[i]",
"c",
"i",
"1",
"print(0)",
"print",
"0",
"break",
"if b[i]<=c[i][1]:\n c[i]=[1,b[i]]\n else:\n print(0)\n break\n ",
"b[i]<=c[i][1]",
"b[i]",
"b",
"i",
"c[i][1]",
"[i]",
"c",
"i",
"1",
"c[i]=[1,b[i]]",
"c[i]",
"c",
"i",
"[1,b[i]]",
"1",
"b[i]",
"b",
"i",
"print(0)",
"print",
"0",
"break",
"if c[i][0]!=1:\n c[i]=[0,min(b[i],c[i][1])]\n else:\n if c[i][1]>b[i]:\n print(0)\n break\n ",
"c[i][0]!=1",
"c[i][0]",
"[i]",
"c",
"i",
"0",
"1",
"c[i]=[0,min(b[i],c[i][1])]",
"c[i]",
"c",
"i",
"[0,min(b[i],c[i][1])]",
"0",
"min(b[i],c[i][1])",
"min",
"b[i]",
"b",
"i",
"c[i][1]",
"[i]",
"c",
"i",
"1",
"if c[i][1]>b[i]:\n print(0)\n break\n ",
"c[i][1]>b[i]",
"c[i][1]",
"[i]",
"c",
"i",
"1",
"b[i]",
"b",
"i",
"print(0)",
"print",
"0",
"break",
"if c[i][0]!=1:\n d=d*c[i][1]%mod",
"c[i][0]!=1",
"c[i][0]",
"[i]",
"c",
"i",
"0",
"1",
"d=d*c[i][1]%mod",
"d",
"d*c[i][1]%mod",
"d*c[i][1]",
"d",
"c[i][1]",
"[i]",
"c",
"i",
"1",
"mod",
"print(d)",
"print",
"d",
"d=1",
"1",
"d",
"n=int(input())",
"int(input())",
"n",
"d=d*c[i][1]%mod",
"d*c[i][1]%mod",
"d",
"c=[[0,0]for i in range(n)]",
"[[0,0]for i in range(n)]",
"c",
"p=0",
"0",
"p",
"a=[0]+list(map(int,input().split()))",
"[0]+list(map(int,input().split()))",
"a",
"b=list(map(int,input().split()))+[0]",
"list(map(int,input().split()))+[0]",
"b",
"mod=10**9+7",
"10**9+7",
"mod"
] |
n=int(input())
a=[0]+list(map(int,input().split()))
b=list(map(int,input().split()))+[0]
c=[[0,0]for i in range(n)]
p=0
mod=10**9+7
d=1
for i in range(n,0,-1):
if a[i-1]!=a[i]:
c[i-1]=[1,a[i]]
else:
c[i-1]=[0,a[i]]
for i in range(n):
if b[i]!=b[i+1]:
if c[i][0]==1:
if b[i]!=c[i][1]:
print(0)
break
else:
if b[i]<=c[i][1]:
c[i]=[1,b[i]]
else:
print(0)
break
else:
if c[i][0]!=1:
c[i]=[0,min(b[i],c[i][1])]
else:
if c[i][1]>b[i]:
print(0)
break
if c[i][0]!=1:
d=d*c[i][1]%mod
else:
print(d)
|
[
7,
12,
13,
0,
13,
4,
13,
4,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
0,
13,
4,
13,
4,
13,
13,
4,
18,
4,
13,
13,
14,
40,
18,
13,
17,
18,
13,
17,
4,
13,
17,
4,
13,
0,
13,
18,
13,
39,
0,
13,
2,
39,
17,
13,
0,
13,
17,
28,
13,
4,
13,
13,
14,
2,
18,
13,
13,
13,
0,
18,
13,
13,
17,
0,
13,
18,
13,
13,
0,
13,
17,
28,
13,
4,
13,
13,
14,
2,
18,
13,
2,
2,
13,
17,
13,
2,
18,
13,
2,
2,
13,
17,
13,
18,
13,
2,
2,
13,
17,
13,
4,
13,
17,
4,
13,
14,
2,
18,
13,
2,
2,
13,
17,
13,
13,
0,
18,
13,
2,
2,
13,
17,
13,
17,
0,
13,
18,
13,
2,
2,
13,
17,
13,
0,
18,
13,
2,
2,
13,
17,
13,
4,
13,
18,
13,
2,
2,
13,
17,
13,
18,
13,
2,
2,
13,
17,
13,
0,
13,
17,
0,
13,
2,
2,
17,
17,
17,
28,
13,
4,
13,
13,
14,
2,
18,
13,
13,
17,
0,
13,
18,
13,
13,
0,
13,
13,
4,
13,
13,
14,
2,
13,
17,
4,
13,
10,
12,
13
] |
[
[
5,
4
],
[
11,
10
],
[
23,
22
],
[
10,
36
],
[
22,
39
],
[
48,
47
],
[
10,
49
],
[
53,
52
],
[
4,
56
],
[
59,
58
],
[
62,
61
],
[
4,
64
],
[
10,
68
],
[
61,
69
],
[
58,
70
],
[
77,
70
],
[
75,
72
],
[
52,
73
],
[
61,
74
],
[
78,
77
],
[
10,
79
],
[
61,
80
],
[
83,
82
],
[
86,
85
],
[
4,
88
],
[
52,
92
],
[
4,
95
],
[
85,
97
],
[
10,
100
],
[
4,
103
],
[
85,
105
],
[
22,
107
],
[
4,
110
],
[
85,
112
],
[
22,
121
],
[
4,
124
],
[
85,
126
],
[
82,
127
],
[
77,
127
],
[
58,
127
],
[
138,
127
],
[
136,
129
],
[
52,
130
],
[
4,
133
],
[
85,
135
],
[
139,
138
],
[
22,
140
],
[
4,
143
],
[
85,
145
],
[
154,
147
],
[
47,
148
],
[
4,
151
],
[
85,
153
],
[
47,
157
],
[
4,
160
],
[
85,
162
],
[
22,
164
],
[
4,
167
],
[
85,
169
],
[
172,
171
],
[
175,
174
],
[
182,
181
],
[
4,
184
],
[
72,
187
],
[
52,
188
],
[
181,
189
],
[
193,
192
],
[
47,
194
],
[
181,
195
],
[
198,
197
],
[
174,
198
],
[
197,
201
],
[
192,
201
],
[
171,
201
],
[
210,
207
]
] |
[
"#!/usr/bin/env python3\n\ndef main():\n N = int(input())\n T = list(map(int, input().split()))\n A = list(map(int, input().split()))\n\n if T[-1] != A[0]:\n print(0)\n exit()\n\n upper = T[:]\n flag = [0] * N\n\n # Tくんの目線で見る\n now = 0\n for i in range(N):\n if T[i] > now:\n flag[i] = 1\n now = T[i]\n\n # A君の目線で見る\n now = 0\n for i in range(N):\n if flag[N-1-i] and T[N-1-i] > A[N-1-i]:\n print(0)\n exit()\n\n if A[N-1-i] > now:\n flag[N-1-i] = 1\n now = A[N-1-i]\n\n upper[N-1-i] = min(upper[N-1-i],A[N-1-i])\n\n ans = 1\n m = 10**9+7\n for i in range(N):\n if flag[i]==0:\n ans *= upper[i]\n ans %= m\n print(ans)\n\nif __name__ == \"__main__\":\n main()",
"def main():\n N = int(input())\n T = list(map(int, input().split()))\n A = list(map(int, input().split()))\n\n if T[-1] != A[0]:\n print(0)\n exit()\n\n upper = T[:]\n flag = [0] * N\n\n # Tくんの目線で見る\n now = 0\n for i in range(N):\n if T[i] > now:\n flag[i] = 1\n now = T[i]\n\n # A君の目線で見る\n now = 0\n for i in range(N):\n if flag[N-1-i] and T[N-1-i] > A[N-1-i]:\n print(0)\n exit()\n\n if A[N-1-i] > now:\n flag[N-1-i] = 1\n now = A[N-1-i]\n\n upper[N-1-i] = min(upper[N-1-i],A[N-1-i])\n\n ans = 1\n m = 10**9+7\n for i in range(N):\n if flag[i]==0:\n ans *= upper[i]\n ans %= m\n print(ans)",
"main",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"T = list(map(int, input().split()))",
"T",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"A = list(map(int, input().split()))",
"A",
"list(map(int, input().split()))",
"list",
"map(int, input().split())",
"map",
"int",
"input().split()",
"().split",
"()",
"input",
"split",
"if T[-1] != A[0]:\n print(0)\n exit()\n\n ",
"T[-1] != A[0]",
"T[-1]",
"T",
"-1",
"A[0]",
"A",
"0",
"print(0)",
"print",
"0",
"exit()",
"exit",
"upper = T[:]",
"upper",
"T[:]",
"T",
":",
"flag = [0] * N",
"flag",
"[0] * N",
"[0]",
"0",
"N",
"now = 0",
"now",
"0",
"for i in range(N):\n if T[i] > now:\n flag[i] = 1\n now = T[i]\n\n # A君の目線で見る\n ",
"i",
"range(N)",
"range",
"N",
"if T[i] > now:\n flag[i] = 1\n now = T[i]\n\n # A君の目線で見る\n ",
"T[i] > now",
"T[i]",
"T",
"i",
"now",
"flag[i] = 1",
"flag[i]",
"flag",
"i",
"1",
"now = T[i]",
"now",
"T[i]",
"T",
"i",
"now = 0",
"now",
"0",
"for i in range(N):\n if flag[N-1-i] and T[N-1-i] > A[N-1-i]:\n print(0)\n exit()\n\n if A[N-1-i] > now:\n flag[N-1-i] = 1\n now = A[N-1-i]\n\n upper[N-1-i] = min(upper[N-1-i],A[N-1-i])\n\n ",
"i",
"range(N)",
"range",
"N",
"if flag[N-1-i] and T[N-1-i] > A[N-1-i]:\n print(0)\n exit()\n\n ",
"flag[N-1-i] and T[N-1-i] > A[N-1-i]",
"flag[N-1-i]",
"flag",
"N-1-i",
"N-1",
"N",
"1",
"i",
"T[N-1-i] > A[N-1-i]",
"T[N-1-i]",
"T",
"N-1-i",
"N-1",
"N",
"1",
"i",
"A[N-1-i]",
"A",
"N-1-i",
"N-1",
"N",
"1",
"i",
"print(0)",
"print",
"0",
"exit()",
"exit",
"if A[N-1-i] > now:\n flag[N-1-i] = 1\n now = A[N-1-i]\n\n ",
"A[N-1-i] > now",
"A[N-1-i]",
"A",
"N-1-i",
"N-1",
"N",
"1",
"i",
"now",
"flag[N-1-i] = 1",
"flag[N-1-i]",
"flag",
"N-1-i",
"N-1",
"N",
"1",
"i",
"1",
"now = A[N-1-i]",
"now",
"A[N-1-i]",
"A",
"N-1-i",
"N-1",
"N",
"1",
"i",
"upper[N-1-i] = min(upper[N-1-i],A[N-1-i])",
"upper[N-1-i]",
"upper",
"N-1-i",
"N-1",
"N",
"1",
"i",
"min(upper[N-1-i],A[N-1-i])",
"min",
"upper[N-1-i]",
"upper",
"N-1-i",
"N-1",
"N",
"1",
"i",
"A[N-1-i]",
"A",
"N-1-i",
"N-1",
"N",
"1",
"i",
"ans = 1",
"ans",
"1",
"m = 10**9+7",
"m",
"10**9+7",
"10**9",
"10",
"9",
"7",
"for i in range(N):\n if flag[i]==0:\n ans *= upper[i]\n ans %= m\n ",
"i",
"range(N)",
"range",
"N",
"if flag[i]==0:\n ans *= upper[i]\n ans %= m\n ",
"flag[i]==0",
"flag[i]",
"flag",
"i",
"0",
"ans *= upper[i]",
"ans",
"upper[i]",
"upper",
"i",
"ans %= m",
"ans",
"m",
"print(ans)",
"print",
"ans",
"if __name__ == \"__main__\":\n main()",
"__name__ == \"__main__\"",
"__name__",
"\"__main__\"",
"main()",
"main",
"def main():\n N = int(input())\n T = list(map(int, input().split()))\n A = list(map(int, input().split()))\n\n if T[-1] != A[0]:\n print(0)\n exit()\n\n upper = T[:]\n flag = [0] * N\n\n # Tくんの目線で見る\n now = 0\n for i in range(N):\n if T[i] > now:\n flag[i] = 1\n now = T[i]\n\n # A君の目線で見る\n now = 0\n for i in range(N):\n if flag[N-1-i] and T[N-1-i] > A[N-1-i]:\n print(0)\n exit()\n\n if A[N-1-i] > now:\n flag[N-1-i] = 1\n now = A[N-1-i]\n\n upper[N-1-i] = min(upper[N-1-i],A[N-1-i])\n\n ans = 1\n m = 10**9+7\n for i in range(N):\n if flag[i]==0:\n ans *= upper[i]\n ans %= m\n print(ans)",
"def main():\n N = int(input())\n T = list(map(int, input().split()))\n A = list(map(int, input().split()))\n\n if T[-1] != A[0]:\n print(0)\n exit()\n\n upper = T[:]\n flag = [0] * N\n\n # Tくんの目線で見る\n now = 0\n for i in range(N):\n if T[i] > now:\n flag[i] = 1\n now = T[i]\n\n # A君の目線で見る\n now = 0\n for i in range(N):\n if flag[N-1-i] and T[N-1-i] > A[N-1-i]:\n print(0)\n exit()\n\n if A[N-1-i] > now:\n flag[N-1-i] = 1\n now = A[N-1-i]\n\n upper[N-1-i] = min(upper[N-1-i],A[N-1-i])\n\n ans = 1\n m = 10**9+7\n for i in range(N):\n if flag[i]==0:\n ans *= upper[i]\n ans %= m\n print(ans)",
"main"
] |
#!/usr/bin/env python3
def main():
N = int(input())
T = list(map(int, input().split()))
A = list(map(int, input().split()))
if T[-1] != A[0]:
print(0)
exit()
upper = T[:]
flag = [0] * N
# Tくんの目線で見る
now = 0
for i in range(N):
if T[i] > now:
flag[i] = 1
now = T[i]
# A君の目線で見る
now = 0
for i in range(N):
if flag[N-1-i] and T[N-1-i] > A[N-1-i]:
print(0)
exit()
if A[N-1-i] > now:
flag[N-1-i] = 1
now = A[N-1-i]
upper[N-1-i] = min(upper[N-1-i],A[N-1-i])
ans = 1
m = 10**9+7
for i in range(N):
if flag[i]==0:
ans *= upper[i]
ans %= m
print(ans)
if __name__ == "__main__":
main()
|
[
7,
12,
13,
0,
13,
4,
13,
4,
13,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
0,
13,
13,
41,
28,
13,
4,
18,
4,
13,
13,
4,
4,
13,
13,
0,
13,
13,
0,
13,
2,
39,
2,
17,
17,
13,
0,
13,
2,
39,
17,
13,
0,
13,
17,
28,
13,
4,
13,
13,
0,
13,
18,
13,
13,
14,
40,
13,
13,
0,
18,
13,
13,
13,
0,
18,
13,
13,
13,
0,
18,
13,
13,
18,
13,
2,
13,
17,
0,
18,
13,
13,
17,
0,
13,
13,
0,
13,
17,
0,
13,
17,
0,
13,
2,
2,
17,
17,
17,
28,
13,
4,
13,
4,
13,
13,
0,
13,
18,
13,
13,
0,
13,
39,
17,
17,
14,
40,
13,
13,
0,
18,
13,
17,
13,
0,
18,
13,
17,
13,
0,
18,
13,
17,
18,
13,
2,
13,
17,
0,
18,
13,
17,
17,
14,
2,
2,
18,
13,
13,
18,
13,
17,
2,
18,
13,
13,
18,
13,
17,
4,
13,
17,
29,
0,
18,
13,
13,
4,
13,
18,
13,
13,
18,
13,
17,
0,
18,
13,
13,
4,
13,
18,
13,
13,
18,
13,
17,
0,
13,
2,
2,
2,
2,
18,
13,
13,
18,
13,
13,
17,
13,
13,
0,
13,
13,
4,
13,
13,
4,
13,
10,
12,
13
] |
[
[
5,
4
],
[
12,
11
],
[
11,
20
],
[
23,
22
],
[
27,
26
],
[
26,
35
],
[
38,
37
],
[
41,
40
],
[
4,
46
],
[
49,
48
],
[
4,
52
],
[
55,
54
],
[
58,
57
],
[
4,
60
],
[
63,
62
],
[
22,
64
],
[
57,
65
],
[
54,
68
],
[
95,
68
],
[
62,
69
],
[
74,
71
],
[
40,
72
],
[
57,
73
],
[
62,
74
],
[
79,
76
],
[
48,
77
],
[
57,
78
],
[
62,
79
],
[
84,
81
],
[
40,
82
],
[
57,
83
],
[
40,
85
],
[
57,
87
],
[
93,
90
],
[
48,
91
],
[
57,
92
],
[
96,
95
],
[
62,
96
],
[
99,
98
],
[
102,
101
],
[
105,
104
],
[
112,
111
],
[
4,
116
],
[
119,
118
],
[
37,
120
],
[
111,
121
],
[
124,
123
],
[
98,
129
],
[
95,
129
],
[
54,
129
],
[
215,
129
],
[
118,
130
],
[
62,
130
],
[
135,
132
],
[
123,
133
],
[
118,
135
],
[
62,
135
],
[
140,
137
],
[
123,
138
],
[
118,
140
],
[
62,
140
],
[
145,
142
],
[
123,
143
],
[
40,
146
],
[
111,
148
],
[
154,
151
],
[
123,
152
],
[
81,
158
],
[
71,
158
],
[
176,
158
],
[
40,
159
],
[
111,
160
],
[
123,
162
],
[
90,
165
],
[
76,
165
],
[
188,
165
],
[
48,
166
],
[
111,
167
],
[
123,
169
],
[
179,
176
],
[
40,
177
],
[
111,
178
],
[
81,
181
],
[
71,
181
],
[
176,
181
],
[
40,
182
],
[
111,
183
],
[
123,
185
],
[
191,
188
],
[
48,
189
],
[
111,
190
],
[
90,
193
],
[
76,
193
],
[
188,
193
],
[
48,
194
],
[
111,
195
],
[
123,
197
],
[
201,
200
],
[
176,
205
],
[
81,
205
],
[
71,
205
],
[
40,
206
],
[
111,
207
],
[
188,
208
],
[
90,
208
],
[
76,
208
],
[
48,
209
],
[
111,
210
],
[
101,
212
],
[
200,
212
],
[
104,
213
],
[
216,
215
],
[
118,
216
],
[
62,
216
],
[
200,
219
],
[
101,
219
],
[
224,
221
]
] |
[
"#2,3\n#3,4\n\ndef main():\n N = int(input())\n A = [int(_n) for _n in input().split()]\n B = [int(_n) for _n in input().split()]\n max_h = [10**10]*N\n min_h = [1]*N\n prev = -1\n for i in range(N):\n a = A[i]\n if prev != a:\n max_h[i] = a\n min_h[i] = a\n else:\n max_h[i] = max_h[i-1]\n min_h[i] = 0\n prev = a\n prev = -1\n res = 1\n MOD = 10**9+7\n for i in reversed(range(N)):\n a = B[i]\n new_range = [0,0]\n if prev != a:\n new_range[0] = a\n new_range[1] = a\n else:\n new_range[0] = max_h[i+1]\n new_range[1] = 1\n if max_h[i] < new_range[1] or min_h[i] > new_range[0]:\n print(0)\n return\n max_h[i] = min(max_h[i], new_range[0])\n min_h[i] = max(min_h[i], new_range[1])\n # print(max_h[i],min_h[i])\n res = (max_h[i]-min_h[i]+1) * res % MOD\n prev = a\n print(res)\n\n\n\nmain()",
"def main():\n N = int(input())\n A = [int(_n) for _n in input().split()]\n B = [int(_n) for _n in input().split()]\n max_h = [10**10]*N\n min_h = [1]*N\n prev = -1\n for i in range(N):\n a = A[i]\n if prev != a:\n max_h[i] = a\n min_h[i] = a\n else:\n max_h[i] = max_h[i-1]\n min_h[i] = 0\n prev = a\n prev = -1\n res = 1\n MOD = 10**9+7\n for i in reversed(range(N)):\n a = B[i]\n new_range = [0,0]\n if prev != a:\n new_range[0] = a\n new_range[1] = a\n else:\n new_range[0] = max_h[i+1]\n new_range[1] = 1\n if max_h[i] < new_range[1] or min_h[i] > new_range[0]:\n print(0)\n return\n max_h[i] = min(max_h[i], new_range[0])\n min_h[i] = max(min_h[i], new_range[1])\n # print(max_h[i],min_h[i])\n res = (max_h[i]-min_h[i]+1) * res % MOD\n prev = a\n print(res)",
"main",
"N = int(input())",
"N",
"int(input())",
"int",
"input()",
"input",
"int(_n) for _n in input().split()",
"for _n in input().split()",
"_n",
"input().split()",
"().split",
"()",
"input",
"split",
"for _n in input().split()",
"int(_n)",
"int",
"_n",
"A = [int(_n) for _n in input().split()]",
"A",
"[int(_n) for _n in input().split()]",
"int(_n) for _n in input().split()",
"for _n in input().split()",
"_n",
"input().split()",
"().split",
"()",
"input",
"split",
"for _n in input().split()",
"int(_n)",
"int",
"_n",
"B = [int(_n) for _n in input().split()]",
"B",
"[int(_n) for _n in input().split()]",
"max_h = [10**10]*N",
"max_h",
"[10**10]*N",
"[10**10]",
"10**10",
"10",
"10",
"N",
"min_h = [1]*N",
"min_h",
"[1]*N",
"[1]",
"1",
"N",
"prev = -1",
"prev",
"-1",
"for i in range(N):\n a = A[i]\n if prev != a:\n max_h[i] = a\n min_h[i] = a\n else:\n max_h[i] = max_h[i-1]\n min_h[i] = 0\n prev = a\n ",
"i",
"range(N)",
"range",
"N",
"a = A[i]",
"a",
"A[i]",
"A",
"i",
"if prev != a:\n max_h[i] = a\n min_h[i] = a\n else:\n max_h[i] = max_h[i-1]\n min_h[i] = 0\n ",
"prev != a",
"prev",
"a",
"max_h[i] = a",
"max_h[i]",
"max_h",
"i",
"a",
"min_h[i] = a",
"min_h[i]",
"min_h",
"i",
"a",
"max_h[i] = max_h[i-1]",
"max_h[i]",
"max_h",
"i",
"max_h[i-1]",
"max_h",
"i-1",
"i",
"1",
"min_h[i] = 0",
"min_h[i]",
"min_h",
"i",
"0",
"prev = a",
"prev",
"a",
"prev = -1",
"prev",
"-1",
"res = 1",
"res",
"1",
"MOD = 10**9+7",
"MOD",
"10**9+7",
"10**9",
"10",
"9",
"7",
"for i in reversed(range(N)):\n a = B[i]\n new_range = [0,0]\n if prev != a:\n new_range[0] = a\n new_range[1] = a\n else:\n new_range[0] = max_h[i+1]\n new_range[1] = 1\n if max_h[i] < new_range[1] or min_h[i] > new_range[0]:\n print(0)\n return\n max_h[i] = min(max_h[i], new_range[0])\n min_h[i] = max(min_h[i], new_range[1])\n # print(max_h[i],min_h[i])\n res = (max_h[i]-min_h[i]+1) * res % MOD\n prev = a\n ",
"i",
"reversed(range(N))",
"reversed",
"range(N)",
"range",
"N",
"a = B[i]",
"a",
"B[i]",
"B",
"i",
"new_range = [0,0]",
"new_range",
"[0,0]",
"0",
"0",
"if prev != a:\n new_range[0] = a\n new_range[1] = a\n else:\n new_range[0] = max_h[i+1]\n new_range[1] = 1\n ",
"prev != a",
"prev",
"a",
"new_range[0] = a",
"new_range[0]",
"new_range",
"0",
"a",
"new_range[1] = a",
"new_range[1]",
"new_range",
"1",
"a",
"new_range[0] = max_h[i+1]",
"new_range[0]",
"new_range",
"0",
"max_h[i+1]",
"max_h",
"i+1",
"i",
"1",
"new_range[1] = 1",
"new_range[1]",
"new_range",
"1",
"1",
"if max_h[i] < new_range[1] or min_h[i] > new_range[0]:\n print(0)\n return\n ",
"max_h[i] < new_range[1] or min_h[i] > new_range[0]",
"max_h[i] < new_range[1]",
"max_h[i]",
"max_h",
"i",
"new_range[1]",
"new_range",
"1",
"min_h[i] > new_range[0]",
"min_h[i]",
"min_h",
"i",
"new_range[0]",
"new_range",
"0",
"print(0)",
"print",
"0",
"return",
"max_h[i] = min(max_h[i], new_range[0])",
"max_h[i]",
"max_h",
"i",
"min(max_h[i], new_range[0])",
"min",
"max_h[i]",
"max_h",
"i",
"new_range[0]",
"new_range",
"0",
"min_h[i] = max(min_h[i], new_range[1])",
"min_h[i]",
"min_h",
"i",
"max(min_h[i], new_range[1])",
"max",
"min_h[i]",
"min_h",
"i",
"new_range[1]",
"new_range",
"1",
"res = (max_h[i]-min_h[i]+1) * res % MOD",
"res",
"(max_h[i]-min_h[i]+1) * res % MOD",
"(max_h[i]-min_h[i]+1) * res",
"max_h[i]-min_h[i]+1",
"max_h[i]-min_h[i]",
"max_h[i]",
"max_h",
"i",
"min_h[i]",
"min_h",
"i",
"1",
"res",
"MOD",
"prev = a",
"prev",
"a",
"print(res)",
"print",
"res",
"main()",
"main",
"def main():\n N = int(input())\n A = [int(_n) for _n in input().split()]\n B = [int(_n) for _n in input().split()]\n max_h = [10**10]*N\n min_h = [1]*N\n prev = -1\n for i in range(N):\n a = A[i]\n if prev != a:\n max_h[i] = a\n min_h[i] = a\n else:\n max_h[i] = max_h[i-1]\n min_h[i] = 0\n prev = a\n prev = -1\n res = 1\n MOD = 10**9+7\n for i in reversed(range(N)):\n a = B[i]\n new_range = [0,0]\n if prev != a:\n new_range[0] = a\n new_range[1] = a\n else:\n new_range[0] = max_h[i+1]\n new_range[1] = 1\n if max_h[i] < new_range[1] or min_h[i] > new_range[0]:\n print(0)\n return\n max_h[i] = min(max_h[i], new_range[0])\n min_h[i] = max(min_h[i], new_range[1])\n # print(max_h[i],min_h[i])\n res = (max_h[i]-min_h[i]+1) * res % MOD\n prev = a\n print(res)",
"def main():\n N = int(input())\n A = [int(_n) for _n in input().split()]\n B = [int(_n) for _n in input().split()]\n max_h = [10**10]*N\n min_h = [1]*N\n prev = -1\n for i in range(N):\n a = A[i]\n if prev != a:\n max_h[i] = a\n min_h[i] = a\n else:\n max_h[i] = max_h[i-1]\n min_h[i] = 0\n prev = a\n prev = -1\n res = 1\n MOD = 10**9+7\n for i in reversed(range(N)):\n a = B[i]\n new_range = [0,0]\n if prev != a:\n new_range[0] = a\n new_range[1] = a\n else:\n new_range[0] = max_h[i+1]\n new_range[1] = 1\n if max_h[i] < new_range[1] or min_h[i] > new_range[0]:\n print(0)\n return\n max_h[i] = min(max_h[i], new_range[0])\n min_h[i] = max(min_h[i], new_range[1])\n # print(max_h[i],min_h[i])\n res = (max_h[i]-min_h[i]+1) * res % MOD\n prev = a\n print(res)",
"main"
] |
#2,3
#3,4
def main():
N = int(input())
A = [int(_n) for _n in input().split()]
B = [int(_n) for _n in input().split()]
max_h = [10**10]*N
min_h = [1]*N
prev = -1
for i in range(N):
a = A[i]
if prev != a:
max_h[i] = a
min_h[i] = a
else:
max_h[i] = max_h[i-1]
min_h[i] = 0
prev = a
prev = -1
res = 1
MOD = 10**9+7
for i in reversed(range(N)):
a = B[i]
new_range = [0,0]
if prev != a:
new_range[0] = a
new_range[1] = a
else:
new_range[0] = max_h[i+1]
new_range[1] = 1
if max_h[i] < new_range[1] or min_h[i] > new_range[0]:
print(0)
return
max_h[i] = min(max_h[i], new_range[0])
min_h[i] = max(min_h[i], new_range[1])
# print(max_h[i],min_h[i])
res = (max_h[i]-min_h[i]+1) * res % MOD
prev = a
print(res)
main()
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.