oj.uz

Submission #894246

# Submission time Handle Problem Language Result Execution time Memory
894246 2023-12-28T03:06:30 Z box Paths (BOI18_paths) C++17
100 / 100
 221 ms 73352 KB 
#include <iostream>
#include <vector>
using namespace std;
 
#define ll long long
 
inline int p2(const int& b) { return 1 << b; }
 
const int N = 3e5, K = 5;
 
int main() {
  ios::sync_with_stdio(0), cin.tie(0);
  int n, m, k;
  cin >> n >> m >> k;
  static int c[N];
  for (int i = 0; i < n; i++) cin >> c[i], c[i]--;
  static vector<int> g[N];
  static ll f[1 << K][N];
  for (int h = 0; h < m; h++) {
    int i, j;
    cin >> i >> j, i--, j--;
    if (c[i] != c[j]) {
      g[i].push_back(j), g[j].push_back(i);
      f[p2(c[i]) | p2(c[j])][i] += 1, f[p2(c[i]) | p2(c[j])][j] += 1;
    }
  }
  ll ans = 0;
  for (int b = 0; b < 1 << k; b++)
    for (int i = 0; i < n; i++)
      if (f[b][i]) {
        ans += f[b][i];
        for (int j : g[i])
          if (!(b & p2(c[j]))) f[b | p2(c[j])][j] += f[b][i];
      }
  cout << ans << '\n';
  return 0;
}

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 30164 KB Output is correct
2 Correct 5 ms 30044 KB Output is correct
3 Correct 4 ms 15708 KB Output is correct
4 Correct 3 ms 9564 KB Output is correct
5 Correct 2 ms 7368 KB Output is correct
6 Correct 4 ms 19804 KB Output is correct
7 Correct 4 ms 28044 KB Output is correct
8 Correct 5 ms 30040 KB Output is correct
9 Correct 3 ms 9560 KB Output is correct
10 Correct 3 ms 15708 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 21380 KB Output is correct
2 Correct 55 ms 20056 KB Output is correct
3 Correct 165 ms 34388 KB Output is correct
4 Correct 58 ms 15428 KB Output is correct
5 Correct 37 ms 10952 KB Output is correct
6 Correct 111 ms 30284 KB Output is correct
7 Correct 162 ms 34252 KB Output is correct
8 Correct 150 ms 35160 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 30164 KB Output is correct
2 Correct 5 ms 30044 KB Output is correct
3 Correct 4 ms 15708 KB Output is correct
4 Correct 3 ms 9564 KB Output is correct
5 Correct 2 ms 7368 KB Output is correct
6 Correct 4 ms 19804 KB Output is correct
7 Correct 4 ms 28044 KB Output is correct
8 Correct 5 ms 30040 KB Output is correct
9 Correct 3 ms 9560 KB Output is correct
10 Correct 3 ms 15708 KB Output is correct
11 Correct 56 ms 21380 KB Output is correct
12 Correct 55 ms 20056 KB Output is correct
13 Correct 165 ms 34388 KB Output is correct
14 Correct 58 ms 15428 KB Output is correct
15 Correct 37 ms 10952 KB Output is correct
16 Correct 111 ms 30284 KB Output is correct
17 Correct 162 ms 34252 KB Output is correct
18 Correct 150 ms 35160 KB Output is correct
19 Correct 51 ms 21416 KB Output is correct
20 Correct 50 ms 19892 KB Output is correct
21 Correct 173 ms 34452 KB Output is correct
22 Correct 73 ms 15436 KB Output is correct
23 Correct 37 ms 10836 KB Output is correct
24 Correct 96 ms 30272 KB Output is correct
25 Correct 151 ms 34500 KB Output is correct
26 Correct 169 ms 35128 KB Output is correct
27 Correct 49 ms 36012 KB Output is correct
28 Correct 74 ms 35828 KB Output is correct
29 Correct 191 ms 53224 KB Output is correct
30 Correct 132 ms 43700 KB Output is correct
31 Correct 175 ms 41968 KB Output is correct
32 Correct 221 ms 53380 KB Output is correct
33 Correct 6 ms 30044 KB Output is correct
34 Correct 5 ms 30160 KB Output is correct
35 Correct 3 ms 15568 KB Output is correct
36 Correct 2 ms 9420 KB Output is correct
37 Correct 2 ms 7372 KB Output is correct
38 Correct 4 ms 19804 KB Output is correct
39 Correct 5 ms 27996 KB Output is correct
40 Correct 5 ms 30124 KB Output is correct
41 Correct 3 ms 9564 KB Output is correct
42 Correct 3 ms 15708 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9820 KB Output is correct
2 Correct 39 ms 62768 KB Output is correct
3 Correct 16 ms 17416 KB Output is correct
4 Correct 34 ms 21620 KB Output is correct
5 Correct 26 ms 19580 KB Output is correct
6 Correct 88 ms 73300 KB Output is correct
7 Correct 19 ms 31904 KB Output is correct
8 Correct 46 ms 38152 KB Output is correct
9 Correct 48 ms 28140 KB Output is correct
10 Correct 49 ms 29068 KB Output is correct
11 Correct 50 ms 71860 KB Output is correct
12 Correct 51 ms 34404 KB Output is correct
13 Correct 61 ms 59976 KB Output is correct
14 Correct 81 ms 73352 KB Output is correct
15 Correct 73 ms 73308 KB Output is correct
16 Correct 4 ms 30152 KB Output is correct
17 Correct 5 ms 30044 KB Output is correct
18 Correct 3 ms 15708 KB Output is correct
19 Correct 2 ms 9560 KB Output is correct
20 Correct 2 ms 7588 KB Output is correct
21 Correct 4 ms 19804 KB Output is correct
22 Correct 4 ms 27996 KB Output is correct
23 Correct 5 ms 30116 KB Output is correct
24 Correct 2 ms 9564 KB Output is correct
25 Correct 4 ms 15708 KB Output is correct