Submission #927599

#	Time	Username	Problem	Language	Result	Execution time	Memory
927599		Pragmatism	Paths (BOI18_paths)	C++17	100 / 100	280 ms	98300 KiB

paths

//Bismillahir-Rahmanir-Rahim

#include <bits/stdc++.h>
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,sse4.1,sse4.2,popcnt,avx,avx2")

#define pb push_back
#define pii pair <int, int>
#define pll pair <long long, long long>
#define pld pair <long double, long double>
#define ll long long
#define ld long double
#define x first
#define y second
#define all(v) v.begin(),v.end()
#define sz(s) (int)s.size()
#define skip continue
#define bpop(x) (ll)__builtin_popcountll(x)

using namespace std;

const int N = 3e5 + 7;
const int M = 5e3 + 7;
const int maxA = 2e6 + 7;
const int inf = 1e9 + 7;
const ll INF = 2e18 + 7;
const int MOD = 1e9 + 7;
const ld eps = 1e-9;

pii dir[] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

#define int long long

vector <int> g[N];
int n, m, k, a[N], dp[N][33];
void solve() {
    cin >> n >> m >> k;
    for (int i = 1;i <= n;i++)cin >> a[i], a[i]--;
    for (int i = 1;i <= m;i++) {
        int x, y;
        cin >> x >> y;
        g[x].pb(y), g[y].pb(x);
    }
    int ans = 0;
    for (int i = 1;i <= n;i++)dp[i][(1ll << a[i])]++;
    for (int mask = 0;mask < (1ll << k);mask++) {
        for (int v = 1;v <= n;v++) {
            if (dp[v][mask]) {
                for (auto to : g[v]) {
                    if (mask & (1ll << a[to]))skip;
                    dp[to][mask + (1ll << a[to])] += dp[v][mask];
                }
            }
        }
        for (int i = 1;i <= n;i++)ans += dp[i][mask];
    }
    cout << ans - n;
}
signed main() {
    //srand(time(NULL));
    ios_base::sync_with_stdio(0);
    cout.tie(0);
    //freopen("tests.in", "r", stdin);
    //freopen("milkorder.out", "w", stdout);
    int test = 1;
    //cin >> test;
    for (int t = 1;t <= test;t++) {
        //cout << "Case " << t << ": ";
        solve();
    }
    return 0;
}

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