malteklaes commited on
Commit
1f96169
·
verified ·
1 Parent(s): 770cd92

Upload 4 files

Browse files
Files changed (1) hide show
  1. cpp_dataset/train/train.jsonl +0 -5
cpp_dataset/train/train.jsonl CHANGED
@@ -53,8 +53,3 @@
53
  {"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long INF = 1e18;\n const int maxn = 2e6 + 10;\n int a[maxn], cnt[maxn];\n long long sum[maxn];\n int main(void) {\n int n, x, y;\n scanf( %d %d %d , &n, &x, &y);\n int z = x / y;\n for (int i = 1; i <= n; i++)\n scanf( %d , a + i), cnt[a[i]]++, sum[a[i]] += a[i];\n for (int i = 1; i <= 2000000; i++) cnt[i] += cnt[i - 1], sum[i] += sum[i - 1];\n long long ans = INF;\n for (int i = 2; i <= 1000000; i++) {\n long long tmp = 0;\n int zz = min(z, i - 1);\n for (int j = 1; (j - 1) * i < 1000000; j++) {\n if (i - zz - 2 >= 0)\n tmp += (long long)(cnt[j * i - zz - 1] - cnt[j * i - i]) * x;\n if (zz)\n tmp += ((long long)i * j * (cnt[j * i - 1] - cnt[j * i - zz - 1]) -\n (sum[j * i - 1] - sum[j * i - zz - 1])) *\n y;\n }\n ans = min(ans, tmp);\n }\n printf( %I64d\n , ans);\n return 0;\n }\n "}
54
  {"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int md = 1e9 + 7;\n int n;\n char s[111];\n int f[111][3333];\n int main() {\n int t;\n f[0][0] = 1;\n for (int i = 1; i <= 100; ++i) {\n for (int j = 0; j <= 3000; ++j) {\n for (int c = 0; c <= min(j, 25); ++c) {\n f[i][j] += f[i - 1][j - c];\n f[i][j] %= md;\n }\n }\n }\n scanf( %d , &t);\n while (t--) {\n scanf( %s , s);\n int sum = 0;\n for (int i = 0; i < strlen(s); ++i) sum += s[i] - 'a';\n printf( %d\n , (f[strlen(s)][sum] + md - 1) % md);\n }\n return 0;\n }\n "}
