답안 #104681

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
104681 2019-04-08T19:20:51 Z WLZ Paths (BOI18_paths) C++17
100 / 100
1043 ms 268152 KB
#include <bits/stdc++.h>
using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m, k;
  cin >> n >> m >> k;
  vector<int> a(n + 1);
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    a[i]--;
  }
  vector< vector<int> > g(n + 1);
  for (int i = 0; i < m; i++) {
    int u, v;
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  vector< vector< vector<long long> > > dp(k, vector< vector<long long> >(n + 1, vector<long long>(1 << k, 0)));
  for (int i = 1; i <= n; i++) {
    dp[0][i][1 << a[i]] = 1;
  }
  for (int i = 0; i < k - 1; i++) {
    for (int u = 1; u <= n; u++) {
      for (int mask = 0; mask < (1 << k); mask++) {
        if (dp[i][u][mask] == 0) {
          continue;
        }
        for (auto& v : g[u]) {
          if (mask & (1 << a[v])) {
            continue;
          }
          dp[i + 1][v][mask | (1 << a[v])] += dp[i][u][mask];
        }
      }
    }
  }
  long long ans = 0;
  for (int i = 1; i < k; i++) {
    for (int u = 1; u <= n; u++) {
      for (int mask = 0; mask < (1 << k); mask++) {
        ans += dp[i][u][mask];
      }
    }
  }
  cout << ans << '\n';
  return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 102 ms 8584 KB Output is correct
2 Correct 71 ms 6320 KB Output is correct
3 Correct 698 ms 143788 KB Output is correct
4 Correct 204 ms 14940 KB Output is correct
5 Correct 171 ms 11768 KB Output is correct
6 Correct 492 ms 98512 KB Output is correct
7 Correct 743 ms 143608 KB Output is correct
8 Correct 776 ms 144380 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 102 ms 8584 KB Output is correct
12 Correct 71 ms 6320 KB Output is correct
13 Correct 698 ms 143788 KB Output is correct
14 Correct 204 ms 14940 KB Output is correct
15 Correct 171 ms 11768 KB Output is correct
16 Correct 492 ms 98512 KB Output is correct
17 Correct 743 ms 143608 KB Output is correct
18 Correct 776 ms 144380 KB Output is correct
19 Correct 101 ms 8600 KB Output is correct
20 Correct 74 ms 6268 KB Output is correct
21 Correct 784 ms 143668 KB Output is correct
22 Correct 195 ms 14968 KB Output is correct
23 Correct 214 ms 11912 KB Output is correct
24 Correct 512 ms 98476 KB Output is correct
25 Correct 767 ms 143696 KB Output is correct
26 Correct 788 ms 144352 KB Output is correct
27 Correct 85 ms 6520 KB Output is correct
28 Correct 174 ms 14200 KB Output is correct
29 Correct 1043 ms 268124 KB Output is correct
30 Correct 648 ms 137708 KB Output is correct
31 Correct 668 ms 137712 KB Output is correct
32 Correct 1014 ms 268152 KB Output is correct
33 Correct 3 ms 384 KB Output is correct
34 Correct 3 ms 384 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 3 ms 384 KB Output is correct
37 Correct 3 ms 384 KB Output is correct
38 Correct 3 ms 512 KB Output is correct
39 Correct 3 ms 384 KB Output is correct
40 Correct 2 ms 384 KB Output is correct
41 Correct 2 ms 384 KB Output is correct
42 Correct 3 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 46 ms 2944 KB Output is correct
3 Correct 23 ms 2304 KB Output is correct
4 Correct 182 ms 47864 KB Output is correct
5 Correct 145 ms 48672 KB Output is correct
6 Correct 463 ms 181112 KB Output is correct
7 Correct 34 ms 2424 KB Output is correct
8 Correct 306 ms 89564 KB Output is correct
9 Correct 231 ms 90224 KB Output is correct
10 Correct 306 ms 90096 KB Output is correct
11 Correct 249 ms 91636 KB Output is correct
12 Correct 304 ms 136928 KB Output is correct
13 Correct 255 ms 91632 KB Output is correct
14 Correct 489 ms 180984 KB Output is correct
15 Correct 481 ms 181120 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct