This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// Bismi Allah
#include "bits/stdc++.h"
using namespace std;
#define int long long
signed main () {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n, m, k, ans = 0;
cin >> n >> m >> k;
vector <int> color(n), g[n], used(n);
set <int> colorUsed;
function <void(int)> dfs=[&](int v) {
ans ++;
used[v] = 1;
colorUsed.insert(color[v]);
for(auto u : g[v] ) {
if(!used[u] && colorUsed.count(color[u]) == 0) dfs(u);
}
used[v]=0;
colorUsed.erase(color[v]);
};
for(int i = 0; i < n; i ++) cin >> color[i];
for(int i = 0; i < m; i ++) {
int u, v;
cin >> u >> v;
u --, v --;
g[u].push_back(v);
g[v].push_back(u);
}
/*for(int firstColor = 1; firstColor <= k; firstColor ++) {
for(int i = 0; i < n; i ++) {
if(color[i] == firstColor) {
dfs(i);
}
}
}*/
for(int i = 0; i < n; i ++) {
if(!used[i]) dfs(i);
}
cout << ans-n;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |