{"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":"MD","content":"大宫忍今天过生日!\n她收到了爱丽丝送的两个下标从 0 开始的长度为 N 的排列 P,Q,排列里的元素在 0~N-1 之间。\n爱丽丝定义了一个排列 x 的变换 f(x),其中 f(x)\\_i\u003dx_i 或者 i(0 \\leq i \\leq N-1),并且 f(x) 也要是一个排列。\n她又定义了一个函数 d(A,B),d(A,B) \u003d \\sum_{i\u003d0}^{n-1} [A_i \\neq B_i]。\n忍想分别确定 f(P) 和 f(Q) 的取值,使得 d(f(P),f(Q)) 最大。"}},{"title":"Constraints","value":{"format":"MD","content":"1 \\leq N \\leq 10^5\n0 \\leq P_i \\leq N-1\n0 \\leq Q_i \\leq N-1"}},{"title":"Input","value":{"format":"MD","content":"第一行输入一个正整数 N。\n第二行输入 N 个非负整数表示排列 P。\n第三行输入 N 个非负整数表示排列 Q。"}},{"title":"Output","value":{"format":"MD","content":"输出 max(d(f(P),f(Q)))。"}},{"title":"Sample Input 1","value":{"format":"MD","content":"4\n1 0 2 3\n0 2 1 3"}},{"title":"Sample Output 1","value":{"format":"MD","content":"3"}},{"title":"Sample Input 2","value":{"format":"MD","content":"8\n2 0 1 3 6 5 7 4\n2 3 0 1 4 6 7 5"}},{"title":"Sample Output 2","value":{"format":"MD","content":"7"}}]}