結果

問題 No.95 Alice and Graph
ユーザー fumiphysfumiphys
提出日時 2019-09-04 23:46:21
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 687 ms / 5,000 ms
コード長 4,623 bytes
コンパイル時間 1,851 ms
コンパイル使用メモリ 175,788 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-06-09 13:25:02
合計ジャッジ時間 4,543 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 199 ms
6,812 KB
testcase_01 AC 31 ms
6,944 KB
testcase_02 AC 32 ms
6,944 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 309 ms
6,944 KB
testcase_05 AC 242 ms
6,944 KB
testcase_06 AC 299 ms
6,944 KB
testcase_07 AC 31 ms
6,948 KB
testcase_08 AC 2 ms
6,940 KB
testcase_09 AC 2 ms
6,940 KB
testcase_10 AC 2 ms
6,940 KB
testcase_11 AC 3 ms
6,944 KB
testcase_12 AC 2 ms
6,940 KB
testcase_13 AC 687 ms
6,948 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
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(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

template <typename T>
struct Graph {
  int n;
  vector<vector<T> > d;
  vector<vector<int> > path;
  Graph(int n): n(n) {
    d = vector<vector<T>>(n, vector<T>(n, numeric_limits<T>::max() / 10));
    path = vector<vector<int>>(n, vector<int>(n, -1));
    for(int i = 0; i < n; i++)d[i][i] = 0;
  }
  void warshall_floyd(){
    for(int k = 0; k < n; k++){
      for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
          if(d[i][j] > d[i][k] + d[k][j]){
            d[i][j] = d[i][k] + d[k][j];
            path[i][j] = k;
          }
        }
      }
    }
  }
  void adde(int at, int to, T cost){
    d[at][to] = cost;
  }
  vector<T>& operator[](size_t i){
    return d[i];
  }
};

using GraphI = Graph<int>;
using GraphL = Graph<ll>;

int dp[1<<16][16];

int main(int argc, char const* argv[])
{
  int n, m, k;
  cin >> n >> m >> k;
  GraphI g(n);
  rep(i, m){
    int u, v;
    cin >> u >> v, u--, v--;
    g.adde(u, v, 1);
    g.adde(v, u, 1);
  }
  g.warshall_floyd();
  vector<int> v;
  for(int i = n - 1; i > 0; i--){
    if(sz(v) == k)break;
    v.pb(i);
    rep(j, (1 << sz(v))){
      rep(l, sz(v))dp[j][l] = inf;
    }
    rep(l, sz(v)){
      dp[bit(l)][l] = g.d[0][v[l]];
    }
    rep(j, (1 << sz(v))){
      if(__builtin_popcount(j) <= 1)continue;
      rep(k2, sz(v)){
        if(!(j & bit(k2)))continue;
        int st = j & (~(1 << k2));
        rep(l, sz(v)){
          if((st >> l) & 1){
            dp[j][k2] = min(dp[j][k2], dp[st][l] + g.d[v[k2]][v[l]]);
          }
        }
      }
    }
    bool ok = false;
    rep(j, sz(v)){
      if(dp[(1<<sz(v))-1][j] <= k)ok = true;
    }
    if(!ok)v.pop_back();
  }
  ll res = 0;
  rep(i, sz(v)){
    res += bit(v[i]) - 1;
  }
  cout << res << endl;
  return 0;
}
0