結果
問題 | No.1332 Range Nearest Query |
ユーザー | tokusakurai |
提出日時 | 2021-01-09 09:47:19 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 215 ms / 2,500 ms |
コード長 | 4,307 bytes |
コンパイル時間 | 3,839 ms |
コンパイル使用メモリ | 212,196 KB |
実行使用メモリ | 15,040 KB |
最終ジャッジ日時 | 2023-08-10 23:55:02 |
合計ジャッジ時間 | 16,278 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 193 ms
12,204 KB |
testcase_04 | AC | 187 ms
12,244 KB |
testcase_05 | AC | 193 ms
12,292 KB |
testcase_06 | AC | 121 ms
14,864 KB |
testcase_07 | AC | 119 ms
14,812 KB |
testcase_08 | AC | 119 ms
14,804 KB |
testcase_09 | AC | 123 ms
14,804 KB |
testcase_10 | AC | 123 ms
14,804 KB |
testcase_11 | AC | 119 ms
14,876 KB |
testcase_12 | AC | 117 ms
14,804 KB |
testcase_13 | AC | 121 ms
14,852 KB |
testcase_14 | AC | 122 ms
14,800 KB |
testcase_15 | AC | 121 ms
14,808 KB |
testcase_16 | AC | 200 ms
14,876 KB |
testcase_17 | AC | 206 ms
15,040 KB |
testcase_18 | AC | 205 ms
14,956 KB |
testcase_19 | AC | 208 ms
14,880 KB |
testcase_20 | AC | 208 ms
14,792 KB |
testcase_21 | AC | 199 ms
14,932 KB |
testcase_22 | AC | 204 ms
14,872 KB |
testcase_23 | AC | 215 ms
14,840 KB |
testcase_24 | AC | 204 ms
14,800 KB |
testcase_25 | AC | 209 ms
14,800 KB |
testcase_26 | AC | 98 ms
14,812 KB |
testcase_27 | AC | 106 ms
14,840 KB |
testcase_28 | AC | 30 ms
4,916 KB |
testcase_29 | AC | 30 ms
4,904 KB |
testcase_30 | AC | 33 ms
5,176 KB |
testcase_31 | AC | 26 ms
4,840 KB |
testcase_32 | AC | 32 ms
4,980 KB |
testcase_33 | AC | 33 ms
4,848 KB |
testcase_34 | AC | 27 ms
4,924 KB |
testcase_35 | AC | 29 ms
4,984 KB |
testcase_36 | AC | 30 ms
4,984 KB |
testcase_37 | AC | 30 ms
4,920 KB |
testcase_38 | AC | 133 ms
10,144 KB |
testcase_39 | AC | 66 ms
5,376 KB |
testcase_40 | AC | 196 ms
14,804 KB |
testcase_41 | AC | 90 ms
6,700 KB |
testcase_42 | AC | 130 ms
9,864 KB |
testcase_43 | AC | 109 ms
7,804 KB |
testcase_44 | AC | 173 ms
11,448 KB |
testcase_45 | AC | 160 ms
10,968 KB |
testcase_46 | AC | 128 ms
8,544 KB |
testcase_47 | AC | 148 ms
10,352 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for(int i = 0; i < n; i++) #define rep2(i, x, n) for(int i = x; i <= n; i++) #define rep3(i, x, n) for(int i = x; i >= n; i--) #define each(e, v) for(auto &e: v) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define sz(x) (int)x.size() using ll = long long; using pii = pair<int, int>; using pil = pair<int, ll>; using pli = pair<ll, int>; using pll = pair<ll, ll>; const int MOD = 1000000007; //const int MOD = 998244353; const int inf = (1<<30)-1; const ll INF = (1LL<<60)-1; template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;}; template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;}; struct io_setup{ io_setup(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(15); } } io_setup; template<typename Monoid> struct Segment_Tree{ using F = function<Monoid(Monoid, Monoid)>; int n; vector<Monoid> seg; const F f; const Monoid e1; Segment_Tree(const vector<Monoid> &v, const F &f, const Monoid &e1) : f(f), e1(e1){ int m = sz(v); n = 1; while(n < m) n <<= 1; seg.assign(2*n, e1); copy(all(v), seg.begin()+n); for(int i = n-1; i > 0; i--) seg[i] = f(seg[2*i], seg[2*i+1]); } void change(int i, const Monoid &x){ seg[i += n] = x; while(i >>= 1){ seg[i] = f(seg[2*i], seg[2*i+1]); } } Monoid query(int l, int r) const{ Monoid L = e1, R = e1; l += n, r += n; while(l < r){ if(l&1) L = f(L, seg[l++]); if(r&1) R = f(seg[--r], R); l >>= 1, r >>= 1; } return f(L, R); } Monoid operator [] (int i) const {return seg[n+i];} template<typename C> int find_subtree(int i, const C &check, const Monoid &x, Monoid &M, bool type) const{ while(i < n){ Monoid nxt = type? f(seg[2*i+type], M) : f(M, seg[2*i+type]); if(check(nxt, x)) i = 2*i+type; else M = nxt, i = 2*i+(type^1); } return i-n; } template<typename C> int find_first(int l, const C &check, const Monoid &x) const{ Monoid L = e1; int a = l+n, b = n+n; while(a < b){ if(a&1){ Monoid nxt = f(L, seg[a]); if(check(nxt, x)) return find_subtree(a, check, x, L, false); L = nxt, a++; } a >>= 1, b >>= 1; } return n; } template<typename C> int find_last(int r, const C &check, const Monoid &x) const{ Monoid R = e1; int a = n, b = r+n; while(a < b){ if(b&1 || a == 1){ Monoid nxt = f(seg[--b], R); if(check(nxt, x)) return find_subtree(b, check, x, R, true); R = nxt; } a >>= 1, b >>= 1; } return -1; } }; int main(){ int N; cin >> N; vector<int> X(N); rep(i, N) cin >> X[i]; vector<int> v(N); iota(all(v), 0); sort(all(v), [&](int i, int j){ return X[i] < X[j]; }); vector<int> id(N); rep(i, N) id[v[i]] = i; vector<int> memo = X; sort(all(memo)); int Q; cin >> Q; vector<int> L(Q), R(Q), x(Q), ans(Q, inf); rep(i, Q){ cin >> L[i] >> R[i] >> x[i]; L[i]--; } vector<int> u(Q); iota(all(u), 0); sort(all(u), [&](int i, int j){ return R[i] < R[j]; }); auto f = [](int a, int b) {return max(a, b);}; auto c = [](int a, int b) {return a >= b;}; Segment_Tree<int> seg(vector<int>(N, -inf), f, -inf); int ptr = 0; rep(i, Q){ while(ptr < R[u[i]]){ seg.change(id[ptr], ptr); ptr++; } int pos = lower_bound(all(memo), x[u[i]])-begin(memo); int l = seg.find_last(pos, c, L[u[i]]); int r = seg.find_first(pos, c, L[u[i]]); if(l >= 0){ chmin(ans[u[i]], x[u[i]]-X[seg[l]]); } if(r < N){ chmin(ans[u[i]], X[seg[r]]-x[u[i]]); } } rep(i, Q) cout << ans[i] << '\n'; }