Language: C++

#include <iostream>
#include <vector>
#include<list>
#include <algorithm>
#include <string>
#include <math.h>
#include<map>
#include <utility>

#include<queue>
using namespace std;
#define REP(i,k,n) for(int i=k;i<n;i++)
 
#define INF 1844674407370955161
typedef long long unsigned int ll;
#define SIZE_OF_ARRAY(array) (sizeof(array)/sizeof(array[0]))
#define MOD 1000000007

template<typename T>
int vector_finder(std::vector<T> vec, T number) {
  auto itr = std::find(vec.begin(), vec.end(), number);
  size_t index = std::distance( vec.begin(), itr );
  if (index != vec.size()) { // 発見できたとき
    return 1;
  }
  else { // 発見できなかったとき
    return 0;
  }
}

template<typename T>
T gcd(T a,T b){
	if(b>0){
		return gcd(b, a % b);
	}else{
		return a;
	}
}

template<typename T>
T lcm(T a,T b){
	T g = gcd(a, b);
	return a * b / g;
}

void clear( std::queue<pair<int,int> > &q )
{
   std::queue<pair<int,int> > empty;
   std::swap( q, empty );
}
bool IsPrime(int num)
{
    if (num < 2) return false;
    else if (num == 2) return true;
    else if (num % 2 == 0) return false; // 偶数はあらかじめ除く

    double sqrtNum = sqrt(num);
    for (int i = 3; i <= sqrtNum; i += 2)
    {
        if (num % i == 0)
        {
            // 素数ではない
            return false;
        }
    }

    // 素数である
    return true;
}
template<typename T>
std::vector<T> enum_div(T n)//nの約数を列挙
{
	std::vector<T> ret;
	for(T i=1 ; i*i<=n ; ++i)
	{
		if(n%i == 0)
		{
			ret.push_back(i);
			if(i!=1 && i*i!=n)
			{
				ret.push_back(n/i);
			}
		}
	}
	return ret;
}

int N,K;


int main()
{
  cin>>N;
  int A, B, C, D;
  string S;
  cin >> A >> B >> C >> D >> S;

  A--;
  B--;
  C--;
  D--;
  bool r = false;
  REP(i, A, C)
  {
    if(!r&&S[i]=='#'){
      r = true;
    }else if(r&&S[i]=='#'){
      cout << "NO" << endl;
      return 0;
    }else if(S[i]=='.'){
      r = false;
    }
  }
  r = false;
  REP(i, B, D)
  {
    if(!r&&S[i]=='#'){
      r = true;
    }else if(r&&S[i]=='#'){
      cout << "NO" << endl;
      return 0;
    }else if(S[i]=='.'){
      r = false;
    }
  }

  if(C<D){
    cout << "YES" << endl;
    return 0;
  }
  else
  {
    int count = 0;
    REP(i, B, D+2)
    {
      if(S[i]=='#'){
        count = 0;
      }else{
        count++;
      }
      if(count>=3){
        cout << "YES" << endl;
        return 0;
      }
    }
  }
  cout << "NO" << endl;
  return 0;
}#include <iostream>
#include <vector>
#include<list>
#include <algorithm>
#include <string>
#include <math.h>
#include<map>
#include <utility>

#include<queue>
using namespace std;
#define REP(i,k,n) for(int i=k;i<n;i++)
 
#define INF 1844674407370955161
typedef long long unsigned int ll;
#define SIZE_OF_ARRAY(array) (sizeof(array)/sizeof(array[0]))
#define MOD 1000000007

template<typename T>
int vector_finder(std::vector<T> vec, T number) {
  auto itr = std::find(vec.begin(), vec.end(), number);
  size_t index = std::distance( vec.begin(), itr );
  if (index != vec.size()) { // 発見できたとき
    return 1;
  }
  else { // 発見できなかったとき
    return 0;
  }
}

template<typename T>
T gcd(T a,T b){
	if(b>0){
		return gcd(b, a % b);
	}else{
		return a;
	}
}

template<typename T>
T lcm(T a,T b){
	T g = gcd(a, b);
	return a * b / g;
}

