2907

#include <iostream>#include <cstring>#include <cmath>using namespace std;struct position{int x;int y;};int size_x, size_y, num, visited[11], way, ans, dis[21][21];position pos[11];void init(){cin >> size_x >> size_y >> pos[0].x >> pos[0].y >> num;for(int i = 1; i <= num; ++i){cin >> pos[i].x >> pos[i].y;}for(int i = 0; i < num; ++i){for(int j = i + 1; j <= num; ++j){dis[i][j] = dis[j][i] = abs(pos[i].x - pos[j].x) + abs(pos[i].y - pos[j].y);}}}void dfs(int ed, int posi){if(ed == num){ans = way < ans? way: ans;}else{visited[posi] = 1;for(int i = 1; i <= num; ++i){if(!visited[i] && way + dis[i][posi] < ans){way += dis[i][posi];if(num - 1 == ed){way += dis[0][i];}dfs(ed + 1, i);if(num - 1 == ed){way -= dis[0][i];}way -= dis[i][posi];}}visited[posi] = 0;}}int main(){int cases;cin >> cases;while(cases--){init();ans = 0x7FFFFFFF;memset(visited, 0, sizeof(visited));way = 0;dfs(0, 0);cout << "The shortest path has length " << ans << endl;}return 0;}