#467131 (C++17) No.1028 闇討ち

提出ソース
結果

問題	No.1028 闇討ち
ユーザー	yuruhiya
提出日時	2020-04-19 19:13:22
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	42 ms / 2,000 ms
コード長	20,692 bytes
コンパイル時間	2,089 ms
コンパイル使用メモリ	216,140 KB
実行使用メモリ	16,000 KB
最終ジャッジ日時	2024-10-06 02:24:28
合計ジャッジ時間	4,204 ms
ジャッジサーバーID （参考情報）	judge4 / judge2
このコードへのチャレンジ
（要ログイン）
テストケース

テストケース表示
入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 5,248 KB
testcase_01	AC	2 ms 5,248 KB
testcase_02	AC	1 ms 5,248 KB
testcase_03	AC	1 ms 5,248 KB
testcase_04	AC	1 ms 5,248 KB
testcase_05	AC	1 ms 5,248 KB
testcase_06	AC	2 ms 5,248 KB
testcase_07	AC	2 ms 5,248 KB
testcase_08	AC	1 ms 5,248 KB
testcase_09	AC	4 ms 5,248 KB
testcase_10	AC	4 ms 5,248 KB
testcase_11	AC	10 ms 6,528 KB
testcase_12	AC	38 ms 15,488 KB
testcase_13	AC	39 ms 15,360 KB
testcase_14	AC	24 ms 11,520 KB
testcase_15	AC	9 ms 5,760 KB
testcase_16	AC	42 ms 16,000 KB
testcase_17	AC	39 ms 16,000 KB
testcase_18	AC	40 ms 16,000 KB
testcase_19	AC	40 ms 16,000 KB
testcase_20	AC	39 ms 16,000 KB
testcase_21	AC	39 ms 16,000 KB
権限があれば一括ダウンロードができます
ソースコード

raw source code
#define _USE_MATH_DEFINES
#if defined(__GNUC__)
#include <bits/stdc++.h>
#elif defined(_MSC_VER)
#define _CRT_SECURE_NO_WARNINGS
#include <__msvc_all_public_headers.hpp>
#undef min
#undef max
#endif
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rfor(i, m, n) for (int i = (m); i >= (n); --i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)

using namespace std;
using ll = long long;		using ld = long double;
using VB = vector<bool>;	using VVB = vector<VB>;
using VI = vector<int>;		using VVI = vector<VI>;
using VL = vector<ll>;		using VVL = vector<VL>;
using VS = vector<string>;	using VD = vector<ld>;
using PII = pair<int, int>;	using VP = vector<PII>;
using PLL = pair<ll, ll>;	using VPL = vector<PLL>;
template<class T>using PQ = priority_queue<T>;
template<class T>using PQS = priority_queue<T, vector<T>, greater<T>>;
constexpr int inf = (int)1e9;
constexpr ll inf_ll = (ll)1e18, MOD = 1000000007;
constexpr ld PI = M_PI, EPS = 1e-12;

// --- input --- //
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#define fwrite_unlocked fwrite
#define fflush_unlocked _fflush_nolock
#endif
inline int gc() { return getchar_unlocked(); }
template<class T>inline void InputF(T& v) { cin >> v; }
inline void InputF(char& v) { while (isspace(v = gc())); }
inline void InputF(bool& v) { char c; InputF(c); v = c == '1'; }
inline void InputF(string& v) { char c; for (InputF(c); !isspace(c); c = gc())v += c; }
inline void InputF(int& v) {
	bool neg = false; v = 0; char c; InputF(c);
	if (c == '-') { neg = true; c = gc(); }
	for (; isdigit(c); c = gc())v = v * 10 + (c - '0');
	if (neg)v = -v;
}
inline void InputF(long long& v) {
	bool neg = false; v = 0; char c; InputF(c);
	if (c == '-') { neg = true; c = gc(); }
	for (; isdigit(c); c = gc())v = v * 10 + (c - '0');
	if (neg)v = -v;
}
inline void InputF(double& v) {
	double dp = 1; bool neg = false, adp = false; v = 0; char c; InputF(c);
	if (c == '-') { neg = true; c = gc(); }
	for (; isdigit(c) || c == '.'; c = gc()) {
		if (c == '.')adp = true;
		else if (adp)v += (c - '0') * (dp *= 0.1);
		else v = v * 10 + (c - '0');
	}
	if (neg)v = -v;
}
template<class T, class U>inline void InputF(pair<T, U>& v) { InputF(v.first); InputF(v.second); }
template<class T>inline void InputF(vector<T>& v) { for (auto& e : v)InputF(e); }
template<size_t N = 0, class T>inline void InputTuple(T& v) {
	if constexpr (N < tuple_size_v<T>) { InputF(get<N>(v)); InputTuple<N + 1>(v); }
}
template<class...T>inline void InputF(tuple<T...>& v) { InputTuple(v); }
template<class T>inline T InputF() { T v; InputF(v); return v; }
struct InputV {
	int n, m;
	InputV(int N) :n(N), m(0) {}
	InputV(pair<int, int> N) :n(N.first), m(N.second) {}
	template<class T>operator vector<T>() { vector<T> v(n); InputF(v); return v; }
	template<class T>operator vector<vector<T>>() { vector<vector<T>> v(n, vector<T>(m)); InputF(v); return v; }
};
struct Input {
	template<class T>operator T() { return InputF<T>(); }
	int operator--(int) { int v; InputF(v); v--; return v; }
	InputV operator[](int n) { return InputV(n); }
	InputV operator[](pair<int, int> n) { return InputV(n); }
	void operator()() {}
	template<class H, class...T>void operator()(H&& h, T&& ...t) { InputF(h); operator()(forward<T>(t)...); }
	template<class T>Input& operator,(T&& v) { InputF(v); return *this; }
private:
	template<template<class...>class, class...>struct Multiple;
	template<template<class...>class V, class Head, class... Tail>struct Multiple<V, Head, Tail...> {
		template<class... Args>using vec = V<vector<Head>, Args...>;
		using type = typename Multiple<vec, Tail...>::type;
	};
	template<template<class...>class V>struct Multiple<V> { using type = V<>; };
	template<class...T>using multiple_t = typename Multiple<tuple, T...>::type;
	template<size_t N = 0, class T>void in_multiple(T& t) {
		if constexpr (N < tuple_size_v<T>) {
			auto& vec = get<N>(t);
			using V = typename remove_reference_t<decltype(vec)>::value_type;
			vec.push_back(InputF<V>());
			in_multiple<N + 1>(t);
		}
	}
public:
	template<class...T>auto multiple(int H) {
		multiple_t<T...> res; while (H--)in_multiple(res); return res;
	}
}in;
#define input(T) InputF<T>()
#define ini input(int)
#define inl input(ll)
#define ins input(string)
#define ind input(ld)
#define input2(T, ...) T __VA_ARGS__; in(__VA_ARGS__)
#define INT(...) input2(int, __VA_ARGS__)
#define LL(...) input2(ll, __VA_ARGS__)
#define STR(...) input2(string, __VA_ARGS__)
#define DOUBLE(...) input2(ld, __VA_ARGS__)

// --- output --- //
struct BoolStr {
	const char* t, * f; BoolStr(const char* _t, const char* _f) :t(_t), f(_f) {}
}Yes("Yes", "No"), yes("yes", "no"), YES("YES", "NO"), Int("1", "0");
struct DivStr {
	const char* d, * l; DivStr(const char* _d, const char* _l) :d(_d), l(_l) {}
}spc(" ", "\n"), no_spc("", "\n"), end_line("\n", "\n"), comma(",", "\n"), no_endl(" ", "");
class Output {
	BoolStr B{ Yes }; DivStr D{ spc };
	void p(int v) {
		if (v < 0)putchar_unlocked('-'), v = -v;
		char b[10]; int n = 0;
		while (v)b[n++] = '0' + v % 10, v /= 10;
		if (!n)b[n++] = '0';
		while (n--)putchar_unlocked(b[n]);
	}
	void p(ll v) {
		if (v < 0)putchar_unlocked('-'), v = -v;
		char b[20]; int n = 0;
		while (v)b[n++] = '0' + v % 10, v /= 10;
		if (!n)b[n++] = '0';
		while (n--)putchar_unlocked(b[n]);
	}
	void p(bool v) { p(v ? B.t : B.f); }
	void p(char v) { putchar_unlocked(v); }
	void p(const char* v) { fwrite_unlocked(v, 1, strlen(v), stdout); }
	void p(double v) { printf("%.20f", v); }
	void p(long double v) { printf("%.20Lf", v); }
	template<class T> void p(const T& v) { cout << v; }
	template<class T, class U>void p(const pair<T, U>& v) { p(v.first); p(D.d); p(v.second); }
	template<class T>void p(const vector<T>& v) { rep(i, sz(v)) { if (i)p(D.d); p(v[i]); } }
	template<class T>void p(const vector<vector<T>>& v) { rep(i, sz(v)) { if (i)p(D.l); p(v[i]); } }
public:
	Output& operator()() { p(D.l); return *this; }
	template<class H>Output& operator()(H&& h) { p(h); p(D.l); return *this; }
	template<class H, class...T>Output& operator()(H&& h, T&& ...t) {
		p(h); p(D.d); return operator()(forward<T>(t)...);
	}
	template<class...T>void exit(T&& ...t) { operator()(forward<T>(t)...); std::exit(EXIT_SUCCESS); }
	Output& flush() { fflush_unlocked(stdout); return *this; }
	Output& set(const BoolStr& b) { B = b; return *this; }
	Output& set(const DivStr& d) { D = d; return *this; }
	Output& set(const char* t, const char* f) { B = BoolStr(t, f); return *this; }
}out;

// --- step --- //
template<class T>struct Step {
	class It {
		T a, b, c;
	public:
		constexpr It() : a(T()), b(T()), c(T()) {}
		constexpr It(T _b, T _c, T _s) : a(_b), b(_c), c(_s) {}
		constexpr It& operator++() { --b; a += c; return *this; }
		constexpr It operator++(int) { It tmp = *this; --b; a += c; return tmp; }
		constexpr const T& operator*()const { return a; }
		constexpr const T* operator->()const { return &a; }
		constexpr bool operator==(const It& i)const { return b == i.b; }
		constexpr bool operator!=(const It& i)const { return !(b == i.b); }
		constexpr T start()const { return a; }
		constexpr T count()const { return b; }
		constexpr T step()const { return c; }
	};
	constexpr Step(T b, T c, T s) : be(b, c, s) {}
	constexpr It begin()const { return be; }
	constexpr It end()const { return en; }
	constexpr T start()const { return be.start(); }
	constexpr T count()const { return be.count(); }
	constexpr T step()const { return be.step(); }
	constexpr T sum()const { return start() * count() + step() * (count() * (count() - 1) / 2); }
	operator vector<T>()const { return as_vector(); }
	template<class F>void each(const F& f)const { for (T i : *this)f(i); }
	auto as_vector()const {
		vector<T> res; res.reserve(count()); each([&](T i) {res.push_back(i); }); return res;
	}
	template<class F, class U = decay_t<invoke_result<F, T>>>auto map(const F& f) {
		vector<U> res; res.reserve(count()); each([&](T i) {res.push_back(f(i)); }); return res;
	}
	template<class F>auto select(const F& f)const {
		vector<T> res; each([&](T i) {if (f(i))res.push_back(i); }); return res;
	}
	template<class F>int count_if(const F& f)const { int res = 0; each([&](T i) {if (f(i))++res; }); return res; }
	template<class F>optional<T> find_if(const F& f)const { for (T i : *this)if (f(i))return i; return nullopt; }
	template<class F>auto max_by(const F& f)const { auto v = map(f); return *max_element(v.begin(), v.end()); }
	template<class F>auto min_by(const F& f)const { auto v = map(f); return *min_element(v.begin(), v.end()); }
	template<class F, class U = decay_t<invoke_result_t<F, T>>>auto sum(const F& f)const {
		U res = 0; each([&](T i) {res += static_cast<U>(f(i)); }); return res;
	}
	using value_type = T;
	using iterator = It;
private:
	It be, en;
};
template<class T>inline constexpr auto step(T a) { return Step<T>(0, a, 1); }
template<class T>inline constexpr auto step(T a, T b) { return Step<T>(a, b - a, 1); }
template<class T>inline constexpr auto step(T a, T b, T c) { return Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c); }

