{"problem":{"name":"Decrement","description":{"content":"Given is a sequence $A$ of $N$ positive integers and a sequence $B$ of $N-1$ positive integers. You can do the following operation any number of times. *   Choose integers $i$ and $j$ ($1 \\leq i < j ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"agc054_f"},"statements":[{"statement_type":"Markdown","content":"Given is a sequence $A$ of $N$ positive integers and a sequence $B$ of $N-1$ positive integers. You can do the following operation any number of times.\n\n*   Choose integers $i$ and $j$ ($1 \\leq i < j \\leq N$) and decrease each of the following values by $1$: $A_i,A_j,B_i,B_{i+1},\\cdots,B_{j-1}$. Here, there should not be any negative value after this operation.\n\nLet $m$ be the maximum number of operations that can be done. Find the number, modulo $998244353$, of sequences that $A$ can be after $m$ operations.\n\n## Constraints\n\n*   $1 \\leq N \\leq 2 \\times 10^5$\n*   $1 \\leq A_i \\leq 10^9$\n*   $1 \\leq B_i \\leq 10^9$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$A_1$ $A_2$ $\\cdots$ $A_N$\n$B_1$ $B_2$ $\\cdots$ $B_{N-1}$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"agc054_f","tags":[],"sample_group":[["3\n1 2 2\n1 2","3\n\nWe have $m=2$. After two operations, $A$ will be one of the following three sequences.\n\n*   $A=(1,0,0)$: we end up with this after operations with $(i,j)=(2,3)$ and $(i,j)=(2,3)$.\n*   $A=(0,1,0)$: we end up with this after operations with $(i,j)=(1,3)$ and $(i,j)=(2,3)$.\n*   $A=(0,0,1)$: we end up with this after operations with $(i,j)=(1,2)$ and $(i,j)=(2,3)$."],["4\n1 1 1 1\n2 2 2","1\n\nNote that we do not distinguish two scenarios with different contents of $B$ if the contents of $A$ are the same."],["4\n2 2 3 4\n3 1 4","3"]],"created_at":"2026-03-03 11:01:14"}}