#812120 (C++23) No.2114 01 Matching

提出ソース

結果

問題	No.2114 01 Matching
ユーザー	hitonanode
提出日時	2022-10-28 22:31:38
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	RE
実行時間	-
コード長	8,938 bytes
コンパイル時間	2,582 ms
コンパイル使用メモリ	201,920 KB
実行使用メモリ	48,512 KB
最終ジャッジ日時	2024-07-06 01:43:44
合計ジャッジ時間	19,400 ms
ジャッジサーバーID （参考情報）	judge2 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	1 ms 6,816 KB
testcase_02	AC	349 ms 25,008 KB
testcase_03	AC	66 ms 13,056 KB
testcase_04	AC	87 ms 16,640 KB
testcase_05	RE	-
testcase_06	AC	305 ms 19,436 KB
testcase_07	RE	-
testcase_08	WA	-
testcase_09	RE	-
testcase_10	AC	287 ms 16,428 KB
testcase_11	AC	451 ms 48,512 KB
testcase_12	AC	477 ms 48,512 KB
testcase_13	WA	-
testcase_14	AC	240 ms 29,660 KB
testcase_15	AC	235 ms 29,864 KB
testcase_16	WA	-
testcase_17	AC	329 ms 19,476 KB
testcase_18	WA	-
testcase_19	WA	-
testcase_20	AC	462 ms 48,512 KB
testcase_21	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	WA	-
testcase_26	AC	458 ms 48,512 KB
testcase_27	AC	450 ms 48,512 KB
testcase_28	AC	204 ms 28,288 KB
testcase_29	AC	472 ms 48,512 KB
testcase_30	RE	-
testcase_31	AC	470 ms 48,384 KB
testcase_32	RE	-
testcase_33	AC	334 ms 25,056 KB
testcase_34	AC	185 ms 13,468 KB
testcase_35	AC	131 ms 21,632 KB
testcase_36	AC	459 ms 48,512 KB
testcase_37	RE	-
testcase_38	RE	-
testcase_39	WA	-
testcase_40	AC	145 ms 21,120 KB
testcase_41	RE	-
testcase_42	WA	-
testcase_43	AC	304 ms 19,440 KB
testcase_44	WA	-
testcase_45	AC	219 ms 48,384 KB
testcase_46	WA	-
testcase_47	AC	476 ms 48,384 KB
testcase_48	AC	468 ms 48,512 KB
testcase_49	WA	-
testcase_50	RE	-
testcase_51	AC	357 ms 25,052 KB
testcase_52	AC	238 ms 29,664 KB

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

ソースコード

raw source code

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
#endif
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif


int main() {
    int N, M, K;
    cin >> N >> M >> K;
    vector<int> A(N), B(M);
    cin >> A >> B;

    map<int, vector<pint>> mp;
    REP(i, N) {
        mp[A.at(i) % K].emplace_back(A.at(i) / K, 0);
    }
    REP(j, M) {
        mp[B.at(j) % K].emplace_back(B.at(j) / K, 1);
    }

    lint ret = 0;
    int nmatch = 0;
    for (auto [key, vs] : mp) {
        sort(ALL(vs));
        dbg(vs);
        int n0 = 0, n1 = 0;
        for (auto [x, t] : vs) {
            (t ? n1 : n0)++;
        }
        nmatch += min(n0, n1);

        multiset<pint> se(vs.begin(), vs.end());
        multiset<pair<int, pint>> diff;

        auto check_is_head = [&](pint p) -> bool {
            const auto itr = se.lower_bound(p);
            if (itr == se.end() or *itr != p or itr == se.begin()) return false;
            return prev(itr)->second != p.second;
        };

        auto erase_diff = [&](pint x) -> void {
            auto itr = se.lower_bound(x);
            if (itr == se.end() or *itr != x or itr == se.begin()) return;

            auto p = *prev(itr);
            if (p.second == x.second) return;

            int dx = x.first - p.first;
            diff.erase(make_pair(dx, x));
        };

        FOR(i, 1, vs.size()) {
            if (check_is_head(vs.at(i))) diff.emplace(vs.at(i).first - vs.at(i - 1).first, vs.at(i));
        }

        REP(_, min(n0, n1)) {
            const pint p = diff.begin()->second;
            const pint q = *prev(se.lower_bound(p));

            ret += p.first - q.first;

            if (check_is_head(q)) erase_diff(q);
            erase_diff(p);
            se.erase(se.lower_bound(p));
            se.erase(se.lower_bound(q));

            auto itr = se.lower_bound(p);
            if (itr != se.begin() and itr != se.end()) {
                auto r = *itr;
                auto l = *prev(itr);
                if (r.second != l.second) diff.emplace(r.first - l.first, r);
            }
        }
    }

    if (nmatch < min(N, M)) ret = -1;

    cout << ret << endl;
}

yukicoder

結果

テストケース

ソースコード