inline namespace {
	template<class T>inline void Sort(T& a) { sort(all(a)); }
	template<class T>inline void RSort(T& a) { sort(rall(a)); }
	template<class T>inline T Sorted(T a) { Sort(a); return a; }
	template<class T>inline T RSorted(T a) { RSort(a); return a; }
	template<class T, class F>inline void Sort(T& a, const F& f) {
		sort(all(a), [&](const auto& x, const auto& y) {return f(x) < f(y); });
	}
	template<class T, class F>inline void RSort(T& a, const F& f) {
		sort(rall(a), [&](const auto& x, const auto& y) {return f(x) < f(y); });
	}
	template<class T>inline void Reverse(T& a) { reverse(all(a)); }
	template<class T>inline void Unique(T& a) { a.erase(unique(all(a)), a.end()); }
	template<class T>inline T Reversed(T a) { Reverse(a); return a; }
	template<class T>inline T Uniqued(T a) { Unique(a); return a; }
	template<class T>inline auto Max(const T& a) { return *max_element(all(a)); }
	template<class T>inline auto Min(const T& a) { return *min_element(all(a)); }
	template<class T>inline int MaxPos(const T& a) { return max_element(all(a)) - a.begin(); }
	template<class T>inline int MinPos(const T& a) { return min_element(all(a)) - a.begin(); }
	template<class T, class F>inline auto Max(const T& a, const F& f) {
		return max_element(all(a), [&](const auto& x, const auto& y) {return f(x) < f(y); });
	}
	template<class T, class F>inline auto Min(const T& a, const F& f) {
		return min_element(all(a), [&](const auto& x, const auto& y) {return f(x) < f(y); });
	}
	template<class T, class U>inline int Count(const T& a, const U& v) { return count(all(a), v); }
	template<class T, class F>inline int CountIf(const T& a, const F& f) { return count_if(all(a), f); }
	template<class T, class U>inline int Find(const T& a, const U& v) { return find(all(a), v) - a.begin(); }
	template<class T, class F>inline int FindIf(const T& a, const F& f) { return find_if(all(a), f) - a.begin(); }
	template<class T, class U = typename T::value_type>inline U Sum(const T& a) { return accumulate(all(a), U()); }
	template<class T, class F>inline auto Sum(const T& v, const F& f) {
		return accumulate(next(v.begin()), v.end(), f(v.front()), [&](auto a, auto b) {return a + f(b); });
	}
	template<class T, class U>inline int Lower(const T& a, const U& v) { return lower_bound(all(a), v) - a.begin(); }
	template<class T, class U>inline int Upper(const T& a, const U& v) { return upper_bound(all(a), v) - a.begin(); }
	template<class T, class F>inline void RemoveIf(T& a, const F& f) { a.erase(remove_if(all(a), f), a.end()); }
	template<class F>inline auto Vector(size_t size, const F& f) {
		vector<decay_t<invoke_result_t<F, size_t>>> res(size); for (size_t i = 0; i < size; ++i)res[i] = f(i); return res;
	}
	template<class T>inline auto Grid(size_t h, size_t w, const T& v = T()) { return vector<vector<T>>(h, vector<T>(w, v)); }
	template<class T>inline auto Slice(const T& v, size_t i, size_t len) {
		return i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T();
	}
	template<class T, class F>inline auto Each(const T& v, const F& f) { for (auto& i : v)f(i); }
	template<class T, class F>inline auto Select(const T& v, const F& f) {
		T res; for (const auto& e : v)if (f(e))res.push_back(e); return res;
	}
	template<class T, class F>inline auto Map(const T& v, const F& f) {
		vector<decay_t<invoke_result_t<F, typename T::value_type>>> res(v.size());
		size_t i = 0; for (const auto& e : v)res[i++] = f(e); return res;
	}
	template<class T, class F>inline auto MapIndex(const T& v, const F& f) {
		vector<decay_t<invoke_result_t<F, size_t, typename T::value_type>>> res(v.size());
		size_t i = 0; for (auto it = v.begin(); it != v.end(); ++it, ++i)res[i] = f(i, *it); return res;
	}
	template<class T, class F>inline auto TrueIndex(const T& v, const F& f) {
		vector<size_t> res; for (size_t i = 0; i < v.size(); ++i)if (f(v[i]))res.push_back(i); return res;
	}
	inline auto operator*(string s, size_t n) { string ret; for (size_t i = 0; i < n; ++i)ret += s; return ret; }
	template<class T>inline auto& operator<<(vector<T>& v, const vector<T>& v2) { v.insert(v.end(), all(v2)); return v; }
	template<class T>inline T Ceil(T n, T m) { return (n + m - 1) / m; }
	template<class T>inline T Ceil2(T n, T m) { return Ceil(n, m) * m; }
	template<class T>inline T Tri(T n) { return (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1); }
	template<class T>inline T nC2(T n) { return (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1); }
	template<class T>inline T Mid(const T& l, const T& r) { return l + (r - l) / 2; }
	template<class T>inline int pop_count(T n) { return bitset<64>(n).count(); }
	template<class T>inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; }
	template<class T>inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; }
	template<class T>inline bool inRange(const T& v, const T& min, const T& max) { return min <= v && v < max; }
	template<class T = ll>inline T BIT(int b) { return T{ 1 } << b; }
	template<class T, class U = typename T::value_type>inline U Gcdv(const T& v) {
		return accumulate(next(v.begin()), v.end(), U(*v.begin()), gcd<U, U>);
	}
	template<class T, class U = typename T::value_type>inline U Lcmv(const T& v) {
		return accumulate(next(v.begin()), v.end(), U(*v.begin()), lcm<U, U>);
	}
	template<class T>inline T Pow(T a, T n) { T r = 1; while (n > 0) { if (n & 1)r *= a; a *= a; n /= 2; } return r; }
	template<class T>inline T Powmod(T a, T n, T m = MOD) {
		T r = 1; while (n > 0) { if (n & 1)r = r * a % m, n--; else a = a * a % m, n /= 2; }return r;
	}
}

// --- dump --- //
#if __has_include("dump.hpp")
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif

// ---------------------------------------------------------------- //

struct Point {
	static int H, W;
	static const vector<Point> d;
	static void set_range(int _H, int _W) { H = _H; W = _W; }
	static constexpr Point zero() { return { 0,0 }; }
	static constexpr Point one() { return { 1,1 }; }
	int x, y;
	constexpr Point() :x(0), y(0) {}
	constexpr Point(int _x, int _y) : x(_x), y(_y) {}
	constexpr Point(const pair<int, int>& xy) : x(xy.first), y(xy.second) {}
	Point(int n) :x(n% W), y(n / W) {}
	constexpr Point operator+()const { return *this; }
	constexpr Point operator-()const { return { -x,-y }; }
	constexpr Point operator+(const Point& p)const { return Point(*this) += p; }
	constexpr Point operator-(const Point& p)const { return Point(*this) -= p; }
	constexpr Point operator*(const Point& p)const { return Point(*this) *= p; }
	constexpr Point operator/(const Point& p)const { return Point(*this) /= p; }
	constexpr Point operator%(const Point& p)const { return Point(*this) %= p; }
	constexpr Point operator+(int n)const { return Point(*this) += n; }
	constexpr Point operator-(int n)const { return Point(*this) -= n; }
	constexpr Point operator*(int n)const { return Point(*this) *= n; }
	constexpr Point operator/(int n)const { return Point(*this) /= n; }
	constexpr Point operator%(int n)const { return Point(*this) %= n; }
	constexpr Point& operator+=(const Point& p) { x += p.x; y += p.y; return *this; }
	constexpr Point& operator-=(const Point& p) { x -= p.x; y -= p.y; return *this; }
	constexpr Point& operator*=(const Point& p) { x *= p.x; y *= p.y; return *this; }
	constexpr Point& operator/=(const Point& p) { x /= p.x; y /= p.y; return *this; }
	constexpr Point& operator%=(const Point& p) { x %= p.x; y %= p.y; return *this; }
	constexpr Point& operator+=(int n) { x += n; y += n; return *this; }
	constexpr Point& operator-=(int n) { x -= n; y -= n; return *this; }
	constexpr Point& operator*=(int n) { x *= n; y *= n; return *this; }
	constexpr Point& operator/=(int n) { x /= n; y /= n; return *this; }
	constexpr Point& operator%=(int n) { x %= n; y %= n; return *this; }
	constexpr bool operator==(const Point& p)const { return x == p.x && y == p.y; }
	constexpr bool operator!=(const Point& p)const { return x != p.x || y != p.y; }
	bool operator<(const Point& p)const { return to_i() < p.to_i(); }
	bool operator<=(const Point& p)const { return to_i() <= p.to_i(); }
	bool operator>(const Point& p)const { return to_i() > p.to_i(); }
	bool operator>=(const Point& p)const { return to_i() >= p.to_i(); }
	constexpr int operator[](int i)const { return i == 0 ? x : i == 1 ? y : 0; }
	bool in_range()const { return 0 <= x && x < W && 0 <= y && y < H; }
	int to_i()const { return x + y * W; }
	constexpr pair<int, int> to_pair()const { return { x,y }; }
	int dist(const Point& p)const { return std::abs(x - p.x) + std::abs(y - p.y); }
	Point abs(const Point& p)const { return { std::abs(x - p.x),std::abs(y - p.y) }; }
	Point abs()const { return { std::abs(x), std::abs(y) }; }
	Point& swap() { std::swap(x, y); return *this; }
	vector<Point> adjacent4()const {
		vector<Point> v(4); for (int i = 0; i < 4; ++i)v[i] = *this + d[i]; return v;
	}
	vector<Point> adjacent8()const {
		vector<Point> v(8); for (int i = 0; i < 8; ++i)v[i] = *this + d[i]; return v;
	}
	vector<Point> adjacent6()const {
		vector<Point> v(6); for (int i = 0; i < 6; ++i)v[i] = *this + d[i]; return v;
	}
	vector<Point> adj4_in_range()const {
		vector<Point> v; for (const auto& P : adjacent4())if (P.in_range())v.push_back(P); return v;
	}
	vector<Point> adj8_in_range()const {
		vector<Point> v; for (const auto& P : adjacent8())if (P.in_range())v.push_back(P); return v;
	}
	constexpr Point left()const { return { x - 1,y }; }
	constexpr Point right()const { return { x + 1,y }; }
	constexpr Point up()const { return { x,y - 1 }; }
	constexpr Point down()const { return { x,y + 1 }; }
	constexpr Point moved(char c)const { return Point(*this).move(c); }
	constexpr Point& move(char c) {
		switch (c) {
		case 'L':case 'l':case'>':x--; break;
		case 'R':case 'r':case'<':x++; break;
		case 'U':case 'u':case'^':y--; break;
		case 'D':case 'd':case'v':y++; break;
		}
		return *this;
	}
	constexpr Point rotate90() { return { y,-x }; }
	constexpr Point rotate180() { return { -x,-y }; }
	constexpr Point rotate270() { return { -y,x }; }
};
int Point::H, Point::W;
const vector<Point> Point::d{ {0,1},{1,0},{0,-1},{-1,0},{1,1},{-1,-1},{1,-1},{-1,1} };
inline ostream& operator<<(ostream& os, const Point& p) { return  os << '(' << p.x << ", " << p.y << ')'; }
inline istream& operator>>(istream& is, Point& p) { return is >> p.x >> p.y; }

