[1차] 비밀지도

#include <string>
#include <vector>

using namespace std;

vector<string> make_map(vector <int> arr, int n)
{
    vector<string> result;
    int i, j;
    int A;
    string temp = "";
    
    for(i = 0; i < n; i++)
    {
        A = arr[i];
        for(j = 0; j < n - 1; j++)
        {
            temp = to_string(A % 2) + temp;
            A = A / 2;
        }
        temp = to_string(A) + temp;
        result.push_back(temp);
    }
    
    return result;
}

vector<string> solution(int n, vector<int> arr1, vector<int> arr2) 
{
    vector<string> answer;
    vector<string> map1;
    vector<string> map2;
    int i, j;
    string temp;
    
    map1 = make_map(arr1, n);
    map2 = make_map(arr2, n);
    
    for(i = 0; i < n; i++)
    {
        temp = "";
        for(j = 0; j < n; j++)
        {
            if(map1[i][j] == '1' || map2[i][j] == '1')
            {
                temp += "#";
            }
            else
            {
                temp += " ";
            }
        }
        answer.push_back(temp);
    }
    
    return answer;
}