Submission #547397

#	Time	Username	Problem	Language	Result	Execution time	Memory
547397		Olympia	Paths (BOI18_paths)	C++17	100 / 100	1587 ms	375032 KiB

paths

#include <cmath>
#include <iostream>
#include <set>
#include <climits>
#include <algorithm>
#include <cassert>
#include <vector>
#include <iomanip>
#include <type_traits>
#include <string>
#include <queue>
#include <map>

#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
using namespace std;
vector<vector<int>> adj;
vector<int> color;
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int N, M, K;
    cin >> N >> M >> K;
    adj.resize(32 * N), color.resize(N);
    for (int i = 0; i < N; i++) {
        cin >> color[i];
        color[i]--;
    }
    for (int i = 0; i < M; i++) {
        int u, v;
        cin >> u >> v;
        u--, v--;
        for (int mask_u = 0; mask_u < 32; mask_u++) {
            if (mask_u & (1 << color[u]) && !(mask_u & (1 << color[v]))) {
                adj[mask_u * N + u].push_back((mask_u ^ (1 << color[v])) * N + v);
            }
        }
        for (int mask_v = 0; mask_v < 32; mask_v++) {
            if (mask_v & (1 << color[v]) && !(mask_v & (1 << color[u]))) {
                adj[mask_v * N + v].push_back((mask_v ^ (1 << color[u])) * N + u);
            }
        }
    }
    vector<int64_t> dp;
    dp.assign(32 * N , 0);
    for (int i = 0; i < N; i++) {
        dp[N * (1 << color[i]) + i] = 1;
    }
    for (int bits = 0; bits <= 5; bits++) {
        for (int mask = 0; mask < 32; mask++) {
            if (__builtin_popcount(mask) != bits) {
                continue;
            }
            for (int j = 0; j < N; j++) {
                for (int k: adj[mask * N + j]) {
                    dp[k] += dp[mask * N + j];
                }
            }
        }
    }
    int64_t ans = 0;
    for (int i = 0; i < dp.size(); i++) {
        ans += dp[i];
    }
    cout << ans - N << '\n';
}

Compilation message (stderr)

paths.cpp:15: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   15 | #pragma GCC optimization ("O3")
      | 
paths.cpp:16: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   16 | #pragma GCC optimization ("unroll-loops")
      | 
paths.cpp: In function 'int main()':
paths.cpp:63:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |     for (int i = 0; i < dp.size(); i++) {
      |                     ~~^~~~~~~~~~~

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