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

提出ソース

結果

問題	No.2627 Unnatural Pitch
ユーザー	noya2
提出日時	2024-02-09 23:51:15
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	1,749 ms / 4,000 ms
コード長	8,082 bytes
コンパイル時間	3,504 ms
コンパイル使用メモリ	263,512 KB
実行使用メモリ	12,672 KB
最終ジャッジ日時	2024-09-28 16:43:12
合計ジャッジ時間	21,876 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,820 KB
testcase_01	AC	2 ms 6,820 KB
testcase_02	AC	694 ms 6,820 KB
testcase_03	AC	2 ms 6,820 KB
testcase_04	AC	1,444 ms 12,544 KB
testcase_05	AC	1,434 ms 12,544 KB
testcase_06	AC	1,569 ms 12,544 KB
testcase_07	AC	38 ms 11,776 KB
testcase_08	AC	45 ms 11,776 KB
testcase_09	AC	1,659 ms 12,672 KB
testcase_10	AC	1,623 ms 12,544 KB
testcase_11	AC	9 ms 6,820 KB
testcase_12	AC	12 ms 6,820 KB
testcase_13	AC	2 ms 6,816 KB
testcase_14	AC	9 ms 6,816 KB
testcase_15	AC	8 ms 6,820 KB
testcase_16	AC	462 ms 11,904 KB
testcase_17	AC	1,510 ms 12,416 KB
testcase_18	AC	229 ms 11,776 KB
testcase_19	AC	876 ms 12,032 KB
testcase_20	AC	244 ms 6,820 KB
testcase_21	AC	1,313 ms 7,296 KB
testcase_22	AC	1,749 ms 10,112 KB
testcase_23	AC	1,182 ms 6,912 KB
testcase_24	AC	317 ms 8,192 KB
testcase_25	AC	1,132 ms 8,320 KB

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

ソースコード

raw source code

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"
namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(vector<T> &v){
    sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"

#line 2 "/Users/noya2/Desktop/Noya2_library/data_structure/fenwick_tree.hpp"

#line 4 "/Users/noya2/Desktop/Noya2_library/data_structure/fenwick_tree.hpp"

namespace noya2{

template <class T> struct fenwick_tree {
  public:
    fenwick_tree() : _n(0) {}
    explicit fenwick_tree(int n_) : _n(n_), data(n_) {}

    void add(int p, T x) {
        assert(0 <= p && p < _n);
        p++;
        while (p <= _n) {
            data[p - 1] += x;
            p += p & -p;
        }
    }

    T sum(int l, int r) {
        assert(0 <= l && l <= r && r <= _n);
        return sum(r) - sum(l);
    }

  private:
    int _n;
    vector<T> data;

    T sum(int r) {
        T s = 0;
        while (r > 0) {
            s += data[r - 1];
            r -= r & -r;
        }
        return s;
    }
};

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/data_structure/csr.hpp"

#line 4 "/Users/noya2/Desktop/Noya2_library/data_structure/csr.hpp"
#include<ranges>
#line 7 "/Users/noya2/Desktop/Noya2_library/data_structure/csr.hpp"

namespace noya2 {

template<class E>
struct csr {
    csr (int n_ = 0, int m_ = -1) : n(n_), m(m_) {
        if (m >= 0){
            es.reserve(m);
            start.reserve(m);
        }
        if (m == 0){
            build();
        }
    }
    int add(int idx, E elem){
        int eid = start.size();
        es.emplace_back(elem);
        start.emplace_back(idx);
        if (eid+1 == m) build();
        return eid;
    }
    void build(){
        if (m == -2) return ;
        m = start.size();
        std::vector<E> nes(m);
        std::vector<int> nstart(n+2,0);
        for (int i = 0; i < m; i++) nstart[start[i]+2]++;
        for (int i = 1; i < n; i++) nstart[i+2] += nstart[i+1];
        for (int i = 0; i < m; i++) nes[nstart[start[i]+1]++] = es[i];
        swap(es,nes);
        swap(start,nstart);
        m = -2;
    }
    const auto operator[](int idx) const {
        assert(m == -2);
        return std::ranges::subrange(es.begin()+start[idx],es.begin()+start[idx+1]);
    }
  private:
    int n, m;
    std::vector<E> es;
    std::vector<int> start;
};

} // namespace noya2
#line 5 "c.cpp"

void solve(){
    ll n, k; in(n,k);
    ll w = [&]{
        ll l, u; in(l,u);
        return u - l;
    }();
    vector<ll> a(n); in(a);
    sort(all(a));
    fenwick_tree<ll> fenl(n), fenr(n), fens(n);
    csr<int> mods(k,n);
    ll wm = w % k;
    rep(i,n){
        mods.add(a[i]%k,i);
        fens.add(i,a[i]/k);
        if (a[i]%k > wm){
            fenr.add(i,1);
        }
    }
    ll ans = linf;
    rep(m,k){
        auto eval = [&](ll x){
            ll L = x*k + m;
            ll R = L + w;
            int il = lower_bound(all(a),L) - a.begin();
            ll lsum = fenl.sum(0,il) + (L/k) * il - fens.sum(0,il);
            int ir = upper_bound(all(a),R) - a.begin();
            ll rsum = fenr.sum(ir,n) + fens.sum(ir,n) - (R/k) * (n-ir);
            ll sum = lsum + rsum;
            return sum;
        };
        ll le = -1e13/k, ri = 1e13/k;
        while (ri - le > 2){
            ll m1 = (le + le + ri) / 3;
            ll m2 = (le + ri + ri) / 3;
            ll v1 = eval(m1);
            ll v2 = eval(m2);
            if (v1 < v2){
                ri = m2;
            }
            else {
                le = m1;
            }
        }
        for (ll x = le; x <= ri; x++){
            chmin(ans,eval(x));
        }
        for (int i : mods[m]){
            fenl.add(i,1);
        }
        ll mp = (m+wm)%k;
        if (mp + 1 == k){
            repp(q,1,k){
                for (int i : mods[q]){
                    fenr.add(i, 1);
                }
            }
        }
        else {
            for (int i : mods[mp+1]){
                fenr.add(i, -1);
            }
        }
    }
    out(ans);
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}

yukicoder

結果

テストケース

ソースコード