#689266 (C++17) No.1649 Manhattan Square

提出ソース

結果

問題	No.1649 Manhattan Square
ユーザー	haruki_K
提出日時	2021-08-13 22:21:08
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	273 ms / 3,000 ms
コード長	11,508 bytes
コンパイル時間	2,982 ms
コンパイル使用メモリ	219,548 KB
実行使用メモリ	13,468 KB
最終ジャッジ日時	2024-04-14 18:33:08
合計ジャッジ時間	14,167 ms
ジャッジサーバーID （参考情報）	judge2 / judge5

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,944 KB
testcase_02	AC	4 ms 6,940 KB
testcase_03	AC	4 ms 6,940 KB
testcase_04	AC	4 ms 6,944 KB
testcase_05	AC	4 ms 6,944 KB
testcase_06	AC	4 ms 6,940 KB
testcase_07	AC	252 ms 13,464 KB
testcase_08	AC	249 ms 13,200 KB
testcase_09	AC	253 ms 13,456 KB
testcase_10	AC	251 ms 13,228 KB
testcase_11	AC	250 ms 13,460 KB
testcase_12	AC	204 ms 10,524 KB
testcase_13	AC	223 ms 12,060 KB
testcase_14	AC	215 ms 11,164 KB
testcase_15	AC	221 ms 11,548 KB
testcase_16	AC	196 ms 10,144 KB
testcase_17	AC	199 ms 10,268 KB
testcase_18	AC	193 ms 10,140 KB
testcase_19	AC	223 ms 11,168 KB
testcase_20	AC	204 ms 10,656 KB
testcase_21	AC	231 ms 12,064 KB
testcase_22	AC	255 ms 13,224 KB
testcase_23	AC	263 ms 13,340 KB
testcase_24	AC	271 ms 13,340 KB
testcase_25	AC	265 ms 13,340 KB
testcase_26	AC	264 ms 13,212 KB
testcase_27	AC	261 ms 13,340 KB
testcase_28	AC	268 ms 13,340 KB
testcase_29	AC	264 ms 13,468 KB
testcase_30	AC	273 ms 13,212 KB
testcase_31	AC	261 ms 13,340 KB
testcase_32	AC	253 ms 13,212 KB
testcase_33	AC	256 ms 13,340 KB
testcase_34	AC	251 ms 13,340 KB
testcase_35	AC	248 ms 13,344 KB
testcase_36	AC	257 ms 13,340 KB
testcase_37	AC	262 ms 13,212 KB
testcase_38	AC	246 ms 13,212 KB
testcase_39	AC	247 ms 13,340 KB
testcase_40	AC	250 ms 13,340 KB
testcase_41	AC	247 ms 13,468 KB
testcase_42	AC	190 ms 13,344 KB
testcase_43	AC	2 ms 6,940 KB
testcase_44	AC	2 ms 6,940 KB

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

ソースコード

raw source code

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define repR(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i, n) for (int i = (int)(n); i >= 1; i--)
#define loop(i, a, B) for (int i = a; i B; i++)
#define loopR(i, a, B) for (int i = a; i B; i--)
#define all(x) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define rng(x, l, r) begin(x) + (l), begin(x) + (r)
#define pb push_back
#define eb emplace_back
#define fst first
#define snd second
template <class A, class B> constexpr auto mp(A &&a, B &&b) { return make_pair(forward<A>(a), forward<B>(b)); }
template <class... T> constexpr auto mt(T&&... x) { return make_tuple(forward<T>(x)...); }
template <class Int> auto constexpr inf_ = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf_<int32_t>;
auto constexpr INF64 = inf_<int64_t>;
auto constexpr INF   = inf_<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T, class Comp> struct pque : priority_queue<T, vector<T>, Comp> { vector<T> &data() { return this->c; } void clear() { this->c.clear(); } };
template <class T> using pque_max = pque<T, less<T>>;
template <class T> using pque_min = pque<T, greater<T>>;
template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0>
ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0>
ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T, S> const& p) { return os << p.first << " " << p.second; }
template <class T, class S> istream& operator>>(istream& is, pair<T, S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint { template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); } };
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T, d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T, d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T, 0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T, d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T, d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > (T)y) { x = (T)y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < (T)y) { x = (T)y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b, e, typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x)-begin(v); }
template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); }
constexpr int64_t mod(int64_t x, int64_t m) { assert(m > 0); return (x %= m) < 0 ? x+m : x; }
constexpr int64_t div_floor(int64_t x, int64_t y) { assert(y != 0); return x/y - ((x^y) < 0 and x%y); }
constexpr int64_t div_ceil(int64_t x, int64_t y) { assert(y != 0); return x/y + ((x^y) > 0 and x%y); }
constexpr int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1 };
constexpr int dy[] = { 0, 1, 0, -1, 1, 1, -1, -1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
mt19937_64 seed_{random_device{}()};
template <class Int> Int rand(Int a, Int b) { return uniform_int_distribution<Int>(a, b)(seed_); }
i64 irand(i64 a, i64 b) { return rand<i64>(a, b); } // [a, b]
u64 urand(u64 a, u64 b) { return rand<u64>(a, b); } //
template <class It> void shuffle(It l, It r) { shuffle(l, r, seed_); }
template <class T> vector<T> &operator--(vector<T> &v) { for (T &x : v) --x; return v; }
template <class T> vector<T> &operator++(vector<T> &v) { for (T &x : v) ++x; return v; }
// <<<
// >>> modint

template <uint32_t md>
class modint {
    static_assert(md < (1u<<31), "");
    using M = modint;
    using i64 = int64_t;
    uint32_t x;
public:
    static constexpr uint32_t mod = md;
    constexpr modint(i64 x = 0) : x((x%=md) < 0 ? x+md : x) { }
    constexpr i64 val() const { return x; }
    constexpr explicit operator i64() const { return x; }
    constexpr bool operator==(M r) const { return x == r.x; }
    constexpr bool operator!=(M r) const { return x != r.x; }
    constexpr M operator+() const { return *this; }
    constexpr M operator-() const { return M()-*this; }
    constexpr M& operator+=(M r) { x += r.x; x = (x < md ? x : x-md); return *this; }
    constexpr M& operator-=(M r) { x += md-r.x; x = (x < md ? x : x-md); return *this; }
    constexpr M& operator*=(M r) { x = (uint64_t(x)*r.x)%md; return *this; }
    constexpr M& operator/=(M r) { return *this *= r.inv(); }
    constexpr M operator+(M r) const { return M(*this) += r; }
    constexpr M operator-(M r) const { return M(*this) -= r; }
    constexpr M operator*(M r) const { return M(*this) *= r; }
    constexpr M operator/(M r) const { return M(*this) /= r; }
    friend constexpr M operator+(i64 x, M y) { return M(x)+y; }
    friend constexpr M operator-(i64 x, M y) { return M(x)-y; }
    friend constexpr M operator*(i64 x, M y) { return M(x)*y; }
    friend constexpr M operator/(i64 x, M y) { return M(x)/y; }
    constexpr M inv() const { assert(x > 0); return pow(md-2); }
    constexpr M pow(i64 n) const {
        assert(not (x == 0 and n == 0));
        if (n < 0) return inv().pow(-n);
        M v = *this, r = 1;
        for (; n > 0; n >>= 1, v *= v) if (n&1) r *= v;
        return r;
    }
#ifdef LOCAL
    friend string to_s(M r) { return to_s(r.val(), mod); }
#endif
    friend ostream& operator<<(ostream& os, M r) { return os << r.val(); }
    friend istream& operator>>(istream& is, M &r) { i64 x; is >> x; r = x; return is; }
};

// <<<
constexpr int64_t MOD = 998244353;
//constexpr int64_t MOD = 1e9+7;
using mint = modint<MOD>;
mint sign(int n) { return n & 1 ? -1 : +1; }
// >>> mod table

template <class mint> struct ModTable {
    vector<mint> fact, finv;
    void calc(int n) {
        int old = fact.size();
        if (n < old) return;
        n += 1000;
        fact.resize(n+1);
        finv.resize(n+1);
        if (old == 0) {
            fact[0] = fact[1] = finv[0] = finv[1] = 1;
            old = 2;
        }
        for (auto i = old; i <= n; i++) fact[i] = fact[i-1] * i;
        finv[n] = mint(1) / fact[n];
        for (auto i = n-1; i >= old; i--) finv[i] = finv[i+1] * (i+1);
    }
};
ModTable<mint> mod_tab;

mint fact(int n) {
    assert(0 <= n);
    return mod_tab.calc(n), mod_tab.fact[n];
}
mint finv(int n) {
    assert(0 <= n);
    return mod_tab.calc(n), mod_tab.finv[n];
}
mint comb(int n, int k) {
    if (n < 0 || k < 0 || n < k) return 0;
    mod_tab.calc(n);
    return mod_tab.fact[n] * mod_tab.finv[k] * mod_tab.finv[n-k];
}
mint perm(int n, int k) {
    assert(k >= 0); assert(n >= k);
    mod_tab.calc(n);
    return mod_tab.fact[n] * mod_tab.finv[n-k];
}

// <<<
// >>> BIT

template <class Abel> struct BIT {
    using Value = typename Abel::Value;
    static Value unit() { return Abel::unit(); }
    static Value plus(Value const& x, Value const& y) { return Abel::op(x, y); }
    static Value minus(Value const& x, Value const& y) { return plus(x, Abel::inv(y)); }

    int n;
    vector<Value> v; // use v[1..n]
    BIT(int n = 0) : n(n), v(n+1) {}
    int size() const { return n; }
    Value operator[](int i) const { return get(i); }
    Value get(int i) const { return sum(i, i+1); }
    void set(int i, Value x) { add(i, minus(x, get(i))); }
    void add(int i, Value x) {
        assert(0 <= i); assert(i < n);
        for (i++; i <= n; i += i&(-i)) v[i] = plus(v[i], x);
    }
    Value sum(int r) const { // [0, r)
        assert(0 <= r); assert(r <= n);
        auto s = unit();
        for (int i = r; i > 0; i -= i&(-i)) s = plus(s, v[i]);
        return s;
    }
    Value sum(int l, int r) const { // [l, r)
        return minus(sum(r), sum(l));
    }
};

// <<<
template <class T> struct Sum {
    using Value = T;
    static constexpr Value unit() { return 0; }
    static constexpr Value op(Value x, Value y) { return x + y; }
    static constexpr Value inv(Value x) { return -x; }
};
// >>> coordinate compression

template <class T> struct Compress {
    vector<T> v;
    bool ok = 0;
    template <class... Ts> Compress(Ts const&... xs) { add(xs...); init(); }
    void add(T const& x) { ok = 0; v.push_back(x); }
    template <class V> void add(V const& u) { ok = false; copy(all(u), back_inserter(v)); }
    template <class... Ts> void add(Ts const&... xs) { (add(xs), ...); }
    void init() { sort(all(v)); v.erase(unique(all(v)), v.end()); ok = true; }
    int size() const { return v.size(); }
    T operator[](int i) const { assert(ok); return v[i]; }
    int find(T const& x) const { assert(ok); auto it = lower_bound(all(v), x); assert(*it == x); return it-v.begin(); }
    void set(T& x) const { x = find(x); }
    template <class V> void set(V& u) const { for (auto &x : u) x = find(x); }
    template <class... Ts> void set(Ts&... xs) const { (set(xs), ...); }
};

// <<<

int32_t main() {
    int n; cin >> n;
    vector<int> x(n), y(n);
    rep (i, n) cin >> x[i] >> y[i];

    Compress<int> Z(y);
    Z.set(y);

    vector<int> idx(n);
    iota(all(idx), 0);
    sort(all(idx), [&](int i, int j) {
        return pair(x[i], y[i]) < pair(x[j], y[j]);
    });

    BIT<Sum<mint>> cnt(Z.size()), plus_1(Z.size()), plus_2(Z.size());
    BIT<Sum<mint>> minus_1(Z.size()), minus_2(Z.size());

    mint ans = 0;
    for (int j : idx) {
        mint plus = x[j] + Z[y[j]], minus = x[j] - Z[y[j]];
        ans += plus*plus*cnt.sum(0, y[j])
            - 2*plus*plus_1.sum(0, y[j])
            + plus_2.sum(0, y[j]);
        ans += minus*minus*cnt.sum(y[j], Z.size())
            - 2*minus*minus_1.sum(y[j], Z.size())
            + minus_2.sum(y[j], Z.size());

        cnt.add(y[j], 1);
        plus_1.add(y[j], plus);
        plus_2.add(y[j], plus*plus);
        minus_1.add(y[j], minus);
        minus_2.add(y[j], minus*minus);
    }
    cout << ans << '\n';

}

yukicoder

結果

テストケース

ソースコード