Submission #377965

#	Time	Username	Problem	Language	Result	Execution time	Memory
377965		jhwest2	Robot (JOI21_ho_t4)	C++14	0 / 100	196 ms	37600 KiB

Main

#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 {
                for (int j = l; j < r; j++) G[i].emplace_back(V[i][j].vb);
                pint x = V[i][r - 2].vb, y = V[i][r - 1].vb;
                if (i == n) A.push_back(sz + 1);
                G[i].emplace_back(0, ++sz);
                G[x.vb].emplace_back(0, sz); G[y.vb].emplace_back(0, sz);
                G[sz].emplace_back(s - x.va, y.vb); G[sz].emplace_back(s - y.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);
    }
    lint ans = D[n];
    for (int x : A) ans = min(ans, D[x]);
    cout << (ans == 4e18 ? -1 : ans);
}

Compilation message (stderr)

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:44:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   44 |         if (D[t.vb] != 4e18) continue; D[t.vb] = -t.va;
      |         ^~
Main.cpp:44:40: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   44 |         if (D[t.vb] != 4e18) continue; D[t.vb] = -t.va;
      |                                        ^

• Subtask 1: 0 / 34
• Subtask 2: 0 / 24
• Subtask 3: 0 / 42