Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- #define pb push_back
- vector<int>sorted,unsorted;
- int main()
- {
- int n;
- scanf("%d",&n);
- int i,x,pos;
- for(i=0; i<n; i++)
- {
- scanf("%d",&x);
- sorted.pb(x);
- unsorted.pb(x);
- }
- sort(sorted.begin(),sorted.end());
- string s;
- cin>>s;
- for(i=0; i<n-1; i++)
- {
- if(s[i]=='1')
- {
- pos=i;
- while(s[i]=='1')
- i++;
- sort(unsorted.begin()+pos,unsorted.begin()+i+1);
- }
- }
- if(sorted==unsorted)
- printf("YES\n");
- else
- printf("NO\n");
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement