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

• 問題: No.92 逃走経路
• ユーザー: zeke
• 提出日時: 2019-11-22 16:29:13
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 52 ms / 5,000 ms
• コード長: 2,564 bytes
• コンパイル時間: 1,069 ms
• コンパイル使用メモリ: 106,792 KB
• 実行使用メモリ: 6,820 KB
• 最終ジャッジ日時: 2024-10-11 02:37:34
• 合計ジャッジ時間: 2,019 ms
• ジャッジサーバーID （参考情報）: judge2 / 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
118
119
120
121
122
123
124
125
126
127
128
/*
    Author:zeke
    
    pass System Test!
    GET AC!!
*/
#include <iostream>
#include <queue>
#include <vector>
#include <iostream>
#include <vector>
#include <string>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <map>
#include <iomanip>
#include <utility>
#include <stack>
using ll = long long;
using ld = long double;
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rep3(var, min, max) for (ll(var) = (min); (var) < (max); ++(var))
#define repi3(var, min, max) for (ll(var) = (max)-1; (var) + 1 > (min); --(var))
#define Mp(a, b) make_pair((a), (b))
#define F first
#define S second
#define Icin(s) \
    ll(s);      \
    cin >> (s);
#define Scin(s) \
    ll(s);      \
    cin >> (s);
template <class T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
    if (b < a)
    {
        a = b;
        return 1;
    }
    return 0;
}
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef vector<V> VV;
typedef vector<P> VP;
ll MOD = 1e9 + 7;
ll INF = 1e18;
ll n, m, k;
vector<vector<pair<ll, ll>>> vec;
V reg;
bool dfs(ll x, ll f)
{
    if(f+1==k)
        return true;
    bool h = false;
    rep(i,vec[x].size()){
       // cout<<x<<" "<<vec[x][i].S<<" "<<reg[f+1]<<endl;
        if(vec[x][i].S==reg[f+1]){
            if(dfs(vec[x][i].F,f+1)){
                h = true;
                break;
            }
        }
    }
    return h;
}
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n >> m >> k;
    vec.resize(n+1);
    rep(i,m){
        ll s,t,c;
        cin >> s >> t >> c;
        vec[s].push_back({t, c});
        vec[t].push_back({s, c});
    }
    reg.resize(k);
    rep(i,k){
        cin >> reg[i];
    }
    V res;
    reverse(all(reg));
    rep(i,n+1){
        rep(j,vec[i].size()){
            if(vec[i][j].S==reg[0]){
               // cout<<i<<" "<<vec[i][j].S<<endl;
                if(dfs(vec[i][j].F,0)){
                 //   cout<<i<<endl;
                    res.push_back(i);
                //    break;
                }
            }
        }
    }
     decltype(res)::iterator result = std::unique(res.begin(), res.end());
      res.erase(result, res.end());
    //sort(all(res));
    //unique(all(res));
    cout<<res.size()<<endl;
    rep(i,res.size()){
        cout << res[i] << " ";
    }
    cout << endl;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX