結果

問題 No.1028 闇討ち
ユーザー haruki_Kharuki_K
提出日時 2020-04-17 22:26:25
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 178 ms / 2,000 ms
コード長 5,334 bytes
コンパイル時間 1,781 ms
コンパイル使用メモリ 185,080 KB
実行使用メモリ 28,800 KB
最終ジャッジ日時 2024-10-03 13:57:26
合計ジャッジ時間 4,456 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 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 2 ms
5,248 KB
testcase_09 AC 9 ms
5,248 KB
testcase_10 AC 11 ms
5,248 KB
testcase_11 AC 41 ms
9,344 KB
testcase_12 AC 165 ms
27,776 KB
testcase_13 AC 162 ms
27,392 KB
testcase_14 AC 90 ms
19,456 KB
testcase_15 AC 32 ms
8,320 KB
testcase_16 AC 169 ms
28,544 KB
testcase_17 AC 173 ms
28,672 KB
testcase_18 AC 173 ms
28,672 KB
testcase_19 AC 176 ms
28,672 KB
testcase_20 AC 176 ms
28,800 KB
testcase_21 AC 178 ms
28,544 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'int32_t main()':
main.cpp:102:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  102 |         for (auto [x,y] : pos[i]) {
      |                   ^
main.cpp:117:23: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  117 |             for (auto [type,x,y] : v[xx]) {
      |                       ^

ソースコード

diff # 

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
#define int ll
#define double ld
#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) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
auto constexpr INF32 = numeric_limits<int32_t>::max()/2-1;
auto constexpr INF64 = numeric_limits<int64_t>::max()/2-1;
auto constexpr INF   = numeric_limits<int>::max()/2-1;
#ifdef LOCAL
#include "debug.hpp"
#define dump(...) cerr << "[" << setw(3) << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl
#define debug if (1)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
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 > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = 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(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class F> int ppt(C const& v, F f) {
    return partition_point(v.begin(), v.end(), f)-v.begin();
}
// <<<

struct dat {
    int cnt = 0, sumX = 0, sumY = 0;
    void add(int x, int y) {
        ++cnt, sumX += x, sumY += y;
    }
    void del(int x, int y) {
        --cnt, sumX -= x, sumY -= y;
    }
};

int32_t main() {
    int n; cin >> n;
    auto a = make_v<int,2>(n,n); cin >> a;

    vector<vector<pair<int,int>>> pos(n);
    rep (i,n) rep (j,n) pos[--a[i][j]].eb(i,j);

    int sum = 0;
    rep (i,n) {
        dat A,B,C;
        auto output = [&]() {
            dump(A.cnt,A.sumX,A.sumY);
            dump(B.cnt,B.sumX,B.sumY);
            dump(C.cnt,C.sumX,C.sumY);
        };
        vector<vector<tuple<bool,int,int>>> v(n);
        for (auto [x,y] : pos[i]) {
            if (x >= y) A.add(x,y);
            else B.add(x,y);

            int xx = x-y;
            if (0 <= xx && xx < n) v[xx].eb(true,x,y);
            xx = x+y;
            if (0 <= xx && xx < n) v[xx].eb(false,x,y);
        }
        output();
        int mi = INF;
        rep (xx,n) {
            int val = A.sumX-xx*A.cnt + B.sumY + xx*C.cnt-C.sumX;
            dump(i,xx,val);
            chmin(mi,val);
            for (auto [type,x,y] : v[xx]) {
                if (type) {
                    A.del(x,y);
                    B.add(x,y);
                } else {
                    B.del(x,y);
                    C.add(x,y);
                }
            }
            output();
        }
        dump(i,mi);
        say("");
        sum += mi;
    }

    cout << sum << endl;
}
0