55
  {"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize ( O3 )\n #pragma GCC target ( sse4 )\n \n using namespace std;\n \n typedef long long ll;\n typedef long double ld;\n typedef complex<ld> cd;\n \n typedef pair<int, int> pi;\n typedef pair<ll,ll> pl;\n typedef pair<ld,ld> pd;\n \n typedef vector<int> vi;\n typedef vector<ld> vd;\n typedef vector<ll> vl;\n typedef vector<pi> vpi;\n typedef vector<pl> vpl;\n typedef vector<cd> vcd;\n \n template<class T> using pq = priority_queue<T>;\n template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\n \n #define FOR(i, a, b) for (int i=a; i<(b); i++)\n #define F0R(i, a) for (int i=0; i<(a); i++)\n #define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)\n #define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)\n #define trav(a,x) for (auto& a : x)\n #define uid(a, b) uniform_int_distribution<int>(a, b)(rng)\n \n #define sz(x) (int)(x).size()\n #define mp make_pair\n #define pb push_back\n #define f first\n #define s second\n #define lb lower_bound\n #define ub upper_bound\n #define all(x) x.begin(), x.end()\n #define ins insert\n \n template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }\n template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }\n \n mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\n \n void __print(int x) {cerr << x;}\n void __print(long x) {cerr << x;}\n void __print(long long x) {cerr << x;}\n void __print(unsigned x) {cerr << x;}\n void __print(unsigned long x) {cerr << x;}\n void __print(unsigned long long x) {cerr << x;}\n void __print(float x) {cerr << x;}\n void __print(double x) {cerr << x;}\n void __print(long double x) {cerr << x;}\n void __print(char x) {cerr << '\'' << x << '\'';}\n void __print(const char *x) {cerr << '\ ' << x << '\ ';}\n void __print(const string &x) {cerr << '\ ' << x << '\ ';}\n void __print(bool x) {cerr << (x ? true : false );}\n \n template<typename T, typename V>\n void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << , ; __print(x.second); cerr << '}';}\n template<typename T>\n void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? , : ), __print(i); cerr << } ;}\n void _print() {cerr << ]\n ;}\n template <typename T, typename... V>\n void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << , ; _print(v...);}\n #ifdef DEBUG\n #define dbg(x...) cerr << \e[91m <<__func__<< : <<__LINE__<< [ << #x << ] = [ ; _print(x); cerr << \e[39m << endl;\n #else\n #define dbg(x...)\n #endif\n \n \n const int MOD = 1000000007;\n const char nl = '\n';\n const int MX = 200001; \n \n int dist[MX];\n int A[MX];\n set<pi> rem;\n pqg<pi> q;\n \n void add(int p, int pre, bool ty) {\n auto it1 = rem.lb({p, -1});\n if (it1 != rem.end()) {\n int v = it1->s;\n int d = max(pre, abs(A[v]-p));\n if (ty) {\n d = pre + abs(A[v]-p);\n }\n if (d < dist[v]) {\n dist[v] = d;\n q.push({d, v});\n }\n }\n if (it1 != rem.begin()) {\n it1--;\n int v = it1->s;\n int d = max(pre, abs(A[v]-p));\n if (ty) {\n d = pre + abs(A[v]-p);\n }\n if (d < dist[v]) {\n dist[v] = d;\n q.push({d, v});\n }\n }\n }\n \n void push(int p, int K) {\n while (rem.lb({p, -1}) != rem.end() && rem.lb({p, -1})->f <= p+K) {\n int x = rem.lb({p, -1})->s;\n rem.erase({A[x], x});\n q.push({K, x});\n dist[x] = K;\n }\n auto it = rem.lb({p, -1});\n while (it != rem.begin()) {\n it--;\n if (it->f < p-K) break;\n int x = it->s;\n rem.erase({A[x], x});\n q.push({K, x});\n dist[x] = K;\n it = rem.lb({p, -1});\n }\n }\n \n \n void solve() {\n int N, Q; cin >> N >> Q;\n F0R(i, N) dist[i] = 100000000;\n int S; cin >> S; S--;\n int D; cin >> D;\n F0R(i, N) {\n cin >> A[i];\n if (i != S) rem.ins({A[i], i});\n }\n dist[S] = 0;\n add(A[S]+D, 0, true);\n add(A[S]-D, 0, true);\n bool vis[MX]; F0R(i, N) vis[i] = false;\n while (!q.empty()) {\n int v = q.top().s;\n int d = q.top().f;\n q.pop();\n if (vis[v]) continue;\n vis[v] = true;\n //dbg(v, d);\n rem.erase({A[v], v});\n add(A[v], d, true);\n push(A[v]+D, d);\n push(A[v]-D, d);\n add(A[v]+D, 0, true);\n add(A[v]-D, 0, true);\n }\n /*F0R(i, N) {\n cout << dist[i] << ;\n }\n cout << nl;*/\n \n while(Q--) {\n int X, V; cin >> X >> V; X--;\n cout << (dist[X]<=V? Yes : No ) << nl;\n }\n }\n \n int main() {\n cin.tie(0)->sync_with_stdio(0); \n cin.exceptions(cin.failbit);\n \n int T = 1;\n // cin >> T;\n while(T--) {\n solve();\n }\n \n return 0;\n }\n \n \n "}
56
- {"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n long long k, b, n, t;\n int main() {\n ios_base ::sync_with_stdio(0);\n cin.tie(0);\n cin >> k >> b >> n >> t;\n long long num = 1;\n long long step = n;\n while (t >= num) {\n num = num * k + b;\n step--;\n }\n if (step < 0) {\n cout << 0;\n return 0;\n }\n cout << step + 1;\n return 0;\n }\n "}
57
- {"func_code_string": "#include <bits/stdc++.h>\n const long double pi = 3.14159265359;\n const long long N = 1e9 + 7;\n using namespace std;\n int main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n long long n, m, arr[200005];\n cin >> n >> m;\n long long cntne = 0, cntpo = 0;\n for (int i = 0; i < n; i++) {\n cin >> arr[i];\n if (arr[i] == -1)\n cntne++;\n else\n cntpo++;\n }\n vector<long long> v;\n for (int i = 0; i < m; i++) {\n long long l, r;\n cin >> l >> r;\n r++;\n long long ans = abs(l - r);\n if ((ans % 2 == 0) && (cntne >= ans / 2) && (cntpo >= ans / 2))\n v.push_back(1);\n else\n v.push_back(0);\n }\n for (int i = 0; i < ((long long)((v).size())); i++) cout << v[i] << endl;\n return 0;\n }\n "}
58
- {"func_code_string": "#include <iostream>\n #include <vector>\n #include <algorithm>\n #include <string>\n \n #define ll long long\n \n using namespace std;\n \n int main() {\n ll qua;\n cin >> qua;\n for (int i = 0; i < qua; ++i) {\n ll n;\n cin >> n;\n vector<int> vec(n);\n for (int j = 0; j < n; ++j) {\n cin >> vec[j];\n }\n cout << 0 << ' ';\n for (int j = 1; j < n; ++j) {\n ll r = (vec[j] | vec[j - 1]) - vec[j];\n cout << r << ' ';\n vec[j] += r;\n }\n cout << '\n';\n }\n return 0;\n }\n "}
59
- {"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int MaxN = 100005;\n const int MaxM = MaxN * 2;\n const int oo = 0x3F3F3F3F;\n int ax[MaxM], K;\n int ret[MaxN];\n set<pair<int, int> > tr[MaxM];\n struct event {\n int l, r, v, tp;\n event() {}\n event(int l, int r, int v, int tp) : l(l), r(r), v(v), tp(tp) {}\n bool operator<(const event& e) const {\n if (r != e.r)\n return r > e.r;\n else\n return tp < e.tp;\n }\n } e[MaxM];\n int getId(int v) { return lower_bound(ax, ax + K, v) - ax + 1; }\n void add(int k, pair<int, int> v) {\n while (k <= K) {\n tr[k].insert(v);\n k += k & -k;\n }\n }\n int read(int k, int v) {\n pair<int, int> ret = make_pair(oo, -1);\n while (k) {\n set<pair<int, int> >::iterator it = tr[k].lower_bound(make_pair(v, 0));\n if (it != tr[k].end()) ret = min(ret, *it);\n k -= k & -k;\n }\n return ret.second;\n }\n int main() {\n int N, M, en;\n int l, r, t;\n scanf( %d%d , &N, &M);\n K = en = 0;\n for (int i = 0; i < N; i++) {\n scanf( %d%d%d , &l, &r, &t);\n e[en++] = event(l, r, t, -i - 1);\n ax[K++] = l;\n }\n for (int i = 0; i < M; i++) {\n scanf( %d%d%d , &l, &r, &t);\n e[en++] = event(l, r, t, i);\n ax[K++] = l;\n }\n sort(ax, ax + K);\n K = unique(ax, ax + K) - ax;\n sort(e, e + en);\n for (int i = 0; i < en; i++) {\n if (e[i].tp < 0) {\n add(getId(e[i].l), make_pair(e[i].v, -e[i].tp));\n } else {\n ret[e[i].tp] = read(getId(e[i].l), e[i].v);\n }\n }\n for (int i = 0; i < M; i++) {\n printf( %d , ret[i]);\n }\n puts( );\n return 0;\n }\n "}
60
- {"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n template <typename T, typename U>\n std::istream& operator>>(std::istream& i, pair<T, U>& p) {\n i >> p.first >> p.second;\n return i;\n }\n template <typename T>\n std::istream& operator>>(std::istream& i, vector<T>& t) {\n for (auto& v : t) {\n i >> v;\n }\n return i;\n }\n template <typename T, typename U>\n std::ostream& operator<<(std::ostream& o, const pair<T, U>& p) {\n o << p.first << ' ' << p.second;\n return o;\n }\n template <typename T>\n std::ostream& operator<<(std::ostream& o, const vector<T>& t) {\n if (t.empty()) o << '\n';\n for (size_t i = 0; i < t.size(); ++i) {\n o << t[i] << \n [i == t.size() - 1];\n }\n return o;\n }\n template <typename T>\n using minheap = priority_queue<T, vector<T>, greater<T>>;\n template <typename T>\n using maxheap = priority_queue<T, vector<T>, less<T>>;\n unsigned int logceil(long long first) {\n return first ? 8 * sizeof(long long) - __builtin_clzll(first) : 0;\n }\n namespace std {\n template <typename T, typename U>\n struct hash<pair<T, U>> {\n hash<T> t;\n hash<U> u;\n size_t operator()(const pair<T, U>& p) const {\n return t(p.first) ^ (u(p.second) << 7);\n }\n };\n } // namespace std\n template <typename T, typename F>\n T bsh(T l, T h, const F& f) {\n T r = -1, m;\n while (l <= h) {\n m = (l + h) / 2;\n if (f(m)) {\n l = m + 1;\n r = m;\n } else {\n h = m - 1;\n }\n }\n return r;\n }\n template <typename F>\n double bshd(double l, double h, const F& f, double p = 1e-9) {\n unsigned int r = 3 + (unsigned int)log2((h - l) / p);\n while (r--) {\n double m = (l + h) / 2;\n if (f(m)) {\n l = m;\n } else {\n h = m;\n }\n }\n return (l + h) / 2;\n }\n template <typename T, typename F>\n T bsl(T l, T h, const F& f) {\n T r = -1, m;\n while (l <= h) {\n m = (l + h) / 2;\n if (f(m)) {\n h = m - 1;\n r = m;\n } else {\n l = m + 1;\n }\n }\n return r;\n }\n template <typename F>\n double bsld(double l, double h, const F& f) {\n unsigned int r = 200;\n while (r--) {\n double m = (l + h) / 2;\n if (f(m)) {\n h = m;\n } else {\n l = m;\n }\n }\n return (l + h) / 2;\n }\n template <typename T>\n T gcd(T a, T b) {\n if (a < b) swap(a, b);\n return b ? gcd(b, a % b) : a;\n }\n template <typename T>\n class vector2 : public vector<vector<T>> {\n public:\n vector2() {}\n vector2(size_t a, size_t b, T t = T())\n : vector<vector<T>>(a, vector<T>(b, t)) {}\n };\n template <typename T>\n class vector3 : public vector<vector2<T>> {\n public:\n vector3() {}\n vector3(size_t a, size_t b, size_t c, T t = T())\n : vector<vector2<T>>(a, vector2<T>(b, c, t)) {}\n };\n template <typename T>\n class vector4 : public vector<vector3<T>> {\n public:\n vector4() {}\n vector4(size_t a, size_t b, size_t c, size_t d, T t = T())\n : vector<vector3<T>>(a, vector3<T>(b, c, d, t)) {}\n };\n template <typename T>\n class vector5 : public vector<vector4<T>> {\n public:\n vector5() {}\n vector5(size_t a, size_t b, size_t c, size_t d, size_t e, T t = T())\n : vector<vector4<T>>(a, vector4<T>(b, c, d, e, t)) {}\n };\n class GOmkarAndPies {\n public:\n vector<std::pair<int, int>> D;\n int N, M, K;\n void fix(int p) {\n for (int i = 0; i < K; ++i) {\n int s = p ^ 1 << i;\n if (D[s].first > D[p].first + 1) {\n D[s] = {D[p].first + 1, D[p].second};\n fix(s);\n }\n }\n };\n void solve(istream& cin, ostream& cout) {\n cin >> N >> M >> K;\n string S, T;\n cin >> S >> T;\n vector<std::pair<int, int>> P(N);\n cin >> P;\n for (std::pair<int, int>& p : P) {\n p.first--;\n p.second--;\n }\n vector<int> X(K);\n iota(X.begin(), X.end(), 0);\n vector<vector<int>> W{X};\n for (int i = 0; i < N; ++i) {\n swap(X[P[i].first], X[P[i].second]);\n vector<int> I(K);\n for (int j = 0; j < K; ++j) I[X[j]] = j;\n W.push_back(X);\n }\n auto apply = [&](int first, string S) {\n int p = 0;\n for (int i = 0; i < K; ++i) {\n p |= (S[i] - '0') << W[first][i];\n }\n return p;\n };\n D.assign(1 << K, {K + 1, -1});\n pair<int, std::pair<int, int>> ans{K + 1, {-1, -1}};\n for (int i = N - M; i >= 0; --i) {\n int TX = apply(i + M, T);\n D[TX] = {0, i + M};\n fix(TX);\n int SX = apply(i, S);\n ans = min(ans, {D[SX].first, {i + 1, D[SX].second}});\n }\n cout << K - ans.first << '\n' << ans.second << '\n';\n }\n };\n int main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n cout.tie(nullptr);\n GOmkarAndPies solver;\n std::istream& in(std::cin);\n std::ostream& out(std::cout);\n solver.solve(in, out);\n return 0;\n }\n "}
 
