oj.uz

Submission #970706

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

vector<array<int, 3>> adj[100001];
vector<int> D[100001];
int sum[200001];
map<int, int> hm[100001];
int sz[100001];
vector<int> id[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});

        hm[u][v] = (int)adj[u].size() - 1;
        hm[v][u] = (int)adj[v].size() - 1;
    }
    for (int i = 1; i <= n; i++)
    {
        sz[i] = (int)adj[i].size();
        D[i].resize(sz[i] + 1);
        id[i].resize(sz[i] + 1);
        for (int j = 0; j < sz[i]; j++) id[i][j] = hm[adj[i][j][0]][i];
    }
    D[1][sz[1]] = 1;
    priority_queue<array<int, 3>, vector<array<int, 3>>, greater<>> q;
    q.push({1, 1, sz[1]});
    while (!q.empty())
    {
        auto [d, u, t] = q.top();
        //cerr << u << " " << d << endl;
        int pc, pw;

        if (t == sz[u]) tie(pc, pw) = make_pair(-1, 0);
        else
        {
            pc = adj[u][t][1];
            pw = adj[u][t][2];
        }
        q.pop();

        for (int i = 0; i < sz[u]; i++) sum[adj[u][i][1]] = 0;

        for (int i = 0; i < sz[u]; i++) sum[adj[u][i][1]] += adj[u][i][2];

        for (int i = 0; i < sz[u]; i++)
        {
            auto [v, c, w] = adj[u][i];
            int s = sum[c];
            int k = id[u][i];

            if (t != sz[u] && v == adj[u][t][0]) continue;

            if (D[u][t] + w < D[v][k] || !D[v][k])
            {
                D[v][k] = D[u][t] + w;
                q.push({D[v][k], v, k});
            }
            if (D[u][t] + s - w - (pc == c) * pw < D[v][sz[v]] || !D[v][sz[v]])
            {
                D[v][sz[v]] = D[u][t] + s - w - (pc == c) * pw;
                q.push({D[v][sz[v]], v, sz[v]});
            }
        }
    }
    int ans = (int)1e18;
    for (int i = 0; i <= sz[n]; i++) ans = min(ans, D[n][i]);
    if (ans == (int)1e18) cout << -1;
    else cout << ans - 1;
    return 0;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14428 KB Output is correct
2 Correct 4 ms 14428 KB Output is correct
3 Correct 3 ms 14512 KB Output is correct
4 Correct 4 ms 14428 KB Output is correct
5 Correct 3 ms 14428 KB Output is correct
6 Correct 3 ms 14428 KB Output is correct
7 Correct 5 ms 14684 KB Output is correct
8 Correct 5 ms 14684 KB Output is correct
9 Correct 17 ms 15096 KB Output is correct
10 Correct 14 ms 15184 KB Output is correct
11 Correct 23 ms 14940 KB Output is correct
12 Correct 11 ms 14940 KB Output is correct
13 Correct 23 ms 14940 KB Output is correct
14 Correct 23 ms 15168 KB Output is correct
15 Correct 4 ms 14680 KB Output is correct
16 Correct 5 ms 14936 KB Output is correct
17 Correct 5 ms 14768 KB Output is correct
18 Correct 4 ms 14684 KB Output is correct
19 Correct 7 ms 15148 KB Output is correct
20 Correct 5 ms 14684 KB Output is correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 167 ms 36976 KB Output is correct
2 Correct 60 ms 24520 KB Output is correct
3 Correct 344 ms 52032 KB Output is correct
4 Correct 109 ms 31176 KB Output is correct
5 Execution timed out 3076 ms 67420 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 14428 KB Output is correct
2 Correct 4 ms 14428 KB Output is correct
3 Correct 3 ms 14512 KB Output is correct
4 Correct 4 ms 14428 KB Output is correct
5 Correct 3 ms 14428 KB Output is correct
6 Correct 3 ms 14428 KB Output is correct
7 Correct 5 ms 14684 KB Output is correct
8 Correct 5 ms 14684 KB Output is correct
9 Correct 17 ms 15096 KB Output is correct
10 Correct 14 ms 15184 KB Output is correct
11 Correct 23 ms 14940 KB Output is correct
12 Correct 11 ms 14940 KB Output is correct
13 Correct 23 ms 14940 KB Output is correct
14 Correct 23 ms 15168 KB Output is correct
15 Correct 4 ms 14680 KB Output is correct
16 Correct 5 ms 14936 KB Output is correct
17 Correct 5 ms 14768 KB Output is correct
18 Correct 4 ms 14684 KB Output is correct
19 Correct 7 ms 15148 KB Output is correct
20 Correct 5 ms 14684 KB Output is correct
21 Correct 167 ms 36976 KB Output is correct
22 Correct 60 ms 24520 KB Output is correct
23 Correct 344 ms 52032 KB Output is correct
24 Correct 109 ms 31176 KB Output is correct
25 Execution timed out 3076 ms 67420 KB Time limit exceeded
26 Halted 0 ms 0 KB -