#738772 (C++17) No.1838 Modulo Straight

提出ソース

結果

問題	No.1838 Modulo Straight
ユーザー	haruki_K
提出日時	2022-02-12 02:01:57
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	851 ms / 2,000 ms
コード長	7,423 bytes
コンパイル時間	2,613 ms
コンパイル使用メモリ	221,892 KB
実行使用メモリ	75,412 KB
最終ジャッジ日時	2024-06-28 01:22:51
合計ジャッジ時間	18,349 ms
ジャッジサーバーID （参考情報）	judge1 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,944 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	4 ms 6,940 KB
testcase_04	AC	4 ms 6,940 KB
testcase_05	AC	3 ms 6,940 KB
testcase_06	AC	3 ms 6,940 KB
testcase_07	AC	3 ms 6,940 KB
testcase_08	AC	4 ms 6,940 KB
testcase_09	AC	3 ms 6,944 KB
testcase_10	AC	4 ms 6,944 KB
testcase_11	AC	838 ms 75,016 KB
testcase_12	AC	851 ms 75,072 KB
testcase_13	AC	836 ms 75,412 KB
testcase_14	AC	841 ms 75,156 KB
testcase_15	AC	835 ms 75,044 KB
testcase_16	AC	676 ms 43,784 KB
testcase_17	AC	696 ms 43,788 KB
testcase_18	AC	683 ms 43,920 KB
testcase_19	AC	620 ms 33,424 KB
testcase_20	AC	616 ms 33,424 KB
testcase_21	AC	610 ms 33,424 KB
testcase_22	AC	315 ms 48,572 KB
testcase_23	AC	261 ms 41,688 KB
testcase_24	AC	194 ms 27,360 KB
testcase_25	AC	204 ms 27,804 KB
testcase_26	AC	246 ms 28,256 KB
testcase_27	AC	243 ms 24,532 KB
testcase_28	AC	244 ms 22,080 KB
testcase_29	AC	254 ms 23,136 KB
testcase_30	AC	267 ms 22,560 KB
testcase_31	AC	304 ms 22,504 KB
testcase_32	AC	410 ms 21,792 KB
testcase_33	AC	668 ms 43,916 KB
testcase_34	AC	667 ms 43,892 KB
testcase_35	AC	473 ms 28,196 KB
testcase_36	AC	348 ms 22,340 KB
testcase_37	AC	285 ms 22,536 KB
testcase_38	AC	243 ms 22,748 KB
testcase_39	AC	96 ms 25,280 KB
testcase_40	AC	2 ms 6,944 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 pb push_back
#define eb emplace_back
#define fst first
#define snd second
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 ll mod(ll x, ll m) { assert(m > 0); return (x %= m) < 0 ? x+m : x; }
constexpr ll div_floor(ll x, ll y) { assert(y != 0); return x/y - ((x^y) < 0 and x%y); }
constexpr ll div_ceil(ll x, ll 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 V> V &operator--(V &v) { for (auto &x : v) --x; return v; }
template <class V> V &operator++(V &v) { for (auto &x : v) ++x; return v; }
bool next_product(vector<int> &v, int m) {
    repR (i, v.size()) if (++v[i] < m) return true; else v[i] = 0;
    return false;
}
bool next_product(vector<int> &v, vector<int> const& s) {
    repR (i, v.size()) if (++v[i] < s[i]) return true; else v[i] = 0;
    return false;
}
template <class vec> int sort_unique(vec &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
    return v.size();
}
template <class V> auto prefix_sum(V const& a) {
    vector<typename V::value_type> s;
    s.reserve(a.size() + 1);
    s.push_back(0);
    for (auto const& x : a) s.emplace_back(s.back() + x);
    return s;
}
template <class V> auto suffix_sum(V const& a) {
    vector<typename V::value_type> s(a.size() + 1);
    int pos = a.size();
    for (auto it = a.rbegin(); it != a.rend(); ++it, --pos) {
        s[pos-1] = *it + s[pos];
    }
    return s;
}
// <<<
// >>> inversion number
template <class T>
int inversion(vector<T> const& a, vector<T> const& b) {
    assert(a.size() == b.size());
    const int n = a.size();

    map<T, vector<int>> pos;
    for (int i = 0; i < n; ++i) pos[a[i]].push_back(i);

    int cnt = 0;
    vector<int> bit(n+1);
    for (int i = n-1; i >= 0; --i) {
        auto it = pos.find(b[i]);
        assert(it != pos.end());
        auto &v = it->second;
        assert(v.size());
        int idx = v.back();
        v.pop_back();
        for (int j = idx; j > 0; j -= j&-j) cnt += bit[j];
        for (int j = idx+1; j <= n; j += j&-j) bit[j]++;
    }
    return cnt;
}
template <class T>
int inversion(vector<T> const& a) {
    auto b = a;
    sort(b.begin(), b.end());
    return inversion(a, b);
}
// <<<

int32_t main() {
    int m, k; cin >> m >> k;
    vector<int> a(m*k); cin >> a;

    int inv = 0;
    vector<int> id(m*k);
    vector<vector<int>> w(k);
    {
        vector<int> cnt(m);
        rep (i, m*k) {
            id[i] = cnt[a[i]]++;
            w[id[i]].eb(a[i]);
        }
        inv = inversion(id);
    }
    dump(inv, id);
    dump(as_mat(w));

    auto f = [&](vector<int> v) {
        vector<int> pos(m), ans(m);
        rep (i, m) pos[v[i]] = i;

        int inv = inversion(v);
        rep (x, m) {
            ans[x] = inv;
            int L = pos[x];
            int R = m-L-1;
            inv += -L+R;
        }
        dump(v, ans);
        return ans;
    };

    vector<int> cnt(m);
    rep (i, k) {
        auto res = f(w[i]);
        rep (j, m) cnt[j] += res[j];
    }

    cout << *min_element(all(cnt)) + inv << '\n';

}

yukicoder

結果

テストケース

ソースコード