# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
225201 | ngot23 | Programiranje (COCI17_programiranje) | C++11 | 38 ms | 7688 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>
using namespace std;
const int N=50005;
string s;
int cnt[N][30]; /// cnt[i][j]: so luong ki tu j tu vi tri 1 den vi tri i
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
if(fopen(".inp", "r")) freopen(".inp", "r", stdin);
cin >> s;
int n=s.size();
s=' '+s;
for(int i=1 ; i<=n ; ++i) {
for(int j=0 ; j<26 ; ++j) {
cnt[i][j]=cnt[i-1][j] + (s[i]-'a' == j);
}
}
int T; cin >> T;
while(T--) {
int a, b, c, d;
cin >> a >> b >> c >> d;
if(b-a != d-c) {
cout << "NE\n";
continue;
}
bool check=1;
for(int i=0 ; i<26 ; ++i) {
if(cnt[b][i]-cnt[a-1][i] != cnt[d][i]-cnt[c-1][i]) {
check=0;
break;
}
}
cout << (check ? "DA" : "NE") << '\n';
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |