#193772 (C++14) No.92 逃走経路

• 問題: No.92 逃走経路
• ユーザー: Pachicobue
• 提出日時: 2017-08-04 04:05:20
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 18 ms / 5,000 ms
• コード長: 2,547 bytes
• コンパイル時間: 1,807 ms
• コンパイル使用メモリ: 179,968 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-10-11 20:40:44
• 合計ジャッジ時間: 2,595 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

ファイルパターン	結果
sample	AC * 2
other	AC * 18

ソースコード

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
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
// {{{ Templates
#include <bits/stdc++.h>
#define show(x) cerr << #x << " = " << x << endl
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v)
{
    os << "sz:" << v.size() << "\n[";
    for (const auto& p : v) {
        os << p << ",";
    }
    os << "]\n";
    return os;
}
template <typename S, typename T>
ostream& operator<<(ostream& os, const pair<S, T>& p)
{
    os << "(" << p.first << "," << p.second
       << ")";
    return os;
}
constexpr ll MOD = (ll)1e9 + 7LL;
template <typename T>
constexpr T INF = numeric_limits<T>::max() / 100;
// }}}
struct Edge {
    Edge() = default;
    Edge(int from, int to, ll cost) : from{from}, to{to}, cost{cost} {}
    int from;
    int to;
    ll cost;
    bool operator<(const Edge& e) const
    {
        return cost < e.cost;
    }
};
struct Graph {
    Graph(int n)
    {
        edge.resize(n);
    }
    void addEdge(int from, int to, ll cost)
    {
        edge[from].push_back(Edge{from, to, cost});
        edge[to].push_back(Edge{to, from, cost});
    }
    vector<vector<Edge>> edge;
};
int N, M, K;
bool dfs(const Graph& g, const int pos, const int tim, const vector<ll>& d)
{
    if (tim == K) {
        return true;
    }
    const ll cost = d[tim];
    if (g.edge[pos].empty()) {
        return false;
    }
    auto it = lower_bound(g.edge[pos].begin(), g.edge[pos].end(), Edge{0, 0, cost});
    if (it == g.edge[pos].end()) {
        return false;
    } else {
        for (; it != g.edge[pos].end() and it->cost == cost; it++) {
            if (dfs(g, it->to, tim + 1, d)) {
                return true;
            }
        }
        return false;
    }
}
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> N >> M >> K;
    Graph g(N);
    for (int i = 0; i < M; i++) {
        int a, b;
        ll c;
        cin >> a >> b >> c;
        a--, b--;
        g.addEdge(a, b, c);
    }
    for (int i = 0; i < N; i++) {
        sort(g.edge[i].begin(), g.edge[i].end());
    }
    vector<ll> d(K);
    for (int i = 0; i < K; i++) {
        cin >> d[i];
    }
    reverse(d.begin(), d.end());
    vector<int> ans;
    for (int i = 0; i < N; i++) {
        if (dfs(g, i, 0, d)) {
            ans.push_back(i + 1);
        }
    }
    cout << ans.size() << endl;
    for (int i = 0; i < ans.size(); i++) {
        if (i != 0) {
            cout << " ";
        }
        cout << ans[i];
    }
    cout << endl;
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX