# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1176302 | CrabCNH | Paths (BOI18_paths) | C++20 | 251 ms | 69572 KiB |
#include <bits/stdc++.h>
#define task "BriantheCrab"
#define int long long
#define pii pair <int, int>
#define fi first
#define se second
#define szf sizeof
#define sz(s) (int)((s).size())
using namespace std;
template <class T> void mini (T &t, T f) {if (t > f) t = f;}
template <class T> void maxi (T &t, T f) {if (t < f) t = f;}
const int maxN = 3e5 + 5;
const int inf = 1e18 + 7;
const int mod = 1e9 + 7;
int a[maxN];
vector <int> adj[maxN];
vector <vector <int>> dp;
bool bit (int x, int i) {
return ((x >> i) & 1);
}
int flip (int x, int i) {
return (x | (1 << i));
}
void solve () {
int n, m, k;
cin >> n >> m >> k;
dp.resize (n + 1, vector <int> ((1 << (k)) + 1));
for (int i = 1; i <= n; i ++) {
cin >> a[i];
a[i] --;
dp[i][flip (0, a[i])] = 1;
}
for (int i = 1; i <= m; i ++) {
int u, v;
cin >> u >> v;
adj[u].push_back (v);
adj[v].push_back (u);
}
int res = 0;
for (int mask = 0; mask < (1 << k); mask ++) {
for (int i = 1; i <= n; i ++) {
if (bit (mask, a[i]) == 1) {
for (auto j : adj[i]) {
if (bit (mask, a[j]) == 0) {
dp[j][flip (mask, a[j])] += dp[i][mask];
}
}
//cout << dp[i][mask] << '\n';
res += dp[i][mask] * (__builtin_popcount (mask) >= 2);
}
}
}
cout << res;
return;
}
signed main () {
cin.tie (nullptr) -> sync_with_stdio (false);
if (fopen (task".inp", "r")) {
freopen (task".inp", "r", stdin);
freopen (task".out", "w", stdout);
}
int t = 1;
//cin >> t;
while (t --) {
solve ();
}
return 0;
}
// thfdgb
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |