제출 #1078671

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1078671		steveonalex	Paths (BOI18_paths)	C++17	100 / 100	208 ms	59008 KiB

paths

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 3e5 + 69;
int n, m, k; 
vector<int> graph[N];
int color[N];

int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
    clock_t start = clock();

    cin >> n >> m >> k;
    for(int i = 1; i<=n; ++i){
        cin >> color[i];
        color[i]--;
    }

    for(int i = 1; i<=m; ++i){
        int u, v; cin >> u >> v;
        graph[u].push_back(v);
        graph[v].push_back(u);
    }

    ll dp[MASK(k)][n+1];
    memset(dp, 0, sizeof dp);
    for(int i = 1; i<=n; ++i) dp[MASK(color[i])][i] = 1;

    ll ans = 0;
    for(int mask = 1; mask < MASK(k); ++mask){
        for(int i = 1; i<=n; ++i) if (dp[mask][i]){
            if (pop_cnt(mask) > 1) ans += dp[mask][i];
            for(int j: graph[i]) if (!GETBIT(mask, color[j])){
                dp[mask + MASK(color[j])][j] += dp[mask][i];
            }
        }
    }

    cout << ans << "\n";

    cerr << "Time elapsed: " << clock() - start << " ms\n";
    return 0;
}

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