{"trustable":false,"prependHtml":"\u003cstyle type\u003d\"text/css\"\u003e\n section pre {\n display: block;\n padding: 9.5px;\n margin: 0 0 10px;\n font-size: 13px;\n line-height: 1.42857143;\n word-break: break-all;\n word-wrap: break-word;\n color: #333;\n background: rgba(255, 255, 255, 0.5);\n border: 1px solid #ccc;\n border-radius: 6px;\n }\n\u003c/style\u003e\n\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027\\\\(\u0027, right: \u0027\\\\)\u0027, display: false},\n {left: \u0027\\\\[\u0027, right: \u0027\\\\]\u0027, display: true}\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"Problem Statement","value":{"format":"HTML","content":"\u003csection\u003e\n \u003cp\u003eYou\u0027re given a simple graph of $N$ nodes and $M$ edges. The nodes are numbered from $1$ to $N$.\u003c/p\u003e\n \u003cp\u003eGiven a list of nodes $C_1, \\dots, C_K$, find the number of nodes in the shortest path of the graph that contains each of the nodes $C_1, \\dots, C_K$ from the given list.\u003c/p\u003e"}},{"title":"Constraints","value":{"format":"HTML","content":"\u003csection\u003e\n \u003cul\u003e\n \u003cli\u003eAll values in input are integers.\u003c/li\u003e\n \u003cli\u003e\u003cvar\u003e\\(1 ≤\u0026nbsp;N ≤ 10^5\\)\u003c/var\u003e\u003c/li\u003e\n \u003cli\u003e\u003cvar\u003e\\(0 ≤\u0026nbsp;M ≤ 10^5\\)\u003c/var\u003e\u003c/li\u003e\n \u003cli\u003e\u003cvar\u003e\\(1 ≤ A_i \u0026lt; B_i ≤ N\\)\u003c/var\u003e\u003c/li\u003e\n \u003cli\u003eIf \u003cvar\u003e\\(i ≠ j\\)\u003c/var\u003e, \u003cvar\u003e\\((A_i, B_i) ≠ (A_j, B_j)\\)\u003c/var\u003e.\u003c/li\u003e\n \u003cli\u003e\u003cvar\u003e\\(1 ≤ K ≤ 17\\)\u003c/var\u003e\u003c/li\u003e\n \u003cli\u003e\u003cvar\u003e\\(1 ≤ C_1 \u0026lt; C_2 \u0026lt; \\dots \u0026lt; C_K ≤ N\\)\u003c/var\u003e\u003c/li\u003e\n \u003c/ul\u003e\n\u003c/section\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003csection\u003e\n \u003cp\u003eInput is given from Standard Input in the following format:\u003c/p\u003e\n \u003cpre\u003e\u003cvar\u003e\\(N\\)\u003c/var\u003e \u003cvar\u003e\\(M\\)\u003c/var\u003e\n\u003cvar\u003e\\(A_1\\)\u003c/var\u003e \u003cvar\u003e\\(B_1\\)\u003c/var\u003e\n\u003cvar\u003e\\(A_2\\)\u003c/var\u003e \u003cvar\u003e\\(B_2\\)\u003c/var\u003e\n\u003cvar\u003e\\(\\hspace{7mm}\\vdots\\)\u003c/var\u003e\n\u003cvar\u003e\\(A_M\\)\u003c/var\u003e \u003cvar\u003e\\(B_M\\)\u003c/var\u003e\n\u003cvar\u003e\\(K\\)\u003c/var\u003e\n\u003cvar\u003e\\(C_1\\)\u003c/var\u003e \u003cvar\u003e\\(C_2\\)\u003c/var\u003e \u003cvar\u003e\\(\\cdots\\)\u003c/var\u003e \u003cvar\u003e\\(C_K\\)\u003c/var\u003e\n\u003c/pre\u003e\n\u003c/section\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003csection\u003e\n \u003cp\u003ePrint the number of nodes in the shortest path that contains each of nodes \u003cvar\u003e\\(C_1, C_2, \\dots, C_K\\)\u003c/var\u003e.\u003cbr\u003e\n If such a path doesn\u0027t exist, print $\\tt{-1}$ instead.\u003c/p\u003e\n\u003c/section\u003e"}},{"title":"Sample 1","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e4 3\n1 4\n2 4\n3 4\n3\n1 2 3\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e5\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\u003csection\u003e\n\u003c/section\u003e\u003csection\u003e\n \u003cp\u003eFor example, the path \u003cvar\u003e\\([1, 4, 2, 4, 3]\\)\u003c/var\u003e of length \u003cvar\u003e\\(5\\)\u003c/var\u003e contains the nodes \u003cvar\u003e\\(1, 2, 3\\)\u003c/var\u003e.\u003c/p\u003e\n\u003c/section\u003e"}},{"title":"Sample 2","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e4 3\n1 4\n2 4\n1 2\n3\n1 2 3\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e-1\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\u003csection\u003e\n\u003c/section\u003e\u003csection\u003e\n\u003c/section\u003e"}},{"title":"Sample 3","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e10 10\n3 9\n3 8\n8 10\n2 10\n5 8\n6 8\n5 7\n6 7\n1 6\n2 4\n4\n1 2 7 9\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e11\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\u003csection\u003e\n\u003c/section\u003e\u003csection\u003e\n \u003cp\u003eFor example, the path \u003cvar\u003e\\([1, 6, 7, 5, 8, 3, 9, 3, 8, 10, 2]\\)\u003c/var\u003e of length \u003cvar\u003e\\(11\\)\u003c/var\u003e contains the nodes \u003cvar\u003e\\(1, 2, 7, 9\\)\u003c/var\u003e.\u003c/p\u003e\n\u003c/section\u003e"}}]}