Submission #1143849

#	Time	Username	Problem	Language	Result	Execution time	Memory
1143849		THXuan	고장난 휴대전화기 (COCI14_mobitel)	C++20	50 / 50	0 ms	328 KiB

mobitel

#include <iostream>
#include <vector>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#define INF 1e9
using namespace std;
typedef long long ll;

string grid[10];

void solve()
{
	grid[2] = "abc";
	grid[3] = "def";
	grid[4] = "ghi";
	grid[5] = "jkl";
	grid[6] = "mno";
	grid[7] = "pqrs";
	grid[8] = "tuv";
	grid[9] = "wxyz";
	map<int, int>vis;
	for (int i = 1; i <= 9; i++) {
		int num; cin >> num;
		vis[num] = i;
	}
	string s; cin >> s;
	int prevnum = 0;
	for (int i = 0; i < s.size(); i++) {
		int num = 0; int idx = 0;
		for (int j = 2; j <= 9; j++) {
			for (int k = 0; k < grid[j].size(); k++) {
				if (grid[j][k] == s[i]) {
					num = j; idx = k + 1; break;
				}
			}
		}
		if (num == prevnum)cout << "#";
		for (int j = 1; j <= idx; j++)cout << vis[num];
		prevnum = num;
	}
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t = 1; //cin>>t;
	while (t--) solve();
	return 0;
}

• Subtask 1: 50 / 50