题解 | 纸牌游戏

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define PII pair<int,int>
#define endl '\n'
int mod = 1000000007;
const int N = 2e5 + 5;

int dx[] = { 0,0,1,-1 };
int dy[] = { 1,-1,0,0 };

int days[] = { 0,31,28,31,30,31,30,31,31,30,31,30,31 };

//快速幂
int ksm(int a, int b)
{
	int ans = 1;
	a %= mod;
	while (b)
	{
		if (b & 1)ans = (ans * a) % mod;
		b >>= 1;
		a = (a * a) % mod;
	}
	return ans % mod;
}

void solve()
{
	int a, b, x, y;
	cin >> a >> b >> x >> y;
	int ans = 0;
	int awin = 0, bwin = 0;
	if (a > x)awin++; else if (a < x)bwin++;
	if (b > y)awin++; else if (b < y)bwin++;
	if (awin > bwin)ans++;
	awin = bwin = 0;
	if (a > y)awin++; else if (a < y)bwin++;
	if (b > x)awin++; else if (b < x)bwin++;
	if (awin > bwin)ans++;
	awin = bwin = 0;
	ans *= 2;
	cout << ans << endl;
}

signed main()
{
	ios::sync_with_stdio, cin.tie(0), cout.tie(0);
	int t = 1;
	cin >> t;
	while (t--)
	{
		solve();
	}

	return 0;
}