結果

問題 No.1597 Matrix Sort
ユーザー scol_kpscol_kp
提出日時 2021-07-09 23:20:41
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 353 ms / 1,500 ms
コード長 3,802 bytes
コンパイル時間 2,070 ms
コンパイル使用メモリ 201,580 KB
実行使用メモリ 316,472 KB
最終ジャッジ日時 2023-09-14 10:48:46
合計ジャッジ時間 7,973 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 284 ms
316,288 KB
testcase_04 AC 334 ms
316,440 KB
testcase_05 AC 353 ms
316,152 KB
testcase_06 AC 269 ms
316,344 KB
testcase_07 AC 248 ms
316,404 KB
testcase_08 AC 215 ms
316,256 KB
testcase_09 AC 224 ms
316,336 KB
testcase_10 AC 162 ms
316,200 KB
testcase_11 AC 167 ms
316,164 KB
testcase_12 AC 20 ms
4,380 KB
testcase_13 AC 59 ms
35,172 KB
testcase_14 AC 203 ms
316,360 KB
testcase_15 AC 20 ms
4,380 KB
testcase_16 AC 38 ms
35,016 KB
testcase_17 AC 150 ms
316,260 KB
testcase_18 AC 190 ms
316,368 KB
testcase_19 AC 183 ms
316,172 KB
testcase_20 AC 145 ms
316,264 KB
testcase_21 AC 137 ms
316,420 KB
testcase_22 AC 135 ms
316,472 KB
testcase_23 AC 133 ms
316,156 KB
testcase_24 AC 15 ms
4,380 KB
testcase_25 AC 13 ms
4,376 KB
testcase_26 AC 2 ms
4,376 KB
testcase_27 AC 1 ms
4,376 KB
testcase_28 AC 2 ms
4,376 KB
testcase_29 AC 112 ms
315,480 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

using ll = long long;
using Vi = std::vector<int>;
using Vl = std::vector<ll>;
using Pii = std::pair<int, int>;
using Pll = std::pair<ll, ll>;

constexpr int I_INF = std::numeric_limits<int>::max();
constexpr ll L_INF = std::numeric_limits<ll>::max();

template <typename T1, typename T2>
inline bool chmin(T1& a, const T2& b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <typename T1, typename T2>
inline bool chmax(T1& a, const T2& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <std::ostream& os = std::cout>
class Prints {
private:
    class __Prints {
    public:
        __Prints(const char* sep, const char* term) : sep(sep), term(term) {}
        template <class... Args>
#if __cplusplus >= 201703L
        auto operator()(const Args&... args) const -> decltype((os << ... << std::declval<Args>()), void()) {
#else
        void operator()(const Args&... args) const {
#endif
            print(args...);
        }
        template <typename T>
#if __cplusplus >= 201703L
        auto pvec(const T& vec, size_t sz) const -> decltype(os << std::declval<decltype(std::declval<T>()[0])>(), void()) {
#else
        void pvec(const T& vec, size_t sz) const {
#endif
            for (size_t i = 0; i < sz; i++)
                os << vec[i] << (i == sz - 1 ? term : sep);
        }
        template <typename T>
#if __cplusplus >= 201703L
        auto pmat(const T& mat, size_t h, size_t w) const -> decltype(os << std::declval<decltype(std::declval<T>()[0][0])>(), void()) {
#else
        void pmat(const T& mat, size_t h, size_t w) const {
#endif
            for (size_t i = 0; i < h; i++)
                for (size_t j = 0; j < w; j++)
                    os << mat[i][j] << (j == w - 1 ? term : sep);
        }

    private:
        const char *sep, *term;
        void print() const { os << term; }
        void print_rest() const { os << term; }
        template <class T, class... Tail>
        void print(const T& head, const Tail&... tail) const { os << head, print_rest(tail...); }
        template <class T, class... Tail>
        void print_rest(const T& head, const Tail&... tail) const { os << sep << head, print_rest(tail...); }
    };

public:
    Prints() {}
    __Prints operator()(const char* sep = " ", const char* term = "\n") const { return __Prints(sep, term); }
};

Prints<> prints;
Prints<std::cerr> prints_err;

//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

void solve() {
    ll N, P, K;
    cin >> N >> K >> P;
    Vl A(N);
    for (ll i = 0; i < N; i++) {
        cin >> A[i];
    }
    Vl cntB(P * 2);
    for (ll i = 0; i < N; i++) {
        ll b;
        cin >> b;
        ++cntB[b];
        ++cntB[b + P];
    }
    Vl cumB(P * 2 + 1);
    for (ll i = 0; i < P * 2; i++) {
        cumB[i + 1] = cumB[i] + cntB[i];
    }
    ll left = -1, right = P;
    while (right - left > 1) {
        ll mid = (left + right) >> 1;
        ll t = 0;
        for (ll i = 0; i < N; i++) {
            t += cumB[mid + P - A[i] + 1] - cumB[P - A[i]];
        }
        if (t >= K) {
            right = mid;
        } else {
            left = mid;
        }
    }
    prints()(right);
}

//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

int main() {
#ifdef FASTIO
    std::cin.tie(nullptr), std::cout.tie(nullptr);
    std::ios::sync_with_stdio(false);
#endif
#ifdef FILEINPUT
    std::ifstream ifs("./in_out/input.txt");
    std::cin.rdbuf(ifs.rdbuf());
#endif
#ifdef FILEOUTPUT
    std::ofstream ofs("./in_out/output.txt");
    std::cout.rdbuf(ofs.rdbuf());
#endif
    std::cout << std::setprecision(18) << std::fixed;
    solve();
    std::cout << std::flush;
    return 0;
}
0