#include<bits/stdc++.h>
using namespace std;
const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
#define maxn 330000
int n, m, k, a[maxn], dp[maxn][40], mark[maxn][40];
vector<int> g[maxn];
int dfs(int u, int mask) {
if(mark[u][mask]) return dp[u][mask];
dp[u][mask] = 1;
mark[u][mask] = 1;
for(auto v : g[u]) {
if((mask&(1<<a[v])) != 0) continue;
dp[u][mask] += dfs(v,mask + (1<<a[v]));
}
return dp[u][mask];
}
void solve() {
cin >> n >> m >> k;
for(int i = 1; i <= n; i++) {
cin >> a[i];
a[i]--;
}
for(int i = 1; i <= m; i++) {
int u, v; cin >> u >> v;
if(a[u] == a[v]) continue;
g[u].pb(v);
g[v].pb(u);
}
int ans = 0;
for(int i = 1; i <= n; i++) {
ans+= dfs(i,(1<<a[i]));
}
cout << ans-n << endl;
}
int32_t main() {
ios::sync_with_stdio(false); cin.tie(0);
// freopen("in.in", "r", stdin);
//freopen("out.out", "w", stdout);
int tt = 1;
// cin >> tt;
while(tt--) solve();
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
5 ms |
8012 KB |
0 is not a string of length exactly 15 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
5 ms |
8012 KB |
0 is not a string of length exactly 15 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
5 ms |
8012 KB |
0 is not a string of length exactly 15 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
31 ms |
22236 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
5 ms |
8012 KB |
0 is not a string of length exactly 15 |
2 |
Halted |
0 ms |
0 KB |
- |