제출 #1089582

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1089582		Tymond	Paths (BOI18_paths)	C++17	100 / 100	241 ms	162128 KiB

paths

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

const int MAXN = 3e5 + 7;
const int MAXK = (1 << 5) + 7;
ll dp[MAXN][MAXK];
int in[MAXN][MAXK];
vi g[MAXN];
int a[MAXN];
int n, m, k;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    
    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;
        g[u].pb(v);
        g[v].pb(u);
    }

    queue<pii> q;
    for(int i = 1; i <= n; i++){
        q.push({i, (1 << a[i])});
        dp[i][(1 << a[i])] = 1LL;
        in[i][(1 << a[i])] = 1;
    }

    int v, msk;
    while(sz(q)){
        v = q.front().fi;
        msk = q.front().se;
        q.pop();

        for(auto u : g[v]){
            if((1 << a[u]) & msk){
                continue;
            }
            dp[u][msk | (1 << a[u])] += dp[v][msk];
            if(!in[u][msk | (1 << a[u])]){
                in[u][msk | (1 << a[u])] = 1;
                q.push({u, (msk | (1 << a[u]))});
            }
        }
    }

    ll ans = -n;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j < (1 << k); j++){
            ans = (ll)ans + dp[i][j];
        }
    }

    cout << ans << '\n';

    return 0;
}

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