Submission #1484428

---

Source Code Expand

#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <cmath>
#include <complex>

#include <string>
#include <cstring>
#include <vector>
#include <tuple>
#include <bitset>

#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <fstream>
#include <random>
//#include <time.h>
#include <ctime>
#pragma endregion //#include
/////////
#define REP(i, x, n) for(int i = x; i < n; ++i)
#define rep(i,n) REP(i,0,n)
#define ALL(X) X.begin(), X.end()
/////////
#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef std::pair<LL,LL> PLL;//
typedef std::pair<int,int> PII;//
#pragma endregion //typedef
////定数
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)1e18+20;
const double PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;

bool END = false;
int ENDcount = 0;
vector< vector< vector<int> > > word(7);

bool check(vector<int> v){
	++ENDcount;
	if( ENDcount > 420 ){
		END = true;
		return true;
	}
	int size = v.size();
	string A,B;
	for(int i=0;i<size;++i){
		if( v[i]&1 ){
			A += '#';
		}else{
			A += '.';
		}
		if( v[i]&2 ){
			B += '#';
		}else{
			B += '.';
		}
	}
	cout << A << '\n' << B << endl;
	string res;
	cin >> res;
	if( res[0] == 'T' ){
		return true;
	}else if( res[0] == 'F' ){
		return false;
	}
	END = true;
	return true;
}

void make(int POW ){
	if( POW == 0 ){
		vector<int> temp(1);
		for(int i=0;i<4;++i){
			temp[0] = i;
			if( check( temp ) ){
				word[POW].push_back( temp );
			}
		}
		return;
	}
	vector< vector<int> >::iterator itrA,itrB,begin,end;
	begin = word[POW-1].begin();
	end = word[POW-1].end();
	for(itrA=begin;itrA != end;++itrA){
		for(itrB=begin;itrB != end;++itrB){
			vector<int> temp;
			temp.reserve( 1<<POW );
			temp.insert( temp.end(), itrA->begin(),itrA->end() );
			temp.insert( temp.end(), itrB->begin(),itrB->end() );
			if( check( temp ) ){
				word[POW].push_back( temp );
			}
		}
	}
}

void f(int N,int POW){
	int LEN = (1<<POW);
	int over =2*LEN-N;
	vector< vector<int> >::iterator itrA,itrB,begin,end;
	begin = word[POW].begin();
	end = word[POW].end();
	vector<int> temp(N);
	for(itrA=begin;itrA != end;++itrA){
		for(itrB=begin;itrB != end;++itrB){
			bool flag = true;
			for(int i=0;i<over;++i){
				if( itrA[LEN-1-i] != itrB[over-1-i] ){
					flag = false;
					break;
				}
			}
			if( flag == false ) continue;
			for(int i=0;i<N;++i){
				if( i < LEN ){
					temp[i] = (*itrA)[i];
				}else{
					temp[i] = (*itrB)[i-(N-LEN)];
				}
			}
			if( check( temp ) ){
				if( END ){
					return;
				}
			}
		}
	}
}
void solve(){
	int N;
	cin >> N;
	
	int Len = 0;
	for(Len=0;(1<<Len)<=N;++Len){
		make(Len);
		if( END ){
			return;
		}
	}
	Len >>= 1;
	f(N,Len);
}

#pragma region main
signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	std::cout << std::fixed;//小数を10進数表示
	cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別	

	solve();
}
#pragma endregion //main()

Submission Info

Judge Result