Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include<cstdio>
- #include<vector>
- #include<algorithm>
- #include<cstring>
- #include<map>
- #include <utility>
- using namespace std;
- map<pair<int,int>,int> m;
- char s[111111];
- int main()
- {
- int n,t,i,j,l,x,y;
- scanf("%d",&t);
- while(t--) {
- scanf("%s",s);
- l=strlen(s);
- x=y=0;
- m.clear();
- m[make_pair(0,0)]=1;
- for(i=0; i<l; i++) {
- switch(s[i]) {
- case '0':
- x++;
- break;
- case '1':
- y++;
- break;
- case '2':
- x--;
- break;
- case '3':
- y--;
- break;
- }
- if(m[make_pair(x,y)])
- break;
- m[make_pair(x,y)]=1;
- }
- if(i==l-1&&!x&&!y)
- printf("YES");
- else printf("NO");
- if(t)
- printf("\n");
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement