{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"hlce","formal_name":"Humanity's Last Code Exam","introduction":"ICPC World FinalsとIOIの競技プログラミング問題を使い、問題解決とコード生成の能力を評価します。公式紹介では235問を収録し、今回の取得は公開ICPCデータ146問を対象とします。\n\nHumanity's Last Code Exam evaluates problem solving and code generation using ICPC World Finals and IOI problems. The project describes 235 problems; this import selects its public ICPC dataset of 146 problems.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://humanity-s-last-code-exam.github.io/website/","indexing_mode":"noindex"},"task_id":"01b4b1e7-2a20-5827-b957-51308562a903","task_key":"ICPC~2dWorld~2dFinals--examples--2016~5fG","task_revision_id":"1","upstream_id":"2016_G","short_description":"Oil","config":"ICPC-World-Finals","split":"examples","body":"{\"platform\":\"atcoder\",\"question_content\":\"## Problem Description\\n\\nA large part of the world economy depends on oil, which is why research into new methods for finding and extracting oil is still active. Profits of oil companies depend in part on how efficiently they can drill for oil. The International Crude Petroleum Consortium (ICPC) hopes that extensive computer simulations will make it easier to determine how to drill oil wells in the best possible way.\\n\\nDrilling oil wells optimally is getting harder each day – the newly discovered oil deposits often do not form a single body, but are split into many parts. The ICPC is currently concerned with stratified deposits.\\n\\nTo simplify its analysis, the ICPC considers only the 2-dimensional case, where oil deposits are modeled as horizontal line segments parallel to the earth’s surface. The ICPC wants to know how to place a single oil well to extract the maximum amount of oil. The oil well is drilled from the surface along a straight line and can extract oil from all deposits that it intersects on its way down, even if the intersection is at an endpoint of a deposit.\\n\\nIn this simple model, the amount of oil contained in a deposit is equal to the width of the deposit. Can you help the ICPC determine the maximum amount of oil that can be extracted by a single well?\\n\\n### Input\\n\\nThe first line of input contains a single integer \\\\( n \\\\) (\\\\(1 \\\\leq n \\\\leq 2000\\\\)), which is the number of oil deposits. This is followed by \\\\( n \\\\) lines, each describing a single deposit. These lines contain three integers \\\\( x_0, x_1, \\\\) and \\\\( y \\\\) giving the deposit’s position as the line segment with endpoints \\\\((x_0, y)\\\\) and \\\\((x_1, y)\\\\). These numbers satisfy \\\\(|x_0|, |x_1| \\\\leq 10^6\\\\) and \\\\(1 \\\\leq y \\\\leq 10^6\\\\). No two deposits will intersect, not even at a point.\\n\\n### Output\\n\\nDisplay the maximum amount of oil that can be extracted by a single oil well.\\n\\n### Sample Input 1\\n```\\n5\\n100 180 20\\n30 60 30\\n70 110 40\\n10 40 50\\n0 80 70\\n```\\n\\n### Sample Output 1\\n```\\n200\\n```\\n\\n### Sample Input 2\\n```\\n3\\n50 60 10\\n-42 -42 20\\n25 0 10\\n```\\n\\n### Sample Output 2\\n```\\n25\\n```\",\"question_title\":\"Oil\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://humanity-s-last-code-exam.github.io/website/","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}