oj.uz

Submission #450177

# Submission time Handle Problem Language Result Execution time Memory
450177 2021-08-02T11:56:22 Z Mestu Robot (JOI21_ho_t4) C++14
100 / 100
 605 ms 77876 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 13 ms 19020 KB Output is correct
2 Correct 12 ms 19080 KB Output is correct
3 Correct 12 ms 19020 KB Output is correct
4 Correct 12 ms 19028 KB Output is correct
5 Correct 13 ms 19012 KB Output is correct
6 Correct 12 ms 19020 KB Output is correct
7 Correct 14 ms 19264 KB Output is correct
8 Correct 14 ms 19244 KB Output is correct
9 Correct 15 ms 19632 KB Output is correct
10 Correct 15 ms 19660 KB Output is correct
11 Correct 16 ms 19788 KB Output is correct
12 Correct 15 ms 19624 KB Output is correct
13 Correct 15 ms 19692 KB Output is correct
14 Correct 16 ms 19672 KB Output is correct
15 Correct 16 ms 19292 KB Output is correct
16 Correct 16 ms 19520 KB Output is correct
17 Correct 15 ms 19532 KB Output is correct
18 Correct 13 ms 19148 KB Output is correct
19 Correct 15 ms 19716 KB Output is correct
20 Correct 14 ms 19428 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 198 ms 38016 KB Output is correct
2 Correct 89 ms 27456 KB Output is correct
3 Correct 384 ms 52348 KB Output is correct
4 Correct 131 ms 31116 KB Output is correct
5 Correct 396 ms 65492 KB Output is correct
6 Correct 405 ms 64084 KB Output is correct
7 Correct 371 ms 72100 KB Output is correct
8 Correct 536 ms 61280 KB Output is correct
9 Correct 528 ms 61328 KB Output is correct
10 Correct 296 ms 44924 KB Output is correct
11 Correct 157 ms 38592 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19020 KB Output is correct
2 Correct 12 ms 19080 KB Output is correct
3 Correct 12 ms 19020 KB Output is correct
4 Correct 12 ms 19028 KB Output is correct
5 Correct 13 ms 19012 KB Output is correct
6 Correct 12 ms 19020 KB Output is correct
7 Correct 14 ms 19264 KB Output is correct
8 Correct 14 ms 19244 KB Output is correct
9 Correct 15 ms 19632 KB Output is correct
10 Correct 15 ms 19660 KB Output is correct
11 Correct 16 ms 19788 KB Output is correct
12 Correct 15 ms 19624 KB Output is correct
13 Correct 15 ms 19692 KB Output is correct
14 Correct 16 ms 19672 KB Output is correct
15 Correct 16 ms 19292 KB Output is correct
16 Correct 16 ms 19520 KB Output is correct
17 Correct 15 ms 19532 KB Output is correct
18 Correct 13 ms 19148 KB Output is correct
19 Correct 15 ms 19716 KB Output is correct
20 Correct 14 ms 19428 KB Output is correct
21 Correct 198 ms 38016 KB Output is correct
22 Correct 89 ms 27456 KB Output is correct
23 Correct 384 ms 52348 KB Output is correct
24 Correct 131 ms 31116 KB Output is correct
25 Correct 396 ms 65492 KB Output is correct
26 Correct 405 ms 64084 KB Output is correct
27 Correct 371 ms 72100 KB Output is correct
28 Correct 536 ms 61280 KB Output is correct
29 Correct 528 ms 61328 KB Output is correct
30 Correct 296 ms 44924 KB Output is correct
31 Correct 157 ms 38592 KB Output is correct
32 Correct 350 ms 64348 KB Output is correct
33 Correct 282 ms 51700 KB Output is correct
34 Correct 414 ms 57104 KB Output is correct
35 Correct 328 ms 52212 KB Output is correct
36 Correct 387 ms 59572 KB Output is correct
37 Correct 411 ms 63760 KB Output is correct
38 Correct 393 ms 76052 KB Output is correct
39 Correct 414 ms 66440 KB Output is correct
40 Correct 549 ms 66472 KB Output is correct
41 Correct 605 ms 66888 KB Output is correct
42 Correct 563 ms 65320 KB Output is correct
43 Correct 190 ms 43180 KB Output is correct
44 Correct 498 ms 77876 KB Output is correct
45 Correct 417 ms 53764 KB Output is correct
46 Correct 366 ms 51652 KB Output is correct
47 Correct 467 ms 62760 KB Output is correct
48 Correct 496 ms 75524 KB Output is correct