{"trustable":false,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript type\u003d\"text/javascript\" async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS_HTML-full\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003e standard input/output\u003cbr\u003e \u003ca href\u003d\"CDN_BASE_URL/0f20eb9c693d74787604a4c9d6dc83ed\" title\u003d\"statements.pdf\"\u003eStatements\u003c/a\u003e\u003c/p\u003e \n\u003cbr\u003e \n\u003cdiv\u003e \n \u003cp\u003e Given a string \u003cspan\u003e\u003ci\u003eS\u003c/i\u003e\u003c/span\u003e of length \u003cspan\u003e\u003ci\u003eN\u003c/i\u003e\u003c/span\u003e, you must find the longest palindromic subsequence of even length. This sounds like a simple problem, but wait, there\u0027s more to it. You also have a budget of \u003cspan\u003e\u003ci\u003eB\u003c/i\u003e\u003c/span\u003e coins and \u003cspan\u003e\u003ci\u003eR\u003c/i\u003e\u003c/span\u003e restrictions that may affect it. For example, a restriction of shape \u003cspan\u003e(\u003ci\u003ea\u003c/i\u003e, \u003ci\u003eb\u003c/i\u003e, \u003ci\u003ec\u003c/i\u003e)\u003c/span\u003e means that given the case you decided to include in your subsequence all characters from position \u003cspan\u003e\u003ci\u003ea\u003c/i\u003e\u003c/span\u003e to \u003cspan\u003e\u003ci\u003eb\u003c/i\u003e\u003c/span\u003e in your string \u003cspan\u003e\u003ci\u003eS\u003c/i\u003e\u003c/span\u003e, you must pay \u003cspan\u003e\u003ci\u003ec\u003c/i\u003e\u003c/span\u003e coins. Given the budget and a set of restrictions, output the size of the longest palindromic subsequence of even length that can be formed.\u003c/p\u003e \n\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cdiv\u003e \n \u003cdiv\u003e \n \u003cp\u003e On the first line there are 3 integers, \u003cspan\u003e\u003ci\u003eN\u003c/i\u003e\u003c/span\u003e (\u003cspan\u003e1 ≤ \u003ci\u003eN\u003c/i\u003e ≤ 33\u003c/span\u003e), the length of the string, \u003cspan\u003e\u003ci\u003eR\u003c/i\u003e\u003c/span\u003e (\u003cspan\u003e1 ≤ \u003ci\u003eR\u003c/i\u003e ≤ 5000\u003c/span\u003e), the number of restrictions and \u003cspan\u003e\u003ci\u003eB\u003c/i\u003e\u003c/span\u003e (\u003cspan\u003e1 ≤ \u003ci\u003eB\u003c/i\u003e ≤ 10\u003csup\u003e9\u003c/sup\u003e\u003c/span\u003e), the budget. On the second line you can find string \u003cspan\u003e\u003ci\u003eS\u003c/i\u003e\u003c/span\u003e. Next \u003cspan\u003e\u003ci\u003eR\u003c/i\u003e\u003c/span\u003e lines contain three numbers: \u003cspan\u003e\u003ci\u003ea\u003c/i\u003e\u003c/span\u003e, \u003cspan\u003e\u003ci\u003eb\u003c/i\u003e\u003c/span\u003e, and \u003cspan\u003e\u003ci\u003ec\u003c/i\u003e\u003c/span\u003e describing a restriction.\u003c/p\u003e \n \u003c/div\u003e \n\u003c/div\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cdiv\u003e \n \u003cdiv\u003e \n \u003cp\u003e Output a single number, the maximal length of the palindromic subsequence.\u003c/p\u003e \n \u003c/div\u003e \n\u003c/div\u003e"}},{"title":"Example","value":{"format":"HTML","content":"\u003cdiv\u003e \n \u003cdiv\u003e \n \u003cdiv\u003e \n \u003cdiv\u003e \n \u003cdiv\u003e\n Input\n \u003c/div\u003e \n \u003cpre\u003e\r\n\t\t\t\t5 2 9\r\n\u003cspan\u003eacbba\u003c/span\u003e\r\n1 2 10\r\n4 5 11\r\n\u003c/pre\u003e \n \u003c/div\u003e \n \u003cdiv\u003e \n \u003cdiv\u003e\n Output\n \u003c/div\u003e \n \u003cpre\u003e\r\n\t\t\t\t2\r\n\u003c/pre\u003e \n \u003c/div\u003e \n \u003cdiv\u003e \n \u003cdiv\u003e\n Input\n \u003c/div\u003e \n \u003cpre\u003e\r\n\t\t\t\t4 2 5\r\n\u003cspan\u003exyyx\u003c/span\u003e\r\n3 4 2\r\n2 3 3\r\n\u003c/pre\u003e \n \u003c/div\u003e \n \u003cdiv\u003e \n \u003cdiv\u003e\n Output\n \u003c/div\u003e \n \u003cpre\u003e\r\n\t\t\t\t4\r\n\u003c/pre\u003e \n \u003c/div\u003e \n \u003c/div\u003e \n \u003c/div\u003e \n\u003c/div\u003e"}}]}