oj.uz

답안 #1112285

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1112285 2024-11-14T02:44:29 Z Zero_OP Construction Project 2 (JOI24_ho_t2) C++14
53 / 100
 2000 ms 26564 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long

const long long inf = 1e18;

void testcase(){
    int N, M, S, T, L; long long K;
    cin >> N >> M >> S >> T >> L >> K;

    --S, --T;
    vector<vector<pair<int, int>>> adj(N);
    while(M--){
        int u, v, w;
        cin >> u >> v >> w;
        --u, --v;
        adj[u].emplace_back(v, w);
        adj[v].emplace_back(u, w);
    }

    auto dijkstra = [&](int s){
        vector<long long> d(N, inf);
        d[s] = 0;

        using node = pair<long long, int>;
        priority_queue<node, vector<node>, greater<node>> pq;
        pq.push({d[s], s});

        while(!pq.empty()){
            long long cur; int u;
            tie(cur, u) = pq.top(); pq.pop();
            for(auto [v, w] : adj[u]){
                if(d[v] > d[u] + w){
                    d[v] = d[u] + w;
                    pq.push({d[v], v});
                }
            }
        }
        return d;
    };

    vector<long long> dS = dijkstra(S), dT = dijkstra(T);

    if(dS[T] <= K){
        cout << 1LL * N * (N - 1) / 2;
        return;
    }

    vector<long long> vS, vT;
    for(int i = 0; i < N; ++i){
        vS.emplace_back(dS[i]);
        vT.emplace_back(dT[i]);
    }

    sort(vS.begin(), vS.end());
    sort(vT.begin(), vT.end());

    long long cnt = 0;
    for(int i = 0; i < N; ++i){
        cnt += upper_bound(vS.begin(), vS.end(), K - L - dT[i]) - vS.begin();
        cnt += upper_bound(vT.begin(), vT.end(), K - L - dS[i]) - vT.begin();
    }

    assert(cnt & 1 ^ 1);
    cout << cnt / 2 << '\n';
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int T = 1;
//    cin >> T;
    while(T--) testcase();

    return 0;
}

Compilation message

