# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
919031 | TIN | Mobitel (COCI14_mobitel) | C++17 | 1 ms | 856 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define FNAME "test"
#define sz(s) (int) (s).size()
unordered_map<char,pair<int,int>> mp;
const string base[11] = {"", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
int digits[10];
string s;
void Task() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cout << fixed << setprecision(9);
if (fopen(FNAME".inp","r")) {
freopen(FNAME".inp","r",stdin);
freopen(FNAME".out","w",stdout);
}
}
void Solve() {
//Your Code
for (int i = 1; i <= 9; i++) {
cin >> digits[i];
for (int j = 0; j < sz(base[digits[i]]); j++) mp[base[digits[i]][j]] = {i, j + 1};
}
cin >> s;
char pc = '.';
for (char c : s) {
int num = mp[c].first;
char cn = '0' + num;
if (pc != '.') {
if (mp[pc].first == num) cout << '#';
}
int j = mp[c].second;
for (int i = 1; i <= j; i++) cout << cn;
pc = c;
}
}
int main() {
Task();
Solve();
cerr << "\nTime run: " << 1000*clock()/CLOCKS_PER_SEC << "ms";
return 37^37;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |