{"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":"1c019ac2-d37f-5952-9ab6-27b12a27d95f","task_key":"ICPC~2dWorld~2dFinals--examples--2013~5fA","task_revision_id":"1","upstream_id":"2013_A","short_description":"Self-Assembly","config":"ICPC-World-Finals","split":"examples","body":"{\"platform\":\"atcoder\",\"question_content\":\"## Problem Description\\n\\nAutomatic Chemical Manufacturing is experimenting with a process called self-assembly. In this process, molecules with natural affinity for each other are mixed together in a solution and allowed to spontaneously assemble themselves into larger structures. But there is one problem: sometimes molecules assemble themselves into a structure of unbounded size, which gums up the machinery.\\n\\nYou must write a program to decide whether a given collection of molecules can be assembled into a structure of unbounded size. You should make two simplifying assumptions:\\n\\n1. The problem is restricted to two dimensions.\\n2. Each molecule in the collection is represented as a square. The four edges of the square represent the surfaces on which the molecule can connect to other compatible molecules.\\n\\nIn each test case, you will be given a set of molecule descriptions. Each type of molecule is described by four two-character connector labels that indicate how its edges can connect to the edges of other molecules. There are two types of connector labels:\\n\\n- An uppercase letter (A, ..., Z) followed by + or −. Two edges are compatible if their labels have the same letter but different signs. For example, A+ is compatible with A− but is not compatible with A+ or B−.\\n- Two zero digits 00. An edge with this label is not compatible with any edge (not even with another edge labeled 00).\\n\\nAssume there is an unlimited supply of molecules of each type, which may be rotated and reflected. As the molecules assemble themselves into larger structures, the edges of two molecules may be adjacent to each other only if they are compatible. It is permitted for an edge, regardless of its connector label, to be connected to nothing (no adjacent molecule on that edge).\\n\\nFigure A.1 shows an example of three molecule types and a structure of bounded size that can be assembled from them (other bounded structures are also possible with this set of molecules).\\n\\n## Input\\n\\nThe input consists of a single test case. A test case consists of two lines. The first contains an integer \\\\( n \\\\) (1 ≤ \\\\( n \\\\) ≤ 40,000) indicating the number of molecule types. The second line contains \\\\( n \\\\) eight-character strings, each describing a single type of molecule, separated by single spaces. Each string consists of four two-character connector labels representing the four edges of the molecule in clockwise order.\\n\\n## Output\\n\\nDisplay the word `unbounded` if the set of molecule types can generate a structure of unbounded size. Otherwise, display the word `bounded`.\\n\\n## Sample Input 1\\n\\n```\\n3\\nA+00A+A+ 00B+D+A- B-C+00C+\\n```\\n\\n## Sample Output 1\\n\\n```\\nbounded\\n```\\n\\n## Sample Input 2\\n\\n```\\n1\\nK+K-Q+Q-\\n```\\n\\n## Sample Output 2\\n\\n```\\nunbounded\\n```\",\"question_title\":\"Self-Assembly\"}","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":[]}