Main.cpp: In lambda function:
Main.cpp:34:22: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   34 |             for(auto [v, w] : adj[u]){
      |                      ^
In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from Main.cpp:1:
Main.cpp: In function 'void testcase()':
Main.cpp:66:16: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   66 |     assert(cnt & 1 ^ 1);
      |            ~~~~^~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 592 KB Output is correct
6 Correct 2 ms 592 KB Output is correct
7 Correct 70 ms 22264 KB Output is correct
8 Correct 74 ms 22176 KB Output is correct
9 Correct 63 ms 21164 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 2 ms 592 KB Output is correct
13 Correct 2 ms 592 KB Output is correct
14 Correct 44 ms 18788 KB Output is correct
15 Correct 146 ms 23988 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 2 ms 556 KB Output is correct
18 Correct 80 ms 22976 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 440 KB Output is correct
21 Correct 2 ms 592 KB Output is correct
22 Correct 2 ms 592 KB Output is correct
23 Correct 47 ms 18792 KB Output is correct
24 Correct 160 ms 23756 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 2 ms 592 KB Output is correct
27 Correct 88 ms 26564 KB Output is correct
28 Correct 66 ms 16552 KB Output is correct
29 Correct 65 ms 19204 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 504 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 504 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 500 KB Output is correct
30 Correct 1 ms 504 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 504 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 504 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 500 KB Output is correct
30 Correct 1 ms 504 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 3 ms 592 KB Output is correct
34 Correct 2 ms 592 KB Output is correct
35 Correct 1 ms 592 KB Output is correct
36 Correct 2 ms 592 KB Output is correct
37 Correct 2 ms 592 KB Output is correct
38 Correct 2 ms 592 KB Output is correct
39 Correct 2 ms 592 KB Output is correct
40 Correct 2 ms 592 KB Output is correct
41 Correct 1 ms 592 KB Output is correct
42 Correct 1 ms 592 KB Output is correct
43 Correct 2 ms 592 KB Output is correct
44 Correct 2 ms 592 KB Output is correct
45 Correct 2 ms 592 KB Output is correct
46 Correct 2 ms 592 KB Output is correct
47 Correct 2 ms 592 KB Output is correct
48 Correct 2 ms 592 KB Output is correct
49 Correct 1 ms 592 KB Output is correct
50 Correct 2 ms 764 KB Output is correct
51 Correct 3 ms 592 KB Output is correct
52 Correct 3 ms 592 KB Output is correct
53 Correct 3 ms 708 KB Output is correct
54 Correct 3 ms 592 KB Output is correct
55 Correct 3 ms 592 KB Output is correct
56 Correct 4 ms 804 KB Output is correct
57 Correct 2 ms 592 KB Output is correct
58 Correct 2 ms 612 KB Output is correct

Subtask #4
0.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 592 KB Output is correct
6 Correct 2 ms 592 KB Output is correct
7 Correct 70 ms 22264 KB Output is correct
8 Correct 74 ms 22176 KB Output is correct
9 Correct 63 ms 21164 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 2 ms 592 KB Output is correct
13 Correct 2 ms 592 KB Output is correct
14 Correct 44 ms 18788 KB Output is correct
15 Correct 146 ms 23988 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 2 ms 556 KB Output is correct
18 Correct 80 ms 22976 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 440 KB Output is correct
21 Correct 2 ms 592 KB Output is correct
22 Correct 2 ms 592 KB Output is correct
23 Correct 47 ms 18792 KB Output is correct
24 Correct 160 ms 23756 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 2 ms 592 KB Output is correct
27 Correct 88 ms 26564 KB Output is correct
28 Correct 66 ms 16552 KB Output is correct
29 Correct 65 ms 19204 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 504 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 1 ms 336 KB Output is correct
40 Correct 1 ms 336 KB Output is correct
41 Correct 1 ms 504 KB Output is correct
42 Correct 1 ms 336 KB Output is correct
43 Correct 1 ms 336 KB Output is correct
44 Correct 1 ms 336 KB Output is correct
45 Correct 1 ms 336 KB Output is correct
46 Correct 1 ms 336 KB Output is correct
47 Correct 1 ms 336 KB Output is correct
48 Correct 1 ms 336 KB Output is correct
49 Correct 1 ms 336 KB Output is correct
50 Correct 1 ms 336 KB Output is correct
51 Correct 1 ms 336 KB Output is correct
52 Correct 1 ms 336 KB Output is correct
53 Correct 1 ms 336 KB Output is correct
54 Correct 1 ms 336 KB Output is correct
55 Correct 1 ms 336 KB Output is correct
56 Correct 1 ms 336 KB Output is correct
57 Correct 1 ms 336 KB Output is correct
58 Correct 1 ms 500 KB Output is correct
59 Correct 1 ms 504 KB Output is correct
60 Correct 1 ms 336 KB Output is correct
61 Correct 1 ms 336 KB Output is correct
62 Correct 3 ms 592 KB Output is correct
63 Correct 2 ms 592 KB Output is correct
64 Correct 1 ms 592 KB Output is correct
65 Correct 2 ms 592 KB Output is correct
66 Correct 2 ms 592 KB Output is correct
67 Correct 2 ms 592 KB Output is correct
68 Correct 2 ms 592 KB Output is correct
69 Correct 2 ms 592 KB Output is correct
70 Correct 1 ms 592 KB Output is correct
71 Correct 1 ms 592 KB Output is correct
72 Correct 2 ms 592 KB Output is correct
73 Correct 2 ms 592 KB Output is correct
74 Correct 2 ms 592 KB Output is correct
75 Correct 2 ms 592 KB Output is correct
76 Correct 2 ms 592 KB Output is correct
77 Correct 2 ms 592 KB Output is correct
78 Correct 1 ms 592 KB Output is correct
79 Correct 2 ms 764 KB Output is correct
80 Correct 3 ms 592 KB Output is correct
81 Correct 3 ms 592 KB Output is correct
82 Correct 3 ms 708 KB Output is correct
83 Correct 3 ms 592 KB Output is correct
84 Correct 3 ms 592 KB Output is correct
85 Correct 4 ms 804 KB Output is correct
86 Correct 2 ms 592 KB Output is correct
87 Correct 2 ms 612 KB Output is correct
88 Correct 115 ms 18980 KB Output is correct
89 Correct 101 ms 18984 KB Output is correct
90 Correct 99 ms 24608 KB Output is correct
91 Correct 44 ms 10832 KB Output is correct
92 Correct 42 ms 11080 KB Output is correct
93 Correct 49 ms 18784 KB Output is correct
94 Correct 46 ms 18864 KB Output is correct
95 Correct 179 ms 24096 KB Output is correct
96 Correct 142 ms 20248 KB Output is correct
97 Correct 169 ms 23952 KB Output is correct
98 Correct 172 ms 23992 KB Output is correct
99 Correct 78 ms 22960 KB Output is correct
100 Correct 75 ms 22848 KB Output is correct
101 Correct 41 ms 10700 KB Output is correct
102 Correct 42 ms 11080 KB Output is correct
103 Correct 55 ms 18784 KB Output is correct
104 Correct 46 ms 18872 KB Output is correct
105 Correct 168 ms 24056 KB Output is correct
106 Correct 173 ms 24104 KB Output is correct
107 Correct 166 ms 25900 KB Output is correct
108 Correct 152 ms 26420 KB Output is correct
109 Execution timed out 2057 ms 16424 KB Time limit exceeded
110 Halted 0 ms 0 KB -