Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <string>
- using namespace std;
- int main() {
- string s;
- cin >> s;
- const int p = 31;
- vector<long long> p_pow(s.length());
- p_pow[0] = 1;
- for (size_t i = 1; i < p_pow.size(); ++i)
- p_pow[i] = p_pow[i - 1] * p;
- vector<long long> h(s.length());
- for (size_t i = 0; i < s.length(); ++i) {
- h[i] = (s[i] - 'a' + 1) * p_pow[i];
- if (i) h[i] += h[i - 1];
- }
- int m;
- cin >> m;
- for (int i = 0; i < m; ++i) {
- int l1, r1, l2, r2;
- cin >> l1 >> r1 >> l2 >> r2;
- l1--;
- r1--;
- l2--;
- r2--;
- int len = r1 - l1 + 1;
- int len2 = r2 - l2 + 1;
- if (len != len2) {
- cout << "No" << endl;
- continue;
- }
- long long h1 = h[l1 + len - 1];
- if (l1)
- h1 -= h[l1 - 1];
- long long h2 = h[l2 + len - 1];
- if (l2)
- h2 -= h[l2 - 1];
- if (l1 <= l2 && h1 * p_pow[l2 - l1] == h2 ||
- l1 > l2 && h1 == h2 * p_pow[l1 - l2])
- cout << "Yes" << endl;
- else
- cout << "No" << endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement