# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
406887 | LptN21 | Mobitel (COCI14_mobitel) | C++17 | 1 ms | 204 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 fastIO ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define FF first
#define SS second
#define pb push_back
#define sz(x) (int)x.size()
#define oo 1e9
#define eps 1e-9
#define PI acos(-1.0)
#define lb lower_bound
#define ub upper_bound
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> ii;
const int N = 250000+7, M=1000+7;
const int MOD = 1e9+7;
int n, m, k, t;
vector<char> ch[10];
int idx[10];
ii qry(char c) {
for(int i=2;i<10;i++)
for(int j=0;j<sz(ch[i]);j++)
if(ch[i][j]==c) return ii(i, j+1);
}
signed main() {
//freopen("test.inp", "r", stdin);
//freopen("test.out", "w", stdout);
//fastIO;
for(int cnt, j=0, i=2;i<10;i++) {
if(i==7||i==9) cnt=4;else cnt=3;
for(int k=0;k<cnt;j++, k++) ch[i].pb(j+'a');
}
for(int j, i=1;i<10;idx[j]=i++) scanf("%d", &j);
char s[100];scanf("%s", &s);
for(int i=0;i<strlen(s);i++) {
ii p=qry(s[i]);
if(i&&p.FF==qry(s[i-1]).FF) printf("#");
for(int k=0;k<p.SS;k++) printf("%d", idx[p.FF]);
}
return 0;
}
/* stuff you should look for
- int overflow, array bounds
- special cases (n=1?)
- do smth instead of do nothing and stay organized
- WRITE STUFF DOWN
- DONT JUST STICK ON ONE APPROACH
*/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |