2 solutions
-
0
#include<bits/stdc++.h> using namespace std; const int N=1e7; int main() { unordered_map<int,string>p; int i,n,m,l1,r1,l2,r2; char s; cin>>n>>m; for(i=0;i<n;i++){ cin>>s; p[i+1]=s; } while(m--) { cin>>l1>>r1>>l2>>r2; string s1,s2; for(i=l1;i<=r1;i++){ s1+=p[i]; } for(i=l2;i<=r2;i++){ s2+=p[i]; } if(s1==s2){ cout<<"Yes"<<endl; } else{ cout<<"No"<<endl; } } return 0; }
Information
- ID
- 6530
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 8
- Tags
- # Submissions
- 34
- Accepted
- 7
- Uploaded By