oj.uz

답안 #564681

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
564681 2022-05-19T13:02:08 Z maomao90 Wild Boar (JOI18_wild_boar) C++17
62 / 100
 18000 ms 884432 KB 
// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
typedef tuple<ll, ll, ll> tll;
#define ALL(_a) _a.begin(), _a.end()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 2005;
const int MAXL = 100005;
const int BAG = 5;

int n, m, t, l, e;
vi adj[MAXN * 3];
int w[MAXN * 3];
int x[MAXL];
ll rd[MAXN][MAXN][BAG];
int fi[MAXN][MAXN][BAG], se[MAXN][MAXN][BAG];
ll dp[MAXL][BAG];

int par[MAXN][2];
ll dist[MAXN * 3][MAXN * 3][2];
priority_queue<tll, vector<tll>, greater<tll>> pq;
void dijkstra(int s) {
    REP (i, 0, e) {
        dist[s][i][0] = dist[s][i][1] = LINF;
    }
    REP (i, 0, n + 1) {
        par[i][0] = par[i][1] = -1;
        if (s <= n) {
            fi[s][i][0] = se[s][i][0] = -1;
        }
    }
    dist[s][s][0] = w[s];
    pq.push(tll{w[s], s, 0});
    while (!pq.empty()) {
        auto [d, u, tp] = pq.top(); pq.pop();
        if (d != dist[s][u][tp]) continue;
        for (int v : adj[u]) {
            int cpar = par[u][tp];
            if (u <= n && v > n && (v ^ 1) == cpar) {
                continue;
            }
            if (u > n) {
                cpar = adj[u ^ 1][0];
            }
            ll nd = d + w[v];
            if (mnto(dist[s][v][0], nd)) {
                pq.push(tll{nd, v, 0});
                if (v <= n) {
                    if (s <= n) {
                        fi[s][v][0] = fi[s][cpar][0] == -1 ? u : fi[s][cpar][0];
                        se[s][v][0] = u;
                    }
                    par[v][0] = u;
                }
            } else if (mnto(dist[s][v][1], nd) && v <= n && par[v][0] != u) {
                pq.push(tll{nd, v, 1});
                par[v][1] = u;
            }
        }
    }
}

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n >> m >> t >> l;
    e = n + 1;
    if (e & 1) {
        e++;
    }
    REP (i, 0, m) {
        int a, b, c; cin >> a >> b >> c;
        w[e] = c;
        adj[a].pb(e);
        adj[e].pb(b);
        e++;
        w[e] = c;
        adj[b].pb(e);
        adj[e].pb(a);
        e++;
    }
    REP (i, 1, e) {
        dijkstra(i);
    }
    REP (i, 1, n + 1) {
        REP (j, 1, n + 1) {
            if (i == j) continue;
            REP (z, 0, BAG) {
                rd[i][j][z] = LINF;
            }
            rd[i][j][0] = dist[i][j][0];
            for (int u : adj[i]) {
                for (int v : adj[j]) {
                    v ^= 1;
                    REP (z, 1, 3) {
                        if ((z == 1 && u == fi[i][j][0]) ||
                                (z == 2 && v == se[i][j][0])) {
                            continue;
                        }
                        if (mnto(rd[i][j][z], dist[u][v][0])) {
                            fi[i][j][z] = u;
                            se[i][j][z] = v;
                        }
                    }
                }
            }
            if (rd[i][j][1] != LINF) {
                for (int u : adj[i]) {
                    for (int v : adj[j]) {
                        v ^= 1;
                        if (u == fi[i][j][0] || v == se[i][j][1]) continue;
                        if (mnto(rd[i][j][3], dist[u][v][0])) {
                            fi[i][j][3] = u;
                            se[i][j][3] = v;
                        }
                    }
                }
            }
            if (rd[i][j][2] != LINF) {
                for (int u : adj[i]) {
                    for (int v : adj[j]) {
                        v ^= 1;
                        if (u == fi[i][j][2] || v == se[i][j][0]) continue;
                        if (mnto(rd[i][j][4], dist[u][v][0])) {
                            fi[i][j][4] = u;
                            se[i][j][4] = v;
                        }
                    }
                }
            }
            REP (z, 0, BAG) {
                cerr << i << ' ' << j << ' ' << z << ": " << rd[i][j][z] << ' ' << fi[i][j][z] << ' ' << se[i][j][z] << '\n';
            }
        }
    }
    x[0] = -1;
    REP (i, 1, l + 1) {
        cin >> x[i];
    }
    while (t--) {
        int p, q; cin >> p >> q;
        x[p] = q;
        REP (j, 0, BAG) {
            dp[1][j] = 0;
        }
        REP (i, 2, l + 1) {
            int p = x[i - 2], u = x[i - 1], v = x[i];
            REP (j, 0, BAG) {
                dp[i][j] = LINF;
                REP (k, 0, BAG) {
                    if (p != -1 && (se[p][u][k] ^ 1) == fi[u][v][j]) continue;
                    mnto(dp[i][j], dp[i - 1][k] + rd[u][v][j]);
                }
                cerr << i << ' ' << j << ": " << dp[i][j] << '\n';
            }
        }
        ll ans = LINF;
        REP (j, 0, BAG) {
            mnto(ans, dp[l][j]);
        }
        if (ans >= LINF) {
            ans = -1;
        }
        cout << ans << '\n';
    }
    return 0;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 732 KB Output is correct
12 Correct 1 ms 732 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 724 KB Output is correct
15 Correct 1 ms 728 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 1 ms 728 KB Output is correct
18 Correct 1 ms 724 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 1 ms 728 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 1 ms 596 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 732 KB Output is correct
12 Correct 1 ms 732 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 724 KB Output is correct
15 Correct 1 ms 728 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 1 ms 728 KB Output is correct
18 Correct 1 ms 724 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 1 ms 728 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 2 ms 1236 KB Output is correct
27 Correct 19 ms 9712 KB Output is correct
28 Correct 20 ms 9752 KB Output is correct
29 Correct 89 ms 17724 KB Output is correct
30 Correct 84 ms 17628 KB Output is correct
31 Correct 83 ms 17652 KB Output is correct
32 Correct 76 ms 17616 KB Output is correct
33 Correct 100 ms 20684 KB Output is correct
34 Correct 102 ms 20672 KB Output is correct
35 Correct 86 ms 20696 KB Output is correct
36 Correct 86 ms 20556 KB Output is correct
37 Correct 100 ms 20716 KB Output is correct
38 Correct 106 ms 24020 KB Output is correct
39 Correct 93 ms 23884 KB Output is correct
40 Correct 117 ms 24108 KB Output is correct
41 Correct 107 ms 24096 KB Output is correct
42 Correct 100 ms 26156 KB Output is correct
43 Correct 107 ms 27920 KB Output is correct
44 Correct 105 ms 27992 KB Output is correct
45 Correct 53 ms 32240 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 732 KB Output is correct
12 Correct 1 ms 732 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 724 KB Output is correct
15 Correct 1 ms 728 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 1 ms 728 KB Output is correct
18 Correct 1 ms 724 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 1 ms 728 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 2 ms 1236 KB Output is correct
27 Correct 19 ms 9712 KB Output is correct
28 Correct 20 ms 9752 KB Output is correct
29 Correct 89 ms 17724 KB Output is correct
30 Correct 84 ms 17628 KB Output is correct
31 Correct 83 ms 17652 KB Output is correct
32 Correct 76 ms 17616 KB Output is correct
33 Correct 100 ms 20684 KB Output is correct
34 Correct 102 ms 20672 KB Output is correct
35 Correct 86 ms 20696 KB Output is correct
36 Correct 86 ms 20556 KB Output is correct
37 Correct 100 ms 20716 KB Output is correct
38 Correct 106 ms 24020 KB Output is correct
39 Correct 93 ms 23884 KB Output is correct
40 Correct 117 ms 24108 KB Output is correct
41 Correct 107 ms 24096 KB Output is correct
42 Correct 100 ms 26156 KB Output is correct
43 Correct 107 ms 27920 KB Output is correct
44 Correct 105 ms 27992 KB Output is correct
45 Correct 53 ms 32240 KB Output is correct
46 Correct 240 ms 33668 KB Output is correct
47 Correct 3117 ms 366332 KB Output is correct
48 Correct 3538 ms 445516 KB Output is correct
49 Correct 3975 ms 507460 KB Output is correct
50 Correct 4000 ms 507464 KB Output is correct
51 Correct 4161 ms 507576 KB Output is correct
52 Correct 4419 ms 507604 KB Output is correct
53 Correct 4477 ms 507576 KB Output is correct
54 Correct 4301 ms 507628 KB Output is correct
55 Correct 4167 ms 507628 KB Output is correct
56 Correct 4440 ms 541556 KB Output is correct
57 Correct 4474 ms 577092 KB Output is correct
58 Correct 4611 ms 614724 KB Output is correct
59 Correct 4677 ms 654156 KB Output is correct
60 Correct 4642 ms 695540 KB Output is correct
61 Correct 4658 ms 738692 KB Output is correct
62 Correct 4543 ms 783852 KB Output is correct
63 Correct 4546 ms 827040 KB Output is correct
64 Correct 1500 ms 884432 KB Output is correct
65 Correct 1505 ms 884428 KB Output is correct

Subtask #4
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 732 KB Output is correct
12 Correct 1 ms 732 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 724 KB Output is correct
15 Correct 1 ms 728 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 1 ms 728 KB Output is correct
18 Correct 1 ms 724 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 1 ms 728 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 2 ms 1236 KB Output is correct
27 Correct 19 ms 9712 KB Output is correct
28 Correct 20 ms 9752 KB Output is correct
29 Correct 89 ms 17724 KB Output is correct
30 Correct 84 ms 17628 KB Output is correct
31 Correct 83 ms 17652 KB Output is correct
32 Correct 76 ms 17616 KB Output is correct
33 Correct 100 ms 20684 KB Output is correct
34 Correct 102 ms 20672 KB Output is correct
35 Correct 86 ms 20696 KB Output is correct
36 Correct 86 ms 20556 KB Output is correct
37 Correct 100 ms 20716 KB Output is correct
38 Correct 106 ms 24020 KB Output is correct
39 Correct 93 ms 23884 KB Output is correct
40 Correct 117 ms 24108 KB Output is correct
41 Correct 107 ms 24096 KB Output is correct
42 Correct 100 ms 26156 KB Output is correct
43 Correct 107 ms 27920 KB Output is correct
44 Correct 105 ms 27992 KB Output is correct
45 Correct 53 ms 32240 KB Output is correct
46 Correct 240 ms 33668 KB Output is correct
47 Correct 3117 ms 366332 KB Output is correct
48 Correct 3538 ms 445516 KB Output is correct
49 Correct 3975 ms 507460 KB Output is correct
50 Correct 4000 ms 507464 KB Output is correct
51 Correct 4161 ms 507576 KB Output is correct
52 Correct 4419 ms 507604 KB Output is correct
53 Correct 4477 ms 507576 KB Output is correct
54 Correct 4301 ms 507628 KB Output is correct
55 Correct 4167 ms 507628 KB Output is correct
56 Correct 4440 ms 541556 KB Output is correct
57 Correct 4474 ms 577092 KB Output is correct
58 Correct 4611 ms 614724 KB Output is correct
59 Correct 4677 ms 654156 KB Output is correct
60 Correct 4642 ms 695540 KB Output is correct
61 Correct 4658 ms 738692 KB Output is correct
62 Correct 4543 ms 783852 KB Output is correct
63 Correct 4546 ms 827040 KB Output is correct
64 Correct 1500 ms 884432 KB Output is correct
65 Correct 1505 ms 884428 KB Output is correct
66 Correct 1115 ms 5884 KB Output is correct
67 Correct 1018 ms 245256 KB Output is correct
68 Correct 1647 ms 879952 KB Output is correct
69 Correct 2373 ms 880016 KB Output is correct
70 Execution timed out 18096 ms 884048 KB Time limit exceeded
71 Halted 0 ms 0 KB -