Affiliate Disclosure: This post contains Amazon affiliate links. If you purchase through these links, eBlogarithm may earn a commission at no extra cost to you. Prices and availability are subject to change.
#include <stdio.h>
#define N 200000
int pp[N], used[N];
void dfs(int i) {
if (used[i])
return;
used[i] = 1;
dfs(pp[i]);
}
int main() {
int n, i, sum, cnt;
static int bb[N];
scanf(“%d”, &n);
for (i = 0; i < n; i++) {
scanf(“%d”, &pp[i]);
pp[i]–;
}
sum = 0;
for (i = 0; i < n; i++) {
scanf(“%d”, &bb[i]);
sum += bb[i];
}
cnt = 0;
for (i = 0; i < n; i++)
if (!used[i]) {
cnt++;
dfs(i);
}
printf(“%d\n”, (cnt == 1 ? 0 : cnt) + (sum % 2 == 0 ? 1 : 0));
return 0;
}
📦 Looking for Codeforces Round 393 Div 8Vc Venture? Check the best deals on Amazon.
🛒 Shop Codeforces Round 393 Div 8Vc Venture on Amazon
As an Amazon Associate, eBlogarithm earns from qualifying purchases. Prices and availability are subject to change.
 (8VC Venture Cup 2017 – Final Round Div. 2 Edition), problem: (C) Pavel and barbecue Solution in C/C++. #include){kind=link}