#799303 (C++17) No.2077 Get Minimum Algorithm

提出ソース

結果

問題	No.2077 Get Minimum Algorithm
ユーザー	rniya
提出日時	2022-09-20 15:32:12
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	186 ms / 3,000 ms
コード長	6,012 bytes
コンパイル時間	2,327 ms
コンパイル使用メモリ	207,472 KB
実行使用メモリ	11,648 KB
最終ジャッジ日時	2024-06-01 16:59:41
合計ジャッジ時間	9,662 ms
ジャッジサーバーID （参考情報）	judge4 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,248 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	3 ms 5,376 KB
testcase_04	AC	7 ms 5,376 KB
testcase_05	AC	4 ms 5,376 KB
testcase_06	AC	5 ms 5,376 KB
testcase_07	AC	4 ms 5,376 KB
testcase_08	AC	6 ms 5,376 KB
testcase_09	AC	8 ms 5,376 KB
testcase_10	AC	4 ms 5,376 KB
testcase_11	AC	8 ms 5,376 KB
testcase_12	AC	162 ms 11,392 KB
testcase_13	AC	165 ms 11,392 KB
testcase_14	AC	166 ms 11,392 KB
testcase_15	AC	163 ms 11,392 KB
testcase_16	AC	163 ms 11,392 KB
testcase_17	AC	161 ms 11,392 KB
testcase_18	AC	164 ms 11,392 KB
testcase_19	AC	159 ms 11,392 KB
testcase_20	AC	161 ms 11,392 KB
testcase_21	AC	160 ms 11,512 KB
testcase_22	AC	162 ms 11,392 KB
testcase_23	AC	161 ms 11,520 KB
testcase_24	AC	160 ms 11,392 KB
testcase_25	AC	159 ms 11,392 KB
testcase_26	AC	159 ms 11,392 KB
testcase_27	AC	146 ms 11,648 KB
testcase_28	AC	126 ms 8,960 KB
testcase_29	AC	97 ms 7,424 KB
testcase_30	AC	140 ms 11,264 KB
testcase_31	AC	128 ms 9,088 KB
testcase_32	AC	97 ms 7,424 KB
testcase_33	AC	136 ms 11,008 KB
testcase_34	AC	116 ms 9,472 KB
testcase_35	AC	99 ms 7,552 KB
testcase_36	AC	186 ms 11,520 KB
testcase_37	AC	181 ms 11,520 KB
testcase_38	AC	2 ms 5,376 KB

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

ソースコード

raw source code

#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(), (x).end()

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (size_t i = 0; i < v.size(); i++) {
        os << v[i] << (i + 1 == v.size() ? "" : " ");
    }
    return os;
}
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> ostream& operator<<(ostream& os, const map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {
    for (size_t i = 0; i < v.size(); i++) {
        os << v[i] << (i + 1 == v.size() ? "" : " ");
    }
    return os;
}
template <typename T, size_t N> ostream& operator<<(ostream& os, const array<T, N>& v) {
    for (size_t i = 0; i < N; i++) {
        os << v[i] << (i + 1 == N ? "" : " ");
    }
    return os;
}

template <int i, typename T> void print_tuple(ostream&, const T&) {}
template <int i, typename T, typename H, class... Args> void print_tuple(ostream& os, const T& t) {
    if (i) os << ',';
    os << get<i>(t);
    print_tuple<i + 1, T, Args...>(os, t);
}
template <typename... Args> ostream& operator<<(ostream& os, const tuple<Args...>& t) {
    os << '{';
    print_tuple<0, tuple<Args...>, Args...>(os, t);
    return os << '}';
}

void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                                   \
    cerr << " ";                                                                     \
    cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \
    cerr << " ";                                                                     \
    debug_out(__VA_ARGS__)
#else
#define debug(...) void(0)
#endif

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }
int botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(long long t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }
long long MSK(int n) { return (1LL << n) - 1; }

template <class T> T ceil(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? (x + y - 1) / y : x / y);
}
template <class T> T floor(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? x / y : (x - y + 1) / y);
}

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <typename T> void mkuni(vector<T>& v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
}
template <typename T> int lwb(const vector<T>& v, const T& x) { return lower_bound(v.begin(), v.end(), x) - v.begin(); }
#pragma endregion

#include "atcoder/fenwicktree"

const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
const long long MOD = 1000000007;
// const long long MOD = 998244353;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    vector<int> P(N), pos(N);
    for (int i = 0; i < N; i++) {
        cin >> P[i];
        pos[--P[i]] = i;
    }
    int Q;
    cin >> Q;
    vector<int> x(Q), y(Q), ans(Q);
    vector<vector<int>> xs(N);
    for (int i = 0; i < Q; i++) {
        cin >> x[i] >> y[i];
        xs[--y[i]].emplace_back(i);
    }

    atcoder::fenwick_tree<int> ft(N);
    for (int i = 0; i < N; i++) {
        for (int& idx : xs[i]) {
            int lb = 0, ub = N;
            while (ub - lb > 1) {
                int mid = (ub + lb) >> 1;
                (ft.sum(0, mid) < x[idx] ? lb : ub) = mid;
            }
            ans[idx] = max(pos[y[idx]], lb);
        }
        ft.add(pos[i], 1);
    }

    for (int i = 0; i < Q; i++) cout << ans[i] + 1 << '\n';
    return 0;
}

yukicoder

結果

テストケース

ソースコード