oj.uz

답안 #882870

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
882870 2023-12-03T23:46:15 Z MilosMilutinovic Wild Boar (JOI18_wild_boar) C++14
62 / 100
 4202 ms 956476 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 = i + 1; 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 = ver + 1; 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++) {
        if (from < to) {
          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);
          }
        } else {
          int x = -1, y = -1;
          for (int j = 0; j < deg[to]; j++) {
            if (x == -1 || dist[to][from][j][i] < dist[to][from][x][i]) {
              y = x;
              x = j; 
            } else if (y == -1 || dist[to][from][j][i] < dist[to][from][y][i]) {
              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++) {
      if (seq[0] <= seq[1]) {
        dp[j] = min(dp[j], dist[seq[0]][seq[1]][i][j]);
      } else {
        dp[j] = min(dp[j], dist[seq[1]][seq[0]][j][i]);
      }
    }
  }
  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]) {
          if (seq[p - 1] <= seq[p]) {
            new_dp[j] = min(new_dp[j], val[i] + dist[seq[p - 1]][seq[p]][i][j]);
          } else {
            new_dp[j] = min(new_dp[j], val[i] + dist[seq[p]][seq[p - 1]][j][i]);
          }
        }
      }
    }
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 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 0 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 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 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 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 0 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 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 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 12 ms 3164 KB Output is correct
28 Correct 11 ms 3164 KB Output is correct
29 Correct 76 ms 7248 KB Output is correct
30 Correct 88 ms 7560 KB Output is correct
31 Correct 137 ms 7504 KB Output is correct
32 Correct 136 ms 7508 KB Output is correct
33 Correct 85 ms 10236 KB Output is correct
34 Correct 79 ms 10252 KB Output is correct
35 Correct 157 ms 10660 KB Output is correct
36 Correct 121 ms 10576 KB Output is correct
37 Correct 84 ms 10212 KB Output is correct
38 Correct 88 ms 13736 KB Output is correct
39 Correct 107 ms 14164 KB Output is correct
40 Correct 87 ms 13648 KB Output is correct
41 Correct 85 ms 13668 KB Output is correct
42 Correct 109 ms 16296 KB Output is correct
43 Correct 87 ms 17492 KB Output is correct
44 Correct 99 ms 17656 KB Output is correct
45 Correct 68 ms 22096 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 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 0 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 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 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 12 ms 3164 KB Output is correct
28 Correct 11 ms 3164 KB Output is correct
29 Correct 76 ms 7248 KB Output is correct
30 Correct 88 ms 7560 KB Output is correct
31 Correct 137 ms 7504 KB Output is correct
32 Correct 136 ms 7508 KB Output is correct
33 Correct 85 ms 10236 KB Output is correct
34 Correct 79 ms 10252 KB Output is correct
35 Correct 157 ms 10660 KB Output is correct
36 Correct 121 ms 10576 KB Output is correct
37 Correct 84 ms 10212 KB Output is correct
38 Correct 88 ms 13736 KB Output is correct
39 Correct 107 ms 14164 KB Output is correct
40 Correct 87 ms 13648 KB Output is correct
41 Correct 85 ms 13668 KB Output is correct
42 Correct 109 ms 16296 KB Output is correct
43 Correct 87 ms 17492 KB Output is correct
44 Correct 99 ms 17656 KB Output is correct
45 Correct 68 ms 22096 KB Output is correct
46 Correct 186 ms 21332 KB Output is correct
47 Correct 3386 ms 236228 KB Output is correct
48 Correct 3569 ms 355184 KB Output is correct
49 Correct 3718 ms 439968 KB Output is correct
50 Correct 3772 ms 439824 KB Output is correct
51 Correct 3888 ms 438096 KB Output is correct
52 Correct 3725 ms 422036 KB Output is correct
53 Correct 3683 ms 421240 KB Output is correct
54 Correct 3748 ms 422416 KB Output is correct
55 Correct 3641 ms 421064 KB Output is correct
56 Correct 3757 ms 465300 KB Output is correct
57 Correct 3852 ms 511048 KB Output is correct
58 Correct 3947 ms 558664 KB Output is correct
59 Correct 4035 ms 607196 KB Output is correct
60 Correct 4149 ms 658312 KB Output is correct
61 Correct 4090 ms 712272 KB Output is correct
62 Correct 4202 ms 769912 KB Output is correct
63 Correct 4139 ms 829456 KB Output is correct
64 Correct 2386 ms 956340 KB Output is correct
65 Correct 2330 ms 956476 KB Output is correct

Subtask #4
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 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 0 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 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 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 12 ms 3164 KB Output is correct
28 Correct 11 ms 3164 KB Output is correct
29 Correct 76 ms 7248 KB Output is correct
30 Correct 88 ms 7560 KB Output is correct
31 Correct 137 ms 7504 KB Output is correct
32 Correct 136 ms 7508 KB Output is correct
33 Correct 85 ms 10236 KB Output is correct
34 Correct 79 ms 10252 KB Output is correct
35 Correct 157 ms 10660 KB Output is correct
36 Correct 121 ms 10576 KB Output is correct
37 Correct 84 ms 10212 KB Output is correct
38 Correct 88 ms 13736 KB Output is correct
39 Correct 107 ms 14164 KB Output is correct
40 Correct 87 ms 13648 KB Output is correct
41 Correct 85 ms 13668 KB Output is correct
42 Correct 109 ms 16296 KB Output is correct
43 Correct 87 ms 17492 KB Output is correct
44 Correct 99 ms 17656 KB Output is correct
45 Correct 68 ms 22096 KB Output is correct
46 Correct 186 ms 21332 KB Output is correct
47 Correct 3386 ms 236228 KB Output is correct
48 Correct 3569 ms 355184 KB Output is correct
49 Correct 3718 ms 439968 KB Output is correct
50 Correct 3772 ms 439824 KB Output is correct
51 Correct 3888 ms 438096 KB Output is correct
52 Correct 3725 ms 422036 KB Output is correct
53 Correct 3683 ms 421240 KB Output is correct
54 Correct 3748 ms 422416 KB Output is correct
55 Correct 3641 ms 421064 KB Output is correct
56 Correct 3757 ms 465300 KB Output is correct
57 Correct 3852 ms 511048 KB Output is correct
58 Correct 3947 ms 558664 KB Output is correct
59 Correct 4035 ms 607196 KB Output is correct
60 Correct 4149 ms 658312 KB Output is correct
61 Correct 4090 ms 712272 KB Output is correct
62 Correct 4202 ms 769912 KB Output is correct
63 Correct 4139 ms 829456 KB Output is correct
64 Correct 2386 ms 956340 KB Output is correct
65 Correct 2330 ms 956476 KB Output is correct
66 Incorrect 12 ms 1116 KB Output isn't correct
67 Halted 0 ms 0 KB -