HDU 6424(复杂度计算，对数的运用-2018多校第九场1010)

我们分别对G(A),G(B)取两次log 化简出来的公式就是  log(log(f(A))) + log(f(B)) * f(C)  然后记录他们的log次数，  然后先比较G(A)和G(B)的  log(log(f(A)))部分 和log(f(B)) * f(C)部分  将小的放在前面 然后对G(A)和G(B)的log(log(f(A)))比较 若值相同的话和 log(f(B)) * f(C)比较 就可以得到答案了

#include <iostream>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#include <list>
#define INF 0x3f3f3f3f3f3f
#define maxn 105000
#define maxnn 6000
#define juzheng 300
#define line cout << "-------------------------" << endl;
#define PI acos(-1.0)
#define mem(a,b) memset(a,b,sizeof(a))
#define fill_(a,b,n) fill(a,a + n,b)
#define esp 1e-9

#define ri(n) scanf("%d",&n)
#define ri2(a,b) scanf("%d %d",&a,&b)
#define ri3(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define rd(n) scanf("%lf",&n)
#define rd2(a,b) scanf("%lf %lf",&a,&b)
#define rd3(a,b,c) scanf("%lf %lf %lf",&a,&b,&c)
#define rl(n) scanf("%lld",&n)
#define rl2(a,b) scanf("%lld %lld",&a,&b)
#define rl3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)
#define rui(n) scanf("%u",&n)
#define rui2(a,b) scanf("%u %u",&a,&b)
#define rui3(a,b,c) scanf("%u %u %u",&a,&b,&c)
#define rs(str) scanf("%s",str)
#define pr(n) cout << n << endl
#define debug(str,x) cout << str << ":" << x << endl
#define ll long long
#define int64 __int64
#define ui unsigned int

using namespace std;

const ll mod = 1e9 + 7;

//Date:2018-8-21
//Author：HarryBlackCat

struct meb{
	ll x,y;
	meb(ll _x,ll _y){
		x = min(_x,INF);
		y = min(_y,INF);
		if(x > y)
			swap(x,y);
	}
};

ll a,b,A[maxn],B[maxn];

int compare(meb k1,meb k2){
	if(k1.x < k2.x)
		return 1;
	else if(k1.x > k2.x)
		return -1;
	
	if(k1.y < k2.y)
		return 1;
	else if(k1.y > k2.y)
		return -1;
	
	return 0;
}

void init(){
	for(int i = 1;i <= 3;i++)
		A[i] = B[i] = INF;
}

int main() {
	//cin.sync_with_stdio(false);//降低cin，cout时间
	int t;
	while(~ri(t)){
		while(t--){
			init();
			
			rl2(a,b);
			
			for(int i = 1;i <= a;i++)
				rl(A[i]);
			
			for(int i = 1;i <= b;i++)
				rl(B[i]);
			
			meb k1 = meb(A[1] + 2,INF);
			meb k2 = meb(A[2] + 1,A[3]);
			meb k3 = meb(B[1] + 2,INF);
			meb k4 = meb(B[2] + 1,B[3]);
			
			if(compare(k1,k2) == -1)
				swap(k1,k2);
			
			if(compare(k3,k4) == -1)
				swap(k3,k4);
			
			if(compare(k1,k3))
				printf("%d\n",compare(k1,k3));
			else
				printf("%d\n",compare(k2,k4));
		}
	}
	return 0;
}