API Response (JSON)
{
"problem": {
"name": "Distinct Elements on Subsegments",
"description": {
"content": "For an integer array $A=(A_1, A_2, \\ldots, A_{N + K-1})$ ($1 \\leq A_i \\leq N+K-1$), let's construct an array $B=(B_1, B_2, \\ldots, B_N)$, where $B_i$ is the number of distinct elements in $A_i,A_{i+1}",
"description_type": "Markdown"
},
"platform": "AtCoder",
"limit": {
"time_limit": 2000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "agc059_d"
},
"statements": [
{
"statement_type": "Markdown",
"content": "For an integer array $A=(A_1, A_2, \\ldots, A_{N + K-1})$ ($1 \\leq A_i \\leq N+K-1$), let's construct an array $B=(B_1, B_2, \\ldots, B_N)$, where $B_i$ is the number of distinct elements in $A_i,A_{i+1}...",
"is_translate": false,
"language": "English"
}
]
}