Submit Info #2667

Problem Lang User Status Time Memory
Static RMQ cpp fumiphys AC 810 ms 85.27 MiB

ケース詳細
Name Status Time Memory
example_00 AC 4 ms 0.63 MiB
max_random_00 AC 793 ms 85.15 MiB
max_random_01 AC 809 ms 85.16 MiB
max_random_02 AC 810 ms 84.91 MiB
max_random_03 AC 795 ms 85.27 MiB
max_random_04 AC 801 ms 85.13 MiB
random_00 AC 665 ms 83.84 MiB
random_01 AC 672 ms 84.43 MiB
random_02 AC 497 ms 11.58 MiB
random_03 AC 155 ms 84.18 MiB
random_04 AC 233 ms 83.01 MiB
small_00 AC 8 ms 0.68 MiB
small_01 AC 6 ms 0.62 MiB
small_02 AC 7 ms 0.68 MiB
small_03 AC 6 ms 0.68 MiB
small_04 AC 6 ms 0.62 MiB
small_05 AC 9 ms 0.62 MiB
small_06 AC 6 ms 0.62 MiB
small_07 AC 8 ms 0.68 MiB
small_08 AC 7 ms 0.63 MiB
small_09 AC 7 ms 0.69 MiB

// includes #include <bits/stdc++.h> using namespace std; // macros #define pb emplace_back #define mk make_pair #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define rep(i, n) FOR(i, 0, n) #define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--) #define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr) #define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr) #define whole(x) (x).begin(),(x).end() #define sz(x) ((int)(x).size()) #define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) #define bit(n) (1LL<<(n)) // functions template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;} template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;} 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){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;} template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;} template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;} template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;} // types using ll = long long int; using P = pair<int, int>; // constants const int inf = 1e9; const ll linf = 1LL << 50; const double EPS = 1e-10; const int mod = 1000000007; const int dx[4] = {-1, 0, 1, 0}; const int dy[4] = {0, -1, 0, 1}; // io struct fast_io{ fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);} } fast_io_; template <typename T> struct SparseTable{ int n; function<T(T, T)> f; vector<vector<T>> vec; vector<int> lookup; SparseTable(){} SparseTable(const vector<T> &v, function<T(T, T)> f): f(f){ n = int(v.size()); int b = 0; while((1 << b) <= n)b++; vec.resize(b, vector<T>(1 << b)); for(int i = 0; i < n; i++)vec[0][i] = v[i]; for(int j = 1; j < b; j++){ for(int i = 0; i + (1 << j) <= (1 << b); i++){ vec[j][i] = f(vec[j-1][i], vec[j-1][i+(1<<(j-1))]); } } lookup.resize(n + 1, 0); for(int i = 2; i <= n; i++){ lookup[i] = lookup[i >> 1] + 1; } } // [l, r) T query(int l, int r){ int b = lookup[r - l]; return f(vec[b][l], vec[b][r - (1 << b)]); } }; int main(int argc, char const* argv[]) { int n, q; cin >> n >> q; vector<ll> a(n); cin >> a; SparseTable<ll> sp(a, [](ll a, ll b){return min(a, b);}); rep(i_, q){ int l, r; cin >> l >> r; cout << sp.query(l, r) << endl; } return 0; }