제출 #1287103

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1287103		wedonttalkanymore	Paths (BOI18_paths)	C++20	100 / 100	388 ms	171196 KiB

paths

#include <bits/stdc++.h>
/*
    Phia ben kia dai duong cung chi co
    Bo cat nang niu bien thoi
*/
using namespace std;
using ll = long long;

#define int long long
#define pii pair<ll, ll>
#define fi first
#define se second

const ll N = 3e5 + 5, inf = 1e18, mod = 1e9 + 7, block = 320, lim = 6;

int n, m, k;
int a[N];
vector <int> adj[N];
int dp[N][1 << lim];

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    if (fopen(".inp", "r")) {
        freopen(".inp", "r", stdin);
        freopen(".out", "w", stdout);
    }
    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;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    for (int i = 1; i <= n; i++) dp[i][1 << a[i]] = 1;
    for (int mask = 1; mask < (1 << k); mask++) {
        for (int u = 1; u <= n; u++) {
            for (auto v : adj[u]) {
                if (!((mask >> a[v]) & 1)) {
                    dp[v][mask | (1 << a[v])] += dp[u][mask];
                }
            }
        }
    }
    int ans = 0;
    for (int mask = 1; mask < (1 << k); mask++) {
        for (int i = 1; i <= n; i++) {
            if (__builtin_popcount(mask) > 1) ans += dp[i][mask];
        }
    }
    cout << ans;
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

paths.cpp: In function 'int main()':
paths.cpp:25:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |         freopen(".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~
paths.cpp:26:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |         freopen(".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~

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