結果

問題 No.1028 闇討ち
ユーザー iiljjiiljj
提出日時 2020-04-17 22:00:02
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 127 ms / 2,000 ms
コード長 7,048 bytes
コンパイル時間 2,128 ms
コンパイル使用メモリ 214,304 KB
実行使用メモリ 28,672 KB
最終ジャッジ日時 2024-10-03 12:54:12
合計ジャッジ時間 4,296 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 1 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 2 ms
5,248 KB
testcase_06 AC 2 ms
5,248 KB
testcase_07 AC 1 ms
5,248 KB
testcase_08 AC 2 ms
5,248 KB
testcase_09 AC 6 ms
5,248 KB
testcase_10 AC 8 ms
5,248 KB
testcase_11 AC 28 ms
9,344 KB
testcase_12 AC 116 ms
27,904 KB
testcase_13 AC 113 ms
27,520 KB
testcase_14 AC 63 ms
19,456 KB
testcase_15 AC 22 ms
8,320 KB
testcase_16 AC 121 ms
28,416 KB
testcase_17 AC 123 ms
28,544 KB
testcase_18 AC 123 ms
28,672 KB
testcase_19 AC 121 ms
28,544 KB
testcase_20 AC 124 ms
28,544 KB
testcase_21 AC 127 ms
28,544 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

/* #region Head */

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

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c)                                                                                                        \
    sort(ALL(c));                                                                                                      \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());

#define endl '\n'
#define sqrt sqrtl
#define floor floorl
#define log2 log2l

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
    for (T &x : vec) is >> x;
    return is;
}
template <typename T> ostream &operator<<(ostream &os, vc<T> &vec) { // vector 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T> ostream &operator>>(ostream &os, vc<T> &vec) { // vector 出力 (inline)
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
    return os;
}

template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
    is >> pair_var.first >> pair_var.second;
    return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) { // pair 出力
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, T &map_var) {
    os << "{";
    REPI(itr, map_var) {
        os << *itr;
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    os << "}";
    return os;
}
template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) { return out_iter(os, map_var); }
template <typename T, typename U> ostream &operator<<(ostream &os, um<T, U> &map_var) { return out_iter(os, map_var); }
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, us<T> &set_var) { return out_iter(os, set_var); }

// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
    if (comp(xmax, x)) {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
    if (comp(x, xmin)) {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#define DEBUG_

#ifdef DEBUG_
#define DEB
#define dump(...)                                                                                                      \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                                                                    \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl                                        \
            << "    ",                                                                                                 \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

struct AtCoderInitialize {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;
    AtCoderInitialize() {
        ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
        cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH) cout << unitbuf;
    }
} ATCODER_INITIALIZE;

string yes = "Yes", no = "No";
// string yes = "YES", no = "NO";
void yn(bool p) { cout << (p ? yes : no) << endl; }

/* #endregion */

template <class tFunctor> ll ternarySearchMaxInt(ll left, ll right, tFunctor iFunctor) {
    ll m1, m2, fn1, fn2;
    while (right - left > 2) {
        m1 = (left * 2 + right) / 3;
        m2 = (left + right * 2) / 3;
        fn1 = iFunctor(m1);
        fn2 = iFunctor(m2);
        if (fn1 <= fn2)
            left = m1;
        else // fn1 > fn2
            right = m2;
    }
    ll fnl, fnr;
    fnl = iFunctor(left);
    fnr = iFunctor(right);
    ll argmaxx = left, maxf = fnl;
    if (fnr > fnl) {
        argmaxx = right;
        maxf = fnr;
    }
    if (right - left == 2) {
        m1 = left + 1;
        fn1 = iFunctor(m1);
        if (fn1 > maxf) {
            argmaxx = m1;
        }
    }
    return argmaxx;
}

template <class tFunctor> ll ternarySearchMinInt(ll left, ll right, tFunctor iFunctor) {
    return ternarySearchMaxInt(left, right, [&iFunctor](ll x) { return -iFunctor(x); });
}

// Problem
void solve() {
    ll n;
    cin >> n;

    vvll a(n, vll(n));
    cin >> a;
    REP(i, 0, n) REP(j, 0, n) a[i][j]--;

    // 各 k について，チェビシェフ距離の総和が最小になる i がわかればよい
    vc<vc<pll>> coords(n, vc<pll>());
    REP(i, 0, n) REP(j, 0, n) {
        ll k = a[i][j];
        coords[k].emplace_back(i, j);
    }

    vll rownum(n);
    REP(i, 0, n) {
        rownum[i] = ternarySearchMinInt(0, n - 1, [&](ll mid) {
            ll distsum = 0;
            REP(j, 0, n) {
                auto [y, x] = coords[i][j];
                distsum += max(abs(y - mid), x);
            }
            return distsum;
        });
    }

    ll dist = 0;
    REP(i, 0, n) REP(j, 0, n) {
        auto [y, x] = coords[i][j];
        dist += max(abs(y - rownum[i]), x);
    }
    cout << dist << endl;
}

// entry point
int main() {
    solve();
    return 0;
}
0