#define ATCODER #define _USE_MATH_DEFINES #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using ll = long long; using ld = long double; using pll = pair; using pdd = pair; //template using pq = priority_queue, greater>; #define FOR(i, a, b) for(ll i=(a); i<(b);i++) #define REP(i, n) for(ll i=0; i<(n);i++) #define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--) #define PER(i, n) for(ll i=n-1; i>=0;i--) #define REPREP(i,j,a,b) for(ll i=0;i > #define VV2(type,n,m,val) vector< vector > val;val.resize(n);for(ll i;i #define VEC(type,n,val) vector val;val.resize(n) #define VL vector #define VVL vector< vector > #define VP vector< pair > #define SZ size() #define all(i) begin(i),end(i) #define SORT(i) sort(all(i)) #define BITI(i) (1<>i) & 1) != 0) #define ALLBIT(n) (ll(1)<v?v:n #define MP(a,b) make_pair(a,b) #define DET2(x1,y1,x2,y2) x1*y2-x2*y1 #define DET3(x1,y1,z1,x2,y2,z2,x3,y3,z3) x1*y2*z3+x2*y3*z1+x3*y1*z2-z1*y2*x3-z2*y3*x1-z3*y1*x2 #define INC(a) for(auto& v:a)v++; #define DEC(a) for(auto& v:a)v--; #define SQU(x) (x)*(x) #define L0 ll(0) #ifdef ATCODER #include using namespace atcoder; using mint = modint1000000007; using mint2 = modint998244353; #endif template vector read(size_t n) { vector ts(n); for (size_t i = 0; i < n; i++) cin >> ts[i]; return ts; } template void read_tuple_impl(TV&) {} template void read_tuple_impl(TV& ts) { get(ts).emplace_back(*(istream_iterator(cin))); read_tuple_impl(ts); } template decltype(auto) read_tuple(size_t n) { tuple...> ts; for (size_t i = 0; i < n; i++) read_tuple_impl(ts); return ts; } using val = ll; using func = ll; val op(val a, val b) { return max(a, b); } val e() { return -1e18; } //val mp(func f, val a) { // return MP(a.first + f, a.second); //} //func comp(func f, func g) { // return f + g; //} //func id() { return 0; } ll di[4] = { 1,0,-1,0 }; ll dj[4] = { 0,1,0,-1 }; ll si[4] = { 0,3,3,0 }; ll sj[4] = { 0,0,3,3 }; //ll di[4] = { -1,-1,1,1 }; //ll dj[4] = { -1,1,-1,1 }; ll di8[8] = { 0,-1,-1,-1,0,1,1,1 }; ll dj8[8] = { -1,-1,0,1,1,1,0,-1 }; void solve() { ll n, k; cin >> n >> k; VL p = read(n); VL a = read(n); DEC(p); ll low = 0, high = n; unordered_set noRev; bool allOne = true; bool allZero = true; bool noConflict = true; REP(i, n) noRev.insert(i); // Aが全員正直 { dsu d(n * 2); vector use(n * 2); REP(i, n) { if (a[i]) { d.merge(i, p[i] + n); d.merge(i + n, p[i]); } else { d.merge(i, p[i]); d.merge(i + n, p[i] + n); } noRev.erase(p[i]); } VVL c(n * 2); REP(i, n) { allOne &= a[i] == 1; allZero &= a[i] == 0; } REP(i, n * 2) { c[d.leader(i)].push_back(i); } REP(i, n * 2) { if (c[i].empty()) continue; if (use[i]) continue; REP(j, c[i].size()) { use[c[i][j] % n] = use[c[i][j] % n + n] = true; } if (d.same(i%n, i%n + n)) { ll mn = 1e18; noConflict = false; ll now = i; REP(j, c[i].size()) { dsu dd(n * 2); REP(ii, c[i].size()) { ll v = c[i][ii]; if (v >= n)continue; if (a[c[i][ii]] ^ (c[i][ii] == c[i][j])){ dd.merge(v, p[v] + n); dd.merge(v + n, p[v]); } else { dd.merge(v, p[v]); dd.merge(v + n, p[v] + n); } } if (dd.same(i % n, i % n + n)) continue; ll sum = 0; REP(ii, c[i].size()) { sum += dd.same(i, c[i][ii]) && c[i][ii] >= n; } CHMIN(mn, min(sum, ll(c[i].size()) / 2 - sum)); } low += mn + 1; } else { ll tmp = 0; REP(j, c[i].size()) { tmp += c[i][j] >= n; } low += min(tmp, ll(c[i].size()) - tmp); } } } // Aが全員嘘吐き { dsu d(n * 2); vector use(n * 2); REP(i, n) { if (a[i]) { d.merge(i, p[i]); d.merge(i + n, p[i] + n); } else { d.merge(i, p[i] + n); d.merge(i + n, p[i]); } noRev.erase(p[i]); } VVL c(n * 2); REP(i, n * 2) { c[d.leader(i)].push_back(i); } REP(i, n * 2) { if (c[i].empty()) continue; if (use[i]) continue; REP(j, c[i].size()) { use[c[i][j] % n] = use[c[i][j] % n + n] = true; } if (d.same(i%n, i%n + n)) { ll mx = 0; noConflict = false; ll now = i; REP(j, c[i].size()) { dsu dd(n * 2); REP(ii, c[i].size()) { ll v = c[i][ii]; if (v >= n)continue; if (a[c[i][ii]] ^ (c[i][ii] == c[i][j])) { dd.merge(v, p[v]); dd.merge(v + n, p[v] + n); } else { dd.merge(v, p[v] + n); dd.merge(v + n, p[v]); } } if (dd.same(i % n, i % n + n)) continue; ll sum = 0; REP(ii, c[i].size()) { sum += dd.same(i, c[i][ii]) && c[i][ii] >= n; } CHMAX(mx, max(sum, ll(c[i].size()) / 2 - sum)); } high += mx - 1; } else { ll tmp = 0; REP(j, c[i].size()) { tmp += c[i][j] >= n; } high += max(tmp, ll(c[i].size()) - tmp); } } } if (khigh) { cout << "No"; return; } else if (allZero && noConflict && low == k - 1) { cout << "No"; return; } else if (allZero && noConflict && noRev.empty() && low == k - 2) { cout << "No"; } else if (allOne && noConflict && high == k + 1) { cout << "No"; return; } else if (allOne && noConflict && noRev.empty() && high == k + 2) { cout << "No"; } else { cout << "Yes"; } return; } int main() { ll t = 1; //cin >> t; while (t--) { solve(); } return 0; }