oj.uz

Submission #882869

# Submission time Handle Problem Language Result Execution time Memory
882869 2023-12-03T23:40:42 Z MilosMilutinovic Wild Boar (JOI18_wild_boar) C++14
47 / 100
 4282 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++) {
      if (i == j) {
        continue;
      }
      dist[i][j].resize(deg[i]);
      for (int k = 0; k < deg[i]; k++) {
        dist[i][j][k] = vector<long long>(deg[j], inf);
      }
    }
  }
  vector<vector<long long>> d(n);
  for (int i = 0; i < n; i++) {
    d[i].resize(deg[i]);
  }
  vector<int> cnt(n);
  set<tuple<long long, int, int>> st;
  for (int ver = 0; ver < n; ver++) {
    for (int e = 0; e < deg[ver]; e++) {
      for (int i = 0; i < n; i++) {
        for (int j = 0; j < deg[i]; j++) {
          d[i][j] = inf;
        }
        cnt[i] = 0;
      }
      int to = g[ver][e].first;
      int w = g[ver][e].second;
      d[to][idx[to][ver]] = w;
      st.clear();
      st.emplace(d[to][idx[to][ver]], to, idx[to][ver]);
      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++) {
        if (i == ver) {
          continue;
        }
        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]);
      for (int i = 0; i < deg[from]; i++) {
        int x = -1, y = -1;
        for (int j = 0; j < deg[to]; j++) {
          if (x == -1 || dist[from][to][i][j] < dist[from][to][i][x]) {
            y = x;
            x = j; 
          } else if (y == -1 || dist[from][to][i][j] < dist[from][to][i][y]) {
            y = j;
          }
        }  
        if (x != -1) {
          good[from][to][i].push_back(x);
        }
        if (y != -1) {
          good[from][to][i].push_back(y);
        }
      }
    }
  }
  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;
    }
    {
      long long mn = inf;
      for (int i = 0; i < deg[seq[p - 1]]; i++) {
        val[i] = min(val[i], mn);
        mn = min(mn, dp[i]);
      }  
    }
    {
      long long mn = inf;
      for (int i = deg[seq[p - 1]] - 1; i >= 0; i--) {
        val[i] = min(val[i], mn);
        mn = min(mn, dp[i]);
      }
    }
    for (int i = 0; i < deg[seq[p - 1]]; i++) {
      if (val[i] != inf) {
        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 0 ms 348 KB Output is correct
2 Correct 0 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 0 ms 348 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 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 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 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 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 0 ms 348 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 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 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 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 2 ms 756 KB Output is correct
27 Correct 15 ms 3688 KB Output is correct
28 Correct 12 ms 3676 KB Output is correct
29 Correct 76 ms 9740 KB Output is correct
30 Correct 85 ms 9552 KB Output is correct
31 Correct 132 ms 9576 KB Output is correct
32 Correct 123 ms 9808 KB Output is correct
33 Correct 86 ms 13396 KB Output is correct
34 Correct 86 ms 13136 KB Output is correct
35 Correct 133 ms 13136 KB Output is correct
36 Correct 111 ms 13356 KB Output is correct
37 Correct 83 ms 13328 KB Output is correct
38 Correct 89 ms 17488 KB Output is correct
39 Correct 117 ms 17452 KB Output is correct
40 Correct 90 ms 17488 KB Output is correct
41 Correct 93 ms 17504 KB Output is correct
42 Correct 126 ms 20340 KB Output is correct
43 Correct 94 ms 22096 KB Output is correct
44 Correct 123 ms 22100 KB Output is correct
45 Correct 81 ms 27828 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 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 0 ms 348 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 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 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 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 2 ms 756 KB Output is correct
27 Correct 15 ms 3688 KB Output is correct
28 Correct 12 ms 3676 KB Output is correct
29 Correct 76 ms 9740 KB Output is correct
30 Correct 85 ms 9552 KB Output is correct
31 Correct 132 ms 9576 KB Output is correct
32 Correct 123 ms 9808 KB Output is correct
33 Correct 86 ms 13396 KB Output is correct
34 Correct 86 ms 13136 KB Output is correct
35 Correct 133 ms 13136 KB Output is correct
36 Correct 111 ms 13356 KB Output is correct
37 Correct 83 ms 13328 KB Output is correct
38 Correct 89 ms 17488 KB Output is correct
39 Correct 117 ms 17452 KB Output is correct
40 Correct 90 ms 17488 KB Output is correct
41 Correct 93 ms 17504 KB Output is correct
42 Correct 126 ms 20340 KB Output is correct
43 Correct 94 ms 22096 KB Output is correct
44 Correct 123 ms 22100 KB Output is correct
45 Correct 81 ms 27828 KB Output is correct
46 Correct 193 ms 29248 KB Output is correct
47 Correct 3555 ms 320224 KB Output is correct
48 Correct 3662 ms 460704 KB Output is correct
49 Correct 3832 ms 560760 KB Output is correct
50 Correct 3884 ms 560724 KB Output is correct
51 Correct 3867 ms 557848 KB Output is correct
52 Correct 3809 ms 560832 KB Output is correct
53 Correct 3823 ms 559328 KB Output is correct
54 Correct 3798 ms 561392 KB Output is correct
55 Correct 3770 ms 560188 KB Output is correct
56 Correct 3924 ms 613012 KB Output is correct
57 Correct 4026 ms 666660 KB Output is correct
58 Correct 4105 ms 724984 KB Output is correct
59 Correct 4154 ms 782432 KB Output is correct
60 Correct 4223 ms 844756 KB Output is correct
61 Correct 4282 ms 909076 KB Output is correct
62 Correct 4266 ms 978076 KB Output is correct
63 Runtime error 3862 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 0 ms 348 KB Output is correct
2 Correct 0 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 0 ms 348 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 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 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 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 2 ms 756 KB Output is correct
27 Correct 15 ms 3688 KB Output is correct
28 Correct 12 ms 3676 KB Output is correct
29 Correct 76 ms 9740 KB Output is correct
30 Correct 85 ms 9552 KB Output is correct
31 Correct 132 ms 9576 KB Output is correct
32 Correct 123 ms 9808 KB Output is correct
33 Correct 86 ms 13396 KB Output is correct
34 Correct 86 ms 13136 KB Output is correct
35 Correct 133 ms 13136 KB Output is correct
36 Correct 111 ms 13356 KB Output is correct
37 Correct 83 ms 13328 KB Output is correct
38 Correct 89 ms 17488 KB Output is correct
39 Correct 117 ms 17452 KB Output is correct
40 Correct 90 ms 17488 KB Output is correct
41 Correct 93 ms 17504 KB Output is correct
42 Correct 126 ms 20340 KB Output is correct
43 Correct 94 ms 22096 KB Output is correct
44 Correct 123 ms 22100 KB Output is correct
45 Correct 81 ms 27828 KB Output is correct
46 Correct 193 ms 29248 KB Output is correct
47 Correct 3555 ms 320224 KB Output is correct
48 Correct 3662 ms 460704 KB Output is correct
49 Correct 3832 ms 560760 KB Output is correct
50 Correct 3884 ms 560724 KB Output is correct
51 Correct 3867 ms 557848 KB Output is correct
52 Correct 3809 ms 560832 KB Output is correct
53 Correct 3823 ms 559328 KB Output is correct
54 Correct 3798 ms 561392 KB Output is correct
55 Correct 3770 ms 560188 KB Output is correct
56 Correct 3924 ms 613012 KB Output is correct
57 Correct 4026 ms 666660 KB Output is correct
58 Correct 4105 ms 724984 KB Output is correct
59 Correct 4154 ms 782432 KB Output is correct
60 Correct 4223 ms 844756 KB Output is correct
61 Correct 4282 ms 909076 KB Output is correct
62 Correct 4266 ms 978076 KB Output is correct
63 Runtime error 3862 ms 1048576 KB Execution killed with signal 9
64 Halted 0 ms 0 KB -