Submission #996684

# Submission time Handle Problem Language Result Execution time Memory
996684 2024-06-11T05:33:42 Z MilosMilutinovic Construction Project 2 (JOI24_ho_t2) C++14
100 / 100
294 ms 32388 KB
#include <bits/stdc++.h>

using namespace std;

template <typename T>
class fenwick {
 public:
  vector<T> fenw;
  int n;

  fenwick(int _n) : n(_n) {
    fenw.resize(n);
  }

  void modify(int x, T v) {
    while (x < n) {
      fenw[x] += v;
      x |= (x + 1);
    }
  }

  T get(int x) {
    T v{};
    while (x >= 0) {
      v += fenw[x];
      x = (x & (x + 1)) - 1;
    }
    return v;
  }
};

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  int s, t, l;
  cin >> s >> t >> l;
  --s; --t;
  long long k;
  cin >> k;
  vector<vector<pair<int, int>>> g(n);
  for (int i = 0; i < m; i++) {
    int u, v, w;
    cin >> u >> v >> w;
    --u; --v;
    g[u].push_back({v, w});
    g[v].push_back({u, w});
  }
  const long long inf = (long long) 1e18;
  vector<vector<long long>> dist(2, vector<long long>(n));
  auto Dijkstra = [&](int s, vector<long long>& d) {
    d = vector<long long>(n, inf);
    d[s] = 0;
    set<pair<long long, int>> st;
    st.emplace(0, s);
    while (!st.empty()) {
      auto it = st.begin();
      int v = it->second;
      st.erase(it);
      for (auto& e : g[v]) {
        int u = e.first;
        int w = e.second;
        if (d[u] > d[v] + w) {
          if (d[u] != inf) {
            st.erase({d[u], u});
          }
          d[u] = d[v] + w;
          st.emplace(d[u], u);
        }
      }
    }
  };
  Dijkstra(s, dist[0]);
  Dijkstra(t, dist[1]);
  if (dist[0][t] <= k) {
    cout << n * 1LL * (n - 1) / 2 << '\n';
    return 0;
  }
  // dist[0][i] + L <= K - dist[1][j]
  vector<long long> xs;
  for (int i = 0; i < n; i++) {
    xs.push_back(dist[0][i] + l);
    xs.push_back(k - dist[1][i]);
  }
  sort(xs.begin(), xs.end());
  xs.erase(unique(xs.begin(), xs.end()), xs.end());
  int sz = (int) xs.size();
  fenwick<int> fenw(sz);
  long long res = 0;
  vector<int> order(n);
  iota(order.begin(), order.end(), 0);
  sort(order.begin(), order.end(), [&](int i, int j) {
    return dist[0][i] < dist[0][j];
  });
  for (int i : order) {
    res += fenw.get((int) (lower_bound(xs.begin(), xs.end(), k - dist[1][i]) - xs.begin()));
    fenw.modify((int) (lower_bound(xs.begin(), xs.end(), dist[0][i] + l) - xs.begin()), 1);
  }
  cout << res << '\n';
  return 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 1 ms 604 KB Output is correct