template<class T>class ImosLinear {
	const int N;
	vector<T> X, A, B;
public:
	ImosLinear(int _n) :N(_n), X(_n), A(_n + 1), B(_n + 1) {}
	void add(int l, int r, T a, T b) { // [l, r) += a + (i -　l) * b 
		if (l >= r)return;
		l = max(min(l, N), 0);
		r = max(min(r, N), 0);
		A[l] += a - b * l; B[l] += b;
		A[r] -= a - b * l; B[r] -= b;
	}
	void build() {
		for (int i = 0; i < N; ++i) {
			X[i] = A[i] + B[i] * i;
			A[i + 1] += A[i];
			B[i + 1] += B[i];
		}
	}
	T operator[](int i)const { return X[i]; }
	const vector<T>& operator*()const { return X; }
};

int main() {
	int n = in;
	VVI a = in[{n, n}];
	rep(i, n)rep(j, n)a[i][j]--;

	Point::set_range(n, n);
	vector<vector<Point>> P(n);
	rep(i, n)rep(j, n) {
		P[a[i][j]].emplace_back(j, i);
	}

	ll ans = 0;
	rep(i, n) {
		ImosLinear<ll> imos(n);
		for (const auto& p : P[i]) {
			int l = p.y - p.x, r = p.y + p.x;
			imos.add(0, l, p.x + l, -1);
			imos.add(l, r + 1, p.x, 0);
			imos.add(r + 1, n, p.x + 1, 1);
		}
		imos.build();
		ans += Min(*imos);
	}
	out(ans);
}
yukicoder

結果

テストケース

ソースコード
