每日一题 - 240115 - B. Lecture

• B. Lecture

---

• TAG - $芝士水题、算法-【STL-map、STL-set】$
• 时间复杂度 - $O(N\ast \log M)$

//
#include <bits/stdc++.h>
using namespace std;
// #define int long long

const int N = 3333;
string s[N];

void solve() {
    map<string, string> mp;
    set<string> st;

    int n, m;
    scanf("%d%d", &n, &m);
    while (m--) {
        string a, b;
        cin >> a >> b;

        mp[a] = b;
        st.insert(a.size() <= b.size() ? a : b);
    }

    for (int i = 1; i <= n; i++)
        cin >> s[i];

    for (int i = 1; i <= n; i++) {
        if (i != 1)
            putchar(' ');

        cout << (st.find(s[i]) != st.end() ? s[i] : mp[s[i]]);
    }
}

signed main() {
    int t = 1;
    // scanf("%d",&t );
    while (t--)
        solve();

    return 0;
}

---

实现细节

• `

---

参考示意图

• `

---

参考链接

• 【LaTeX应用】常用数学公式和符号

---

作者 | 乐意奥AI