結果
問題 | No.1332 Range Nearest Query |
ユーザー |
![]() |
提出日時 | 2021-01-08 21:47:43 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 526 ms / 2,500 ms |
コード長 | 3,174 bytes |
コンパイル時間 | 2,315 ms |
コンパイル使用メモリ | 208,372 KB |
実行使用メモリ | 93,440 KB |
最終ジャッジ日時 | 2024-11-16 11:08:18 |
合計ジャッジ時間 | 21,102 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 49 ms
52,352 KB |
testcase_01 | AC | 32 ms
52,200 KB |
testcase_02 | AC | 53 ms
52,352 KB |
testcase_03 | AC | 470 ms
88,192 KB |
testcase_04 | AC | 469 ms
88,192 KB |
testcase_05 | AC | 466 ms
88,320 KB |
testcase_06 | AC | 258 ms
93,312 KB |
testcase_07 | AC | 255 ms
93,312 KB |
testcase_08 | AC | 247 ms
93,440 KB |
testcase_09 | AC | 250 ms
93,312 KB |
testcase_10 | AC | 258 ms
93,312 KB |
testcase_11 | AC | 256 ms
93,312 KB |
testcase_12 | AC | 247 ms
93,312 KB |
testcase_13 | AC | 256 ms
93,312 KB |
testcase_14 | AC | 251 ms
93,312 KB |
testcase_15 | AC | 254 ms
93,312 KB |
testcase_16 | AC | 520 ms
93,312 KB |
testcase_17 | AC | 515 ms
93,312 KB |
testcase_18 | AC | 521 ms
93,312 KB |
testcase_19 | AC | 518 ms
93,420 KB |
testcase_20 | AC | 526 ms
93,440 KB |
testcase_21 | AC | 510 ms
93,440 KB |
testcase_22 | AC | 516 ms
93,312 KB |
testcase_23 | AC | 510 ms
93,312 KB |
testcase_24 | AC | 517 ms
93,312 KB |
testcase_25 | AC | 518 ms
93,440 KB |
testcase_26 | AC | 178 ms
93,308 KB |
testcase_27 | AC | 174 ms
93,372 KB |
testcase_28 | AC | 76 ms
52,352 KB |
testcase_29 | AC | 76 ms
52,352 KB |
testcase_30 | AC | 77 ms
52,352 KB |
testcase_31 | AC | 75 ms
52,352 KB |
testcase_32 | AC | 79 ms
52,224 KB |
testcase_33 | AC | 79 ms
52,352 KB |
testcase_34 | AC | 75 ms
52,352 KB |
testcase_35 | AC | 75 ms
52,336 KB |
testcase_36 | AC | 75 ms
52,352 KB |
testcase_37 | AC | 77 ms
52,432 KB |
testcase_38 | AC | 395 ms
73,300 KB |
testcase_39 | AC | 178 ms
53,760 KB |
testcase_40 | AC | 503 ms
92,160 KB |
testcase_41 | AC | 280 ms
59,904 KB |
testcase_42 | AC | 386 ms
72,064 KB |
testcase_43 | AC | 324 ms
64,908 KB |
testcase_44 | AC | 458 ms
83,164 KB |
testcase_45 | AC | 444 ms
79,744 KB |
testcase_46 | AC | 369 ms
70,016 KB |
testcase_47 | AC | 418 ms
76,416 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; template <class T> using V = vector<T>; template <class T> using VV = V<V<T>>; #define pb push_back #define eb emplace_back #define mp make_pair #define fi first #define se second #define rep(i, n) rep2(i, 0, n) #define rep2(i, m, n) for (int i = m; i < (n); i++) #define per(i, b) per2(i, 0, b) #define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--) #define ALL(c) (c).begin(), (c).end() #define SZ(x) ((int)(x).size()) constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); } template <class T, class U> void chmin(T& t, const U& u) { if (t > u) t = u; } template <class T, class U> void chmax(T& t, const U& u) { if (t < u) t = u; } template <class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p) { os << "(" << p.first << "," << p.second << ")"; return os; } template <class T> ostream& operator<<(ostream& os, const vector<T>& v) { os << "{"; rep(i, v.size()) { if (i) os << ","; os << v[i]; } os << "}"; return os; } #ifdef LOCAL void debug_out() { cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...); } #define debug(...) \ cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__) #define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl #else #define debug(...) (void(0)) #define dump(x) (void(0)) #endif const int INF = TEN(9) + 10; const int sz = 1 << 20; struct segtree { using Val = int; vector<vector<Val>> dat; segtree() {} void init(vector<Val> num) { dat.resize(sz * 2); rep(i, sz * 2) { dat[i].clear(); } rep(i, num.size()) { dat[sz - 1 + i].pb(num[i]); } for (int i = sz - 2; i >= 0; --i) { int lc = i * 2 + 1, rc = i * 2 + 2; dat[i].resize(dat[lc].size() + dat[rc].size()); merge(dat[lc].begin(), dat[lc].end(), dat[rc].begin(), dat[rc].end(), dat[i].begin()); } } Val ask(int a, int b, int u, int k = 0, int l = 0, int r = sz) { if (b <= l || r <= a) return INF; if (a <= l && r <= b) { if (dat[k].size() == 0) return INF; int res = INF; if (u <= dat[k][0]) res = dat[k][0] - u; else if (u >= dat[k].back()) res = u - dat[k].back(); else { auto it = lower_bound(ALL(dat[k]), u); res = min(abs((*it) - u), abs(*(prev(it)) - u)); } return res; } return min(ask(a, b, u, k * 2 + 1, l, (l + r) / 2), ask(a, b, u, k * 2 + 2, (l + r) / 2, r)); } } seg; int main() { cin.tie(nullptr); ios::sync_with_stdio(false); int N; cin >> N; V<int> X(N); rep(i, N) cin >> X[i]; segtree seg; seg.init(X); int Q; cin >> Q; while (Q--) { int l, r, y; cin >> l >> r >> y; --l; int ans = INF; cout << seg.ask(l, r, y) << '\n'; } return 0; }