Submission #11233821

---

Source Code Expand

#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
#include "numeric"
#include "cassert"
#include "ctime"

using namespace std;

constexpr long long int MOD = 1000000007;
//constexpr int MOD = 1000000007;
//constexpr int MOD = 998244353;
//constexpr long long int MOD = 998244353;
constexpr long double EPS = 1e-8;

long long int N, M, K, L, R, H, W;
//int N, M, K, L, R, H, W;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> N;
	string a, b;
	int flag = 1;
	while (a.size() < N) {
		if (flag) {
			a.push_back('#');
			b.push_back('#');
			cout << a << endl;
			cout << b << endl;
			char c;
			cin >> c;
			if (c == 'T') {
				continue;
			}
			a.pop_back();
			b.pop_back();
			a.push_back('#');
			b.push_back('.');
			cout << a << endl;
			cout << b << endl;
			cin >> c;
			if (c == 'T') {
				continue;
			}
			a.pop_back();
			b.pop_back();
			a.push_back('.');
			b.push_back('#');
			cout << a << endl;
			cout << b << endl;
			cin >> c;
			if (c == 'T') {
				continue;
			}
			a.pop_back();
			b.pop_back();
			a.push_back('.');
			b.push_back('.');
			cout << a << endl;
			cout << b << endl;
			cin >> c;
			if (c == 'T') {
				continue;
			}
			a.pop_back();
			b.pop_back();
			flag = false;
		}
		else {
			reverse(a.begin(), a.end());
			reverse(b.begin(), b.end());
			a.push_back('#');
			b.push_back('#');
			reverse(a.begin(), a.end());
			reverse(b.begin(), b.end());
			cout << a << endl;
			cout << b << endl;
			char c;
			cin >> c;
			if (c == 'T') {
				continue;
			}
			reverse(a.begin(), a.end());
			reverse(b.begin(), b.end());
			a.pop_back();
			b.pop_back();
			a.push_back('#');
			b.push_back('.');
			reverse(a.begin(), a.end());
			reverse(b.begin(), b.end());
			cout << a << endl;
			cout << b << endl;
			cin >> c;
			if (c == 'T') {
				continue;
			}
			reverse(a.begin(), a.end());
			reverse(b.begin(), b.end());
			a.pop_back();
			b.pop_back();
			a.push_back('.');
			b.push_back('#');
			reverse(a.begin(), a.end());
			reverse(b.begin(), b.end());
			cout << a << endl;
			cout << b << endl;
			cin >> c;
			if (c == 'T') {
				continue;
			}
			reverse(a.begin(), a.end());
			reverse(b.begin(), b.end());
			a.pop_back();
			b.pop_back();
			a.push_back('.');
			b.push_back('.');
			reverse(a.begin(), a.end());
			reverse(b.begin(), b.end());
			cout << a << endl;
			cout << b << endl;
			cin >> c;
			if (c == 'T') {
				continue;
			}
			reverse(a.begin(), a.end());
			reverse(b.begin(), b.end());
			a.pop_back();
			b.pop_back();
			reverse(a.begin(), a.end());
			reverse(b.begin(), b.end());
		}
	}
	cout << a << endl;
	cout << b << endl;
}

Submission Info

Judge Result