oj.uz

Submission #971170

# Submission time Handle Problem Language Result Execution time Memory
971170 2024-04-28T05:49:16 Z htphong0909 Robot (JOI21_ho_t4) C++17
34 / 100
 476 ms 159060 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;

vector<array<int, 4>> adj[200001];
vector<vector<array<int, 3>>> adj2[200001];
vector<int> sum[200001];
int DP[200001];
vector<int> DP2[200001];
int cnt[200001];
map<int, int> hm[200001];

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;
        if (!hm[u].count(c)) hm[u][c] = cnt[u]++;
        if (!hm[v].count(c)) hm[v][c] = cnt[v]++;
        adj[u].push_back({v, hm[u][c], w, hm[v][c]});
        adj[v].push_back({u, hm[v][c], w, hm[u][c]});
    }
    for (int i = 1; i <= n; i++)
    {
        DP2[i].assign(cnt[i], (int)1e18);
        adj2[i].resize(cnt[i]);
        sum[i].assign(cnt[i], 0);
        for (const auto& [v, c, w, vc] : adj[i])
        {
            adj2[i][c].push_back({v, w, vc});
            sum[i][c] += w;
        }
    }
    memset(DP, 0x3f, sizeof DP);
    DP[1] = 0;
    priority_queue<array<int, 3>, vector<array<int, 3>>, greater<>> q;
    q.push({DP[1], 1, -1});
    while (!q.empty())
    {
        auto [d, u, pc] = q.top();
        q.pop();
        if (DP[u] == d && pc == -1)
        {
            for (int i = 0; i < cnt[u]; i++)
            {
                int s = sum[u][i];
                for (const auto& [v, w, vc] : adj2[u][i])
                {
                    if (DP[v] > DP[u] + min(w, s - w))
                    {
                        DP[v] = DP[u] + min(w, s - w);
                        q.push({DP[v], v, -1});
                    }
                    if (DP2[v][vc] > DP[u])
                    {
                        DP2[v][vc] = DP[u];
                        q.push({DP2[v][vc], v, vc});
                    }
                }
            }
        }
        else if (DP2[u][pc] == d)
        {
            int s = sum[u][pc];
            for (const auto& [v, w, vc] : adj2[u][pc])
            {
                if (DP[v] > DP2[u][pc] + s - w)
                {
                    DP[v] = DP2[u][pc] + s - w;
                    q.push({DP[v], v, -1});
                }
            }
        }
    }
    if (DP[n] > (int)1e18) cout << -1;
    else cout << DP[n];
    return 0;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 31576 KB Output is correct
2 Correct 8 ms 31580 KB Output is correct
3 Correct 8 ms 31580 KB Output is correct
4 Correct 9 ms 31576 KB Output is correct
5 Correct 7 ms 31576 KB Output is correct
6 Correct 7 ms 31580 KB Output is correct
7 Correct 8 ms 31836 KB Output is correct
8 Correct 7 ms 31836 KB Output is correct
9 Correct 9 ms 32348 KB Output is correct
10 Correct 9 ms 32348 KB Output is correct
11 Correct 8 ms 32092 KB Output is correct
12 Correct 8 ms 32044 KB Output is correct
13 Correct 8 ms 32348 KB Output is correct
14 Correct 9 ms 32348 KB Output is correct
15 Correct 8 ms 31836 KB Output is correct
16 Correct 8 ms 32088 KB Output is correct
17 Correct 8 ms 32092 KB Output is correct
18 Correct 7 ms 31984 KB Output is correct
19 Correct 8 ms 32092 KB Output is correct
20 Correct 8 ms 32312 KB Output is correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 53196 KB Output is correct
2 Correct 48 ms 41808 KB Output is correct
3 Correct 115 ms 59512 KB Output is correct
4 Correct 69 ms 46224 KB Output is correct
5 Correct 476 ms 96168 KB Output is correct
6 Correct 409 ms 94128 KB Output is correct
7 Correct 219 ms 84252 KB Output is correct
8 Correct 317 ms 78488 KB Output is correct
9 Runtime error 232 ms 159060 KB Execution killed with signal 11
10 Halted 0 ms 0 KB -

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 31576 KB Output is correct
2 Correct 8 ms 31580 KB Output is correct
3 Correct 8 ms 31580 KB Output is correct
4 Correct 9 ms 31576 KB Output is correct
5 Correct 7 ms 31576 KB Output is correct
6 Correct 7 ms 31580 KB Output is correct
7 Correct 8 ms 31836 KB Output is correct
8 Correct 7 ms 31836 KB Output is correct
9 Correct 9 ms 32348 KB Output is correct
10 Correct 9 ms 32348 KB Output is correct
11 Correct 8 ms 32092 KB Output is correct
12 Correct 8 ms 32044 KB Output is correct
13 Correct 8 ms 32348 KB Output is correct
14 Correct 9 ms 32348 KB Output is correct
15 Correct 8 ms 31836 KB Output is correct
16 Correct 8 ms 32088 KB Output is correct
17 Correct 8 ms 32092 KB Output is correct
18 Correct 7 ms 31984 KB Output is correct
19 Correct 8 ms 32092 KB Output is correct
20 Correct 8 ms 32312 KB Output is correct
21 Correct 116 ms 53196 KB Output is correct
22 Correct 48 ms 41808 KB Output is correct
23 Correct 115 ms 59512 KB Output is correct
24 Correct 69 ms 46224 KB Output is correct
25 Correct 476 ms 96168 KB Output is correct
26 Correct 409 ms 94128 KB Output is correct
27 Correct 219 ms 84252 KB Output is correct
28 Correct 317 ms 78488 KB Output is correct
29 Runtime error 232 ms 159060 KB Execution killed with signal 11
30 Halted 0 ms 0 KB -