oj.uz

Submission #970877

# Submission time Handle Problem Language Result Execution time Memory
970877 2024-04-27T12:38:09 Z htphong0909 Robot (JOI21_ho_t4) C++17
34 / 100
 3000 ms 56032 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;

vector<array<int, 3>> adj[100001];
int DP[100001];
unordered_map<int, int> DP2[100001], sum[100001];

int32_t main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    //freopen("TEST.in", "r", stdin);
    //freopen("TEST.out", "w", stdout);
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < m; i++)
    {
        int u, v, c, w;
        cin >> u >> v >> c >> w;
        adj[u].push_back({v, c, w});
        adj[v].push_back({u, c, w});
        sum[u][c] += w;
        sum[v][c] += w;
    }
    memset(DP, 0x3f, sizeof DP);
    DP[1] = 1;
    priority_queue<array<int, 3>, vector<array<int, 3>>, greater<>> q;
    q.push({DP[1], 1, 0});
    while (!q.empty())
    {
        auto [d, u, pc] = q.top();
        q.pop();
        for (const auto& [v, c, w] : adj[u])
        {
            bool k = false;
            if (pc == c && DP[v] > DP2[u][c] + sum[u][c] - w)
            {
                DP[v] = DP2[u][c] + sum[u][c] - w;
                k = true;
            }
            if (DP[v] > DP[u] + min(w, sum[u][c] - w))
            {
                DP[v] = DP[u] + min(w, sum[u][c] - w);
                k = true;
            }
            if (k) q.push({DP[v], v, 0});
            if (DP2[v][c] > DP[u] || !DP2[v][c])
            {
                DP2[v][c] = DP[u];
                q.push({DP2[v][c], v, c});
            }
        }
    }
    if (DP[n] > (int)1e18) cout << -1;
    else cout << DP[n] - 1;
    return 0;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 14424 KB Output is correct
2 Correct 5 ms 14428 KB Output is correct
3 Correct 4 ms 14428 KB Output is correct
4 Correct 5 ms 14428 KB Output is correct
5 Correct 5 ms 14516 KB Output is correct
6 Correct 4 ms 14428 KB Output is correct
7 Correct 6 ms 14684 KB Output is correct
8 Correct 6 ms 14428 KB Output is correct
9 Correct 29 ms 14940 KB Output is correct
10 Correct 18 ms 14940 KB Output is correct
11 Correct 6 ms 14940 KB Output is correct
12 Correct 6 ms 14940 KB Output is correct
13 Correct 6 ms 14936 KB Output is correct
14 Correct 6 ms 14936 KB Output is correct
15 Correct 5 ms 14684 KB Output is correct
16 Correct 7 ms 14940 KB Output is correct
17 Correct 6 ms 14684 KB Output is correct
18 Correct 5 ms 14684 KB Output is correct
19 Correct 7 ms 14828 KB Output is correct
20 Correct 6 ms 14684 KB Output is correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 171 ms 30932 KB Output is correct
2 Correct 58 ms 23052 KB Output is correct
3 Correct 127 ms 30432 KB Output is correct
4 Correct 86 ms 26892 KB Output is correct
5 Execution timed out 3060 ms 56032 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 14424 KB Output is correct
2 Correct 5 ms 14428 KB Output is correct
3 Correct 4 ms 14428 KB Output is correct
4 Correct 5 ms 14428 KB Output is correct
5 Correct 5 ms 14516 KB Output is correct
6 Correct 4 ms 14428 KB Output is correct
7 Correct 6 ms 14684 KB Output is correct
8 Correct 6 ms 14428 KB Output is correct
9 Correct 29 ms 14940 KB Output is correct
10 Correct 18 ms 14940 KB Output is correct
11 Correct 6 ms 14940 KB Output is correct
12 Correct 6 ms 14940 KB Output is correct
13 Correct 6 ms 14936 KB Output is correct
14 Correct 6 ms 14936 KB Output is correct
15 Correct 5 ms 14684 KB Output is correct
16 Correct 7 ms 14940 KB Output is correct
17 Correct 6 ms 14684 KB Output is correct
18 Correct 5 ms 14684 KB Output is correct
19 Correct 7 ms 14828 KB Output is correct
20 Correct 6 ms 14684 KB Output is correct
21 Correct 171 ms 30932 KB Output is correct
22 Correct 58 ms 23052 KB Output is correct
23 Correct 127 ms 30432 KB Output is correct
24 Correct 86 ms 26892 KB Output is correct
25 Execution timed out 3060 ms 56032 KB Time limit exceeded
26 Halted 0 ms 0 KB -