結果
問題 | No.905 Sorted? |
ユーザー |
![]() |
提出日時 | 2019-10-11 21:35:22 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 263 ms / 2,000 ms |
コード長 | 3,673 bytes |
コンパイル時間 | 1,556 ms |
コンパイル使用メモリ | 174,364 KB |
実行使用メモリ | 8,192 KB |
最終ジャッジ日時 | 2024-11-25 06:55:37 |
合計ジャッジ時間 | 5,144 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 23 |
ソースコード
#include <bits/stdc++.h>using namespace std;typedef long long signed int LL;typedef long long unsigned int LU;#define incID(i, l, r) for(LL i = (l) ; i < (r); ++i)#define incII(i, l, r) for(LL i = (l) ; i <= (r); ++i)#define decID(i, l, r) for(LL i = (r) - 1; i >= (l); --i)#define decII(i, l, r) for(LL i = (r) ; i >= (l); --i)#define inc(i, n) incID(i, 0, n)#define inc1(i, n) incII(i, 1, n)#define dec(i, n) decID(i, 0, n)#define dec1(i, n) decII(i, 1, n)#define inID(v, l, r) ((l) <= (v) && (v) < (r))#define inII(v, l, r) ((l) <= (v) && (v) <= (r))#define PB push_back#define EB emplace_back#define MP make_pair#define FI first#define SE second#define ALL(v) v.begin(), v.end()#define RALL(v) v.rbegin(), v.rend()template<typename T> bool setmin (T & a, T b) { if(b < a) { a = b; return true; } else { return false; } }template<typename T> bool setmax (T & a, T b) { if(b > a) { a = b; return true; } else { return false; } }template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }LL mo(LL a, LL b) { assert(b > 0); a %= b; if(a < 0) { a += b; } return a; }LL fl(LL a, LL b) { assert(b > 0); return (a > 0 ? a / b : (a - b + 1) / b); }LL ce(LL a, LL b) { assert(b > 0); return (a < 0 ? a / b : (a + b - 1) / b); }template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }#define bit(b, i) (((b) >> (i)) & 1)#define BC __builtin_popcountll#define SC static_cast#define SI(v) SC<int>(v.size())#define SL(v) SC<LL >(v.size())#define RF(e, v) for(auto & e: v)#define ef else if#define UR assert(false)// ---- ----template<typename T> class SegmentTree {private:int n, s;vector<T> a;function<T(T &, T &)> f;T e;bool ok;public:SegmentTree() { n = 0; }SegmentTree(int nn, function<T(T &, T &)> ff, T ee) { init(nn, ff, ee); }void init(int nn, function<T(T &, T &)> ff, T ee) {n = nn;f = ff;e = ee;s = 1;while(s < n) { s *= 2; }a = vector<T>(2 * s, e);ok = true;}void shift(int & p) {assert(inID(p, 0, n));p += s;}void apply(int p, function<void(T &)> g) {shift(p);g(a[p]);while(p > 1) {p /= 2;a[p] = f(a[2 * p], a[2 * p + 1]);}}T fold_ID(int l, int r) {assert(ok);assert(inII(l, 0, n)); l += s;assert(inII(r, 0, n)); r += s; r--;T x = e, y = e;while(l <= r) {if(l % 2 == 1) { x = f(x, a[l]); l++; }if(r % 2 == 0) { y = f(a[r], y); r--; }l /= 2;r /= 2;}return f(x, y);}T fold_II(int l, int r) { return fold_ID(l + 0, r + 1); }T fold_CI(int l, int r) { return fold_ID(l + 1, r + 1); }T fold_CD(int l, int r) { return fold_ID(l + 1, r + 0); }const T & operator[](int p) {shift(p);return a[p];}T & ref(int p) {shift(p);ok = false;return a[p];}void update() {dec(i, s) { a[i] = f(a[2 * i], a[2 * i + 1]); }ok = true;}};#define OP(s) [&](auto & A, auto & B) { return s; }#define AP(s) [&](auto & A) { s; }// ---- ----LL n, a[100000], q;int main() {cin >> n;inc(i, n) { cin >> a[i]; }SegmentTree<LL> st1(n - 1, OP(A + B), 0);SegmentTree<LL> st2(n - 1, OP(A + B), 0);inc(i, n - 1) {st1.ref(i) = (a[i] <= a[i + 1] ? 0 : 1);st2.ref(i) = (a[i] >= a[i + 1] ? 0 : 1);}st1.update();st2.update();cin >> q;inc(qq, q) {int l, r;cin >> l >> r;int x = (st1.fold_ID(l, r) == 0 ? 1 : 0);int y = (st2.fold_ID(l, r) == 0 ? 1 : 0);cout << x << " " << y << "\n";}return 0;}