void clear( std::queue<pair<int,int> > &q )
{
   std::queue<pair<int,int> > empty;
   std::swap( q, empty );
}
bool IsPrime(int num)
{
    if (num < 2) return false;
    else if (num == 2) return true;
    else if (num % 2 == 0) return false; // 偶数はあらかじめ除く

    double sqrtNum = sqrt(num);
    for (int i = 3; i <= sqrtNum; i += 2)
    {
        if (num % i == 0)
        {
            // 素数ではない
            return false;
        }
    }

    // 素数である
    return true;
}
template<typename T>
std::vector<T> enum_div(T n)//nの約数を列挙
{
	std::vector<T> ret;
	for(T i=1 ; i*i<=n ; ++i)
	{
		if(n%i == 0)
		{
			ret.push_back(i);
			if(i!=1 && i*i!=n)
			{
				ret.push_back(n/i);
			}
		}
	}
	return ret;
}

int N,K;


int main()
{
  cin>>N;
  int A, B, C, D;
  string S;
  cin >> A >> B >> C >> D >> S;

  A--;
  B--;
  C--;
  D--;
  bool r = false;
  REP(i, A, C)
  {
    if(!r&&S[i]=='#'){
      r = true;
    }else if(r&&S[i]=='#'){
      cout << "NO" << endl;
      return 0;
    }else if(S[i]=='.'){
      r = false;
    }
  }
  r = false;
  REP(i, B, D)
  {
    if(!r&&S[i]=='#'){
      r = true;
    }else if(r&&S[i]=='#'){
      cout << "NO" << endl;
      return 0;
    }else if(S[i]=='.'){
      r = false;
    }
  }

  if(C<D){
    cout << "YES" << endl;
    return 0;
  }
  else
  {
    int count = 0;
    REP(i, B, D+2)
    {
      if(S[i]=='#'){
        count = 0;
      }else{
        count++;
      }
      if(count>=3){
        cout << "YES" << endl;
        return 0;
      }
    }
  }
  cout << "NO" << endl;
  return 0;
}

Compiler output:
a.cc:149:2: error: stray '#' in program
  149 | }#include <iostream>
      |  ^
a.cc:149:3: error: 'include' does not name a type
  149 | }#include <iostream>
      |   ^~~~~~~
a.cc:168:5: error: redefinition of 'template<class T> int vector_finder(std::vector<_Tp>, T)'
  168 | int vector_finder(std::vector<T> vec, T number) {
      |     ^~~~~~~~~~~~~
a.cc:20:5: note: 'template<class T> int vector_finder(std::vector<_Tp>, T)' previously declared here
   20 | int vector_finder(std::vector<T> vec, T number) {
      |     ^~~~~~~~~~~~~
a.cc:180:3: error: redefinition of 'template<class T> T gcd(T, T)'
  180 | T gcd(T a,T b){
      |   ^~~
a.cc:32:3: note: 'template<class T> T gcd(T, T)' previously declared here
   32 | T gcd(T a,T b){
      |   ^~~
a.cc:189:3: error: redefinition of 'template<class T> T lcm(T, T)'
  189 | T lcm(T a,T b){
      |   ^~~
a.cc:41:3: note: 'template<class T> T lcm(T, T)' previously declared here
   41 | T lcm(T a,T b){
      |   ^~~
a.cc:194:6: error: redefinition of 'void clear(std::queue<std::pair<int, int> >&)'
  194 | void clear( std::queue<pair<int,int> > &q )
      |      ^~~~~
a.cc:46:6: note: 'void clear(std::queue<std::pair<int, int> >&)' previously defined here
   46 | void clear( std::queue<pair<int,int> > &q )
      |      ^~~~~
a.cc:199:6: error: redefinition of 'bool IsPrime(int)'
  199 | bool IsPrime(int num)
      |      ^~~~~~~
a.cc:51:6: note: 'bool IsPrime(int)' previously defined here
   51 | bool IsPrime(int num)
      |      ^~~~~~~
a.cc:219:16: error: redefinition of 'template<class T> std::vector<_Tp> enum_div(T)'
  219 | std::vector<T> enum_div(T n)//nの約数を列挙
      |                ^~~~~~~~
a.cc:71:16: note: 'template<class T> std::vector<_Tp> enum_div(T)' previously declared here
   71 | std::vector<T> enum_div(T n)//nの約数を列挙
      |                ^~~~~~~~
a.cc:236:5: error: redefinition of 'int N'
  236 | int N,K;
      |     ^
a.cc:88:5: note: 'int N' previously declared here
   88 | int N,K;
      |     ^
a.cc:236:7: error: redefinition of 'int K'
  236 | int N,K;
      |       ^
a.cc:88:7: note: 'int K' previously declared here
   88 | int N,K;
      |       ^
a.cc:239:5: error: redefinition of 'int main()'
  239 | int main()
      |     ^~~~
a.cc:91:5: note: 'int main()' previously defined here
   91 | int main()
      |     ^~~~