#949503 (C++23) No.2627 Unnatural Pitch

提出ソース

結果

問題	No.2627 Unnatural Pitch
ユーザー	hitonanode
提出日時	2024-02-09 22:46:51
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	8,410 bytes
コンパイル時間	2,327 ms
コンパイル使用メモリ	195,112 KB
実行使用メモリ	54,784 KB
最終ジャッジ日時	2024-09-28 15:56:38
合計ジャッジ時間	13,410 ms
ジャッジサーバーID （参考情報）	judge2 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,820 KB
testcase_01	AC	2 ms 6,820 KB
testcase_02	AC	1 ms 6,816 KB
testcase_03	AC	1 ms 6,820 KB
testcase_04	AC	107 ms 6,816 KB
testcase_05	AC	108 ms 6,816 KB
testcase_06	AC	156 ms 6,816 KB
testcase_07	AC	166 ms 6,820 KB
testcase_08	AC	187 ms 6,816 KB
testcase_09	AC	1,613 ms 54,784 KB
testcase_10	AC	1,618 ms 54,784 KB
testcase_11	AC	6 ms 6,816 KB
testcase_12	AC	7 ms 6,816 KB
testcase_13	AC	2 ms 6,816 KB
testcase_14	AC	6 ms 6,820 KB
testcase_15	AC	5 ms 6,820 KB
testcase_16	WA	-
testcase_17	AC	951 ms 22,784 KB
testcase_18	AC	658 ms 8,448 KB
testcase_19	AC	684 ms 17,792 KB
testcase_20	WA	-
testcase_21	AC	645 ms 19,456 KB
testcase_22	AC	1,323 ms 27,136 KB
testcase_23	WA	-
testcase_24	AC	260 ms 10,112 KB
testcase_25	AC	600 ms 17,536 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 <memory>
#include <numeric>
#include <optional>
#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> 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; }
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 << ')'; }
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, K;
    lint L_, U_;
    cin >> N >> K >> L_ >> U_;
    const lint W = U_ - L_;

    vector<lint> A(N);
    cin >> A;
    sort(ALL(A));
    for (auto &x : A) x += K;
    dbg(make_tuple(K, W, A));

    auto eval = [&](lint a, lint x) -> lint {
        const lint y = x + W;
        // [x, y]
        if (a < x) return (x - a + K - 1) / K;
        if (a > y) return (a - y + K - 1) / K;
        return 0;
    };

    int l = N / 2, r = (N + 1) / 2;
    while (l and A.at(r) - A.at(l - 1) <= W) {
        --l;
        ++r;
    }
    dbg(make_tuple(A, N, l, r));

    lint ret = 1LL << 60;

    for (const lint c : {A.at(l), A.at(r - 1) - W, A.at((N - 1) / 2) - W / 2}) {

        const lint lo = c - K * 2, hi = c + K * 2;

        lint current_val = 0;
        map<lint, lint> events;

        for (lint a : A) {
            lint x = lo - 1;
            lint cur = eval(a, x);
            current_val += cur;
            while (true) {
                int tgtmd;
                if (a > x + W) {
                    tgtmd = (a - W) % K;
                } else {
                    tgtmd = (a + 1) % K;
                }
                if (tgtmd < 0) tgtmd += K;

                int curmd = x % K;
                int diff = (tgtmd - curmd + K) % K;
                if (diff == 0) diff = K;
                x += diff;
                if (x > hi) break;
                auto nxt = eval(a, x);
                if (nxt != cur) events[x] += nxt - cur;
                cur = nxt;
            }
        }
        dbg(make_tuple(c, current_val));

        // lint ret = current_val;
        chmin(ret, current_val);
        for (auto [k, v] : events) {
            current_val += v;
            chmin(ret, current_val);
        }
    }
    cout << ret << '\n';


    // cout << ret << '\n';
}

yukicoder

結果

テストケース

ソースコード