oj.uz

답안 #489686

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
489686 2021-11-23T22:04:08 Z JerryLiu06 고장난 휴대전화기 (COCI14_mobitel) C++17
50 / 50
 1 ms 320 KB 
// https://oj.uz/problem/view/COCI14_mobitel

#include <bits/stdc++.h>
 
using namespace std;
 
using ll = long long;
using ld = long double;
using db = double;
using str = string;
 
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
 
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
 
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(0);
#define FASTIOF ios_base::sync_with_stdio(false); fin.tie(0);
 
#define mp make_pair
#define f first
#define s second
 
#define sz(x) (int)(x).size()
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert 
#define ft front()
#define bk back()
#define pb push_back
#define pf push_front
 
#define lb lower_bound
#define ub upper_bound
 
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define R0F(i, a) ROF(i, 0, a)
#define EACH(a, x) for (auto& a : x)
 
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); }
ll fdiv(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); }
 
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
 
template<class T> void remDup(vector<T>& v) { sor(v); v.erase(unique(all(v)), v.end()); }
 
const int MOD = 1e9 + 7;
const int MX = 10; 
const ll INF = 1e18;

int key[MX]; pi MP[26]; str S, res = "";

int main() {
    FASTIO;

    F0R(i, 15) {
        MP[i] = {i / 3 + 2, i % 3 + 1};
    }
    FOR(i, 15, 19) {
        MP[i] = {7, (i + 1) % 4 + 1};
    }
    FOR(i, 19, 25) {
        MP[i] = {(i + 2) / 3 + 1, (i + 2) % 3 + 1};
    }
    MP[25] = {9, 4};

    FOR(i, 1, 10) {
        int A; cin >> A;

        key[A] = i;
    }
    EACH(P, MP) {
        P.f = key[P.f];
    }
    cin >> S;

    F0R(i, sz(S)) {
        int curLet = S[i] - 'a';
        
        char add = (char) ('0' + MP[curLet].f);

        F0R(j, MP[curLet].s) {
            res += add;
        }
        if (i < sz(S) - 1 && MP[curLet].f == MP[S[i + 1] - 'a'].f) {
            res += "#";
        }
    }
    cout << res;
}

Subtask #1
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 316 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 316 KB Output is correct
7 Correct 0 ms 320 KB Output is correct
8 Correct 1 ms 316 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct