API Response (JSON)
{
"problem": {
"name": "[PA 2018] Heros",
"description": {
"content": "**题目译自 [PA 2018](https://sio2.mimuw.edu.pl/c/pa-2018-1/dashboard/) Runda 2 [Heros](https://sio2.mimuw.edu.pl/c/pa-2018-1/p/her/)** 给定一个有向无环图，该图有 $n$ 个节点， $m$ 条有向边。 你需要从中删除 $k$ 个点以及与其关联的边，使得图中的最长链最短。",
"description_type": "Markdown"
},
"platform": "Luogu",
"limit": {
"time_limit": 2000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "LGP9079"
},
"statements": [
{
"statement_type": "Markdown",
"content": "**题目译自 [PA 2018](https://sio2.mimuw.edu.pl/c/pa-2018-1/dashboard/) Runda 2 [Heros](https://sio2.mimuw.edu.pl/c/pa-2018-1/p/her/)**\n\n给定一个有向无环图，该图有 $n$ 个节点， $m$ 条有向边。\n\n你需要从中删除 $k$ 个点以及与其关联的边，使得图中的最长链最短。...",
"is_translate": false,
"language": "English"
}
]
}