#5488 (C++11) No.95 Alice and Graph

• 問題: No.95 Alice and Graph
• ユーザー: mamekin
• 提出日時: 2014-12-07 23:57:41
• 言語: C++11 (gcc 13.3.0)
• 結果: AC
• 実行時間: 1,773 ms / 5,000 ms
• コード長: 2,466 bytes
• コンパイル時間: 1,269 ms
• コンパイル使用メモリ: 105,252 KB
• 実行使用メモリ: 9,972 KB
• 最終ジャッジ日時: 2024-11-14 13:29:21
• 合計ジャッジ時間: 10,033 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

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

ソースコード

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
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;
const int INF = INT_MAX / 4;
void shortestPath(const vector<vector<int> >& edges, int start, vector<int>& dist)
{
    int n = edges.size();
    dist.assign(n, INF);
    dist[start] = 0;
    queue<int> q;
    q.push(start);
    while(!q.empty()){
        int v = q.front();
        q.pop();
        for(unsigned i=0; i<edges[v].size(); ++i){
            int u = edges[v][i];
            if(dist[u] == INF){
                dist[u] = dist[v] + 1;
                q.push(u);
            }
        }
    }
}
void shortestPath(const vector<vector<int> >& edges, vector<vector<int> >& dist)
{
    dist.resize(edges.size());
    for(unsigned i=0; i<edges.size(); ++i)
        shortestPath(edges, i, dist[i]);
}
int solve(const vector<vector<int> >& dist, const vector<int> node)
{
    int n = node.size();
    vector<vector<int> > dp(1<<n, vector<int>(n, INF));
    for(int i=0; i<n; ++i)
        dp[1<<i][i] = dist[0][node[i]];
    for(int i=0; i<(1<<n); ++i){
        bitset<32> bs(i);
        for(int j=0; j<n; ++j){
            if(!bs[j])
                continue;
            for(int k=0; k<n; ++k){
                if(bs[k])
                    continue;
                bs[k] = true;
                dp[bs.to_ulong()][k] = min(dp[bs.to_ulong()][k], dp[i][j] + dist[node[j]][node[k]]);
                bs[k] = false;
            }
        }
    }
    return *min_element(dp.back().begin(), dp.back().end());
}
int main()
{
    int n, m, k;
    cin >> n >> m >> k;
    vector<vector<int> > edges(n);
    for(int i=0; i<m; ++i){
        int a, b;
        cin >> a >> b;
        edges[a-1].push_back(b-1);
        edges[b-1].push_back(a-1);
    }
    vector<vector<int> > dist;
    shortestPath(edges, dist);
    long long ret = 0;
    vector<int> node;
    for(int i=n-1; i>0; --i){
        node.push_back(i);
        if(solve(dist, node) <= k)
            ret += (1LL << i) - 1;
        else
            node.pop_back();
    }
    cout << ret << endl;
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX