#799116 (C++23) No.2077 Get Minimum Algorithm

提出ソース

結果

問題	No.2077 Get Minimum Algorithm
ユーザー	hitonanode
提出日時	2022-09-19 19:43:23
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	143 ms / 3,000 ms
コード長	7,676 bytes
コンパイル時間	2,100 ms
コンパイル使用メモリ	180,852 KB
実行使用メモリ	12,008 KB
最終ジャッジ日時	2024-12-22 02:37:26
合計ジャッジ時間	10,824 ms
ジャッジサーバーID （参考情報）	judge1 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,248 KB
testcase_02	AC	2 ms 5,248 KB
testcase_03	AC	3 ms 5,248 KB
testcase_04	AC	7 ms 5,248 KB
testcase_05	AC	4 ms 5,248 KB
testcase_06	AC	4 ms 5,248 KB
testcase_07	AC	4 ms 5,248 KB
testcase_08	AC	7 ms 5,248 KB
testcase_09	AC	7 ms 5,248 KB
testcase_10	AC	4 ms 5,248 KB
testcase_11	AC	6 ms 5,248 KB
testcase_12	AC	141 ms 11,260 KB
testcase_13	AC	140 ms 11,280 KB
testcase_14	AC	140 ms 11,136 KB
testcase_15	AC	136 ms 11,152 KB
testcase_16	AC	137 ms 11,152 KB
testcase_17	AC	138 ms 11,232 KB
testcase_18	AC	141 ms 11,236 KB
testcase_19	AC	141 ms 11,152 KB
testcase_20	AC	141 ms 11,140 KB
testcase_21	AC	143 ms 11,148 KB
testcase_22	AC	105 ms 11,404 KB
testcase_23	AC	98 ms 11,268 KB
testcase_24	AC	101 ms 11,268 KB
testcase_25	AC	101 ms 11,396 KB
testcase_26	AC	101 ms 11,400 KB
testcase_27	AC	125 ms 12,008 KB
testcase_28	AC	101 ms 8,704 KB
testcase_29	AC	72 ms 7,552 KB
testcase_30	AC	123 ms 11,588 KB
testcase_31	AC	102 ms 8,576 KB
testcase_32	AC	77 ms 7,424 KB
testcase_33	AC	101 ms 11,224 KB
testcase_34	AC	84 ms 9,600 KB
testcase_35	AC	57 ms 7,552 KB
testcase_36	AC	99 ms 11,396 KB
testcase_37	AC	131 ms 11,396 KB
testcase_38	AC	2 ms 5,248 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; }
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
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; }
#if __cplusplus >= 201703L
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 << ')'; }
#endif
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 <atcoder/segtree>

int op(int l, int r) { return l + r; }
int e() { return 0; }

int main() {
    int N;
    cin >> N;
    vector<int> P(N);
    cin >> P;
    for (auto &p : P) --p;

    vector<int> Pinv(N);
    REP(i, N) Pinv.at(P.at(i)) = i;

    int Q;
    cin >> Q;

    vector<vector<pint>> val2tq(N);

    REP(q, Q) {
        int x, y;
        cin >> x >> y;
        --y;
        val2tq.at(y).emplace_back(x, q);
    }

    atcoder::segtree<int, op, e> tree(N);

    vector<int> ret(Q, -1);
    REP(v, N) {
        const int x = Pinv.at(v);
        const int lo_left = tree.prod(0, x);

        for (auto [t, q] : val2tq.at(v)) {
            const int nstep = t - lo_left;
            if (nstep <= 0) {
                ret.at(q) = x;
            } else {
                ret.at(q) = tree.max_right(x, [&nstep](int y) { return y < nstep; });
            }
        }

        tree.set(x, 1);
    }

    for (auto x : ret) cout << x + 1 << '\n';
}

yukicoder

結果

テストケース

ソースコード