oj.uz

답안 #894496

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
894496 2023-12-28T11:16:17 Z hafo Robot (JOI21_ho_t4) C++14
100 / 100
 640 ms 90848 KB 
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define pb push_back
#define pa pair<int, int>
#define pall pair<ll, int>
#define fi first
#define se second
#define TASK "test"
#define Size(x) (int) x.size()
#define all(x) x.begin(), x.end()
using namespace std;

template<typename T1, typename T2> bool mini (T1 &a, T2 b) {if(a > b) a = b; else return 0; return 1;}
template<typename T1, typename T2> bool maxi (T1 &a, T2 b) {if(a < b) a = b; else return 0; return 1;}

const int MOD = 1e9 + 7;
const int LOG = 20;
const int maxn = 2e5 + 7;
const ll oo = 1e18 + 69;

int n, m, u, v, c, p;
struct edge {
    int v, c, p;
};
map<int, vector<edge>> g[maxn];
ll f[maxn];
map<int, ll> f2[maxn], cnt[maxn];

struct state {
    ll cost;
    int u, c;

    friend bool operator < (const state &a, const state &b) {
        return a.cost > b.cost;
    } 

};

void dijkstra() {
    priority_queue<state> q;
    fill_n(f, n + 1, oo);
    f[1] = 0;
    q.push({0, 1, 0});

    while(!q.empty()) {
        int u = q.top().u, c = q.top().c;
        ll fu = q.top().cost;
        q.pop();

        if(c > 0) {
            if(f2[u][c] != fu) continue;
            for(auto e:g[u][c]) {
                int v = e.v;
                if(mini(f[v], fu + cnt[u][c] - e.p)) {
                    q.push({f[v], v, 0});
                }
            }
        } else {
            if(f[u] != fu) continue;
            for(auto tmp:g[u]) {
                for(auto e:tmp.se) {
                    int v = e.v;
                    if(mini(f[v], fu + cnt[u][e.c] - e.p)) {
                        q.push({f[v], v, 0});
                    }
                    if(mini(f[v], fu + e.p)) {
                        q.push({f[v], v, 0});
                    }
                    if(!f2[v].count(e.c) || f2[v][e.c] > fu) {
                        f2[v][e.c] = fu;
                        q.push({fu, v, e.c});
                    }
                }
            }
        }
    }

    cout<<(f[n] == oo ? -1:f[n]);
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    //freopen(TASK".inp", "r", stdin);
    //freopen(TASK".out", "w", stdout);

    cin>>n>>m;
    while(m--) {
        cin>>u>>v>>c>>p;
        g[u][c].pb({v, c, p});
        g[v][c].pb({u, c, p});
        cnt[u][c] += p;
        cnt[v][c] += p;
    }

    dijkstra();
    return 0;
}

Subtask #1
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 30040 KB Output is correct
2 Correct 6 ms 30044 KB Output is correct
3 Correct 6 ms 30044 KB Output is correct
4 Correct 6 ms 30044 KB Output is correct
5 Correct 6 ms 30040 KB Output is correct
6 Correct 6 ms 30044 KB Output is correct
7 Correct 7 ms 30168 KB Output is correct
8 Correct 6 ms 30044 KB Output is correct
9 Correct 9 ms 30552 KB Output is correct
10 Correct 8 ms 30552 KB Output is correct
11 Correct 8 ms 30300 KB Output is correct
12 Correct 7 ms 30420 KB Output is correct
13 Correct 7 ms 30300 KB Output is correct
14 Correct 8 ms 30300 KB Output is correct
15 Correct 7 ms 30300 KB Output is correct
16 Correct 8 ms 30300 KB Output is correct
17 Correct 7 ms 30548 KB Output is correct
18 Correct 7 ms 30372 KB Output is correct
19 Correct 7 ms 30300 KB Output is correct
20 Correct 7 ms 30300 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 131 ms 47552 KB Output is correct
2 Correct 56 ms 39116 KB Output is correct
3 Correct 114 ms 42980 KB Output is correct
4 Correct 69 ms 41660 KB Output is correct
5 Correct 640 ms 90304 KB Output is correct
6 Correct 505 ms 80172 KB Output is correct
7 Correct 236 ms 66472 KB Output is correct
8 Correct 246 ms 59312 KB Output is correct
9 Correct 252 ms 59280 KB Output is correct
10 Correct 218 ms 59424 KB Output is correct
11 Correct 97 ms 44756 KB Output is correct

Subtask #3
42.0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 30040 KB Output is correct
2 Correct 6 ms 30044 KB Output is correct
3 Correct 6 ms 30044 KB Output is correct
4 Correct 6 ms 30044 KB Output is correct
5 Correct 6 ms 30040 KB Output is correct
6 Correct 6 ms 30044 KB Output is correct
7 Correct 7 ms 30168 KB Output is correct
8 Correct 6 ms 30044 KB Output is correct
9 Correct 9 ms 30552 KB Output is correct
10 Correct 8 ms 30552 KB Output is correct
11 Correct 8 ms 30300 KB Output is correct
12 Correct 7 ms 30420 KB Output is correct
13 Correct 7 ms 30300 KB Output is correct
14 Correct 8 ms 30300 KB Output is correct
15 Correct 7 ms 30300 KB Output is correct
16 Correct 8 ms 30300 KB Output is correct
17 Correct 7 ms 30548 KB Output is correct
18 Correct 7 ms 30372 KB Output is correct
19 Correct 7 ms 30300 KB Output is correct
20 Correct 7 ms 30300 KB Output is correct
21 Correct 131 ms 47552 KB Output is correct
22 Correct 56 ms 39116 KB Output is correct
23 Correct 114 ms 42980 KB Output is correct
24 Correct 69 ms 41660 KB Output is correct
25 Correct 640 ms 90304 KB Output is correct
26 Correct 505 ms 80172 KB Output is correct
27 Correct 236 ms 66472 KB Output is correct
28 Correct 246 ms 59312 KB Output is correct
29 Correct 252 ms 59280 KB Output is correct
30 Correct 218 ms 59424 KB Output is correct
31 Correct 97 ms 44756 KB Output is correct
32 Correct 84 ms 38440 KB Output is correct
33 Correct 90 ms 40596 KB Output is correct
34 Correct 266 ms 60096 KB Output is correct
35 Correct 189 ms 52412 KB Output is correct
36 Correct 211 ms 55968 KB Output is correct
37 Correct 246 ms 59704 KB Output is correct
38 Correct 231 ms 65240 KB Output is correct
39 Correct 84 ms 40404 KB Output is correct
40 Correct 270 ms 59316 KB Output is correct
41 Correct 272 ms 59280 KB Output is correct
42 Correct 363 ms 68964 KB Output is correct
43 Correct 137 ms 48840 KB Output is correct
44 Correct 228 ms 50928 KB Output is correct
45 Correct 215 ms 56660 KB Output is correct
46 Correct 195 ms 57104 KB Output is correct
47 Correct 229 ms 58916 KB Output is correct
48 Correct 622 ms 90848 KB Output is correct