제출 #1310304

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1310304		eliodr	Kartomat (COCI17_kartomat)	C++20	80 / 80	1 ms	576 KiB

kartomat

#include <iostream>
#include <vector>
using namespace std;

int main()
{
	int n;
	cin >> n;
	vector <string> v;
	vector<int> t;
	for (int i=0;i < n;i++){
		string a;
		cin >> a;
		v.push_back(a);
		t.push_back(i);
	}
	string w;
	cin >> w;
	vector <string> v1;
	vector <vector<char>> pre={
		{'*','*','*','A','B','C','D','E'},
        {'F','G','H','I','J','K','L','M'},
        {'N','O','P','Q','R','S','T','U'},
        {'V','W','X','Y','Z','*','*','*'}
	};
	vector <vector<char>> res={
		{'*','*','*','*','*','*','*','*'},
        {'*','*','*','*','*','*','*','*'},
        {'*','*','*','*','*','*','*','*'},
        {'*','*','*','*','*','*','*','*'}
	};
	for (int i=0;i < n;i++){
		if (v[i].size() > w.size()){
			bool flag=true;
			for (int y=0;y < w.size();y++){
				if (v[i][y]!=w[y]){
					flag=false;
				break;
				}
				
				}
				if (flag==true){
				v1.push_back(v[i]);
				
				//cout << v[i]<<endl;
			}
		
		}
	}
	for (int k3=0;k3 < v1.size();k3++){
		char q = v1[k3][w.size()];
		//cout << v1[k3][w.size()]<<endl;
	for (int k=0;k < 4;k++){
			for (int k1=0;k1 < 8;k1++){
					if (pre[k][k1]==q){
					res[k][k1]=q;
				//	cout << q <<endl;
					}
		
			//	cout << k <<" "<< k1<<endl;
				}
			}
	}
	
	
	for (int k=0;k < 4;k++){
			for (int k1=0;k1 < 8;k1++){
				cout << res[k][k1];
				}
				cout <<endl;
			}
	return 0;
}

• Subtask 1: 80 / 80