# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
446576 | keta_tsimakuridze | Paths (BOI18_paths) | C++14 | 733 ms | 79840 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define f first
#define s second
#define ll long long
using namespace std;
const int N=3e5+5,mod=1e9+7;
int t,n,m,k,cnt[N],col[N];
vector<pair<int,ll> > en[34];
vector<int> V[N][6];
main(){
cin>>n>>m>>k;
for(int i=1;i<=n;i++){
cin>>col[i];
col[i]--;
V[0][col[i]].push_back(i);
}
for(int i=1;i<=m;i++) {
int u,v;
cin>>u>>v;
V[u][col[v]].push_back(v);
V[v][col[u]].push_back(u);
}
en[0].push_back({0,1});
ll ans = -n;
for(int i = 1; i<(1<<k); i++) {
for(int j=1;j<=n;j++) cnt[j] = 0;
for(int j=0;j<k;j++) {
if(!((1<<j) & i)) continue;
int b = i ^ (1<<j);
for(int k=0; k<en[b].size(); k++){
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... |