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

提出ソース

結果

問題	No.960 マンハッタン距離3
ユーザー	FF256grhy
提出日時	2019-12-23 14:34:13
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	75 ms / 2,000 ms
コード長	3,568 bytes
コンパイル時間	1,963 ms
コンパイル使用メモリ	195,096 KB
実行使用メモリ	6,948 KB
最終ジャッジ日時	2024-09-17 06:37:42
合計ジャッジ時間	11,848 ms
ジャッジサーバーID （参考情報）	judge6 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,812 KB
testcase_01	AC	2 ms 6,944 KB
testcase_02	AC	2 ms 6,944 KB
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	2 ms 6,944 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	2 ms 6,940 KB
testcase_08	AC	2 ms 6,944 KB
testcase_09	AC	1 ms 6,940 KB
testcase_10	AC	1 ms 6,940 KB
testcase_11	AC	1 ms 6,940 KB
testcase_12	AC	2 ms 6,944 KB
testcase_13	AC	1 ms 6,940 KB
testcase_14	AC	2 ms 6,948 KB
testcase_15	AC	2 ms 6,944 KB
testcase_16	AC	2 ms 6,944 KB
testcase_17	AC	1 ms 6,940 KB
testcase_18	AC	1 ms 6,944 KB
testcase_19	AC	2 ms 6,944 KB
testcase_20	AC	2 ms 6,944 KB
testcase_21	AC	2 ms 6,940 KB
testcase_22	AC	1 ms 6,944 KB
testcase_23	AC	2 ms 6,940 KB
testcase_24	AC	1 ms 6,940 KB
testcase_25	AC	2 ms 6,940 KB
testcase_26	AC	2 ms 6,944 KB
testcase_27	AC	2 ms 6,940 KB
testcase_28	AC	1 ms 6,944 KB
testcase_29	AC	2 ms 6,944 KB
testcase_30	AC	2 ms 6,940 KB
testcase_31	AC	1 ms 6,944 KB
testcase_32	AC	2 ms 6,944 KB
testcase_33	AC	2 ms 6,944 KB
testcase_34	AC	2 ms 6,944 KB
testcase_35	AC	2 ms 6,944 KB
testcase_36	AC	2 ms 6,940 KB
testcase_37	AC	1 ms 6,940 KB
testcase_38	AC	1 ms 6,940 KB
testcase_39	AC	2 ms 6,940 KB
testcase_40	AC	2 ms 6,940 KB
testcase_41	AC	2 ms 6,940 KB
testcase_42	AC	2 ms 6,940 KB
testcase_43	AC	2 ms 6,940 KB
testcase_44	AC	2 ms 6,940 KB
testcase_45	AC	2 ms 6,940 KB
testcase_46	AC	2 ms 6,940 KB
testcase_47	AC	2 ms 6,940 KB
testcase_48	AC	2 ms 6,940 KB
testcase_49	AC	2 ms 6,940 KB
testcase_50	AC	1 ms 6,940 KB
testcase_51	AC	1 ms 6,940 KB
testcase_52	AC	2 ms 6,944 KB
testcase_53	AC	1 ms 6,944 KB
testcase_54	AC	1 ms 6,944 KB
testcase_55	AC	1 ms 6,944 KB
testcase_56	AC	2 ms 6,940 KB
testcase_57	AC	2 ms 6,940 KB
testcase_58	AC	1 ms 6,944 KB
testcase_59	AC	1 ms 6,940 KB
testcase_60	AC	1 ms 6,940 KB
testcase_61	AC	2 ms 6,944 KB
testcase_62	AC	1 ms 6,940 KB
testcase_63	AC	1 ms 6,944 KB
testcase_64	AC	2 ms 6,940 KB
testcase_65	AC	1 ms 6,944 KB
testcase_66	AC	1 ms 6,944 KB
testcase_67	AC	1 ms 6,944 KB
testcase_68	AC	1 ms 6,940 KB
testcase_69	AC	1 ms 6,944 KB
testcase_70	AC	1 ms 6,944 KB
testcase_71	AC	2 ms 6,944 KB
testcase_72	AC	2 ms 6,940 KB
testcase_73	AC	1 ms 6,940 KB
testcase_74	AC	2 ms 6,944 KB
testcase_75	AC	1 ms 6,940 KB
testcase_76	AC	2 ms 6,940 KB
testcase_77	AC	2 ms 6,948 KB
testcase_78	AC	2 ms 6,940 KB
testcase_79	AC	2 ms 6,940 KB
testcase_80	AC	2 ms 6,944 KB
testcase_81	AC	1 ms 6,944 KB
testcase_82	AC	1 ms 6,940 KB
testcase_83	AC	1 ms 6,944 KB
testcase_84	AC	1 ms 6,940 KB
testcase_85	AC	1 ms 6,940 KB
testcase_86	AC	2 ms 6,944 KB
testcase_87	AC	2 ms 6,944 KB
testcase_88	AC	2 ms 6,944 KB
testcase_89	AC	1 ms 6,944 KB
testcase_90	AC	2 ms 6,940 KB
testcase_91	AC	1 ms 6,940 KB
testcase_92	AC	1 ms 6,940 KB
testcase_93	AC	2 ms 6,940 KB
testcase_94	AC	2 ms 6,944 KB
testcase_95	AC	2 ms 6,940 KB
testcase_96	AC	1 ms 6,944 KB
testcase_97	AC	2 ms 6,940 KB
testcase_98	AC	1 ms 6,940 KB
testcase_99	AC	1 ms 6,940 KB
testcase_100	AC	1 ms 6,940 KB
testcase_101	AC	2 ms 6,944 KB
testcase_102	AC	1 ms 6,940 KB
testcase_103	AC	1 ms 6,940 KB
testcase_104	AC	2 ms 6,944 KB
testcase_105	AC	1 ms 6,944 KB
testcase_106	AC	1 ms 6,944 KB
testcase_107	AC	1 ms 6,940 KB
testcase_108	AC	2 ms 6,940 KB
testcase_109	AC	1 ms 6,940 KB
testcase_110	AC	1 ms 6,940 KB
testcase_111	AC	1 ms 6,944 KB
testcase_112	AC	1 ms 6,940 KB
testcase_113	AC	1 ms 6,944 KB
testcase_114	AC	2 ms 6,944 KB
testcase_115	AC	1 ms 6,940 KB
testcase_116	AC	2 ms 6,940 KB
testcase_117	AC	2 ms 6,944 KB
testcase_118	AC	1 ms 6,944 KB
testcase_119	AC	2 ms 6,940 KB
testcase_120	AC	2 ms 6,940 KB
testcase_121	AC	2 ms 6,944 KB
testcase_122	AC	1 ms 6,940 KB
testcase_123	AC	2 ms 6,944 KB
testcase_124	AC	1 ms 6,944 KB
testcase_125	AC	2 ms 6,940 KB
testcase_126	AC	2 ms 6,940 KB
testcase_127	AC	2 ms 6,944 KB
testcase_128	AC	21 ms 6,944 KB
testcase_129	AC	55 ms 6,944 KB
testcase_130	AC	40 ms 6,940 KB
testcase_131	AC	67 ms 6,940 KB
testcase_132	AC	64 ms 6,940 KB
testcase_133	AC	3 ms 6,940 KB
testcase_134	AC	19 ms 6,940 KB
testcase_135	AC	24 ms 6,940 KB
testcase_136	AC	23 ms 6,940 KB
testcase_137	AC	35 ms 6,944 KB
testcase_138	AC	47 ms 6,944 KB
testcase_139	AC	56 ms 6,940 KB
testcase_140	AC	71 ms 6,944 KB
testcase_141	AC	68 ms 6,944 KB
testcase_142	AC	30 ms 6,940 KB
testcase_143	AC	46 ms 6,944 KB
testcase_144	AC	59 ms 6,940 KB
testcase_145	AC	6 ms 6,940 KB
testcase_146	AC	15 ms 6,940 KB
testcase_147	AC	49 ms 6,940 KB
testcase_148	AC	27 ms 6,944 KB
testcase_149	AC	42 ms 6,940 KB
testcase_150	AC	60 ms 6,940 KB
testcase_151	AC	4 ms 6,940 KB
testcase_152	AC	50 ms 6,944 KB
testcase_153	AC	75 ms 6,940 KB
testcase_154	AC	3 ms 6,940 KB
testcase_155	AC	53 ms 6,944 KB
testcase_156	AC	19 ms 6,940 KB
testcase_157	AC	52 ms 6,944 KB
testcase_158	AC	69 ms 6,940 KB
testcase_159	AC	10 ms 6,944 KB
testcase_160	AC	4 ms 6,940 KB
testcase_161	AC	58 ms 6,940 KB
testcase_162	AC	63 ms 6,940 KB
testcase_163	AC	36 ms 6,940 KB
testcase_164	AC	67 ms 6,940 KB
testcase_165	AC	54 ms 6,940 KB
testcase_166	AC	10 ms 6,944 KB
testcase_167	AC	34 ms 6,940 KB
testcase_168	AC	25 ms 6,940 KB
testcase_169	AC	25 ms 6,940 KB
testcase_170	AC	21 ms 6,944 KB
testcase_171	AC	35 ms 6,944 KB
testcase_172	AC	26 ms 6,944 KB
testcase_173	AC	6 ms 6,940 KB
testcase_174	AC	60 ms 6,940 KB
testcase_175	AC	73 ms 6,940 KB
testcase_176	AC	50 ms 6,940 KB
testcase_177	AC	8 ms 6,940 KB
testcase_178	AC	53 ms 6,944 KB
testcase_179	AC	57 ms 6,940 KB
testcase_180	AC	64 ms 6,940 KB
testcase_181	AC	16 ms 6,944 KB
testcase_182	AC	31 ms 6,944 KB
testcase_183	AC	41 ms 6,940 KB
testcase_184	AC	30 ms 6,944 KB
testcase_185	AC	50 ms 6,940 KB
testcase_186	AC	60 ms 6,940 KB
testcase_187	AC	43 ms 6,944 KB
testcase_188	AC	2 ms 6,940 KB
testcase_189	AC	2 ms 6,940 KB
testcase_190	AC	1 ms 6,940 KB
testcase_191	AC	1 ms 6,944 KB
testcase_192	AC	1 ms 6,944 KB
testcase_193	AC	2 ms 6,940 KB
testcase_194	AC	2 ms 6,944 KB
testcase_195	AC	2 ms 6,940 KB
testcase_196	AC	45 ms 6,944 KB
testcase_197	AC	14 ms 6,940 KB
testcase_198	AC	34 ms 6,940 KB
testcase_199	AC	51 ms 6,944 KB
testcase_200	AC	60 ms 6,940 KB
testcase_201	AC	35 ms 6,940 KB
testcase_202	AC	52 ms 6,944 KB
testcase_203	AC	29 ms 6,940 KB
testcase_204	AC	69 ms 6,944 KB
testcase_205	AC	34 ms 6,940 KB
testcase_206	AC	64 ms 6,944 KB
testcase_207	AC	47 ms 6,940 KB
testcase_208	AC	50 ms 6,940 KB
testcase_209	AC	16 ms 6,948 KB
testcase_210	AC	8 ms 6,940 KB
testcase_211	AC	23 ms 6,940 KB
testcase_212	AC	16 ms 6,940 KB
testcase_213	AC	34 ms 6,944 KB
testcase_214	AC	69 ms 6,944 KB
testcase_215	AC	57 ms 6,944 KB
testcase_216	AC	68 ms 6,944 KB
testcase_217	AC	37 ms 6,940 KB
testcase_218	AC	69 ms 6,944 KB
testcase_219	AC	35 ms 6,944 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
using LL = long long int;
#define incID(i, l, r) for(int i = (l)    ; i <  (r); ++i)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); ++i)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); --i)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); --i)
#define inc(i, n)  incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec(i, n)  decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))
#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
auto setmin   = [](auto & a, auto b) { return (b <  a ? a = b, true : false); };
auto setmax   = [](auto & a, auto b) { return (b >  a ? a = b, true : false); };
auto setmineq = [](auto & a, auto b) { return (b <= a ? a = b, true : false); };
auto setmaxeq = [](auto & a, auto b) { return (b >= a ? a = b, true : false); };
auto fl = [](auto a, auto b) { assert(b != 0); return a / b - (a % b != 0 && ((a >= 0) != (b >= 0)) ? 1 : 0); };
auto ce = [](auto a, auto b) { assert(b != 0); return a / b + (a % b != 0 && ((a >= 0) == (b >= 0)) ? 1 : 0); };
auto mo = [](auto a, auto b) { assert(b != 0); a %= b; if(a < 0) { a += abs(b); } return a; };
LL gcd(LL a, LL b) { return (b == 0 ? a : gcd(b, a % b)); }
LL lcm(LL a, LL b) { return a / gcd(a, b) * b; }
#define bit(b, i) (((b) >> (i)) & 1)
#define SI(v) static_cast<int>(v.size())
#define RF(e, v) for(auto & e: v)
#define until(e) while(! (e))
#define if_not(e) if(! (e))
#define ef else if
#define UR assert(false)

// ----

#define T0(T) T
#define T1(T) vector<T0(T)>
#define T2(T) vector<T1(T)>
#define V0(v, T     ...) v
#define V1(v, T, n, ...) T1(T)(n, V0(v, T, __VA_ARGS__))
#define V2(v, T, n, ...) T2(T)(n, V1(v, T, __VA_ARGS__))

int main() {
	LL h, w, n;
	cin >> h >> w >> n;
	vector<LL> x(n), y(n);
	inc(i, n) { cin >> x[i] >> y[i]; }
	
	LL INF = 1e12;
	LL a = +INF, A = -INF;
	LL b = +INF, B = -INF;
	set<int> parity;
	inc(i, n) {
		setmin(a, x[i] - y[i]);
		setmax(A, x[i] - y[i]);
		setmin(b, x[i] + y[i]);
		setmax(B, x[i] + y[i]);
		parity.insert(mo(x[i] + y[i], 2));
	}
	if(SI(parity) == 2) { cout << 0 << endl; return 0; }
	
	using VPLL = vector<pair<LL, LL>>;
	auto v = V2(VPLL(), VPLL, 3, 3);
	inc(i, n) {
		int s = 1;
		if(x[i] - y[i] == a) { s = 0; }
		ef(x[i] - y[i] == A) { s = 2; }
		
		int t = 1;
		if(x[i] + y[i] == b) { t = 0; }
		ef(x[i] + y[i] == B) { t = 2; }
		
		if(SI(v[s][t]) == 0) { v[s][t].EB(x[i], y[i]); };
	}
	
	set<pair<LL, LL>> done;
	auto ok = [&](LL X, LL Y) -> bool {
		bool exist = ! done.emplace(X, Y).SE;
		if(exist) { return false; }
		set<LL> dist;
		inc(i, 3) {
		inc(j, 3) {
			RF(e, v[i][j]) { dist.insert(abs(e.FI - X) + abs(e.SE - Y)); }
		}
		}
		return (SI(dist) == 1);
	};
	
	auto xy = [](LL a, LL b) -> pair<LL, LL> { return { (b + a) / 2, (b - a) / 2 }; };
	vector<LL> X = { xy(a, B).FI, xy(A, b).FI };
	vector<LL> Y = { xy(a, b).SE, xy(A, B).SE };
	sort(ALL(X));
	sort(ALL(Y));
	
	LL ans = 0;
	vector<LL> xp = { X[0] - 1, X[0], X[1], X[1] + 1 };
	vector<LL> yp = { Y[0] - 1, Y[0], Y[1], Y[1] + 1 };
	vector<LL> xl = { X[0] - 1,    1,    1, h - X[1] };
	vector<LL> yl = { Y[0] - 1,    1,    1, w - Y[1] };
	inc(i, 4) {
	inc(j, 4) {
		if(ok(xp[i], yp[j])) { ans += xl[i] * yl[j]; }
	}
	}
	if(ok(X[0] + 1, Y[0] + 1)) { ans += X[1] - X[0] - 1; }
	if(ok(X[0] + 1, Y[1] - 1)) { ans += X[1] - X[0] - 1; }
	
	cout << ans << endl;
	
	return 0;
}

yukicoder

結果

テストケース

ソースコード