建议月赛2A评橙，2B评红

听取MLE声一片 @ 2021-10-01 19:02:34

by P8107 @ 2021-10-01 19:03:43

建议 2A 2B 全红。

by 听取MLE声一片 @ 2021-10-01 19:04:29

我也这么想的

但是怕不好

by FxorG @ 2021-10-01 19:06:11

全红吧 而且2B可以不用压空间的

by Fatalis_Lights @ 2021-10-01 19:06:31

2A 2B 是全红。

by 王熙文 @ 2021-10-01 19:07:47

2B 都不用定义数组 /qd

by 王熙文 @ 2021-10-01 19:09:27

2A 也不用分讨 /qd

一个算式就出来了

by ajahjahah @ 2021-10-01 19:14:23

我觉得2A橙吧 还是有点难度的（应该是我太菜了）

by npqenqpve @ 2021-10-01 19:14:48

@王熙文 100+ 行大分讨人暴怒

by 蒟蒻炒扇贝 @ 2021-10-01 19:16:59

虽然我赞成楼主的观点

但我有预感2A2B会全红

by 听取MLE声一片 @ 2021-10-01 19:18:18

#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<vector>
#include<map>
#include<ctime>
#include<complex>
using namespace std;
#define int long long
inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
int t,a,b,c,d,ans;
signed main()
{
    t=read();
    while(t--){
        a=read(),b=read(),c=read(),d=read();
        ans=0;
        int minn=min(abs(a-c),abs(b-d));
        if(a>c)a-=minn;
        else a+=minn;
        if(b>d)b-=minn;
        else b+=minn;
        int dis=max(abs(a-c),abs(b-d));
        if(dis<=1){
            cout<<2*minn+dis<<endl;
            continue;
        }
        if(dis%2==0){
            cout<<2*minn+2*dis<<endl;
            continue;
        }
        cout<<2*minn+2*dis-1<<endl;
    }
    return 0;
}

@SSFC103王赫奕