oj.uz

Submission #971147

# Submission time Handle Problem Language Result Execution time Memory
971147 2024-04-28T04:30:37 Z htphong0909 Robot (JOI21_ho_t4) C++17
34 / 100
 3000 ms 74572 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;

vector<array<int, 4>> adj[100001];
vector<vector<pair<int, int>>> adj2[100001];
int DP[100001];
int sum[200001];
vector<int> DP2[100001];
int cnt[200001];
map<int, int> hm[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;
        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]);
        for (const auto& [v, c, w, vc] : adj[i]) adj2[i][c].emplace_back(v, 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();
        for (int i = 0; i < cnt[u]; i++) sum[i] = 0;
        for (const array<int, 4>& cur : adj[u]) sum[cur[1]] += cur[2];
        if (DP[u] == d && pc == -1)
        {
            for (const auto& [v, c, w, vc] : adj[u])
            {
                int s = sum[c];
                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[pc];
            for (const auto& [v, w] : adj2[u][pc])
            {
                if (DP[v] > DP2[u][pc] + s - w)
                {
                    DP[v] = DP2[u][pc] + s - w;
                    q.push({DP[v], v, -1});
                }
            }
        }
        for (int i = 0; i < cnt[u]; i++) sum[i] = 0;
    }
    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 4 ms 15964 KB Output is correct
2 Correct 3 ms 15964 KB Output is correct
3 Correct 3 ms 15964 KB Output is correct
4 Correct 4 ms 15964 KB Output is correct
5 Correct 4 ms 15964 KB Output is correct
6 Correct 3 ms 15964 KB Output is correct
7 Correct 4 ms 16220 KB Output is correct
8 Correct 4 ms 15964 KB Output is correct
9 Correct 6 ms 16476 KB Output is correct
10 Correct 6 ms 16660 KB Output is correct
11 Correct 8 ms 16476 KB Output is correct
12 Correct 5 ms 16472 KB Output is correct
13 Correct 5 ms 16592 KB Output is correct
14 Correct 6 ms 16472 KB Output is correct
15 Correct 5 ms 16220 KB Output is correct
16 Correct 5 ms 16476 KB Output is correct
17 Correct 7 ms 16472 KB Output is correct
18 Correct 4 ms 16220 KB Output is correct
19 Correct 5 ms 16476 KB Output is correct
20 Correct 4 ms 16220 KB Output is correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 131 ms 35456 KB Output is correct
2 Correct 44 ms 25176 KB Output is correct
3 Correct 114 ms 39972 KB Output is correct
4 Correct 68 ms 28904 KB Output is correct
5 Execution timed out 3036 ms 74572 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 15964 KB Output is correct
2 Correct 3 ms 15964 KB Output is correct
3 Correct 3 ms 15964 KB Output is correct
4 Correct 4 ms 15964 KB Output is correct
5 Correct 4 ms 15964 KB Output is correct
6 Correct 3 ms 15964 KB Output is correct
7 Correct 4 ms 16220 KB Output is correct
8 Correct 4 ms 15964 KB Output is correct
9 Correct 6 ms 16476 KB Output is correct
10 Correct 6 ms 16660 KB Output is correct
11 Correct 8 ms 16476 KB Output is correct
12 Correct 5 ms 16472 KB Output is correct
13 Correct 5 ms 16592 KB Output is correct
14 Correct 6 ms 16472 KB Output is correct
15 Correct 5 ms 16220 KB Output is correct
16 Correct 5 ms 16476 KB Output is correct
17 Correct 7 ms 16472 KB Output is correct
18 Correct 4 ms 16220 KB Output is correct
19 Correct 5 ms 16476 KB Output is correct
20 Correct 4 ms 16220 KB Output is correct
21 Correct 131 ms 35456 KB Output is correct
22 Correct 44 ms 25176 KB Output is correct
23 Correct 114 ms 39972 KB Output is correct
24 Correct 68 ms 28904 KB Output is correct
25 Execution timed out 3036 ms 74572 KB Time limit exceeded
26 Halted 0 ms 0 KB -