Submission #3168677

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
using namespace std;
const int INF=1145141919,MOD=1e9+7;
const long long LINF=8101145141919364364;

int main(){
	int n; cin>>n;
	string r,s1,s2;
	string eins[]={".",".","#","#"};
	string zwei[]={".","#",".","#"};
	bool side=1;
	while(1){
		rep(i,3){
			string tmp1=(side?s1+eins[i]:eins[i]+s1);
			string tmp2=(side?s2+zwei[i]:zwei[i]+s2);
			cout<<tmp1<<"\n"<<tmp2<<"\n"; fflush(stdout);
			cin>>r;
			if(r=="end") return 0;
			if(r=="T"){
				s1=tmp1;
				s2=tmp2;
				break;
			}else if(i==2){
				tmp1=(side?s1+eins[3]:eins[3]+s1);
				tmp2=(side?s2+zwei[3]:zwei[3]+s2);
				s1=tmp1;
				s2=tmp2;
				break;
			}
		}
		int x=s1.size();
		if(x==n){
			cout<<s1<<"\n"<<s2<<"\n"; fflush(stdout);
			cin>>r;
			if(r=="end") return 0;
			s1=s1.substr(0,n-1);
			s2=s2.substr(0,n-1);
			side=0;
		}
	}
	return 0;
}

Submission Info

Judge Result