#132598 (C++14) No.17 2つの地点に泊まりたい

• 問題: No.17 2つの地点に泊まりたい
• ユーザー: 0w1
• 提出日時: 2016-11-22 18:15:32
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 3 ms / 5,000 ms
• コード長: 2,516 bytes
• コンパイル時間: 1,884 ms
• コンパイル使用メモリ: 191,756 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-10-15 01:38:47
• 合計ジャッジ時間: 2,668 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

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

ソースコード

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
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector< int > vi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector< vvvi > vvvvi;
typedef vector< vvvvi > vvvvvi;
typedef vector< ll > vl;
typedef vector< vl > vvl;
typedef vector< vvl > vvvl;
typedef vector< vvvl > vvvvl;
typedef vector< vvvvl > vvvvvl;
typedef pair< int, int > pii;
typedef vector< pii > vp;
typedef vector< vp > vvp;
typedef vector < string > vs;
typedef vector< vs > vvs;
typedef vector< double > vd;
typedef vector< vd > vvd;
typedef vector< vvd > vvvd;
typedef vector< bool > vb;
typedef vector< vb > vvb;
const int INF = 0x3f3f3f3f;
const int MOD7 = ( int ) 1e9 + 7;
template< class T1, class T2 >
int upmin( T1 &x, T2 v ){
    if( x > v ){
        x = v;
        return 1;
    }
    return 0;
}
template< class T1, class T2 >
int upmax( T1 &x, T2 v ){
    if( x < v ){
        x = v;
        return 1;
    }
    return 0;
}
typedef tuple< int, int, int, int > t4i;
int N;
vi S;
int M;
vvp E;
void init(){
    cin >> N;
    S = vi( N );
    for( int i = 0; i < N; ++i )
        cin >> S[ i ];
    cin >> M;
    E = vvp( N );
    for( int i = 0; i < M; ++i ){
        int A, B, C; cin >> A >> B >> C;
        E[ A ].emplace_back( C, B );
        E[ B ].emplace_back( C, A );
    }
}
vvvi dp;
void preprocess(){
    dp = vvvi( N + 1, vvi( N + 1, vi( N, INF ) ) );
}
void solve(){
    priority_queue< t4i, vector< t4i >, greater< t4i > > pq;
    pq.emplace( dp[ N ][ N ][ 0 ] = 0, N, N, 0 );
    while( not pq.empty() ){
        int d, f, s, u; tie( d, f, s, u ) = pq.top(); pq.pop();
        if( f < N and s < N and u == N - 1 )
            cout << d << endl, exit( 0 );
        if( d != dp[ f ][ s ][ u ] ) continue;
        for( int i = 0; i < E[ u ].size(); ++i ){
            int c, v; tie( c, v ) = E[ u ][ i ];
            if( upmin( dp[ f ][ s ][ v ], dp[ f ][ s ][ u ] + c ) )
                pq.emplace( dp[ f ][ s ][ v ], f, s, v );
            if( f == N and v != N - 1 and v != 0 ){
                if( upmin( dp[ v ][ s ][ v ], dp[ f ][ s ][ u ] + c + S[ v ] ) )
                    pq.emplace( dp[ v ][ s ][ v ], v, s, v );
            } else if( s == N and f != v and v != N - 1 and v != 0 ){
                if( upmin( dp[ v ][ f ][ v ], dp[ f ][ s ][ u ] + c + S[ v ] ) )
                    pq.emplace( dp[ v ][ f ][ v ], v, f, v );
            }
        }
    }
}
signed main(){
    ios::sync_with_stdio( 0 );
    init();
    preprocess();
    solve();
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX