#include <string>
#include <vector>
#include <map>
using namespace std;

int solution(vector<vector<int>> board, vector<int> moves) {
    int answer = 0;
    
    map<int,vector<int>> temp;
    vector<int> temp_val;
    for(vector<int>::size_type i =0; i<board.size(); i++){
        for(vector<int>::size_type j =0; j<board[i].size();j++){
            temp_val.push_back(board[j][i]);
        }
        pair<int, vector<int>> temp_pair(i+1,temp_val);
        temp_val.clear();
        temp.insert(temp_pair);
    }
    vector<int> temp_answer;
    for (vector<int>::size_type i = 0; i < moves.size(); i++) 
	{
		for (vector<int>::size_type j = 0; j < temp[moves[i]].size(); j++) 
		{
			if (temp[moves[i]][j] == 0) continue;

			temp_answer.push_back(temp[moves[i]][j]);
			temp[moves[i]].erase(temp[moves[i]].begin() + j);
			if (temp_answer.size() == 1) {
				break;
			}
			if (temp_answer[temp_answer.size() - 1] == temp_answer[temp_answer.size() - 2]) {
				answer += 2;
				temp_answer.erase(temp_answer.begin() + (temp_answer.size() - 1));
				temp_answer.erase(temp_answer.begin() + (temp_answer.size() - 1));
			}
			break;
		}
	}
    
    return answer;
}