# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
299775 | theshadow_04 | Mobitel (COCI14_mobitel) | C++14 | 1 ms | 384 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.
// VU TRUONG AN
#include <bits/stdc++.h>
#define F first
#define S second
#define MOD 1000000007
#define pb push_back
#define bit(x,p) ((x>>p) & 1)
#define ll long long
#define Task "MOBITEL"
using namespace std;
const int base = 100003;
const int maxn = 100005;
string s[9] = {"000","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
map<char,int> M,sl;
int main(){
ios_base::sync_with_stdio(0);
cout.tie(0); cin.tie(0);
if(fopen(Task".inp","r")){
freopen(Task".inp","r",stdin);
freopen(Task".out","w",stdout);
}
for(int i = 1;i <= 9;++i){
int a;
cin >> a;
if(i > 1){
for(int j = 0;j < s[i - 1].length();++j){
char c = s[i - 1][j];
M[c] = a;
sl[c] = j + 1;
}
}
}
string res;
cin >> res;
for(int i = 0;i < res.length();++i){
if(M[res[i]] == M[res[i - 1]]) cout << '#';
for(int j = 1;j <= sl[res[i]];++j) cout << M[res[i]];
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |