Submission #624928

#TimeUsernameProblemLanguageResultExecution timeMemory
624928DrollWolfProgramiranje (COCI17_programiranje)C++17
0 / 80
3080 ms1300 KiB
#include <bits/stdc++.h> using namespace std; typedef long long int lli; //const int N = 50e5+5; //int arr[N]; int main() { lli q, a, b, c, d, i, j; string str; cin>>str>>q; for(i=0;i<q;i++) { cin>>a>>b>>c>>d; vector<lli> x(26, 0); vector<lli> y(26, 0); if((b-a+1)==(d-c+1)) { for(j=a-1;j<b;j++) x[str[j]-'a']++; for(j=c-1;j<d;j++) y[str[j]-'a']++; bool ans=true; for(j=0;j<b-a+1;j++) { if(x[j]!=y[j]) { ans=false; break; } } if(ans) cout<<"DA"<<'\n'; else cout<<"NE"<<'\n'; } else cout<<"NE"<<'\n'; } //freopen("diamond.in","r",stdin); //freopen("diamond.out","w",stdout); }
#Verdict Execution timeMemoryGrader output
Fetching results...