Submission #1084131

#	Time	Username	Problem	Language	Result	Execution time	Memory
1084131		TrinhKhanhDung	Mobitel (COCI14_mobitel)	C++14	50 / 50	0 ms	600 KiB

mobitel

#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(x) (int)x.size()
#define ALL(v) v.begin(),v.end()
#define MASK(k) (1LL << (k))
#define BIT(x, i) (((x) >> (i)) & 1)
#define oo (ll)1e18
#define INF (ll)1e9
#define MOD (ll)(998244353)

using namespace std;

template<class T1, class T2>
    bool maximize(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}

template<class T1, class T2>
    bool minimize(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}

template<class T1, class T2>
    void add(T1 &a, T2 b){a += b; if(a >= MOD) a -= MOD;}

template<class T1, class T2>
    void sub(T1 &a, T2 b){a -= b; if(a < 0) a += MOD;}

template<class T>
    void cps(T &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}

void solve(){
    vector<pair<int, int>> ord(26);
    vector<char> kt = {char('a' - 1), 'c', 'f', 'i', 'l', 'o', 's', 'v', 'z'};
    int j = 0;
    for(char c='a'; c<='z'; c++){
        if(kt[j] < c) j++;
        ord[(int)c - 'a'] = make_pair(j + 1, (int)(c - kt[j - 1]));
    }
    vector<int> a(10);
    for(int i=1; i<=9; i++){
        int u; cin >> u;
        a[u] = i;
    }
    string s; cin >> s;
    for(int i=0; i<sz(s); i++){
        if(i > 0 && ord[s[i] - 'a'].fi == ord[s[i - 1] - 'a'].fi){
            cout << '#';
        }
        for(int j=0; j<ord[s[i] - 'a'].se; j++){
            cout << a[ord[s[i] - 'a'].fi];
        }
    }
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    // freopen("flowers.inp", "r", stdin);
    // freopen("flowers.out", "w", stdout);

    int nTest = 1;
//    cin >> nTest;
    while(nTest--)
        solve();

    return 0;
}

• Subtask 1: 50 / 50