53
  {"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const long long INF = 1e18;\n const int maxn = 2e6 + 10;\n int a[maxn], cnt[maxn];\n long long sum[maxn];\n int main(void) {\n int n, x, y;\n scanf( %d %d %d , &n, &x, &y);\n int z = x / y;\n for (int i = 1; i <= n; i++)\n scanf( %d , a + i), cnt[a[i]]++, sum[a[i]] += a[i];\n for (int i = 1; i <= 2000000; i++) cnt[i] += cnt[i - 1], sum[i] += sum[i - 1];\n long long ans = INF;\n for (int i = 2; i <= 1000000; i++) {\n long long tmp = 0;\n int zz = min(z, i - 1);\n for (int j = 1; (j - 1) * i < 1000000; j++) {\n if (i - zz - 2 >= 0)\n tmp += (long long)(cnt[j * i - zz - 1] - cnt[j * i - i]) * x;\n if (zz)\n tmp += ((long long)i * j * (cnt[j * i - 1] - cnt[j * i - zz - 1]) -\n (sum[j * i - 1] - sum[j * i - zz - 1])) *\n y;\n }\n ans = min(ans, tmp);\n }\n printf( %I64d\n , ans);\n return 0;\n }\n "}
54
  {"func_code_string": "#include <bits/stdc++.h>\n using namespace std;\n const int md = 1e9 + 7;\n int n;\n char s[111];\n int f[111][3333];\n int main() {\n int t;\n f[0][0] = 1;\n for (int i = 1; i <= 100; ++i) {\n for (int j = 0; j <= 3000; ++j) {\n for (int c = 0; c <= min(j, 25); ++c) {\n f[i][j] += f[i - 1][j - c];\n f[i][j] %= md;\n }\n }\n }\n scanf( %d , &t);\n while (t--) {\n scanf( %s , s);\n int sum = 0;\n for (int i = 0; i < strlen(s); ++i) sum += s[i] - 'a';\n printf( %d\n , (f[strlen(s)][sum] + md - 1) % md);\n }\n return 0;\n }\n "}