6 Correct 2 ms 600 KB Output is correct
7 Correct 77 ms 22616 KB Output is correct
8 Correct 96 ms 22928 KB Output is correct
9 Correct 83 ms 21984 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 2 ms 820 KB Output is correct
14 Correct 47 ms 19452 KB Output is correct
15 Correct 176 ms 23288 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 2 ms 576 KB Output is correct
18 Correct 101 ms 20688 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 2 ms 604 KB Output is correct
23 Correct 46 ms 19208 KB Output is correct
24 Correct 167 ms 22356 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 860 KB Output is correct
27 Correct 103 ms 28408 KB Output is correct
28 Correct 98 ms 15288 KB Output is correct
29 Correct 89 ms 15772 KB Output is correct
# Verdict Execution time Memory 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 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 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 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 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory 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 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 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 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 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 2 ms 604 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 2 ms 616 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 2 ms 604 KB Output is correct
40 Correct 2 ms 860 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 3 ms 604 KB Output is correct
44 Correct 2 ms 604 KB Output is correct
45 Correct 2 ms 604 KB Output is correct
46 Correct 2 ms 604 KB Output is correct
47 Correct 2 ms 604 KB Output is correct
48 Correct 1 ms 604 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 2 ms 604 KB Output is correct
51 Correct 3 ms 604 KB Output is correct
52 Correct 2 ms 604 KB Output is correct
53 Correct 3 ms 860 KB Output is correct
54 Correct 3 ms 860 KB Output is correct
55 Correct 2 ms 604 KB Output is correct
56 Correct 1 ms 604 KB Output is correct
57 Correct 1 ms 604 KB Output is correct
58 Correct 2 ms 600 KB Output is correct
# 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 1 ms 604 KB Output is correct
6 Correct 2 ms 600 KB Output is correct
7 Correct 77 ms 22616 KB Output is correct
8 Correct 96 ms 22928 KB Output is correct
9 Correct 83 ms 21984 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 2 ms 820 KB Output is correct
14 Correct 47 ms 19452 KB Output is correct
15 Correct 176 ms 23288 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 2 ms 576 KB Output is correct
18 Correct 101 ms 20688 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 2 ms 604 KB Output is correct
23 Correct 46 ms 19208 KB Output is correct
24 Correct 167 ms 22356 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 860 KB Output is correct
27 Correct 103 ms 28408 KB Output is correct
28 Correct 98 ms 15288 KB Output is correct
29 Correct 89 ms 15772 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 2 ms 604 KB Output is correct
63 Correct 1 ms 604 KB Output is correct
64 Correct 1 ms 604 KB Output is correct
65 Correct 2 ms 616 KB Output is correct
66 Correct 1 ms 604 KB Output is correct
67 Correct 1 ms 604 KB Output is correct
68 Correct 2 ms 604 KB Output is correct
69 Correct 2 ms 860 KB Output is correct
70 Correct 1 ms 348 KB Output is correct
71 Correct 1 ms 604 KB Output is correct
72 Correct 3 ms 604 KB Output is correct
73 Correct 2 ms 604 KB Output is correct
74 Correct 2 ms 604 KB Output is correct
75 Correct 2 ms 604 KB Output is correct
76 Correct 2 ms 604 KB Output is correct
77 Correct 1 ms 604 KB Output is correct
78 Correct 1 ms 348 KB Output is correct
79 Correct 2 ms 604 KB Output is correct
80 Correct 3 ms 604 KB Output is correct
81 Correct 2 ms 604 KB Output is correct
82 Correct 3 ms 860 KB Output is correct
83 Correct 3 ms 860 KB Output is correct
84 Correct 2 ms 604 KB Output is correct
85 Correct 1 ms 604 KB Output is correct
86 Correct 1 ms 604 KB Output is correct
87 Correct 2 ms 600 KB Output is correct
88 Correct 82 ms 17180 KB Output is correct
89 Correct 100 ms 17496 KB Output is correct
90 Correct 103 ms 21752 KB Output is correct
91 Correct 34 ms 5980 KB Output is correct
92 Correct 34 ms 5972 KB Output is correct
93 Correct 61 ms 20220 KB Output is correct
94 Correct 52 ms 19208 KB Output is correct
95 Correct 249 ms 23540 KB Output is correct
96 Correct 184 ms 18208 KB Output is correct
97 Correct 209 ms 22436 KB Output is correct
98 Correct 166 ms 22008 KB Output is correct
99 Correct 96 ms 21240 KB Output is correct
100 Correct 115 ms 22272 KB Output is correct
101 Correct 36 ms 5980 KB Output is correct
102 Correct 35 ms 6016 KB Output is correct
103 Correct 46 ms 20388 KB Output is correct
104 Correct 52 ms 19964 KB Output is correct
105 Correct 247 ms 23100 KB Output is correct
106 Correct 250 ms 22776 KB Output is correct
107 Correct 280 ms 32388 KB Output is correct
108 Correct 294 ms 28552 KB Output is correct
109 Correct 122 ms 15096 KB Output is correct
110 Correct 150 ms 15128 KB Output is correct
111 Correct 82 ms 16184 KB Output is correct
112 Correct 93 ms 15260 KB Output is correct