Submission #951595

#TimeUsernameProblemLanguageResultExecution timeMemory
951595mochaPaths (BOI18_paths)C++14
0 / 100
67 ms15764 KiB
#include <bits/stdc++.h> using namespace std; const int mx = 3e5+5; int n, m, k; int a[mx]; long long b[6][mx]; long long ans = 0; int main() { cin.tie(0);ios::sync_with_stdio(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; b[a[v]][u]++; b[a[u]][v]++; } for (int i=1;i<=n;i++) { long long tmp = 1; long long cnt = 0; for (int j=1;j<=k;j++) { if (a[i] == j) continue; tmp *= b[j][i]; cnt += b[j][i]; } ans += tmp * 2 + cnt; } cout << ans << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...