# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
654965 | Bliznetc | Programiranje (COCI17_programiranje) | C++17 | 26 ms | 5836 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#pragma GCC target("avx2")
using namespace std;
#define pb push_back
#define sz size()
#define all(x) x.begin(), x.end()
#define F first
#define S second
typedef pair < int, int > pii;
typedef vector < int > vi;
typedef vector < vi > vvi;
int pref[100100][27];
void solve(){
string s;
cin >> s;
int n = s.sz;
s = '+' + s;
for (int i = 1; i <= n; i++) {
pref[i][s[i] - 'a'] = 1;
for (int j = 0; j < 26; j++) {
pref[i][j] += pref[i - 1][j];
}
}
int q;
cin >> q;
while (q--) {
int a, b, c, d;
cin >> a >> b >> c >> d;
bool ok = 1;
for (int i = 0; i <= 25; i++) {
ok &= (pref[b][i] - pref[a - 1][i] == pref[d][i] - pref[c - 1][i]);
}
cout << (ok == 1 ? "DA" : "NE") << "\n";
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int t = 1;
//cin >> t;
while (t--) {
solve();
cout << "\n";
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |