#577196 (C++14) No.1283 Extra Fee

• 問題: No.1283 Extra Fee
• ユーザー: fine
• 提出日時: 2020-11-07 03:16:04
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 213 ms / 2,000 ms
• コード長: 2,382 bytes
• コンパイル時間: 2,108 ms
• コンパイル使用メモリ: 184,380 KB
• 実行使用メモリ: 39,956 KB
• 最終ジャッジ日時: 2024-11-16 06:58:44
• 合計ジャッジ時間: 6,057 ms
• ジャッジサーバーID （参考情報）: judge1 / judge5

ファイルパターン	結果
other	AC * 30

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr char newl = '\n';
constexpr int dh[] = {1, -1, 0, 0};
constexpr int dw[] = {0, 0, 1, -1};
struct State {
    int at;
    ll cost;
    bool used;
    //int prev;
    State(int at, ll cost, bool used) : at(at), cost(cost), used(used) {}
    bool operator>(const State& s) const {
        return cost > s.cost;
    }
};
struct Edge {
    int to;
    ll cost;
    Edge(int to, ll cost) : to(to), cost(cost) {}
};
using Graph = vector< vector<Edge> >; //隣接リスト
const ll INF = 1e15;
//const int NONE = -1;
//sは始点、mincは最短経路のコスト、prevsは最短経路をたどる際の前の頂点
void dijkstra(int s, const Graph& graph, vector< vector<ll> >& minc){
    minc.assign(2, vector<ll>(graph.size(), INF));
    priority_queue<State, vector<State>, greater<State> > pq;
    pq.emplace(s, 0, false);
    minc[false][s] = 0;
    while(!pq.empty()) {
        State cur = pq.top();
        pq.pop();
        if (minc[cur.used][cur.at] < cur.cost) continue;
        for(const Edge& e : graph[cur.at]) {
            if (!cur.used) {
                ll cost = cur.cost + 1;
                if (minc[true][e.to] > cost) {
                    minc[true][e.to] = cost;
                    pq.emplace(e.to, cost, true);
                }
            }
            ll cost = cur.cost + e.cost;
            if (minc[cur.used][e.to] <= cost) continue;
            minc[cur.used][e.to] = cost;
            pq.emplace(e.to, cost, cur.used);
        }
    }
}
int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n, m;
    cin >> n >> m;
    vector< vector<ll> > memo(n, vector<ll>(n, 0));
    for (int i = 0; i < m; i++) {
        int h, w;
        ll c;
        cin >> h >> w >> c;
        --h; --w;
        memo[h][w] = c;
    }
    Graph g(n * n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            for (int k = 0; k < 4; k++) {
                int nh = i + dh[k], nw = j + dw[k];
                if (nh < 0 || nh >= n || nw < 0 || nw >= n) continue;
                g[i * n + j].emplace_back(nh * n + nw, memo[nh][nw] + 1);
            }
        }
    }
    vector< vector<ll> > minc;
    dijkstra(0, g, minc);
    int goal = (n - 1) * n + (n - 1);
    cout << min(minc[0][goal], minc[1][goal]) << newl; 
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX