Submission #1194919

#TimeUsernameProblemLanguageResultExecution timeMemory
1194919liuchenxi0527Programiranje (COCI17_programiranje)C++20
80 / 80
2167 ms680 KiB
#include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <cstring> #include <string> #include <algorithm> #include <vector> #include <stack> #include <queue> #include <cctype> #include <map> #include <set> using namespace std; long long a[30],b[30]; int main() { string s; cin>>s; int T; cin>>T; while(T--) { long long x1,y1,x2,y2; cin>>x1>>y1>>x2>>y2; for(long long i=x1-1;i<=y1-1;i++) { int f=(int)(s[i]-'a'); a[f]++; // cout<<s[i]<<" "<<f<<" "; } // cout<<endl; for(long long i=x2-1;i<=y2-1;i++) { int f=(int)(s[i]-'a'); b[f]++; // cout<<s[i]<<" "<<f<<" "; } // cout<<endl; bool p=true; bool bbj=false; for(int i=0;i<26;i++) { if(a[i]!=b[i]&&bbj!=true) { cout<<"NE"<<endl; bbj=true; // cout<<a[i]<<" "<<b[i]<<endl; // cout<<i<<endl; p=false; } a[i]=0; b[i]=0; } if(p==true) { cout<<"DA"<<endl; } } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...