#994205 (C++23) No.2809 Sort Query

提出ソース

結果

問題	No.2809 Sort Query
ユーザー	hitonanode
提出日時	2024-07-12 21:53:41
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	1,226 ms / 2,000 ms
コード長	8,272 bytes
コンパイル時間	3,840 ms
コンパイル使用メモリ	228,436 KB
実行使用メモリ	47,232 KB
最終ジャッジ日時	2024-07-12 21:55:05
合計ジャッジ時間	79,540 ms
ジャッジサーバーID （参考情報）	judge1 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,812 KB
testcase_01	AC	1,009 ms 47,232 KB
testcase_02	AC	1,012 ms 47,232 KB
testcase_03	AC	992 ms 47,232 KB
testcase_04	AC	1,008 ms 47,104 KB
testcase_05	AC	1,002 ms 47,104 KB
testcase_06	AC	981 ms 47,192 KB
testcase_07	AC	946 ms 47,232 KB
testcase_08	AC	968 ms 47,104 KB
testcase_09	AC	930 ms 47,104 KB
testcase_10	AC	965 ms 47,104 KB
testcase_11	AC	1,128 ms 47,164 KB
testcase_12	AC	1,113 ms 47,104 KB
testcase_13	AC	1,136 ms 47,104 KB
testcase_14	AC	1,129 ms 47,232 KB
testcase_15	AC	1,098 ms 47,232 KB
testcase_16	AC	1,131 ms 47,232 KB
testcase_17	AC	1,094 ms 47,232 KB
testcase_18	AC	1,119 ms 47,232 KB
testcase_19	AC	1,107 ms 47,232 KB
testcase_20	AC	1,148 ms 47,232 KB
testcase_21	AC	1,188 ms 47,080 KB
testcase_22	AC	1,183 ms 47,232 KB
testcase_23	AC	1,208 ms 47,084 KB
testcase_24	AC	1,226 ms 47,232 KB
testcase_25	AC	1,205 ms 47,104 KB
testcase_26	AC	1,197 ms 47,104 KB
testcase_27	AC	1,196 ms 47,232 KB
testcase_28	AC	1,218 ms 47,104 KB
testcase_29	AC	1,217 ms 47,104 KB
testcase_30	AC	1,203 ms 47,232 KB
testcase_31	AC	1,145 ms 47,104 KB
testcase_32	AC	1,100 ms 47,232 KB
testcase_33	AC	1,112 ms 47,204 KB
testcase_34	AC	1,114 ms 47,208 KB
testcase_35	AC	1,098 ms 47,232 KB
testcase_36	AC	1,086 ms 47,232 KB
testcase_37	AC	1,049 ms 47,104 KB
testcase_38	AC	1,075 ms 47,104 KB
testcase_39	AC	1,048 ms 47,104 KB
testcase_40	AC	1,098 ms 47,232 KB
testcase_41	AC	999 ms 47,232 KB
testcase_42	AC	971 ms 47,104 KB
testcase_43	AC	1,024 ms 47,232 KB
testcase_44	AC	969 ms 47,104 KB
testcase_45	AC	1,014 ms 47,232 KB
testcase_46	AC	888 ms 47,232 KB
testcase_47	AC	913 ms 47,232 KB
testcase_48	AC	889 ms 47,232 KB
testcase_49	AC	918 ms 47,104 KB
testcase_50	AC	899 ms 47,196 KB
testcase_51	AC	873 ms 43,008 KB
testcase_52	AC	752 ms 43,008 KB
testcase_53	AC	783 ms 43,136 KB
testcase_54	AC	793 ms 43,136 KB
testcase_55	AC	753 ms 43,080 KB
testcase_56	AC	623 ms 27,904 KB
testcase_57	AC	449 ms 20,736 KB
testcase_58	AC	481 ms 24,192 KB
testcase_59	AC	437 ms 17,792 KB
testcase_60	AC	686 ms 38,016 KB
testcase_61	AC	887 ms 46,592 KB
testcase_62	AC	471 ms 22,784 KB
testcase_63	AC	676 ms 29,952 KB
testcase_64	AC	1,003 ms 45,968 KB
testcase_65	AC	539 ms 32,256 KB
testcase_66	AC	2 ms 6,940 KB
testcase_67	AC	2 ms 6,944 KB
testcase_68	AC	2 ms 6,940 KB
testcase_69	AC	2 ms 6,940 KB
testcase_70	AC	2 ms 6,944 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

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds; // find_by_order(), order_of_key()
template <typename TK>
using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename TK, typename TV>
using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;



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

    pbds_set<pair<lint, int>> se;
    REP(i, N) se.insert({i, i});
    int head = N;

    map<int, lint> mp;
    REP(i, N) mp[i] = A.at(i);

    // 基本 se で入っているが、 mp で上書きする

    REP(_, Q) {
        int tp;
        cin >> tp;
        dbg(tp);
        if (tp == 1) {
            int k;
            lint x;
            cin >> k >> x;
            k--;
            mp[k] = x;
        } else if (tp == 2) {
            vector<lint> add;
            for (auto itr = mp.rbegin(); itr != mp.rend(); ++itr) {
                auto [key, val] = *itr;
                se.erase(se.find_by_order(key));
                add.push_back(val);
            }

            dbg(add);
            dbg(mp);

            for (auto x : add) se.insert({x, head++});

            mp.clear();
        } else if (tp == 3) {
            int k;
            cin >> k;
            --k;
            dbg(make_tuple(k, mp));
            if (mp.count(k)) {
                cout << mp.at(k) << '\n';
            } else {
                cout << se.find_by_order(k)->first << '\n';
            }
        } else {
            assert(false);
        }
    }
}

yukicoder

結果

テストケース

ソースコード