#411289 (C++14) No.960 マンハッタン距離3

• 問題: No.960 マンハッタン距離3
• ユーザー: maroon_kuri
• 提出日時: 2019-12-23 01:07:05
• 言語: C++14 (gcc 13.2.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 39 ms / 2,000 ms
• コード長: 6,466 bytes
• コンパイル時間: 2,313 ms
• コンパイル使用メモリ: 187,340 KB
• 実行使用メモリ: 6,392 KB
• 最終ジャッジ日時: 2023-10-13 00:00:12
• 合計ジャッジ時間: 11,298 ms
• ジャッジサーバーID （参考情報）: judge12 / judge13

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 4,368 KB
testcase_01	AC	1 ms; 4,368 KB
testcase_02	AC	2 ms; 4,368 KB
testcase_03	AC	2 ms; 4,372 KB
testcase_04	AC	2 ms; 4,372 KB
testcase_05	AC	2 ms; 4,368 KB
testcase_06	AC	2 ms; 4,368 KB
testcase_07	AC	1 ms; 4,368 KB
testcase_08	AC	2 ms; 4,372 KB
testcase_09	AC	2 ms; 4,372 KB
testcase_10	AC	2 ms; 4,372 KB
testcase_11	AC	2 ms; 4,368 KB
testcase_12	AC	1 ms; 4,368 KB
testcase_13	AC	2 ms; 4,368 KB
testcase_14	AC	2 ms; 4,368 KB
testcase_15	AC	1 ms; 4,368 KB
testcase_16	AC	1 ms; 4,372 KB
testcase_17	AC	1 ms; 4,372 KB
testcase_18	AC	2 ms; 4,372 KB
testcase_19	AC	2 ms; 4,368 KB
testcase_20	AC	2 ms; 4,376 KB
testcase_21	AC	1 ms; 4,372 KB
testcase_22	AC	1 ms; 4,368 KB
testcase_23	AC	2 ms; 4,372 KB
testcase_24	AC	2 ms; 4,368 KB
testcase_25	AC	2 ms; 4,372 KB
testcase_26	AC	2 ms; 4,368 KB
testcase_27	AC	1 ms; 4,368 KB
testcase_28	AC	1 ms; 4,368 KB
testcase_29	AC	2 ms; 4,368 KB
testcase_30	AC	2 ms; 4,372 KB
testcase_31	AC	2 ms; 4,372 KB
testcase_32	AC	1 ms; 4,368 KB
testcase_33	AC	2 ms; 4,372 KB
testcase_34	AC	2 ms; 4,372 KB
testcase_35	AC	2 ms; 4,368 KB
testcase_36	AC	2 ms; 4,368 KB
testcase_37	AC	2 ms; 4,368 KB
testcase_38	AC	2 ms; 4,372 KB
testcase_39	AC	2 ms; 4,368 KB
testcase_40	AC	2 ms; 4,372 KB
testcase_41	AC	2 ms; 4,368 KB
testcase_42	AC	2 ms; 4,372 KB
testcase_43	AC	1 ms; 4,372 KB
testcase_44	AC	2 ms; 4,372 KB
testcase_45	AC	1 ms; 4,372 KB
testcase_46	AC	2 ms; 4,368 KB
testcase_47	AC	2 ms; 4,368 KB
testcase_48	AC	1 ms; 4,368 KB
testcase_49	AC	1 ms; 4,368 KB
testcase_50	AC	2 ms; 4,372 KB
testcase_51	AC	1 ms; 4,372 KB
testcase_52	AC	1 ms; 4,372 KB
testcase_53	AC	2 ms; 4,368 KB
testcase_54	AC	2 ms; 4,368 KB
testcase_55	AC	2 ms; 4,368 KB
testcase_56	AC	1 ms; 4,372 KB
testcase_57	AC	2 ms; 4,368 KB
testcase_58	AC	2 ms; 4,368 KB
testcase_59	AC	1 ms; 4,372 KB
testcase_60	AC	2 ms; 4,368 KB
testcase_61	AC	2 ms; 4,368 KB
testcase_62	AC	1 ms; 4,368 KB
testcase_63	AC	2 ms; 4,368 KB
testcase_64	AC	1 ms; 4,372 KB
testcase_65	AC	2 ms; 4,368 KB
testcase_66	AC	1 ms; 4,372 KB
testcase_67	AC	2 ms; 4,368 KB
testcase_68	AC	1 ms; 4,372 KB
testcase_69	AC	2 ms; 4,368 KB
testcase_70	AC	1 ms; 4,368 KB
testcase_71	AC	1 ms; 4,376 KB
testcase_72	AC	1 ms; 4,368 KB
testcase_73	AC	1 ms; 4,372 KB
testcase_74	AC	2 ms; 4,368 KB
testcase_75	AC	2 ms; 4,372 KB
testcase_76	AC	2 ms; 4,372 KB
testcase_77	AC	1 ms; 4,372 KB
testcase_78	AC	2 ms; 4,368 KB
testcase_79	AC	2 ms; 4,368 KB
testcase_80	AC	2 ms; 4,368 KB
testcase_81	AC	1 ms; 4,368 KB
testcase_82	AC	2 ms; 4,368 KB
testcase_83	AC	1 ms; 4,368 KB
testcase_84	AC	1 ms; 4,372 KB
testcase_85	AC	2 ms; 4,368 KB
testcase_86	AC	1 ms; 4,368 KB
testcase_87	AC	2 ms; 4,368 KB
testcase_88	AC	2 ms; 4,368 KB
testcase_89	AC	2 ms; 4,372 KB
testcase_90	AC	1 ms; 4,368 KB
testcase_91	AC	2 ms; 4,368 KB
testcase_92	AC	2 ms; 4,368 KB
testcase_93	AC	1 ms; 4,368 KB
testcase_94	AC	2 ms; 4,368 KB
testcase_95	AC	1 ms; 4,368 KB
testcase_96	AC	2 ms; 4,372 KB
testcase_97	AC	2 ms; 4,372 KB
testcase_98	AC	2 ms; 4,372 KB
testcase_99	AC	2 ms; 4,368 KB
testcase_100	AC	2 ms; 4,368 KB
testcase_101	AC	2 ms; 4,368 KB
testcase_102	AC	2 ms; 4,368 KB
testcase_103	AC	2 ms; 4,368 KB
testcase_104	AC	2 ms; 4,368 KB
testcase_105	AC	2 ms; 4,368 KB
testcase_106	AC	2 ms; 4,368 KB
testcase_107	AC	2 ms; 4,372 KB
testcase_108	AC	2 ms; 4,372 KB
testcase_109	AC	2 ms; 4,368 KB
testcase_110	AC	1 ms; 4,368 KB
testcase_111	AC	1 ms; 4,372 KB
testcase_112	AC	2 ms; 4,368 KB
testcase_113	AC	2 ms; 4,368 KB
testcase_114	AC	1 ms; 4,368 KB
testcase_115	AC	1 ms; 4,372 KB
testcase_116	AC	2 ms; 4,368 KB
testcase_117	AC	1 ms; 4,368 KB
testcase_118	AC	2 ms; 4,372 KB
testcase_119	AC	2 ms; 4,368 KB
testcase_120	AC	1 ms; 4,372 KB
testcase_121	AC	2 ms; 4,368 KB
testcase_122	AC	2 ms; 4,372 KB
testcase_123	AC	2 ms; 4,368 KB
testcase_124	AC	2 ms; 4,372 KB
testcase_125	AC	2 ms; 4,368 KB
testcase_126	AC	1 ms; 4,368 KB
testcase_127	AC	1 ms; 4,372 KB
testcase_128	AC	10 ms; 4,372 KB
testcase_129	AC	26 ms; 5,864 KB
testcase_130	AC	18 ms; 4,700 KB
testcase_131	AC	31 ms; 6,140 KB
testcase_132	AC	29 ms; 5,340 KB
testcase_133	AC	2 ms; 4,372 KB
testcase_134	AC	8 ms; 4,372 KB
testcase_135	AC	10 ms; 4,372 KB
testcase_136	AC	11 ms; 4,372 KB
testcase_137	AC	16 ms; 4,372 KB
testcase_138	AC	21 ms; 4,836 KB
testcase_139	AC	26 ms; 5,208 KB
testcase_140	AC	30 ms; 5,168 KB
testcase_141	AC	32 ms; 5,488 KB
testcase_142	AC	14 ms; 4,372 KB
testcase_143	AC	19 ms; 4,372 KB
testcase_144	AC	26 ms; 5,368 KB
testcase_145	AC	4 ms; 4,372 KB
testcase_146	AC	8 ms; 4,368 KB
testcase_147	AC	22 ms; 4,368 KB
testcase_148	AC	13 ms; 4,500 KB
testcase_149	AC	20 ms; 4,832 KB
testcase_150	AC	28 ms; 5,988 KB
testcase_151	AC	3 ms; 4,368 KB
testcase_152	AC	22 ms; 5,100 KB
testcase_153	AC	31 ms; 5,176 KB
testcase_154	AC	2 ms; 4,368 KB
testcase_155	AC	24 ms; 5,100 KB
testcase_156	AC	9 ms; 4,372 KB
testcase_157	AC	24 ms; 5,072 KB
testcase_158	AC	30 ms; 5,072 KB
testcase_159	AC	6 ms; 4,368 KB
testcase_160	AC	3 ms; 4,372 KB
testcase_161	AC	28 ms; 5,100 KB
testcase_162	AC	27 ms; 5,096 KB
testcase_163	AC	16 ms; 4,368 KB
testcase_164	AC	33 ms; 5,352 KB
testcase_165	AC	25 ms; 5,096 KB
testcase_166	AC	5 ms; 4,368 KB
testcase_167	AC	17 ms; 4,368 KB
testcase_168	AC	12 ms; 4,368 KB
testcase_169	AC	13 ms; 4,372 KB
testcase_170	AC	11 ms; 4,372 KB
testcase_171	AC	18 ms; 4,368 KB
testcase_172	AC	14 ms; 4,424 KB
testcase_173	AC	4 ms; 4,368 KB
testcase_174	AC	32 ms; 6,068 KB
testcase_175	AC	39 ms; 6,392 KB
testcase_176	AC	24 ms; 5,160 KB
testcase_177	AC	5 ms; 4,372 KB
testcase_178	AC	29 ms; 5,800 KB
testcase_179	AC	30 ms; 5,864 KB
testcase_180	AC	35 ms; 6,116 KB
testcase_181	AC	9 ms; 4,372 KB
testcase_182	AC	13 ms; 4,368 KB
testcase_183	AC	22 ms; 4,944 KB
testcase_184	AC	13 ms; 4,368 KB
testcase_185	AC	20 ms; 4,372 KB
testcase_186	AC	25 ms; 5,316 KB
testcase_187	AC	18 ms; 4,372 KB
testcase_188	AC	2 ms; 4,372 KB
testcase_189	AC	1 ms; 4,372 KB
testcase_190	AC	1 ms; 4,372 KB
testcase_191	AC	1 ms; 4,368 KB
testcase_192	AC	2 ms; 4,372 KB
testcase_193	AC	2 ms; 4,368 KB
testcase_194	AC	2 ms; 4,372 KB
testcase_195	AC	2 ms; 4,372 KB
testcase_196	AC	19 ms; 4,368 KB
testcase_197	AC	7 ms; 4,368 KB
testcase_198	AC	15 ms; 4,368 KB
testcase_199	AC	21 ms; 5,168 KB
testcase_200	AC	25 ms; 5,100 KB
testcase_201	AC	15 ms; 4,368 KB
testcase_202	AC	23 ms; 5,324 KB
testcase_203	AC	13 ms; 4,372 KB
testcase_204	AC	29 ms; 5,104 KB
testcase_205	AC	14 ms; 4,368 KB
testcase_206	AC	27 ms; 5,088 KB
testcase_207	AC	22 ms; 5,084 KB
testcase_208	AC	22 ms; 5,168 KB
testcase_209	AC	8 ms; 4,368 KB
testcase_210	AC	4 ms; 4,368 KB
testcase_211	AC	10 ms; 4,368 KB
testcase_212	AC	7 ms; 4,372 KB
testcase_213	AC	15 ms; 4,372 KB
testcase_214	AC	30 ms; 5,216 KB
testcase_215	AC	25 ms; 5,088 KB
testcase_216	AC	29 ms; 5,140 KB
testcase_217	AC	16 ms; 4,368 KB
testcase_218	AC	28 ms; 5,328 KB
testcase_219	AC	16 ms; 4,372 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;

using ll=long long;
#define int ll

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif

template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

using pi=pair<int,int>;
using vi=vc<int>;

template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.a<<","<<p.b<<"}";
}

