Submission #1171480

#	Time	Username	Problem	Language	Result	Execution time	Memory
1171480		nuutsnoynton	Mobitel (COCI14_mobitel)	C++20	50 / 50	0 ms	328 KiB

mobitel

#include<bits/stdc++.h>

using namespace std;
using ll = long long;

int main() {
	ll n, m, r, x, y, i, j,p, ans, t;

	map < char, pair < ll, ll > > A;
	
	A['a'] = make_pair(2, 1);
	A['b'] = make_pair(2, 2);
	A['c'] = make_pair(2, 3);
	A['d'] = make_pair(3, 1);
	A['e'] = make_pair(3, 2);
	A['f'] = make_pair(3, 3);
	A['g'] = make_pair(4, 1);
	A['h'] = make_pair(4, 2);
	A['i'] = make_pair(4, 3);
	A['j'] = make_pair(5, 1);
	A['k'] = make_pair(5, 2);
	A['l'] = make_pair(5, 3);
	A['m'] = make_pair(6, 1);
	A['n'] = make_pair(6, 2);
	A['o'] = make_pair(6, 3);
	A['p'] = make_pair(7, 1);
	A['q'] = make_pair(7, 2);
	A['r'] = make_pair(7, 3);
	A['s'] = make_pair(7, 4);
	A['t'] = make_pair(8, 1);
	A['u'] = make_pair(8, 2);
	A['v'] = make_pair(8, 3);
	A['w'] = make_pair(9, 1);
	A['x'] = make_pair(9, 2);
	A['y'] = make_pair(9, 3);
	A['z'] = make_pair(9, 4);
	
	ll a[10];
	for (i = 1; i <= 9; i ++) {
		cin >> x;
		a[x] = i;
	}
	
	string str;
	
	cin >> str;
	
	for (i = 0; i < str.size(); i ++) {
		r = a[A[str[i]].first];
		if (i != 0 && a[A[str[i]].first] == a[A[str[i - 1]].first]) {
			cout << "#";
		}
		p = A[str[i]].second;
		while (p --) {
			cout << r;	
		}
	}	
	cout << "\n";
}

• Subtask 1: 50 / 50