oj.uz

Submission #706355

# Submission time Handle Problem Language Result Execution time Memory
706355 2023-03-06T10:26:23 Z becaido Robot (JOI21_ho_t4) C++17
100 / 100
 841 ms 85668 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include <bits/stdc++.h>
using namespace std;

#ifdef WAIMAI
#define debug(HEHE...) cout << "[" << #HEHE << "] : ", dout(HEHE)
void dout() {cout << '\n';}
template<typename T, typename...U>
void dout (T t, U...u) {cout << t << (sizeof... (u) ? ", " : ""), dout (u...);}
#else
#define debug(...) 7122
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for (int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second

const ll INF = 1e18;
const int SIZE = 1e5 + 5;

int n, m;
ll ans = INF;
unordered_set<int> us[SIZE];
unordered_map<int, vector<pair<int, int>>> adj[SIZE];
priority_queue<tuple<ll, int, int>, vector<tuple<ll, int, int>>, greater<tuple<ll, int, int>>> pq;

void solve() {
    cin >> n >> m;
    while (m--) {
        int a, b, c, w;
        cin >> a >> b >> c >> w;
        adj[a][c].pb(b, w);
        adj[b][c].pb(a, w);
    }
    pq.emplace(0, 1, 0);
    while (pq.size()) {
        auto [d, pos, color] = pq.top();
        pq.pop();
        if (us[pos].count(color)) continue;
        if (pos == n && color == 0) ans = min(ans, d);
        us[pos].insert(color);
        if (color == 0) {
            for (auto [c, v] : adj[pos]) {
                ll sum = 0;
                for (auto [np, w] : v) sum += w;
                for (auto [np, w] : v) {
                    pq.emplace(d + min((ll) w, sum - w), np, 0);
                    pq.emplace(d, np, c);
                }
            }
        } else {
            ll sum = 0;
            for (auto [np, w] : adj[pos][color]) sum += w;
            for (auto [np, w] : adj[pos][color]) pq.emplace(d + sum - w, np, 0);
        }
    }
    cout << (ans == INF ? -1 : ans) << '\n';
}

int main() {
    Waimai;
    solve();
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11220 KB Output is correct
2 Correct 7 ms 11220 KB Output is correct
3 Correct 7 ms 11220 KB Output is correct
4 Correct 7 ms 11220 KB Output is correct
5 Correct 8 ms 11280 KB Output is correct
6 Correct 6 ms 11220 KB Output is correct
7 Correct 8 ms 11348 KB Output is correct
8 Correct 7 ms 11348 KB Output is correct
9 Correct 10 ms 11932 KB Output is correct
10 Correct 10 ms 11860 KB Output is correct
11 Correct 11 ms 11816 KB Output is correct
12 Correct 9 ms 11680 KB Output is correct
13 Correct 9 ms 11732 KB Output is correct
14 Correct 10 ms 11732 KB Output is correct
15 Correct 8 ms 11604 KB Output is correct
16 Correct 9 ms 11680 KB Output is correct
17 Correct 8 ms 11676 KB Output is correct
18 Correct 8 ms 11424 KB Output is correct
19 Correct 10 ms 11552 KB Output is correct
20 Correct 8 ms 11676 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 249 ms 30220 KB Output is correct
2 Correct 97 ms 21112 KB Output is correct
3 Correct 335 ms 31408 KB Output is correct
4 Correct 155 ms 25484 KB Output is correct
5 Correct 746 ms 85668 KB Output is correct
6 Correct 624 ms 69608 KB Output is correct
7 Correct 440 ms 66584 KB Output is correct
8 Correct 420 ms 53364 KB Output is correct
9 Correct 459 ms 53476 KB Output is correct
10 Correct 341 ms 41648 KB Output is correct
11 Correct 98 ms 28372 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11220 KB Output is correct
2 Correct 7 ms 11220 KB Output is correct
3 Correct 7 ms 11220 KB Output is correct
4 Correct 7 ms 11220 KB Output is correct
5 Correct 8 ms 11280 KB Output is correct
6 Correct 6 ms 11220 KB Output is correct
7 Correct 8 ms 11348 KB Output is correct
8 Correct 7 ms 11348 KB Output is correct
9 Correct 10 ms 11932 KB Output is correct
10 Correct 10 ms 11860 KB Output is correct
11 Correct 11 ms 11816 KB Output is correct
12 Correct 9 ms 11680 KB Output is correct
13 Correct 9 ms 11732 KB Output is correct
14 Correct 10 ms 11732 KB Output is correct
15 Correct 8 ms 11604 KB Output is correct
16 Correct 9 ms 11680 KB Output is correct
17 Correct 8 ms 11676 KB Output is correct
18 Correct 8 ms 11424 KB Output is correct
19 Correct 10 ms 11552 KB Output is correct
20 Correct 8 ms 11676 KB Output is correct
21 Correct 249 ms 30220 KB Output is correct
22 Correct 97 ms 21112 KB Output is correct
23 Correct 335 ms 31408 KB Output is correct
24 Correct 155 ms 25484 KB Output is correct
25 Correct 746 ms 85668 KB Output is correct
26 Correct 624 ms 69608 KB Output is correct
27 Correct 440 ms 66584 KB Output is correct
28 Correct 420 ms 53364 KB Output is correct
29 Correct 459 ms 53476 KB Output is correct
30 Correct 341 ms 41648 KB Output is correct
31 Correct 98 ms 28372 KB Output is correct
32 Correct 317 ms 36496 KB Output is correct
33 Correct 319 ms 31468 KB Output is correct
34 Correct 577 ms 44996 KB Output is correct
35 Correct 459 ms 41264 KB Output is correct
36 Correct 379 ms 55532 KB Output is correct
37 Correct 424 ms 57300 KB Output is correct
38 Correct 413 ms 68188 KB Output is correct
39 Correct 318 ms 31256 KB Output is correct
40 Correct 399 ms 55096 KB Output is correct
41 Correct 496 ms 55380 KB Output is correct
42 Correct 646 ms 58196 KB Output is correct
43 Correct 212 ms 30060 KB Output is correct
44 Correct 629 ms 44860 KB Output is correct
45 Correct 347 ms 52808 KB Output is correct
46 Correct 307 ms 52064 KB Output is correct
47 Correct 443 ms 59220 KB Output is correct
48 Correct 841 ms 85644 KB Output is correct