#137330 (C++11) No.92 逃走経路

• 問題: No.92 逃走経路
• ユーザー: assy1028
• 提出日時: 2016-12-10 15:38:04
• 言語: C++11 (gcc 13.3.0)
• 結果: AC
• 実行時間: 1,571 ms / 5,000 ms
• コード長: 2,478 bytes
• コンパイル時間: 1,173 ms
• コンパイル使用メモリ: 108,864 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-11-29 00:42:43
• 合計ジャッジ時間: 7,065 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

ファイルパターン	結果
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
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <iomanip>
#include <sys/time.h>
#include <random>
using namespace std;
#define endl '\n'
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end())
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef complex<double> comp;
typedef vector< vector<ld> > matrix;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
    size_t seed = hash<T>()(x.first);
    return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};
const int inf = 1e9 + 9;
const ll mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1);
int n, m, k;
int a[1010], b[1010], c[1010];
int d[1010];
typedef struct {
    int to, cost;
} edge;
vector<edge> G[110];
bool cand[110];
void check(int s) {
    vector<int> vec[2];
    int p = 0;
    vec[p].push_back(s);
    for (int i = 0; i < k; i++, p=1-p) {
        if (vec[p].size() == 0) break;
        for (int v : vec[p]) {
            for (int j = 0; j < G[v].size(); j++) {
                edge w = G[v][j];
                if (w.cost == d[i]) {
                    vec[1-p].push_back(w.to);
                }
            }
        }
        sort(ALL(vec[1-p]));
        UNIQ(vec[1-p]);
        vec[p].clear();
    }
    
    for (int v : vec[p]) {
        cand[v] = true;
    }
}
void solve() {
    for (int i = 0; i < m; i++) {
        G[a[i]].push_back(edge{b[i], c[i]});
        G[b[i]].push_back(edge{a[i], c[i]});
    }
    for (int i = 0; i < n; i++) check(i);
    vector<int> res;
    for (int i = 0; i < n; i++)
        if (cand[i])
            res.push_back(i+1);
    int l = res.size();
    cout << l << endl;
    for (int i = 0; i < l; i++) {
        cout << res[i] << (i==l-1?endl:' ');
    }
}
void input() {
    cin >> n >> m >> k;
    for (int i = 0; i < m; i++) {
        cin >> a[i] >> b[i] >> c[i];
        a[i]--; b[i]--;
    }
    for (int i = 0; i < k; i++) cin >> d[i];
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);
    input();
    solve();
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX