結果

問題 No.1270 Range Arrange Query
ユーザー 👑 hitonanodehitonanode
提出日時 2020-10-23 23:02:27
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 1,393 ms / 7,000 ms
コード長 5,722 bytes
コンパイル時間 2,224 ms
コンパイル使用メモリ 205,212 KB
実行使用メモリ 4,380 KB
最終ジャッジ日時 2023-09-28 17:34:12
合計ジャッジ時間 13,952 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 2 ms
4,380 KB
testcase_04 AC 2 ms
4,380 KB
testcase_05 AC 1 ms
4,376 KB
testcase_06 AC 37 ms
4,380 KB
testcase_07 AC 635 ms
4,376 KB
testcase_08 AC 62 ms
4,380 KB
testcase_09 AC 383 ms
4,380 KB
testcase_10 AC 463 ms
4,376 KB
testcase_11 AC 1,361 ms
4,380 KB
testcase_12 AC 1,355 ms
4,380 KB
testcase_13 AC 1,364 ms
4,380 KB
testcase_14 AC 1,103 ms
4,376 KB
testcase_15 AC 1,393 ms
4,376 KB
testcase_16 AC 1,254 ms
4,380 KB
testcase_17 AC 1,299 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
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) { if (m < q) {m = q; return true;} else return false; }
template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> srtunq(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl
#else
#define dbg(x) {}
#endif

// 1-indexed BIT (i : [1, len])
template <typename T>
struct BIT : std::vector<T>
{
    BIT(int len = 0) : std::vector<T>(len + 1) {}
    void reset() { fill(this->begin(), this->end(), 0); }
    void add(int pos, T v) {
        while (pos > 0 and pos < (int)this->size()) (*this)[pos] += v, pos += pos & -pos;
    }
    T sum(int pos) const { // (0, pos]
        T res = 0;
        while (pos > 0) res += (*this)[pos], pos -= pos & -pos;
        return res;
    }
    friend std::ostream &operator<<(std::ostream &os, const BIT &bit) {
        T prv = 0;
        os << '[';
        for (int i = 1; i < (int)bit.size(); i++) {
            T now = bit.sum(i);
            os << now - prv << ",";
            prv = now;
        }
        os << ']';
        return os;
    }
};

int main()
{
    int N, Q;
    cin >> N >> Q;
    vector<int> A(N);
    cin >> A;

    vector<lint> tl(N), tr(N);
    {
        BIT<lint> bit(N);
        lint t = 0;
        REP(i, N) {
            t += bit.sum(N) - bit.sum(A[i]);
            tl[i] = t;
            bit.add(A[i], 1);
        }
    }
    {
        BIT<lint> bit(N);
        lint t = 0;
        IREP(i, N) {
            t += bit.sum(A[i] - 1);
            tr[i] = t;
            bit.add(A[i], 1);
        }
    }
    dbg(tl);
    dbg(tr);

    vector<int> cntl(N + 3);
    vector<int> cntr(N + 3);

    while (Q--) {
        int l, r;
        cin >> l >> r;
        l--;
        // [l, r)

        lint ret = 0;
        if (l) ret += tl[l - 1];
        if (r < N) ret += tr[r];
        fill(cntl.begin(), cntl.end(), 0);
        fill(cntr.begin(), cntr.end(), 0);
        REP(i, l) cntl[A[i]]++;
        FOR(i, r, N) cntr[A[i]]++;
        REP(i, N + 2) cntr[i + 1] += cntr[i];
        REP(i, N + 1) {
            ret += 1LL * cntl[i + 1] * cntr[i];
        }
        IREP(i, N + 2) cntl[i] += cntl[i + 1];
        dbg(ret);
        dbg(cntl);
        dbg(cntr);
        lint cadd = 1e18;
        REP(i, N + 2) chmin(cadd, (cntr[i] + cntl[i + 2]) * lint(r - l));
        dbg(cadd);
        cout << ret + cadd << '\n';
    }
}
0