# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
754710 | Unforgettablepl | Programiranje (COCI17_programiranje) | C++17 | 33 ms | 13772 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.
/*
ID: samikgo1
TASK:
LANG: C++
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define f first
#define s second
//#define x first
//#define y second
const int INF = INT32_MAX;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
// freopen("haybales.in","r",stdin);
// freopen("haybales.out","w",stdout);
string s;ll q;
cin >> s >> q;
s.insert(0," ");
vector<vector<ll>> prefix(s.length()+1,vector<ll>(26));
for (int i = 1; i < s.length(); i++) {
prefix[i] = prefix[i-1];
prefix[i][s[i]-'a']++;
}
for (int i = 0; i < q; i++) {
ll a,b,c,d;
cin >> a >> b >> c >> d;
for (int j = 0; j < 26; j++) {
if(prefix[b][j]-prefix[a-1][j]!=prefix[d][j]-prefix[c-1][j]){
cout << "NE\n";goto skip;
}
}
cout << "DA\n";
skip:
continue;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |