Submission #3404095

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>
#include <stack>


using namespace std;
using ll = long long;
using ull = unsigned long long;

const ll INF = 1e16;
const ll MOD = 1e9 + 7;

#define REP(i, n) for(ll i = 0; i < n; i++)
#define Yes(condition) if(condition){ cout << "Yes" << '\n'; }else{ cout << "No" << '\n'; }
#define YES(condition) if(condition){ cout << "YES" << '\n'; }else{ cout << "NO" << '\n'; }
#define yes(condition) if(condition){ cout << "yes" << '\n'; }else{ cout << "no" << '\n'; }





int main() {
    ll n;
    cin >> n;
    string s[2];
    REP(i, n){
        string t;
        
        s[0] += ".";
        s[1] += ".";
        cout << s[0] << endl << s[1] << endl;
        cin >> t;
        if(t == "end") return 0;
        if(t == "T") continue;
        
        s[0][i] = '#';
        cout << s[0] << endl << s[1] << endl;
        cin >> t;
        if(t == "end") return 0;
        if(t == "T") continue;
        
        s[0][i] = '.';
        s[1][i] = '#';
        cout << s[0] << endl << s[1] << endl;
        cin >> t;
        if(t == "end") return 0;
        if(t == "T") continue;
        
        s[0][i] = '#';
        cout << s[0] << endl << s[1] << endl;
        cin >> t;
        if(t == "end") return 0;
    }
}

Submission Info

Judge Result