{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"hlce","formal_name":"Humanity's Last Code Exam","introduction":"Humanity'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","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"88572043-22fc-5c19-bc3a-c4e5ad32a347","task_key":"ICPC~2dWorld~2dFinals--examples--2020~5fD","task_revision_id":"2","upstream_id":"2020_D","short_description":"Gene Folding","config":"ICPC-World-Finals","split":"examples","body":"{\"platform\":\"atcoder\",\"question_content\":\"## Problem Statement\\n\\nInternational Cell Processing Company (ICPC) is a world leader in the analysis of genetic sequences. A genetic sequence is a sequence of nucleotides, which in this problem is represented by a string containing only the letters A, C, G, and T in some combination, each letter representing a single nucleotide (Adenine, Cytosine, Guanine, and Thymine, respectively).\\n\\nOne of the key discoveries made by ICPC is that through a process called Genetically Optimized Organic Folding (GOOF), they can take a genetic sequence and transform it into a simpler one, while preserving many of the properties of the sequence that ICPC wants to analyze.\\n\\nA single application of GOOF works as follows. Find a point between two adjacent nucleotides in the nucleotide sequence, such that the sequence reads the same from that point in both directions, up until the nearer end of the sequence. For instance, in the sequence `ATTACC`, there are two such points: `AT-TACC` and `ATTAC-C`. Then pick one of these points (say, the first one), and fold the genetic sequence at that point, merging the identical nucleotides (so, in this case the `AT` and `TA` would become merged, and the resulting sequence would be `CCAT` or `TACC`).\\n\\nThrough repeated application of GOOF, a nucleotide can potentially be made much shorter. However, manually searching for the appropriate folding points is very time-consuming. ICPC reached out to you to write a program that would automate the process of finding the folding points and choosing them so as to obtain the shortest possible genetic sequence from a given input sequence.\\n\\n### Input\\n\\nThe input contains a single string \\\\( s \\\\) representing the nucleotide sequence to be analyzed. The string consists of characters A, C, G, and T only. The length of \\\\( s \\\\) is between 1 and \\\\( 4 \\\\times 10^6 \\\\), inclusive.\\n\\n### Output\\n\\nOutput the smallest possible length of a sequence obtained from the input by applying GOOF zero or more times.\\n\\n### Sample Input 1\\n\\n```\\nATTACC\\n```\\n\\n### Sample Output 1\\n\\n```\\n3\\n```\\n\\n### Sample Input 2\\n\\n```\\nAAAAGAATTAA\\n```\\n\\n### Sample Output 2\\n\\n```\\n5\\n```\",\"question_title\":\"Gene Folding\"}","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":[]}