oj.uz

Submission #925312

# Submission time Handle Problem Language Result Execution time Memory
925312 2024-02-11T11:36:18 Z crafticat Robot (JOI21_ho_t4) C++17
34 / 100
 3000 ms 160464 KB 
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using pii = pair<ll,ll>;
constexpr ll inf = 1e12 + 7;

int main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);

    ll n, m; cin >> n >> m;

    vector<vector<tuple<ll,ll,ll>>> f(n + 1);
    for (ll i = 0; i < m; ++i) {
        ll a, b, c, d; cin >> a >> b >> c >> d;
        f[a].emplace_back(c,b,d);
        f[b].emplace_back(c,a,d);
    }

    vector<vector<tuple<ll,ll,ll>>> g(n + 1);
    vector<map<ll,ll>> apps(n + 1);
    map<pii, pii> roads;

    for (ll i = 1; i <= n; ++i) {
        map<ll, ll> app;
        for (auto [c, node, d] : f[i]) {
            app[c]+=d;
        }

        apps[i] = app;

        for (auto [c, node, d] : f[i]) {
            roads[{i,node}] = {c,d};
            roads[{node,i}] = {c,d};
            g[i].emplace_back(node,d,c);
        }
    }

    priority_queue<tuple<ll,ll,ll>,vector<tuple<ll,ll,ll>>,greater<>> pq;
    pq.emplace(0,1,0);

    vector<ll> d(n + 1,inf);
    map<tuple<ll,ll>,bool> visited;

    while (!pq.empty()) {
        auto [cost, cur, par] = pq.top();pq.pop();
        if (visited[{cur,par}]) continue;
        d[cur] = min(d[cur],cost);
        visited[{cur,par}] = true;

        for (auto [child, len, c] : g[cur]) {
            if (child == par) continue;
            if (visited[{child,cur}]) continue;

            ll am = apps[cur][c];
            if (c == roads[{par,cur}].first) am -= roads[{par,cur}].second;
            pq.emplace(cost + len,child,cur);
            pq.emplace(cost + am - len,child,-cur);
        }
    }

    if (d[n] == inf) {
        cout << "-1";
        return 0;
    }
    cout << d[n];
    return 0;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 22 ms 2324 KB Output is correct
8 Correct 6 ms 1092 KB Output is correct
9 Correct 1908 ms 100564 KB Output is correct
10 Correct 913 ms 51428 KB Output is correct
11 Correct 1087 ms 51588 KB Output is correct
12 Correct 397 ms 26868 KB Output is correct
13 Correct 1022 ms 50584 KB Output is correct
14 Correct 1048 ms 51480 KB Output is correct
15 Correct 4 ms 1116 KB Output is correct
16 Correct 13 ms 1708 KB Output is correct
17 Correct 10 ms 1688 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 92 ms 7840 KB Output is correct
20 Correct 7 ms 1368 KB Output is correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1745 ms 98248 KB Output is correct
2 Correct 525 ms 36844 KB Output is correct
3 Execution timed out 3059 ms 160464 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 22 ms 2324 KB Output is correct
8 Correct 6 ms 1092 KB Output is correct
9 Correct 1908 ms 100564 KB Output is correct
10 Correct 913 ms 51428 KB Output is correct
11 Correct 1087 ms 51588 KB Output is correct
12 Correct 397 ms 26868 KB Output is correct
13 Correct 1022 ms 50584 KB Output is correct
14 Correct 1048 ms 51480 KB Output is correct
15 Correct 4 ms 1116 KB Output is correct
16 Correct 13 ms 1708 KB Output is correct
17 Correct 10 ms 1688 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 92 ms 7840 KB Output is correct
20 Correct 7 ms 1368 KB Output is correct
21 Correct 1745 ms 98248 KB Output is correct
22 Correct 525 ms 36844 KB Output is correct
23 Execution timed out 3059 ms 160464 KB Time limit exceeded
24 Halted 0 ms 0 KB -