给定两个点,让我们选择一些点放障碍物,使得两个点之间无法相互到达,最优 策略就是围住某个点,判断一个点是否在边界上
输入
3
4 4
2 2 3 3
6 7
1 1 2 3
9 9
5 1 3 6
输出
4
2
3
#include <iostream>
#include <vector>
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <algorithm>
#define x first
#define y second
#define pb emplace_back
#define fu(i,a,b) for(int i=a;i<=b; ++ i)
#define fd(i,a,b) for(int i=a;i>=b; -- i)
#define endl '\n'
#define ms(x,y) memset(x,y,sizeof x)
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<vector<LL>> VVL;
typedef vector<vector<int>> VVI;
typedef vector<LL> VL;
typedef vector<bool> VB;
typedef vector<int> VI;
typedef vector<string> VS;
typedef pair<int,int> PII;
typedef vector<PII> VPII;
typedef pair<PII,int> PIII;
typedef pair<double,double> PDD;
typedef pair<double,int> PDI;
typedef pair<char,int> PCI;
typedef pair<string,int> PSI;
typedef pair<int,string> PIS;
typedef pair<int,char> PIC;
typedef pair<LL,LL> PLL;
typedef __int128 i128;
typedef unsigned long long ULL;
const int N = 1e6 + 10,M = N * 2 ,INF = 0x3f3f3f3f,P = 131;
const double eps = 1e-8,DNF = 1e18;
const int mod = 1e9 + 7 ,base= 20010;
const LL LNF=(LL) INF * INF;
int n,m;
inline void solve()
{
int n,m;cin >> n >> m;
int x1,y1,x2,y2;
cin >> x1 >> y1 >> x2 >> y2;
// 封住第一个点
int a = (x1 != 1 ) + (x1 != n ) + (y1 != 1 ) + (y1 != m );
int b = (x2 != 1 ) + (x2 != n ) + (y2 != 1) + (y2 != m ) ;
int ans = min(a,b);
cout << ans <<endl;
}
signed main()
{
// freopen("1.txt","r",stdin);
// #define int long long
// init(N-1);
ios
// cout << fixed<<setprecision(2);
int t=1;
cin>>t;
int now = 1;
while(t -- )
{
// cout<<"Case ";
// cout<<"Case #";
// cout<<"Scenario #";
// cout<< now ++ <<": ";
// cout<< now ++ <<": \n";
solve();
}
return 0;
}