#826270 (C++23) No.5010 Better Mo's Algorithm is Needed!! (Unweighted)

提出ソース

結果

問題	No.5010 Better Mo's Algorithm is Needed!! (Unweighted)
ユーザー	hitonanode
提出日時	2022-12-17 00:50:23
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	140 ms / 5,000 ms
コード長	8,735 bytes
コンパイル時間	2,902 ms
実行使用メモリ	8,688 KB
スコア	16,092,298,449
最終ジャッジ日時	2022-12-17 00:51:31
合計ジャッジ時間	60,907 ms
ジャッジサーバーID （参考情報）	judge15 / judge16
	純コード判定しない問題か言語

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	123 ms 8,416 KB
testcase_01	AC	124 ms 8,556 KB
testcase_02	AC	123 ms 8,576 KB
testcase_03	AC	124 ms 8,664 KB
testcase_04	AC	122 ms 8,484 KB
testcase_05	AC	123 ms 8,548 KB
testcase_06	AC	123 ms 8,468 KB
testcase_07	AC	123 ms 8,684 KB
testcase_08	AC	122 ms 8,416 KB
testcase_09	AC	127 ms 8,468 KB
testcase_10	AC	123 ms 8,424 KB
testcase_11	AC	123 ms 8,592 KB
testcase_12	AC	123 ms 8,584 KB
testcase_13	AC	123 ms 8,428 KB
testcase_14	AC	125 ms 8,472 KB
testcase_15	AC	123 ms 8,420 KB
testcase_16	AC	122 ms 8,480 KB
testcase_17	AC	123 ms 8,424 KB
testcase_18	AC	124 ms 8,616 KB
testcase_19	AC	121 ms 8,468 KB
testcase_20	AC	121 ms 8,416 KB
testcase_21	AC	124 ms 8,536 KB
testcase_22	AC	122 ms 8,500 KB
testcase_23	AC	122 ms 8,420 KB
testcase_24	AC	124 ms 8,588 KB
testcase_25	AC	123 ms 8,416 KB
testcase_26	AC	124 ms 8,492 KB
testcase_27	AC	123 ms 8,468 KB
testcase_28	AC	122 ms 8,420 KB
testcase_29	AC	125 ms 8,420 KB
testcase_30	AC	123 ms 8,412 KB
testcase_31	AC	123 ms 8,476 KB
testcase_32	AC	123 ms 8,576 KB
testcase_33	AC	125 ms 8,584 KB
testcase_34	AC	123 ms 8,480 KB
testcase_35	AC	123 ms 8,548 KB
testcase_36	AC	124 ms 8,508 KB
testcase_37	AC	122 ms 8,496 KB
testcase_38	AC	122 ms 8,592 KB
testcase_39	AC	123 ms 8,464 KB
testcase_40	AC	123 ms 8,576 KB
testcase_41	AC	123 ms 8,416 KB
testcase_42	AC	124 ms 8,520 KB
testcase_43	AC	122 ms 8,588 KB
testcase_44	AC	122 ms 8,476 KB
testcase_45	AC	124 ms 8,572 KB
testcase_46	AC	123 ms 8,500 KB
testcase_47	AC	123 ms 8,424 KB
testcase_48	AC	123 ms 8,416 KB
testcase_49	AC	132 ms 8,580 KB
testcase_50	AC	123 ms 8,596 KB
testcase_51	AC	124 ms 8,608 KB
testcase_52	AC	122 ms 8,472 KB
testcase_53	AC	124 ms 8,452 KB
testcase_54	AC	123 ms 8,532 KB
testcase_55	AC	125 ms 8,472 KB
testcase_56	AC	125 ms 8,476 KB
testcase_57	AC	124 ms 8,520 KB
testcase_58	AC	123 ms 8,472 KB
testcase_59	AC	122 ms 8,568 KB
testcase_60	AC	123 ms 8,428 KB
testcase_61	AC	122 ms 8,576 KB
testcase_62	AC	123 ms 8,528 KB
testcase_63	AC	125 ms 8,424 KB
testcase_64	AC	123 ms 8,548 KB
testcase_65	AC	123 ms 8,536 KB
testcase_66	AC	126 ms 8,472 KB
testcase_67	AC	122 ms 8,684 KB
testcase_68	AC	122 ms 8,472 KB
testcase_69	AC	123 ms 8,424 KB
testcase_70	AC	123 ms 8,552 KB
testcase_71	AC	122 ms 8,476 KB
testcase_72	AC	123 ms 8,472 KB
testcase_73	AC	124 ms 8,616 KB
testcase_74	AC	122 ms 8,544 KB
testcase_75	AC	124 ms 8,468 KB
testcase_76	AC	123 ms 8,468 KB
testcase_77	AC	123 ms 8,688 KB
testcase_78	AC	124 ms 8,536 KB
testcase_79	AC	134 ms 8,576 KB
testcase_80	AC	122 ms 8,548 KB
testcase_81	AC	123 ms 8,532 KB
testcase_82	AC	122 ms 8,532 KB
testcase_83	AC	122 ms 8,548 KB
testcase_84	AC	124 ms 8,424 KB
testcase_85	AC	122 ms 8,468 KB
testcase_86	AC	122 ms 8,488 KB
testcase_87	AC	123 ms 8,592 KB
testcase_88	AC	123 ms 8,472 KB
testcase_89	AC	123 ms 8,480 KB
testcase_90	AC	123 ms 8,492 KB
testcase_91	AC	122 ms 8,476 KB
testcase_92	AC	122 ms 8,424 KB
testcase_93	AC	124 ms 8,500 KB
testcase_94	AC	123 ms 8,484 KB
testcase_95	AC	122 ms 8,596 KB
testcase_96	AC	123 ms 8,496 KB
testcase_97	AC	122 ms 8,408 KB
testcase_98	AC	123 ms 8,592 KB
testcase_99	AC	123 ms 8,420 KB
testcase_100	AC	121 ms 8,572 KB
testcase_101	AC	122 ms 8,476 KB
testcase_102	AC	124 ms 8,476 KB
testcase_103	AC	122 ms 8,468 KB
testcase_104	AC	125 ms 8,596 KB
testcase_105	AC	123 ms 8,492 KB
testcase_106	AC	122 ms 8,468 KB
testcase_107	AC	122 ms 8,536 KB
testcase_108	AC	124 ms 8,476 KB
testcase_109	AC	122 ms 8,476 KB
testcase_110	AC	123 ms 8,540 KB
testcase_111	AC	123 ms 8,524 KB
testcase_112	AC	121 ms 8,544 KB
testcase_113	AC	120 ms 8,492 KB
testcase_114	AC	140 ms 8,416 KB
testcase_115	AC	122 ms 8,492 KB
testcase_116	AC	122 ms 8,492 KB
testcase_117	AC	122 ms 8,472 KB
testcase_118	AC	122 ms 8,420 KB
testcase_119	AC	124 ms 8,420 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; }
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


// Mo's algorithm
// - add_range(l, r) : Add [l, r) as query.
// - run(Add, Remove, Query) : run Mo's algorithm.
//   - Add(i) : Add i-th element ([i + 1, r) -> [i, r)).
//   - Remove(i) : Remove i-th element (Inverse of Add(i)).
//   - Query(q) : Solve q-th problem.
// Veirfied: https://codeforces.com/contest/375/submission/114665433
class MosAlgorithm {
    static const int INF = 1 << 30;
    int nmin, nmax;

public:
    struct Point {
        int first, second;
        int qid;
    };
    std::vector<Point> ranges;
    MosAlgorithm() : nmin(INF), nmax(-INF) {}

    void add_range(int l, int r, int q) {
        assert(l <= r);
        nmin = std::min(nmin, l);
        nmax = std::max(nmax, r);
        ranges.push_back(Point{l, r, q});
    }
    std::vector<int> run() {
        const int Q = ranges.size();
        const int nbbucket = std::max(1, std::min<int>(nmax - nmin, sqrt(Q)));
        const int szbucket = (nmax - nmin + nbbucket - 1) / nbbucket;
        std::vector<int> qs(Q);
        std::iota(qs.begin(), qs.end(), 0);
        std::sort(qs.begin(), qs.end(), [&](int q1, int q2) {
            int b1 = (ranges[q1].first - nmin) / szbucket, b2 = (ranges[q2].first - nmin) / szbucket;
            if (b1 != b2)
                return b1 < b2;
            else {
                return (b1 & 1) ? (ranges[q1].second > ranges[q2].second)
                                : (ranges[q1].second < ranges[q2].second);
            }
        });
        return qs;
    }
};



int main() {
    int N, Q, WT, ST;
    cin >> N >> Q >> WT >> ST;
    vector<int> W(N);
    cin >> W;
    vector<pint> xs(Q);
    for (auto &[x, y] : xs) cin >> x >> y;
    dbg(xs);
    MosAlgorithm mo;
    REP(q, Q) mo.add_range(xs.at(q).first, xs.at(q).second, q);
    auto ret = mo.run();
    for (auto q : ret) cout << q + 1 << " ";
    cout << endl;
}

yukicoder

結果

テストケース

ソースコード