Submission #879715

#TimeUsernameProblemLanguageResultExecution timeMemory
8797151075508020060209tcProgramiranje (COCI17_programiranje)C++14
80 / 80
104 ms13240 KiB
//#pragma gcc optimize("O2") #include <bits/stdc++.h> //#include<complex> using namespace std; #define int long long int n; string s; int ps[29][200005]; signed main(){ cin>>s; n=s.size(); s="*"+s; for(int i=1;i<=n;i++){ for(int c=0;c<=28;c++){ ps[c][i]=ps[c][i-1]; } ps[s[i]-'a'][i]++; } int Q; cin>>Q; while(Q--){ int a;int b;int l;int r; cin>>a>>b>>l>>r; if(b-a!=r-l){ cout<<"NE\n"; continue; } int ok=1; for(int i=0;i<=28;i++){ if(ps[i][b]-ps[i][a-1]!=ps[i][r]-ps[i][l-1]){ ok=0;break; } } if(ok){ cout<<"DA\n"; }else{ cout<<"NE\n"; } } }
#Verdict Execution timeMemoryGrader output
Fetching results...