O and Z task for Oz! : HackerEarth Problem Solution

O and Z task for Oz! : HackerEarth Problem Solution

#include <iostream> #include<cstring> #define MAX 1000000 using namespace std; int main() { long int T; char str[MAX],cpy[MAX]; //cin>>T; scanf("%llu",&T); while(T--) { cin>>str; strcpy(cpy,str); long int n=strlen(str); long int l=0; long int r=n-1; long int moves=0; while(l<r) { while(str[l]=='O' && l<r) l++; while(str[r]=='Z' && l<r) r--; if(l<r) { str[l]='O'; str[r]='Z'; moves=moves+(r-l); l++; r--; } } l=0; r=n-1; long int count=0; while(l<r) { while(cpy[l]=='Z' && l<r) l++; while(cpy[r]=='O' && l<r) r--; if(l<r) { cpy[l]='Z'; cpy[r]='O'; count=count+(r-l); l++; r--; } } long int out=count<moves?count:moves; cout<<out<<"\n"; } return 0; }