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

提出ソース

結果

問題	No.960 マンハッタン距離3
ユーザー	Pachicobue
提出日時	2019-12-23 15:42:08
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	RE
実行時間	-
コード長	8,149 bytes
コンパイル時間	3,085 ms
コンパイル使用メモリ	215,192 KB
実行使用メモリ	10,348 KB
最終ジャッジ日時	2023-10-17 12:38:23
合計ジャッジ時間	32,285 ms
ジャッジサーバーID （参考情報）	judge13 / judge11

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

テストケース

テストケース表示

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

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

ソースコード

raw source code

#include <bits/stdc++.h>
// created [2019/12/23] 12:51:08
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"

using i32   = int32_t;
using i64   = int64_t;
using u32   = uint32_t;
using u64   = uint64_t;
using uint  = unsigned int;
using usize = std::size_t;
using ll    = long long;
using ull   = unsigned long long;
using ld    = long double;
template<typename T, usize n>
using arr = T (&)[n];
template<typename T, usize n>
using c_arr = const T (&)[n];
template<typename T> constexpr T popcount(const T u) { return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T log2p1(const T u) { return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T msbp1(const T u) { return log2p1(u); }
template<typename T> constexpr T lsbp1(const T u) { return __builtin_ffsll(u); }
template<typename T> constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast<T>(u); }
template<typename T> constexpr bool ispow2(const T u) { return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0; }
template<typename T> constexpr T ceil2(const T u) { return static_cast<T>(1) << clog(u); }
template<typename T> constexpr T floor2(const T u) { return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1); }
template<typename T> constexpr bool btest(const T mask, const usize ind) { return static_cast<bool>((static_cast<u64>(mask) >> ind) & static_cast<u64>(1)); }
template<typename T> void bset(T& mask, const usize ind) { mask |= (static_cast<T>(1) << ind); }
template<typename T> void breset(T& mask, const usize ind) { mask &= ~(static_cast<T>(1) << ind); }
template<typename T> void bflip(T& mask, const usize ind) { mask ^= (static_cast<T>(1) << ind); }
template<typename T> void bset(T& mask, const usize ind, const bool b) { (b ? bset(mask, ind) : breset(mask, ind)); }
template<typename T> constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast<T>(0) : static_cast<T>((static_cast<u64>(mask) << (64 - ind)) >> (64 - ind)); }
template<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }
template<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }
constexpr unsigned int mod                  = 1000000007;
template<typename T> constexpr T inf_v      = std::numeric_limits<T>::max() / 4;
template<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};
auto mfp = [](auto&& f) { return [=](auto&&... args) { return f(f, std::forward<decltype(args)>(args)...); }; };

template<typename T>
T in()
{
    T v;
    return std::cin >> v, v;
}
template<typename T, typename Uint, usize n, usize i>
T in_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type) { return in<T>(); }
template<typename T, typename Uint, usize n, usize i>
auto in_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type& szs)
{
    const usize s = (usize)szs[i];
    std::vector<decltype(in_v<T, Uint, n, i + 1>(szs))> ans(s);
    for (usize j = 0; j < s; j++) { ans[j] = in_v<T, Uint, n, i + 1>(szs); }
    return ans;
}
template<typename T, typename Uint, usize n>
auto in_v(c_arr<Uint, n> szs) { return in_v<T, Uint, n, 0>(szs); }
template<typename... Types>
auto in_t() { return std::tuple<std::decay_t<Types>...>{in<Types>()...}; }
struct io_init
{
    io_init()
    {
        std::cin.tie(nullptr), std::ios::sync_with_stdio(false);
        std::cout << std::fixed << std::setprecision(20);
    }
    void clear()
    {
        std::cin.tie(), std::ios::sync_with_stdio(true);
    }
} io_setting;

template<typename T>
int out(const T& v) { return std::cout << v, 0; }
template<typename T>
int out(const std::vector<T>& v)
{
    for (usize i = 0; i < v.size(); i++) {
        if (i > 0) { std::cout << ' '; }
        out(v[i]);
    }
    return std::cout << "\n", 0;
}
template<typename T1, typename T2>
int out(const std::pair<T1, T2>& v) { return out(v.first), std::cout << ' ', out(v.second), 0; }
template<typename T, typename... Args>
int out(const T& v, const Args... args) { return out(v), std::cout << ' ', out(args...), 0; }
template<typename... Args>
int outln(const Args... args) { return out(args...), std::cout << '\n', 0; }
template<typename... Args>
void outel(const Args... args) { return out(args...), std::cout << std::endl, 0; }
#    define SHOW(...) static_cast<void>(0)
constexpr ull TEN(const usize n) { return n == 0 ? 1ULL : TEN(n - 1) * 10ULL; }

