제출 #1207393

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1207393		dksnfjkfnwkfw	Paths (BOI18_paths)	C++20	100 / 100	297 ms	119560 KiB

paths

#include <bits/stdc++.h>
using namespace std;

#define sonic ios_base::sync_with_stdio(false);cin.tie(0); cout.tie(0)
#define IO(main) if(fopen(main".inp","r")){freopen(main".inp","r",stdin);freopen(main".out","w",stdout);}
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define ins insert
#define pb push_back
#define el cout << endl
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define MASK(i) ((1LL)<<(i))
#define BIT(x,i) (((x)>>(i))&(1LL))
#define FOR(i, a, b) for(int (i)=(a);(i)<=(b); i++)
#define FORD(i, a, b) for(int (i)=(a);(i)>=(b); i--)


using ll = long long;
#define int ll
using ull = unsigned long long;
using ld = long double;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vii = vector<pii>;

const int N = 1e6 + 9;
const int mod = 1e9 + 7;
const ll INF = 1e18 + 7;
const int base = 31;
const int LOG = 20;
const ll MOD = 1e9 + 7;

int mul(int x, int y) {return 1LL * x * y % mod;}
int calPw(int x, int y)
{
    int ans = 1;
    while(y)
    {
        if (y&1) ans = 1LL * ans * x % mod;
        x = 1LL * x * x % mod;
        y >>= 1;
    }
    return ans;
}
int d4x[4] = {1, 0, -1, 0};
int d4y[4] = {0, 1, 0, -1};
int dx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int dy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
///Author: Le Chi Thien Luong The Vinh high school 2008
///code
template<class X, class Y>
bool minimize(X &x , Y y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}
template<class X, class Y>
bool maximize(X &x , Y y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class X, class Y>
bool add(X &x , Y y){
    if((x + y ) >= mod){
        ll tmp  = x + y;
        x = tmp - mod;
        return true;
    }
    return false;
}
void Solve(){

}
int n, m, k;
int a[N];
int dp[N][35];
vector<int>adj[N];
void Read(){
    cin >> n >> m >> k;
    FOR(i, 1, n){
        cin >> a[i];
        a[i]--;
    }
    FOR(i, 1, n)dp[i][MASK(a[i])] = 1;
    FOR(i, 1, m){
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    ll ans =0;
    FOR(mask, 0, MASK(k) - 1){
        FOR(i, 1, n){
            int cnt = __builtin_popcount(mask);
            if(BIT(mask, a[i]) == 0)continue;
            for(int v : adj[i]){
                if(BIT(mask, a[v]) == 1){
                    dp[i][mask] += dp[v][mask ^ MASK(a[i])];
                }
            }
        }
    }
    FOR(i, 1, n){
        FOR(mask, 0, MASK(k) - 1){
            int cnt = __builtin_popcount(mask);
            if(cnt > 1)
            ans += dp[i][mask];
        }
    }
    cout << ans ;
}



signed main()
{
    sonic;

    int TEST = 1;
   // cin >> TEST;
    while(TEST--)
    {

        Read();
        Solve();
    }
}

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