Submission

Score: 100

User: porpeang

Problemset: Croissant Beyond Peaks

Language: cpp

Time: 0.010 second

Submitted On: 2026-10-08 00:04:45

#include <bits/stdc++.h>
using namespace std;

int main(){
  int a=0;
  cin>>a;
  
  for(int i=0;i<a;i++){
    int b=0,c=0,d=0,e=0,i1=12345,i2=12345,r=0;
    string ko1,ko2;
    cin>>b;
    cin>>ko1;
    cin>>ko2;
    vector<char>vec={};
    vector<char>vev={};
    
    int start_col = -1, end_col = -1;
    for(int l = 0; l < b; l++){
      if(ko1[l] == 'S' || ko2[l] == 'S') {
        if(start_col == -1) start_col = l; else end_col = l;
      }
      if(ko1[l] == 'T' || ko2[l] == 'T') {
        if(start_col == -1) start_col = l; else end_col = l;
      }
    }
    if(start_col > end_col) swap(start_col, end_col);  
      
    for(int q = start_col; q <= end_col; q++){
      if(ko1[q] == '#' && ko2[q] == '#') {
        e++;
      }
      if(q + 1 <= end_col){
        if(ko1[q] == '#' && ko2[q+1] == '#') e++;
        if(ko2[q] == '#' && ko1[q+1] == '#') e++;
      }
    }

      if(e==0){
        cout<<"Yes"<<'\n';
      }
      else{
        cout<<"No"<<'\n';
      }
    
    

    
  }
}