結果
問題 | No.1332 Range Nearest Query |
ユーザー | fastmath |
提出日時 | 2021-01-08 21:59:31 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 887 ms / 2,500 ms |
コード長 | 2,584 bytes |
コンパイル時間 | 2,386 ms |
コンパイル使用メモリ | 205,244 KB |
実行使用メモリ | 111,244 KB |
最終ジャッジ日時 | 2023-08-10 09:29:26 |
合計ジャッジ時間 | 29,380 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 13 ms
32,008 KB |
testcase_01 | AC | 12 ms
32,024 KB |
testcase_02 | AC | 12 ms
32,184 KB |
testcase_03 | AC | 761 ms
83,464 KB |
testcase_04 | AC | 764 ms
83,384 KB |
testcase_05 | AC | 760 ms
83,340 KB |
testcase_06 | AC | 429 ms
110,344 KB |
testcase_07 | AC | 429 ms
110,380 KB |
testcase_08 | AC | 431 ms
110,320 KB |
testcase_09 | AC | 427 ms
109,924 KB |
testcase_10 | AC | 430 ms
110,464 KB |
testcase_11 | AC | 429 ms
111,244 KB |
testcase_12 | AC | 430 ms
110,032 KB |
testcase_13 | AC | 424 ms
110,192 KB |
testcase_14 | AC | 426 ms
110,056 KB |
testcase_15 | AC | 426 ms
109,792 KB |
testcase_16 | AC | 883 ms
110,908 KB |
testcase_17 | AC | 886 ms
109,976 KB |
testcase_18 | AC | 878 ms
110,856 KB |
testcase_19 | AC | 878 ms
110,188 KB |
testcase_20 | AC | 878 ms
109,924 KB |
testcase_21 | AC | 880 ms
110,068 KB |
testcase_22 | AC | 883 ms
110,048 KB |
testcase_23 | AC | 880 ms
110,460 KB |
testcase_24 | AC | 887 ms
110,712 KB |
testcase_25 | AC | 883 ms
110,188 KB |
testcase_26 | AC | 301 ms
110,112 KB |
testcase_27 | AC | 294 ms
109,924 KB |
testcase_28 | AC | 39 ms
32,044 KB |
testcase_29 | AC | 41 ms
32,132 KB |
testcase_30 | AC | 42 ms
32,272 KB |
testcase_31 | AC | 37 ms
32,156 KB |
testcase_32 | AC | 43 ms
32,008 KB |
testcase_33 | AC | 44 ms
32,020 KB |
testcase_34 | AC | 38 ms
32,308 KB |
testcase_35 | AC | 39 ms
32,252 KB |
testcase_36 | AC | 39 ms
32,032 KB |
testcase_37 | AC | 41 ms
32,100 KB |
testcase_38 | AC | 557 ms
69,836 KB |
testcase_39 | AC | 159 ms
33,988 KB |
testcase_40 | AC | 848 ms
109,044 KB |
testcase_41 | AC | 323 ms
42,552 KB |
testcase_42 | AC | 543 ms
68,272 KB |
testcase_43 | AC | 417 ms
52,008 KB |
testcase_44 | AC | 703 ms
79,580 KB |
testcase_45 | AC | 657 ms
76,672 KB |
testcase_46 | AC | 503 ms
56,184 KB |
testcase_47 | AC | 618 ms
72,916 KB |
ソースコード
#include<bits/stdc++.h> using namespace std; #define int long long #define ii pair <int, int> #define app push_back #define all(a) a.begin(), a.end() #define bp __builtin_popcountll #define ll long long #define mp make_pair #define x first #define y second #define Time (double)clock()/CLOCKS_PER_SEC #define debug(x) std::cout << #x << ": " << x << '\n'; #define FOR(i, n) for (int i = 0; i < n; ++i) #define pb push_back #define trav(a, x) for (auto& a : x) using vi = vector<int>; template <typename T> std::ostream& operator <<(std::ostream& output, const pair <T, T> & data) { output << "(" << data.x << "," << data.y << ")"; return output; } template <typename T> std::ostream& operator <<(std::ostream& output, const std::vector<T>& data) { for (const T& x : data) output << x << " "; return output; } //ll div_up(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up //ll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down #define tcT template<class T #define tcTU tcT, class U tcT> using V = vector<T>; tcT> void re(V<T>& x) { trav(a, x) cin >> a; } tcT> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } // set a = min(a,b) tcT> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } const int N = 3e5+7, INF = 1e9+7; int n, q; int a[N]; vi t[N << 2]; void build(int v, int tl, int tr) { if (tl == tr) { t[v] = {a[tl]}; return; } int tm = (tl + tr) >> 1; build(v * 2 + 1, tl, tm); build(v * 2 + 2, tm + 1, tr); trav (x, t[v * 2 + 1]) t[v].app(x); trav (x, t[v * 2 + 2]) t[v].app(x); sort(all(t[v])); } int get(int v, int tl, int tr, int l, int r, int x) { if (tr < l || r < tl) return INF; if (l <= tl && tr <= r) { auto u = lower_bound(all(t[v]), x); int ans = INF; if (u != t[v].begin()) ckmin(ans, abs(*prev(u) - x)); if (u != t[v].end()) ckmin(ans, abs(*u - x)); return ans; } int tm = (tl + tr) >> 1; return min(get(v * 2 + 1, tl, tm, l, r, x) , get(v * 2 + 2, tm + 1, tr, l, r, x)); } signed main() { #ifdef HOME freopen("input.txt", "r", stdin); #else #define endl '\n' ios_base::sync_with_stdio(0); cin.tie(0); #endif cin >> n; FOR (i, n) cin >> a[i]; build(0, 0, n - 1); cin >> q; while (q--) { int l, r, x; cin >> l >> r >> x; cout << get(0, 0, n - 1, l - 1, r - 1, x) << endl; } }