Submission #225207

#TimeUsernameProblemLanguageResultExecution timeMemory
225207baoduytran0104Programiranje (COCI17_programiranje)C++14
80 / 80
197 ms6564 KiB
#include <bits/stdc++.h> using namespace std; int a[50005][30], n, t, e, b,c , d; string s; int main() { cin >> s; n = s.size(); s = ' ' + s; for(int i = 1; i <= n; ++i) { for(int j = 0; j < 26; ++j) { a[i][j] = a[i - 1][j] + (s[i] - 'a' == j); } } cin >> t; while(t--) { cin >> e >> b >> c >> d; if(b - e != d - c) { cout << "NE\n"; continue; } bool check = 1; for(int i = 0; i < 26; ++i) { if (a[b][i] - a[e - 1][i] != a[d][i] - a[c - 1][i]) { check = 0; break; } } cout << (check ? "DA" : "NE") << '\n'; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...