template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}

#define mp make_pair
#define mt make_tuple
#define one(x) memset(x,-1,sizeof(x))
#define zero(x) memset(x,0,sizeof(x))
#ifdef LOCAL
void dmpr(ostream&os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ";
	dmpr(os,args...);
}
#define dmp2(...) dmpr(cerr,"Line:",__LINE__,##__VA_ARGS__)
#else
#define dmp2(...) void(0)
#endif

using uint=unsigned;
using ull=unsigned long long;

template<class t,size_t n>
ostream& operator<<(ostream&os,const array<t,n>&a){
	return os<<vc<t>(all(a));
}

template<int i,class T>
void print_tuple(ostream&,const T&){
}

template<int i,class T,class H,class ...Args>
void print_tuple(ostream&os,const T&t){
	if(i)os<<",";
	os<<get<i>(t);
	print_tuple<i+1,T,Args...>(os,t);
}

template<class ...Args>
ostream& operator<<(ostream&os,const tuple<Args...>&t){
	os<<"{";
	print_tuple<0,tuple<Args...>,Args...>(os,t);
	return os<<"}";
}

void print(ll x,int suc=1){
	cout<<x;
	if(suc==1)
		cout<<"\n";
	if(suc==2)
		cout<<" ";
}

ll read(){
	ll i;
	cin>>i;
	return i;
}

vi readvi(int n,int off=0){
	vi v(n);
	rep(i,n)v[i]=read()+off;
	return v;
}

template<class T>
void print(const vector<T>&v,int suc=1){
	rep(i,v.size())
		print(v[i],i==int(v.size())-1?suc:2);
}

string readString(){
	string s;
	cin>>s;
	return s;
}

template<class T>
T sq(const T& t){
	return t*t;
}

//#define CAPITAL
void yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<endl;
	#else
	cout<<"Yes"<<endl;
	#endif
	if(ex)exit(0);
}
void no(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<endl;
	#else
	cout<<"No"<<endl;
	#endif
	if(ex)exit(0);
}
void possible(bool ex=true){
	#ifdef CAPITAL
	cout<<"POSSIBLE"<<endl;
	#else
	cout<<"Possible"<<endl;
	#endif
	if(ex)exit(0);
}
void impossible(bool ex=true){
	#ifdef CAPITAL
	cout<<"IMPOSSIBLE"<<endl;
	#else
	cout<<"Impossible"<<endl;
	#endif
	if(ex)exit(0);
}

constexpr ll ten(int n){
	return n==0?1:ten(n-1)*10;
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

int topbit(signed t){
	return t==0?-1:31-__builtin_clz(t);
}
int topbit(ll t){
	return t==0?-1:63-__builtin_clzll(t);
}
int botbit(signed a){
	return a==0?32:__builtin_ctz(a);
}
int botbit(ll a){
	return a==0?64:__builtin_ctzll(a);
}
int popcount(signed t){
	return __builtin_popcount(t);
}
int popcount(ll t){
	return __builtin_popcountll(t);
}
bool ispow2(int i){
	return i&&(i&-i)==i;
}
int mask(int i){
	return (int(1)<<i)-1;
}

bool inc(int a,int b,int c){
	return a<=b&&b<=c;
}

template<class t> void mkuni(vc<t>&v){
	sort(all(v));
	v.erase(unique(all(v)),v.ed);
}

ll rand_int(ll l, ll r) { //[l, r]
	#ifdef LOCAL
	static mt19937_64 gen;
	#else
    static random_device rd;
    static mt19937_64 gen(rd());
    #endif
    return uniform_int_distribution<ll>(l, r)(gen);
}

template<class t>
int lwb(const vc<t>&v,const t&a){
	return lower_bound(all(v),a)-v.bg;
}

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	
	int wid,hei;cin>>wid>>hei;
	wid--;hei--;
	int n;cin>>n;
	bool dbg=n<0;
	if(dbg){
		n=-n;
	}
	vc<pi> xy;
	rep(i,n){
		int x,y;
		if(dbg){
			static set<pi> tmp;
			do{
				x=rand_int(0,wid);
				y=rand_int(0,hei);
			}while(tmp.count(pi(x,y)));
			tmp.emplace(x,y);
		}else{
			cin>>x>>y;
			x--;y--;
		}
		xy.eb(x,y);
	}
	int ans=0;
	{
		int a=inf,b=-inf,c=inf,d=-inf;
		for(auto p:xy){
			int x,y;tie(x,y)=p;
			chmin(a,x+y);
			chmax(b,x+y);
			chmin(c,x-y);
			chmax(d,x-y);
		}
		if(a!=b&&c!=d&&b-a==d-c&&(a+b)%2==0){
			bool z=true;
			for(auto p:xy){
				int x,y;tie(x,y)=p;
				bool ok=false;
				if(a==x+y)
					ok=1;
				if(b==x+y)
					ok=1;
				if(c==x-y)
					ok=1;
				if(d==x-y)
					ok=1;
				z&=ok;
			}
			if(z)
				ans--;
		}
	}
	dmp(ans);
	rep(_,2){
		dmp(xy);
		int a=inf,b=-inf,c=inf,d=-inf;
		for(auto p:xy){
			int x,y;tie(x,y)=p;
			chmin(a,x+y);
			chmax(b,x+y);
			chmin(c,x-y);
			chmax(d,x-y);
		}
		if(a==b)goto relka;
		if((a+b)%2)goto relka;
		if(d-c>b-a)goto relka;
		{
				
			vi z;
			for(auto p:xy){
				int x,y;tie(x,y)=p;
				if(a!=x+y&&b!=x+y)
					z.pb(x-y);
			}
			
			mkuni(z);
			dmp(z);
			if(z.size()){
				bool ok=true;
				for(auto v:z){
					if(v!=c&&v!=d)
						ok=false;
				}
				if(ok){
					if(z.size()==1){
						if((a+z[0])%2==0){
							if(c==d)
								ans++;
							ans++;
						}
					}else if(d-c==b-a){
						if((a+c)%2==0&&(a+d)%2==0)
							ans++;
					}
				}
			}else{
				int e=c,f=d;
				if((a+c)%2)e--;
				if((a+d)%2)f++;
				dmp2(e,f);
				ans+=max(((b-a)-(f-e))/2+1,int(0));
			}
			
		}
		relka:;
		
		dmp(ans);
		
		for(auto&p:xy)
			p=pi(wid-p.a,p.b);
	}
	rep(_,4){
		int a=inf,b=-inf,c=inf,d=-inf;
		for(auto p:xy){
			int x,y;tie(x,y)=p;
			chmin(a,x+y);
			chmax(b,x+y);
			chmin(c,x-y);
			chmax(d,x-y);
		}
		if((a+c)%2==0){
		
			bool ng=false;
			for(auto p:xy){
				int x,y;tie(x,y)=p;
				if(a!=x+y&&c!=x-y)
					ng=true;
			}
			if(!ng){
				int mx=-inf;
				for(auto p:xy){
					int x,y;tie(x,y)=p;
					chmax(mx,x);
				}
				ans+=wid-mx;
			}
		}
		
		dmp(xy);
		dmp(ans);
		for(auto&p:xy)
			p=pi(hei-p.b,p.a);
		swap(hei,wid);
	}
	rep(_,4){
		int a=inf,b=-inf,c=inf,d=-inf;
		for(auto p:xy){
			int x,y;tie(x,y)=p;
			chmin(a,x+y);
			chmax(b,x+y);
			chmin(c,x-y);
			chmax(d,x-y);
		}
		if(a==b){
			int e=0,f=0;
			for(auto p:xy){
				int x,y;tie(x,y)=p;
				chmax(e,y);
				chmax(f,x);
			}
			ans+=(hei-e)*(wid-f);
		}
		
		dmp(xy);
		dmp(ans);
		for(auto&p:xy)
			p=pi(hei-p.b,p.a);
		swap(hei,wid);
	}
	cout<<ans<<endl;
}