제출 #314414

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
314414	2020-10-19 20:12:23	Temmie	Paths (BOI18_paths)	C++17	100 / 100	1028 ms	109176 KiB

paths

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
typedef long long ll;
int cnt(int x) {
  int r = 0;
  while (x) {
    r += x & 1;
    x >>= 1;
  }
  return r;
}
int main() {
  std::ios::sync_with_stdio(0); std::cin.tie(0);
  
  int n, m, k; std::cin >> n >> m >> k;
  std::vector <int> col(n);
  std::vector <std::vector <ll>> dp(3e5 + 5, std::vector <ll> (32, 0));
  for (int i = 0; i < n; i++) {
    std::cin >> col[i]; col[i]--;
    dp[i][1 << col[i]] = 1;
  }
  std::vector <std::vector <int>> g(n);
  for (int i = 0; i < m; i++) {
    int u, v; std::cin >> u >> v; u--, v--;
    g[u].push_back(v);
    g[v].push_back(u);
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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