# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1100767 | 2024-10-14T15:50:26 Z | Choco | Mobitel (COCI14_mobitel) | C++14 | 1 ms | 460 KB |
#include<bits/stdc++.h> using namespace std; #define Study ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) #define ll long long #define pb push_back #define ff first #define ss second #define fori for(ll i=0;i<n;i++) #define ins insert vector<string>ori(10); void namethem(){ ori[1]=""; ori[2]="abc"; ori[3]="def"; ori[4]="ghi"; ori[5]="jkl"; ori[6]="mno"; ori[7]="pqrs"; ori[8]="tuv"; ori[9]="wxyz"; } void work(){ ll n=9; vector<pair<ll,ll>>letter(26); namethem(); for(ll i=1;i<=n;i++){ ll k; cin>>k; for(ll j=0;j<ori[k].size();j++){ char c=ori[k][j]; letter[c-'a']={i,j+1}; } } string s; cin>>s; string s1=""; for(ll i=0;i<s.size();i++){ char l=s[i]; int ind=s[i]-'a'; string fir=to_string(letter[ind].ff); if(s1==""){ for(ll j=0;j<letter[ind].ss;j++) s1=s1+fir; } else{ string last; last+=s1[s1.size()-1]; if(last==fir) s1+="#"; for(ll j=0;j<letter[ind].ss;j++) s1=s1+fir; } } cout<<s1; } int main(){ Study; ll t=1; //cin>>t; while(t--){ work(); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 336 KB | Output is correct |
2 | Correct | 1 ms | 336 KB | Output is correct |
3 | Correct | 1 ms | 348 KB | Output is correct |
4 | Correct | 1 ms | 336 KB | Output is correct |
5 | Correct | 1 ms | 336 KB | Output is correct |
6 | Correct | 1 ms | 336 KB | Output is correct |
7 | Correct | 1 ms | 336 KB | Output is correct |
8 | Correct | 1 ms | 336 KB | Output is correct |
9 | Correct | 1 ms | 336 KB | Output is correct |
10 | Correct | 1 ms | 460 KB | Output is correct |