oj.uz

답안 #882858

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
882858 2023-12-03T23:04:18 Z MilosMilutinovic Wild Boar (JOI18_wild_boar) C++14
47 / 100
 16046 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(deg[seq[1]], 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]);
    }
  }
  for (int p = 2; p < l; p++) {
    vector<long long> new_dp(deg[seq[p]], inf);
    vector<long long> val(deg[seq[p - 1]], inf);
    for (int i = 0; i < (int) val.size(); i++) {
      for (int j = 0; j < (int) val.size(); 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]);
      }
    }
    swap(dp, new_dp);
  }
  long long res = *min_element(dp.begin(), dp.end());
  cout << (res == inf ? -1 : res) << '\n';
  return 0;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 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 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 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 0 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 1 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 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 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 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 0 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 1 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 19 ms 3928 KB Output is correct
28 Correct 25 ms 3932 KB Output is correct
29 Correct 116 ms 9856 KB Output is correct
30 Correct 148 ms 9812 KB Output is correct
31 Correct 658 ms 9792 KB Output is correct
32 Correct 653 ms 9812 KB Output is correct
33 Correct 99 ms 13652 KB Output is correct
34 Correct 106 ms 13696 KB Output is correct
35 Correct 740 ms 13392 KB Output is correct
36 Correct 434 ms 13636 KB Output is correct
37 Correct 101 ms 13696 KB Output is correct
38 Correct 108 ms 17920 KB Output is correct
39 Correct 229 ms 17744 KB Output is correct
40 Correct 118 ms 17744 KB Output is correct
41 Correct 139 ms 17868 KB Output is correct
42 Correct 253 ms 20600 KB Output is correct
43 Correct 108 ms 22408 KB Output is correct
44 Correct 131 ms 22612 KB Output is correct
45 Correct 105 ms 28104 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 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 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 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 0 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 1 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 19 ms 3928 KB Output is correct
28 Correct 25 ms 3932 KB Output is correct
29 Correct 116 ms 9856 KB Output is correct
30 Correct 148 ms 9812 KB Output is correct
31 Correct 658 ms 9792 KB Output is correct
32 Correct 653 ms 9812 KB Output is correct
33 Correct 99 ms 13652 KB Output is correct
34 Correct 106 ms 13696 KB Output is correct
35 Correct 740 ms 13392 KB Output is correct
36 Correct 434 ms 13636 KB Output is correct
37 Correct 101 ms 13696 KB Output is correct
38 Correct 108 ms 17920 KB Output is correct
39 Correct 229 ms 17744 KB Output is correct
40 Correct 118 ms 17744 KB Output is correct
41 Correct 139 ms 17868 KB Output is correct
42 Correct 253 ms 20600 KB Output is correct
43 Correct 108 ms 22408 KB Output is correct
44 Correct 131 ms 22612 KB Output is correct
45 Correct 105 ms 28104 KB Output is correct
46 Correct 228 ms 29264 KB Output is correct
47 Correct 14137 ms 324576 KB Output is correct
48 Correct 15570 ms 463800 KB Output is correct
49 Correct 15638 ms 562980 KB Output is correct
50 Correct 11065 ms 563180 KB Output is correct
51 Correct 16046 ms 560952 KB Output is correct
52 Correct 4236 ms 561232 KB Output is correct
53 Correct 4288 ms 559876 KB Output is correct
54 Correct 4324 ms 562184 KB Output is correct
55 Correct 4301 ms 560736 KB Output is correct
56 Correct 4412 ms 613460 KB Output is correct
57 Correct 4560 ms 667520 KB Output is correct
58 Correct 4574 ms 725456 KB Output is correct
59 Correct 4623 ms 783184 KB Output is correct
60 Correct 4811 ms 845412 KB Output is correct
61 Correct 4840 ms 909292 KB Output is correct
62 Correct 4742 ms 978120 KB Output is correct
63 Runtime error 4452 ms 1048576 KB Execution killed with signal 9
64 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 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 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 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 0 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 1 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 19 ms 3928 KB Output is correct
28 Correct 25 ms 3932 KB Output is correct
29 Correct 116 ms 9856 KB Output is correct
30 Correct 148 ms 9812 KB Output is correct
31 Correct 658 ms 9792 KB Output is correct
32 Correct 653 ms 9812 KB Output is correct
33 Correct 99 ms 13652 KB Output is correct
34 Correct 106 ms 13696 KB Output is correct
35 Correct 740 ms 13392 KB Output is correct
36 Correct 434 ms 13636 KB Output is correct
37 Correct 101 ms 13696 KB Output is correct
38 Correct 108 ms 17920 KB Output is correct
39 Correct 229 ms 17744 KB Output is correct
40 Correct 118 ms 17744 KB Output is correct
41 Correct 139 ms 17868 KB Output is correct
42 Correct 253 ms 20600 KB Output is correct
43 Correct 108 ms 22408 KB Output is correct
44 Correct 131 ms 22612 KB Output is correct
45 Correct 105 ms 28104 KB Output is correct
46 Correct 228 ms 29264 KB Output is correct
47 Correct 14137 ms 324576 KB Output is correct
48 Correct 15570 ms 463800 KB Output is correct
49 Correct 15638 ms 562980 KB Output is correct
50 Correct 11065 ms 563180 KB Output is correct
51 Correct 16046 ms 560952 KB Output is correct
52 Correct 4236 ms 561232 KB Output is correct
53 Correct 4288 ms 559876 KB Output is correct
54 Correct 4324 ms 562184 KB Output is correct
55 Correct 4301 ms 560736 KB Output is correct
56 Correct 4412 ms 613460 KB Output is correct
57 Correct 4560 ms 667520 KB Output is correct
58 Correct 4574 ms 725456 KB Output is correct
59 Correct 4623 ms 783184 KB Output is correct
60 Correct 4811 ms 845412 KB Output is correct
61 Correct 4840 ms 909292 KB Output is correct
62 Correct 4742 ms 978120 KB Output is correct
63 Runtime error 4452 ms 1048576 KB Execution killed with signal 9
64 Halted 0 ms 0 KB -