oj.uz

답안 #1094913

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1094913 2024-09-30T20:41:29 Z Triseedot Construction Project 2 (JOI24_ho_t2) C++17
100 / 100
 141 ms 30308 KB 
// In honor of El Psy Congroo
 
//#define _GLIBCXX_DEBUG
 
#include <bits/stdc++.h>
#include <random>
#include <chrono>
using namespace std;
 
// variables
using ld = long double;
using ll = long long;
using ull = unsigned long long;
template<typename T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;
// bitwise operations
#define cnt_bit(n) __builtin_popcountll(n)
#define low_bit(n) ((n) & (-(n)))
#define bit(n, i) (((n) >> (i)) & 1)
#define set_bit(n, i) ((n) | (1ll << (i)))
#define reset_bit(n, i) ((n) & ~(1ll << (i)))
#define flip_bit(n, i) ((n) ^ (1ll << (i)))
// math
#define sqr(n) ((n) * (n))
int log2_floor(ull n) {
    return n ? __builtin_clzll(1) - __builtin_clzll(n) : -1;
}
// vector
#define len(x) (int) x.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
template <typename T>
istream& operator>>(istream& is, vector<T>& v) {
    for(auto& el : v) { 
        is >> el;
    }
    return is;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < len(v); i++) {
        if (i) os << ' ';
        os << v[i];
    }
    return os;
}
template<class... Args>
auto create(size_t n, Args&&... args) {
    if constexpr(sizeof...(args) == 1) {
        return vector(n, args...);
    }
    else {
        return vector(n, create(args...));
    }
}
template<typename T>
void remove_dups(vector<T>& v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
}
// random
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
 
//////solution start//////
 
void solve() {
    int n, m;
    cin >> n >> m;
    int s, t, l;
    ll k;
    cin >> s >> t >> l >> k;
    s--, t--;
    vector<vector<pair<int, int>>> g(n);
    for (int i = 0; i < m; i++) {
        int v, u, w;
        cin >> v >> u >> w;
        v--, u--;
        g[v].emplace_back(u, w);
        g[u].emplace_back(v, w);
    }
 
    auto dijkstra = [&] (int start) {
        vector<optional<ll>> dist(n);
        dist[start] = 0;
        min_heap<pair<ll, int>> pq;
        pq.emplace(*dist[start], start);
        while (!pq.empty()) {
            auto [dist_v, v] = pq.top();
            pq.pop();
            if (dist[v] != dist_v) continue;
            for (auto [u, w] : g[v]) {
                if (dist[u].has_value() && *dist[u] <= *dist[v] + w) continue;
                dist[u] = *dist[v] + w;
                pq.emplace(*dist[u], u);
            }
        }
        return dist;
    };
 
    vector dist_s = dijkstra(s), dist_t = dijkstra(t);
    if (dist_s[t].has_value() && dist_s[t] <= k) {
        cout << n * 1ll * (n - 1) / 2;
        return;
    }
    vector<ll> vals;
    for (int v = 0; v < n; v++) {
        if (dist_t[v].has_value()) {
            vals.push_back(*dist_t[v]);
        }
    }
    sort(all(vals));
    ll ans = 0;
    for (int v = 0; v < n; v++) {
        if (!dist_s[v].has_value() || *dist_s[v] + l > k) continue;
        ans += upper_bound(all(vals), k - *dist_s[v] - l) - vals.begin();
    }
    cout << ans << '\n';
}
 
//////solution end//////
 
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    
    int tt = 1;
    //cin >> tt;
    for (int i = 1; i <= tt; i++) {
        solve();
    }
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 604 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 58 ms 23264 KB Output is correct
8 Correct 64 ms 23276 KB Output is correct
9 Correct 57 ms 23900 KB Output is correct
10 Correct 0 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 604 KB Output is correct
14 Correct 33 ms 16976 KB Output is correct
15 Correct 123 ms 23068 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 58 ms 22356 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 38 ms 17048 KB Output is correct
24 Correct 118 ms 23164 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 860 KB Output is correct
27 Correct 73 ms 29004 KB Output is correct
28 Correct 51 ms 16536 KB Output is correct
29 Correct 51 ms 17348 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 400 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 1 ms 436 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 348 KB Output is correct
14 Correct 0 ms 348 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 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 0 ms 464 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

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 400 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 1 ms 436 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 348 KB Output is correct
14 Correct 0 ms 348 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 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 0 ms 464 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 1 ms 604 KB Output is correct
34 Correct 1 ms 724 KB Output is correct
35 Correct 1 ms 708 KB Output is correct
36 Correct 2 ms 736 KB Output is correct
37 Correct 1 ms 600 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 2 ms 604 KB Output is correct
40 Correct 1 ms 852 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 1 ms 608 KB Output is correct
43 Correct 2 ms 616 KB Output is correct
44 Correct 1 ms 616 KB Output is correct
45 Correct 2 ms 600 KB Output is correct
46 Correct 2 ms 604 KB Output is correct
47 Correct 1 ms 604 KB Output is correct
48 Correct 1 ms 604 KB Output is correct
49 Correct 1 ms 604 KB Output is correct
50 Correct 1 ms 604 KB Output is correct
51 Correct 2 ms 604 KB Output is correct
52 Correct 2 ms 600 KB Output is correct
53 Correct 2 ms 860 KB Output is correct
54 Correct 3 ms 860 KB Output is correct
55 Correct 1 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 1 ms 684 KB Output is correct

Subtask #4
47.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 604 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 58 ms 23264 KB Output is correct
8 Correct 64 ms 23276 KB Output is correct
9 Correct 57 ms 23900 KB Output is correct
10 Correct 0 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 604 KB Output is correct
14 Correct 33 ms 16976 KB Output is correct
15 Correct 123 ms 23068 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 58 ms 22356 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 38 ms 17048 KB Output is correct
24 Correct 118 ms 23164 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 860 KB Output is correct
27 Correct 73 ms 29004 KB Output is correct
28 Correct 51 ms 16536 KB Output is correct
29 Correct 51 ms 17348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 400 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 1 ms 436 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 348 KB Output is correct
43 Correct 0 ms 348 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 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 464 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 1 ms 604 KB Output is correct
63 Correct 1 ms 724 KB Output is correct
64 Correct 1 ms 708 KB Output is correct
65 Correct 2 ms 736 KB Output is correct
66 Correct 1 ms 600 KB Output is correct
67 Correct 1 ms 604 KB Output is correct
68 Correct 2 ms 604 KB Output is correct
69 Correct 1 ms 852 KB Output is correct
70 Correct 1 ms 604 KB Output is correct
71 Correct 1 ms 608 KB Output is correct
72 Correct 2 ms 616 KB Output is correct
73 Correct 1 ms 616 KB Output is correct
74 Correct 2 ms 600 KB Output is correct
75 Correct 2 ms 604 KB Output is correct
76 Correct 1 ms 604 KB Output is correct
77 Correct 1 ms 604 KB Output is correct
78 Correct 1 ms 604 KB Output is correct
79 Correct 1 ms 604 KB Output is correct
80 Correct 2 ms 604 KB Output is correct
81 Correct 2 ms 600 KB Output is correct
82 Correct 2 ms 860 KB Output is correct
83 Correct 3 ms 860 KB Output is correct
84 Correct 1 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 1 ms 684 KB Output is correct
88 Correct 87 ms 22576 KB Output is correct
89 Correct 90 ms 22580 KB Output is correct
90 Correct 75 ms 22916 KB Output is correct
91 Correct 36 ms 9044 KB Output is correct
92 Correct 35 ms 9212 KB Output is correct
93 Correct 34 ms 17492 KB Output is correct
94 Correct 35 ms 17492 KB Output is correct
95 Correct 141 ms 25136 KB Output is correct
96 Correct 124 ms 23756 KB Output is correct
97 Correct 136 ms 23496 KB Output is correct
98 Correct 130 ms 23492 KB Output is correct
99 Correct 70 ms 23492 KB Output is correct
100 Correct 61 ms 23492 KB Output is correct
101 Correct 42 ms 9040 KB Output is correct
102 Correct 34 ms 9040 KB Output is correct
103 Correct 35 ms 17488 KB Output is correct
104 Correct 39 ms 17528 KB Output is correct
105 Correct 141 ms 25140 KB Output is correct
106 Correct 137 ms 25144 KB Output is correct
107 Correct 135 ms 30308 KB Output is correct
108 Correct 127 ms 30168 KB Output is correct
109 Correct 66 ms 17308 KB Output is correct
110 Correct 64 ms 17308 KB Output is correct
111 Correct 81 ms 17644 KB Output is correct
112 Correct 80 ms 17564 KB Output is correct