oj.uz

Submission #981112

# Submission time Handle Problem Language Result Execution time Memory
981112 2024-05-12T20:06:00 Z 0x34c Robot (JOI21_ho_t4) C++17
34 / 100
 3000 ms 65708 KB 
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define endl '\n'
#define int ll
 
using namespace std;
 
const int INF = 2e15;
 
struct nei {
    int v, c, w;
};
 
int N, M;
vector<vector<nei>> graph;
vector<map<int, int>> color_cost;
 
class Compare {
public:
    bool operator()(tuple<int, int, int, int> &a, tuple<int, int, int, int> &b) {
        return get<0>(a) > get<0>(b);
    }
};
 
 
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
 
    cin >> N >> M;
 
    graph.resize(N);
    color_cost.resize(N);
    for(int i = 0; i < M; i++) {
        int a, b, c, w;
        cin >> a >> b >> c >> w;
 
        --a; --b; --c;
 
        graph[a].push_back({b, c, w});
        graph[b].push_back({a, c, w});
    }
 
    for(int i = 0; i < N; i++) {
        for(nei& u : graph[i])
            color_cost[i][u.c] += u.w;
    }
 
    vector<map<pii, int>> dist(N);
    // wei, node, prev color, prev color weight
    priority_queue<tuple<int, int, int, int>, vector<tuple<int, int, int, int>>, Compare> q;
    dist[0][{0, 0}] = 0;
    q.push({0, 0, 0, 0});
    while(!q.empty()) {
        int w, v, pc, pw;
        tie(w, v, pc, pw) = q.top(); q.pop();

        if(dist[v][{pc, pw}] != w)
            continue;
 
        for(nei& u : graph[v]) {
            int opt1 = w + u.w;
            if(!dist[u.v].count({u.c, u.w}) || dist[u.v][{u.c, u.w}] > opt1) {
                dist[u.v][{u.c, u.w}] = opt1;
                q.push({opt1, u.v, u.c, u.w});
            }
 
            int opt2 = w + color_cost[v][u.c] - u.w - (pc == u.c ? pw : 0);
            if(!dist[u.v].count({0, 0}) || dist[u.v][{0, 0}] > opt2) {
                dist[u.v][{0, 0}] = opt2;
                q.push({opt2, u.v, 0, 0});
            }
        }
    }
 
    int mn = INF;
    for(auto mp : dist[N - 1]) {
        mn = min(mn, mp.second);
    }
 
    cout << (mn == INF ? -1 : mn) << endl;
 
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 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 5 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 62 ms 1116 KB Output is correct
10 Correct 31 ms 1340 KB Output is correct
11 Correct 2 ms 856 KB Output is correct
12 Correct 2 ms 860 KB Output is correct
13 Correct 2 ms 952 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 1 ms 708 KB Output is correct
16 Correct 3 ms 972 KB Output is correct
17 Correct 3 ms 860 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 17 ms 860 KB Output is correct
20 Correct 2 ms 860 KB Output is correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 22996 KB Output is correct
2 Correct 46 ms 11472 KB Output is correct
3 Correct 128 ms 18876 KB Output is correct
4 Correct 67 ms 15296 KB Output is correct
5 Execution timed out 3018 ms 65708 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 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 5 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 62 ms 1116 KB Output is correct
10 Correct 31 ms 1340 KB Output is correct
11 Correct 2 ms 856 KB Output is correct
12 Correct 2 ms 860 KB Output is correct
13 Correct 2 ms 952 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 1 ms 708 KB Output is correct
16 Correct 3 ms 972 KB Output is correct
17 Correct 3 ms 860 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 17 ms 860 KB Output is correct
20 Correct 2 ms 860 KB Output is correct
21 Correct 121 ms 22996 KB Output is correct
22 Correct 46 ms 11472 KB Output is correct
23 Correct 128 ms 18876 KB Output is correct
24 Correct 67 ms 15296 KB Output is correct
25 Execution timed out 3018 ms 65708 KB Time limit exceeded
26 Halted 0 ms 0 KB -