template<typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type, const T& v = T{}) { return v; }
template<typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type szs, const T& v = T{})
{
    const usize s = (usize)szs[i];
    return std::vector<decltype(make_v<T, Uint, n, i + 1>(szs, v))>(s, make_v<T, Uint, n, i + 1>(szs, v));
}
template<typename T, typename Uint, usize n>
auto make_v(c_arr<Uint, n> szs, const T& t = T{}) { return make_v<T, Uint, n, 0>(szs, t); }
int main()
{
    using pll    = std::pair<ll, ll>;
    const auto W = in<ll>(), H = in<ll>();
    auto enc     = [&](ll x, ll y) -> pll { return pll{x + y, y - x}; };
    auto dec     = [&](ll x, ll y) -> pll { return std::abs(x + y) % 2 == 1 ? pll{-1, -1} : pll{(x - y) / 2, (x + y) / 2}; };
    auto L1      = [&](ll x1, ll y1, ll x2, ll y2) { return std::abs(x1 - x2) + std::abs(y1 - y2); };
    auto Linf    = [&](ll x1, ll y1, ll x2, ll y2) { return std::max(std::abs(x1 - x2), std::abs(y1 - y2)); };
    auto is_in   = [&](ll x, ll y) { return 1 <= y and y <= H and 1 <= x and x <= W; };
    const auto N = in<int>();
    std::vector<ll> rxs(N), rys(N);
    for (int i = 0; i < N; i++) { rxs[i] = in<ll>(), rys[i] = in<ll>(); }
    std::vector<ll> xs(N), ys(N);
    for (int i = 0; i < N; i++) { std::tie(xs[i], ys[i]) = enc(rxs[i], rys[i]); }
    auto is_ok = [&](ll x, ll y) {
        std::set<ll> ds;
        for (int i = 0; i < N; i++) { ds.insert(L1(xs[i], ys[i], x, y)); }
        return ds.size() == 1;
    };
    std::vector<std::vector<int>> outer(4);
    const ll ym = *std::min_element(ys.begin(), ys.end());
    const ll xm = *std::min_element(xs.begin(), xs.end());
    const ll yM = *std::max_element(ys.begin(), ys.end());
    const ll xM = *std::max_element(xs.begin(), xs.end());

    if (xm == xM) {
        ll p1 = xm * 2 + (yM - ym), q1 = ym + yM;
        ll p2 = xm * 2 - (yM - ym), q2 = ym + yM;
        if (p1 % 2 == 1 or q1 % 2 == 1) { return outln(0); }
        p1 /= 2, q1 /= 2;
        p2 /= 2, q2 /= 2;
        if (not is_ok(p1, q1) or not is_ok(p2, q2)) { return outln(0); }
        ll ans = (W - p1 + 1) * (H - q1 + 1) + p2 * q2;
        if (N == 2) { ans += (p1 - p2 - 1); }
        return outln(ans);
    }
    if (ym == yM) {
        ll p1 = xm + xM, q1 = ym * 2 - (yM - ym);
        ll p2 = xm + xM, q2 = ym * 2 + (yM - ym);
        if (p1 % 2 == 1 or q1 % 2 == 1) { return outln(0); }
        p1 /= 2, q1 /= 2;
        p2 /= 2, q2 /= 2;
        if (not is_ok(p1, q1) or not is_ok(p2, q2)) { return outln(0); }
        ll ans = (W - p1 + 1) * q1 + p2 * (H - q1 + 1);
        if (N == 2) { ans += (p1 - p2 - 1); }
        return outln(ans);
    }
    if (xM - xm == yM - ym) {
        ll p = xm + xM, q = ym + yM;
        if (p % 2 == 1 or q % 2 == 1) { return outln(0); }
        p /= 2, q /= 2;
        std::tie(p, q) = dec(p, q);
        if (not is_in(p, q) or not is_ok(p, q)) { return outln(0); }
        ll ans            = 1;
        constexpr ll dx[] = {-1, -1, -1, 0, 0, 1, 1, 1};
        constexpr ll dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};
        for (int i = 0; i < 8; i++) {
            ll inf = 0, sup = H + W;
            while (sup - inf > 1) {
                const ll mid = (inf + sup) / 2;
                const ll np = p + mid * dx[i], nq = q + mid * dy[i];
                (is_in(np, nq) ? inf : sup) = mid;
            }
            ans += inf;
        }
        return outln(ans);
    }
    // まだまだやる
    assert(false);
    return 0;
}

yukicoder

結果

テストケース

ソースコード