tests/aoj/tsp.test.cpp

View this file on GitHub
Last update: 2020-10-30 00:46:21+01:00
Problem: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_2_A

Depends on

Code

#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_2_A"

#include "../../code/dynamicProgramming/tsp.cc"

int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(0);

  int N, E;
  cin >> N >> E;

  adj.assign(N, vi(N, INF));
  F0R(i, E) {
      int s, t, d;
      cin >> s >> t >> d;
      adj[s][t] = d;
  }

  int res = tsp();
  cout << (res == INF ? -1 : res) << endl;
}

#line 1 "tests/aoj/tsp.test.cpp"
#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_2_A"

#line 1 "code/template.cc"
// this line is here for a reason
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
#define fi first
#define se second
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define endl '\n'
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define SZ(x) (int)(x).size()
#define FOR(a, b, c) for (auto a = (b); (a) < (c); ++(a))
#define F0R(a, b) FOR (a, 0, (b))
template <typename T>
bool ckmin(T& a, const T& b) { return a > b ? a = b, true : false; }
template <typename T>
bool ckmax(T& a, const T& b) { return a < b ? a = b, true : false; }
#ifndef DEBUG
#define DEBUG 0
#endif
#define dout if (DEBUG) cerr
#define dvar(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#line 2 "code/dynamicProgramming/tsp.cc"
const int INF = 1e9;
vvi dp, adj; // adjacency matrix
int tsp_calc(int pos, int start, int mask) {
  if ((1 << SZ(adj)) - 1 == mask) return adj[pos][start];
  if (dp[pos][mask] != -1) return dp[pos][mask];
  int minV = INF;
  F0R (i, SZ(adj))
    if (i != pos && !(mask & (1 << i)))
      ckmin(minV, adj[pos][i] + tsp_calc(i, start, mask | (1 << i)));
  return dp[pos][mask] = minV;
}
int tsp(int start = 0) {
  dp.assign(SZ(adj), vi(1 << SZ(adj), -1));
  F0R(i, SZ(adj)) ckmin(adj[i][i], 0);
  return tsp_calc(start, start, 1 << start);
}
#line 4 "tests/aoj/tsp.test.cpp"

int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(0);

  int N, E;
  cin >> N >> E;

  adj.assign(N, vi(N, INF));
  F0R(i, E) {
      int s, t, d;
      cin >> s >> t >> d;
      adj[s][t] = d;
  }

  int res = tsp();
  cout << (res == INF ? -1 : res) << endl;
}