제출 #1128120

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1128120		underwaterkillerwhale	Paths (BOI18_paths)	C++20	100 / 100	913 ms	933540 KiB

paths

//#include"holiday.h"
#include <bits/stdc++.h>
#define ll long long
#define rep(i,m,n) for(int i=(m); i<=(n); i++)
#define REB(i,m,n) for(int i=(m); i>=(n); i--)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define MP make_pair
#define fs first
#define se second
#define bit(msk, i) ((msk >> i) & 1)
#define iter(id, v) for(auto id : v)
#define pb push_back
#define SZ(v) (ll)v.size()
#define ALL(v) v.begin(),v.end()

using namespace std;

mt19937_64 rd(chrono :: steady_clock :: now ().time_since_epoch().count());
ll Rand (ll l, ll r) { return uniform_int_distribution<ll> (l, r) (rd); }

const int N = 3e5 + 7;
const int Mod = 1e9 + 7;///lon
const ll INF = 1e18 + 7;
const ll BASE = 137;
const int szBL = 450;

int n, m, K;
int a[N];
vector<int> ke[N];
ll dp[N][10][(1 << 5) + 7];

void solution() {
    cin >> n >> m >> K;
    rep (i, 1, n) cin >> a[i], --a[i];
    rep (i, 1, m) {
        int u, v;
        cin >> u >> v;
        ke[u].pb(v);
        ke[v].pb(u);
    }
    rep (i, 1, n) {
        dp[i][1][(1 << a[i])] = 1;
    }
    rep (msk, 0, (1 << K) - 1) {
        int Len = __builtin_popcount(msk);
        rep (u, 1, n) {
            if (!bit(msk, a[u])) continue;
            iter (&v, ke[u]) {
                dp[u][Len][msk] += dp[v][Len - 1][msk ^ (1 << a[u])];
            }
        }
    }
    ll res = 0;
    rep (i, 1, n) {
        rep (j, 2, K) {
            rep (msk, 0, (1 << K) - 1) {
                res += dp[i][j][msk];
            }
        }
    }
    cout << res <<"\n";
}

#define file(name) freopen(name".inp","r",stdin); \
freopen(name".out","w",stdout);
int main () {
//    file("c");
    ios_base :: sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int num_Test = 1;
//    cin >> num_Test;
    while (num_Test--)
        solution();
}
/*
no bug challenge +36
10 2
1 2 3 1 4 5 1 2 1 2
1 2
2 3
3 4
4 5
5 6
6 7
7 8
8 9
9 10
1 10
4 9
*/

• Subtask 1: 23 / 23
• Subtask 2: 20 / 20
• Subtask 3: 27 / 27
• Subtask 4: 30 / 30