# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1167588 | sasde | Paths (BOI18_paths) | C++20 | 199 ms | 91972 KiB |
#include<bits/stdc++.h>
#define task "strdel"
#define ii pair<int,int>
#define iii pair<int,ii>
#define iv pair<ii,ii>
#define se second
#define fi first
#define ffi fi.fi
#define sfi se.fi
#define sse se.se
#define fse fi.se
#define lt(i, c, d) for(int i = c; i <= d; ++i)
#define fl(i, c, d) for(int i = d; i >= c; --i)
#define pb push_back
#define emb emplace_back
#define emf emplace_front
#define em emplace
using namespace std;
const int N=3e5+5,lg=20,mod=1e9+7;
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int Rand(int u,int v){
return u+rd()%(v-u+1);
}
long long dp[N][(1<<5)];
int p[N],m,n,k;
vector<int>a[N];
void solve(){
cin >> n >> m >> k;
for(int i=1;i<=n;++i){
cin >> p[i];
--p[i];
dp[i][(1<<p[i])]=1;
}
for(int i=1;i<=m;++i){
int u,v;
cin >> u >> v;
a[u].emb(v);
a[v].emb(u);
}
int ans=0;
for(int mask=0;mask<(1<<k);++mask){
for(int u=1;u<=n;++u){
for(int v:a[u]){
if(mask&(1<<p[v]))
dp[v][mask]+=dp[u][mask^(1<<p[v])];
}
}
}
for(int mask=0;mask<(1<<k);++mask)for(int i=1;i<=n;++i)ans+=dp[i][mask];
cout << ans-n;
}
main()
{
srand(time(0));
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
if(fopen(task".inp","r")){
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
int t=1;
// cin >> t;
while(t--){
solve();
cout<<'\n';
}
}
Compilation message (stderr)
# | 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... |