55
  {"func_code_string": "#include <bits/stdc++.h>\n #pragma GCC optimize ( O3 )\n #pragma GCC target ( sse4 )\n \n using namespace std;\n \n typedef long long ll;\n typedef long double ld;\n typedef complex<ld> cd;\n \n typedef pair<int, int> pi;\n typedef pair<ll,ll> pl;\n typedef pair<ld,ld> pd;\n \n typedef vector<int> vi;\n typedef vector<ld> vd;\n typedef vector<ll> vl;\n typedef vector<pi> vpi;\n typedef vector<pl> vpl;\n typedef vector<cd> vcd;\n \n template<class T> using pq = priority_queue<T>;\n template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\n \n #define FOR(i, a, b) for (int i=a; i<(b); i++)\n #define F0R(i, a) for (int i=0; i<(a); i++)\n #define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)\n #define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)\n #define trav(a,x) for (auto& a : x)\n #define uid(a, b) uniform_int_distribution<int>(a, b)(rng)\n \n #define sz(x) (int)(x).size()\n #define mp make_pair\n #define pb push_back\n #define f first\n #define s second\n #define lb lower_bound\n #define ub upper_bound\n #define all(x) x.begin(), x.end()\n #define ins insert\n \n template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }\n template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }\n \n mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\n \n void __print(int x) {cerr << x;}\n void __print(long x) {cerr << x;}\n void __print(long long x) {cerr << x;}\n void __print(unsigned x) {cerr << x;}\n void __print(unsigned long x) {cerr << x;}\n void __print(unsigned long long x) {cerr << x;}\n void __print(float x) {cerr << x;}\n void __print(double x) {cerr << x;}\n void __print(long double x) {cerr << x;}\n void __print(char x) {cerr << '\'' << x << '\'';}\n void __print(const char *x) {cerr << '\ ' << x << '\ ';}\n void __print(const string &x) {cerr << '\ ' << x << '\ ';}\n void __print(bool x) {cerr << (x ? true : false );}\n \n template<typename T, typename V>\n void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << , ; __print(x.second); cerr << '}';}\n template<typename T>\n void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? , : ), __print(i); cerr << } ;}\n void _print() {cerr << ]\n ;}\n template <typename T, typename... V>\n void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << , ; _print(v...);}\n #ifdef DEBUG\n #define dbg(x...) cerr << \e[91m <<__func__<< : <<__LINE__<< [ << #x << ] = [ ; _print(x); cerr << \e[39m << endl;\n #else\n #define dbg(x...)\n #endif\n \n \n const int MOD = 1000000007;\n const char nl = '\n';\n const int MX = 200001; \n \n int dist[MX];\n int A[MX];\n set<pi> rem;\n pqg<pi> q;\n \n void add(int p, int pre, bool ty) {\n auto it1 = rem.lb({p, -1});\n if (it1 != rem.end()) {\n int v = it1->s;\n int d = max(pre, abs(A[v]-p));\n if (ty) {\n d = pre + abs(A[v]-p);\n }\n if (d < dist[v]) {\n dist[v] = d;\n q.push({d, v});\n }\n }\n if (it1 != rem.begin()) {\n it1--;\n int v = it1->s;\n int d = max(pre, abs(A[v]-p));\n if (ty) {\n d = pre + abs(A[v]-p);\n }\n if (d < dist[v]) {\n dist[v] = d;\n q.push({d, v});\n }\n }\n }\n \n void push(int p, int K) {\n while (rem.lb({p, -1}) != rem.end() && rem.lb({p, -1})->f <= p+K) {\n int x = rem.lb({p, -1})->s;\n rem.erase({A[x], x});\n q.push({K, x});\n dist[x] = K;\n }\n auto it = rem.lb({p, -1});\n while (it != rem.begin()) {\n it--;\n if (it->f < p-K) break;\n int x = it->s;\n rem.erase({A[x], x});\n q.push({K, x});\n dist[x] = K;\n it = rem.lb({p, -1});\n }\n }\n \n \n void solve() {\n int N, Q; cin >> N >> Q;\n F0R(i, N) dist[i] = 100000000;\n int S; cin >> S; S--;\n int D; cin >> D;\n F0R(i, N) {\n cin >> A[i];\n if (i != S) rem.ins({A[i], i});\n }\n dist[S] = 0;\n add(A[S]+D, 0, true);\n add(A[S]-D, 0, true);\n bool vis[MX]; F0R(i, N) vis[i] = false;\n while (!q.empty()) {\n int v = q.top().s;\n int d = q.top().f;\n q.pop();\n if (vis[v]) continue;\n vis[v] = true;\n //dbg(v, d);\n rem.erase({A[v], v});\n add(A[v], d, true);\n push(A[v]+D, d);\n push(A[v]-D, d);\n add(A[v]+D, 0, true);\n add(A[v]-D, 0, true);\n }\n /*F0R(i, N) {\n cout << dist[i] << ;\n }\n cout << nl;*/\n \n while(Q--) {\n int X, V; cin >> X >> V; X--;\n cout << (dist[X]<=V? Yes : No ) << nl;\n }\n }\n \n int main() {\n cin.tie(0)->sync_with_stdio(0); \n cin.exceptions(cin.failbit);\n \n int T = 1;\n // cin >> T;\n while(T--) {\n solve();\n }\n \n return 0;\n }\n \n \n "}