oj.uz

Submission #382738

# Submission time Handle Problem Language Result Execution time Memory
382738 2021-03-28T06:22:34 Z jainbot27 Robot (JOI21_ho_t4) C++17
100 / 100
 592 ms 73164 KB 
#include <bits/stdc++.h>
#define va first
#define vb second
using namespace std;
typedef long long lint;
typedef pair<int, int> pint;
typedef pair<lint, lint> plint;
const int MAX = 4e5 + 10;
 
int n, m;
lint D[MAX];
vector<int> A;
vector<plint> G[MAX];
vector<pair<int, pint>> V[MAX];
int main() {
    cin.tie(0); ios_base::sync_with_stdio(0);
    cin >> n >> m;
    for (int i = 0; i < m; i++) {
        int a, b, c, p; cin >> a >> b >> c >> p;
        V[a].push_back({ c, {p, b} });
        V[b].push_back({ c, {p, a} });
    }
    int sz = n;
    for (int i = 1; i < n; i++) {
        if (V[i].empty()) continue; sort(V[i].begin(), V[i].end());
        for (int l = 0, r = 0; l < V[i].size(); l = r) {
            lint s = 0;
            while (r < V[i].size() && V[i][l].va == V[i][r].va) s += V[i][r++].vb.va;
            if (r - l == 1) G[i].emplace_back(0, V[i][l].vb.vb);
            else {
                G[i].emplace_back(0, ++sz);
                for (int j = l; j < r; j++) {
                    pint x = V[i][j].vb;
                    G[i].emplace_back(x);
                    G[x.vb].emplace_back(0, sz);
                    G[sz].emplace_back(s - x.va, x.vb);
                }
            }
        }
    }
    priority_queue<plint> Q; Q.emplace(0, 1);
    for (int i = 1; i <= sz; i++) D[i] = 4e18;
    while (!Q.empty()) {
        auto t = Q.top(); Q.pop();
        if (D[t.vb] != 4e18) continue; D[t.vb] = -t.va;
        for (auto nxt : G[t.vb]) Q.emplace(t.va - nxt.va, nxt.vb);
    }
    cout << (D[n] == 4e18 ? -1 : D[n]);
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:25:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   25 |         if (V[i].empty()) continue; sort(V[i].begin(), V[i].end());
      |         ^~
Main.cpp:25:37: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   25 |         if (V[i].empty()) continue; sort(V[i].begin(), V[i].end());
      |                                     ^~~~
Main.cpp:26:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |         for (int l = 0, r = 0; l < V[i].size(); l = r) {
      |                                ~~^~~~~~~~~~~~~
Main.cpp:28:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |             while (r < V[i].size() && V[i][l].va == V[i][r].va) s += V[i][r++].vb.va;
      |                    ~~^~~~~~~~~~~~~
Main.cpp:45:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   45 |         if (D[t.vb] != 4e18) continue; D[t.vb] = -t.va;
      |         ^~
Main.cpp:45:40: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   45 |         if (D[t.vb] != 4e18) continue; D[t.vb] = -t.va;
      |                                        ^

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 19180 KB Output is correct
2 Correct 14 ms 19180 KB Output is correct
3 Correct 15 ms 19180 KB Output is correct
4 Correct 14 ms 19180 KB Output is correct
5 Correct 14 ms 19180 KB Output is correct
6 Correct 14 ms 19180 KB Output is correct
7 Correct 15 ms 19436 KB Output is correct
8 Correct 14 ms 19308 KB Output is correct
9 Correct 16 ms 19692 KB Output is correct
10 Correct 20 ms 19692 KB Output is correct
11 Correct 21 ms 19820 KB Output is correct
12 Correct 17 ms 19692 KB Output is correct
13 Correct 17 ms 19820 KB Output is correct
14 Correct 17 ms 19820 KB Output is correct
15 Correct 15 ms 19436 KB Output is correct
16 Correct 17 ms 19564 KB Output is correct
17 Correct 17 ms 19564 KB Output is correct
18 Correct 14 ms 19180 KB Output is correct
19 Correct 17 ms 19692 KB Output is correct
20 Correct 16 ms 19436 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 227 ms 38108 KB Output is correct
2 Correct 98 ms 27496 KB Output is correct
3 Correct 381 ms 52320 KB Output is correct
4 Correct 149 ms 31200 KB Output is correct
5 Correct 472 ms 65544 KB Output is correct
6 Correct 489 ms 64252 KB Output is correct
7 Correct 416 ms 72140 KB Output is correct
8 Correct 529 ms 61316 KB Output is correct
9 Correct 592 ms 61548 KB Output is correct
10 Correct 307 ms 44896 KB Output is correct
11 Correct 152 ms 38804 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 19180 KB Output is correct
2 Correct 14 ms 19180 KB Output is correct
3 Correct 15 ms 19180 KB Output is correct
4 Correct 14 ms 19180 KB Output is correct
5 Correct 14 ms 19180 KB Output is correct
6 Correct 14 ms 19180 KB Output is correct
7 Correct 15 ms 19436 KB Output is correct
8 Correct 14 ms 19308 KB Output is correct
9 Correct 16 ms 19692 KB Output is correct
10 Correct 20 ms 19692 KB Output is correct
11 Correct 21 ms 19820 KB Output is correct
12 Correct 17 ms 19692 KB Output is correct
13 Correct 17 ms 19820 KB Output is correct
14 Correct 17 ms 19820 KB Output is correct
15 Correct 15 ms 19436 KB Output is correct
16 Correct 17 ms 19564 KB Output is correct
17 Correct 17 ms 19564 KB Output is correct
18 Correct 14 ms 19180 KB Output is correct
19 Correct 17 ms 19692 KB Output is correct
20 Correct 16 ms 19436 KB Output is correct
21 Correct 227 ms 38108 KB Output is correct
22 Correct 98 ms 27496 KB Output is correct
23 Correct 381 ms 52320 KB Output is correct
24 Correct 149 ms 31200 KB Output is correct
25 Correct 472 ms 65544 KB Output is correct
26 Correct 489 ms 64252 KB Output is correct
27 Correct 416 ms 72140 KB Output is correct
28 Correct 529 ms 61316 KB Output is correct
29 Correct 592 ms 61548 KB Output is correct
30 Correct 307 ms 44896 KB Output is correct
31 Correct 152 ms 38804 KB Output is correct
32 Correct 314 ms 60812 KB Output is correct
33 Correct 333 ms 48860 KB Output is correct
34 Correct 404 ms 53468 KB Output is correct
35 Correct 347 ms 49368 KB Output is correct
36 Correct 478 ms 56784 KB Output is correct
37 Correct 450 ms 60608 KB Output is correct
38 Correct 424 ms 72500 KB Output is correct
39 Correct 384 ms 61924 KB Output is correct
40 Correct 561 ms 61416 KB Output is correct
41 Correct 557 ms 61488 KB Output is correct
42 Correct 534 ms 60756 KB Output is correct
43 Correct 188 ms 40924 KB Output is correct
44 Correct 530 ms 73164 KB Output is correct
45 Correct 409 ms 50028 KB Output is correct
46 Correct 343 ms 48236 KB Output is correct
47 Correct 484 ms 59428 KB Output is correct
48 Correct 532 ms 70284 KB Output is correct