제출 #926965

#제출 시각아이디문제언어결과실행 시간메모리
926965vjudge1Paths (BOI18_paths)C++17
23 / 100
3064 ms15132 KiB
#include<bits/stdc++.h> using namespace std; const int N = (int)3e5+3; const int MOD = (int)1e6+3; int n, m, k, a[N]; vector<int> g[N]; bool used[N]; int ans = 0; void dfs(int v) { used[a[v]] = 1; ans++; for(auto to : g[v]) { if(!used[a[to]]) { dfs(to); } } used[a[v]] = 0; } int main() { ios_base::sync_with_stdio(NULL); cin.tie(0); cin >> n >> m >> k; for(int i = 1; i <= n; ++i) { cin >> a[i]; } for(int i = 1; i <= m; ++i) { int u, v; cin >> u >> v; g[u].push_back(v); g[v].push_back(u); } for(int i = 1; i <= n; ++i) { dfs(i); } cout << ans-n; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...