oj.uz

Submission #882860

# Submission time Handle Problem Language Result Execution time Memory
882860 2023-12-03T23:11:46 Z MilosMilutinovic Wild Boar (JOI18_wild_boar) C++14
47 / 100
 17428 ms 1048576 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m, t, l;
  cin >> n >> m >> t >> l;
  vector<vector<pair<int, int>>> g(n);
  for (int i = 0; i < m; i++) {
    int x, y, z;
    cin >> x >> y >> z;
    --x; --y;
    g[x].emplace_back(y, z);
    g[y].emplace_back(x, z);
  }
  vector<int> seq(l);
  for (int i = 0; i < l; i++) {
    cin >> seq[i];
    --seq[i];
  }
  {
    int p, x;
    cin >> p >> x;
    --p; --x;
    seq[p] = x;
  }
  vector<int> deg(n);
  for (int i = 0; i < n; i++) {
    deg[i] = (int) g[i].size();
  }
  vector<vector<int>> idx(n, vector<int>(n));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < deg[i]; j++) {
      idx[i][g[i][j].first] = j;
    }
  }
  const long long inf = (long long) 1e18;
  vector<vector<vector<vector<long long>>>> dist(n, vector<vector<vector<long long>>>(n));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      dist[i][j].resize(deg[i]);
      for (int k = 0; k < deg[i]; k++) {
        dist[i][j][k] = vector<long long>(deg[j], inf);
      }
    }
  }
  for (int ver = 0; ver < n; ver++) {
    for (int e = 0; e < deg[ver]; e++) {
      vector<vector<long long>> d(n);
      for (int i = 0; i < n; i++) {
        d[i] = vector<long long>(deg[i], inf);
      }
      int to = g[ver][e].first;
      int w = g[ver][e].second;
      d[to][idx[to][ver]] = w;
      set<tuple<long long, int, int>> st;
      st.emplace(d[to][idx[to][ver]], to, idx[to][ver]);
      vector<int> cnt(n);
      while (!st.empty()) {
        auto it = st.begin();
        int v = get<1>(*it);
        int lst = get<2>(*it);
        st.erase(it);
        cnt[v] += 1;
        if (cnt[v] >= 3) {
          continue;
        }
        for (int i = 0; i < deg[v]; i++) {
          if (i == lst) {
            continue;
          }
          int to = g[v][i].first;
          int w = g[v][i].second;
          if (d[to][idx[to][v]] > d[v][lst] + w) {
            if (d[to][idx[to][v]] != inf) {
              st.erase(st.find({d[to][idx[to][v]], to, idx[to][v]}));
            }
            d[to][idx[to][v]] = d[v][lst] + w;
            st.emplace(d[to][idx[to][v]], to, idx[to][v]);
          }
        }
      }
      for (int i = 0; i < n; i++) {
        for (int j = 0; j < deg[i]; j++) {
          dist[ver][i][e][j] = d[i][j];
        }
      }
    }
  }
  vector<vector<vector<vector<int>>>> good(n, vector<vector<vector<int>>>(n));
  for (int from = 0; from < n; from++) {
    for (int to = 0; to < n; to++) {
      if (from == to) {
        continue;
      }
      good[from][to].resize(deg[from]);
      vector<int> order(deg[to]);
      iota(order.begin(), order.end(), 0);
      for (int i = 0; i < deg[from]; i++) {
        sort(order.begin(), order.end(), [&](int a, int b) {
          return dist[from][to][i][a] < dist[from][to][i][b]; 
        });
        for (int j = 0; j < min(deg[to], 3); j++) {
          good[from][to][i].push_back(order[j]);
        }
      }
    }
  }
  vector<long long> dp(n, inf);
  for (int i = 0; i < deg[seq[0]]; i++) {
    for (int j = 0; j < deg[seq[1]]; j++) {
      dp[j] = min(dp[j], dist[seq[0]][seq[1]][i][j]);
    }
  }
  vector<long long> new_dp(n);
  vector<long long> val(n);
  for (int p = 2; p < l; p++) {
    for (int i = 0; i < deg[seq[p]]; i++) {
      new_dp[i] = inf;
    }
    for (int i = 0; i < deg[seq[p - 1]]; i++) {
      val[i] = inf;
    }
    for (int i = 0; i < deg[seq[p - 1]]; i++) {
      for (int j = 0; j < deg[seq[p - 1]]; j++) {
        if (i != j) {
          val[i] = min(val[i], dp[j]);
        }
      }
    }
    for (int i = 0; i < deg[seq[p - 1]]; i++) {
      for (int j : good[seq[p - 1]][seq[p]][i]) {
        new_dp[j] = min(new_dp[j], val[i] + dist[seq[p - 1]][seq[p]][i][j]);
      }
    }
    for (int i = 0; i < deg[seq[p]]; i++) {
      dp[i] = new_dp[i];
    }
  }
  long long res = inf;
  for (int i = 0; i < deg[seq.back()]; i++) {
    res = min(res, dp[i]);
  }
  cout << (res == inf ? -1 : res) << '\n';
  return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 756 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 452 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 756 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 452 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 16 ms 3932 KB Output is correct
28 Correct 15 ms 3932 KB Output is correct
29 Correct 101 ms 9828 KB Output is correct
30 Correct 147 ms 10012 KB Output is correct
31 Correct 599 ms 9812 KB Output is correct
32 Correct 627 ms 9992 KB Output is correct
33 Correct 113 ms 13652 KB Output is correct
34 Correct 100 ms 13716 KB Output is correct
35 Correct 881 ms 13596 KB Output is correct
36 Correct 372 ms 13496 KB Output is correct
37 Correct 102 ms 13652 KB Output is correct
38 Correct 101 ms 17748 KB Output is correct
39 Correct 241 ms 17728 KB Output is correct
40 Correct 108 ms 17928 KB Output is correct
41 Correct 131 ms 18112 KB Output is correct
42 Correct 240 ms 20424 KB Output is correct
43 Correct 113 ms 22404 KB Output is correct
44 Correct 105 ms 22620 KB Output is correct
45 Correct 79 ms 28356 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 756 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 452 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 16 ms 3932 KB Output is correct
28 Correct 15 ms 3932 KB Output is correct
29 Correct 101 ms 9828 KB Output is correct
30 Correct 147 ms 10012 KB Output is correct
31 Correct 599 ms 9812 KB Output is correct
32 Correct 627 ms 9992 KB Output is correct
33 Correct 113 ms 13652 KB Output is correct
34 Correct 100 ms 13716 KB Output is correct
35 Correct 881 ms 13596 KB Output is correct
36 Correct 372 ms 13496 KB Output is correct
37 Correct 102 ms 13652 KB Output is correct
38 Correct 101 ms 17748 KB Output is correct
39 Correct 241 ms 17728 KB Output is correct
40 Correct 108 ms 17928 KB Output is correct
41 Correct 131 ms 18112 KB Output is correct
42 Correct 240 ms 20424 KB Output is correct
43 Correct 113 ms 22404 KB Output is correct
44 Correct 105 ms 22620 KB Output is correct
45 Correct 79 ms 28356 KB Output is correct
46 Correct 224 ms 29520 KB Output is correct
47 Correct 13320 ms 324324 KB Output is correct
48 Correct 13308 ms 463984 KB Output is correct
49 Correct 10447 ms 562768 KB Output is correct
50 Correct 10598 ms 562972 KB Output is correct
51 Correct 17428 ms 560904 KB Output is correct
52 Correct 4219 ms 560880 KB Output is correct
53 Correct 4177 ms 559440 KB Output is correct
54 Correct 4242 ms 561760 KB Output is correct
55 Correct 4168 ms 560328 KB Output is correct
56 Correct 4379 ms 612984 KB Output is correct
57 Correct 4384 ms 666924 KB Output is correct
58 Correct 4464 ms 725040 KB Output is correct
59 Correct 4506 ms 782476 KB Output is correct
60 Correct 4591 ms 844884 KB Output is correct
61 Correct 4610 ms 909140 KB Output is correct
62 Correct 4623 ms 978112 KB Output is correct
63 Runtime error 4190 ms 1048576 KB Execution killed with signal 9
64 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 756 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 452 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 16 ms 3932 KB Output is correct
28 Correct 15 ms 3932 KB Output is correct
29 Correct 101 ms 9828 KB Output is correct
30 Correct 147 ms 10012 KB Output is correct
31 Correct 599 ms 9812 KB Output is correct
32 Correct 627 ms 9992 KB Output is correct
33 Correct 113 ms 13652 KB Output is correct
34 Correct 100 ms 13716 KB Output is correct
35 Correct 881 ms 13596 KB Output is correct
36 Correct 372 ms 13496 KB Output is correct
37 Correct 102 ms 13652 KB Output is correct
38 Correct 101 ms 17748 KB Output is correct
39 Correct 241 ms 17728 KB Output is correct
40 Correct 108 ms 17928 KB Output is correct
41 Correct 131 ms 18112 KB Output is correct
42 Correct 240 ms 20424 KB Output is correct
43 Correct 113 ms 22404 KB Output is correct
44 Correct 105 ms 22620 KB Output is correct
45 Correct 79 ms 28356 KB Output is correct
46 Correct 224 ms 29520 KB Output is correct
47 Correct 13320 ms 324324 KB Output is correct
48 Correct 13308 ms 463984 KB Output is correct
49 Correct 10447 ms 562768 KB Output is correct
50 Correct 10598 ms 562972 KB Output is correct
51 Correct 17428 ms 560904 KB Output is correct
52 Correct 4219 ms 560880 KB Output is correct
53 Correct 4177 ms 559440 KB Output is correct
54 Correct 4242 ms 561760 KB Output is correct
55 Correct 4168 ms 560328 KB Output is correct
56 Correct 4379 ms 612984 KB Output is correct
57 Correct 4384 ms 666924 KB Output is correct
58 Correct 4464 ms 725040 KB Output is correct
59 Correct 4506 ms 782476 KB Output is correct
60 Correct 4591 ms 844884 KB Output is correct
61 Correct 4610 ms 909140 KB Output is correct
62 Correct 4623 ms 978112 KB Output is correct
63 Runtime error 4190 ms 1048576 KB Execution killed with signal 9
64 Halted 0 ms 0 KB -