提出 #73817907

---

ソースコード 拡げる

#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
//#include <numeric>
#include <queue>
//#include <ranges>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define pb push_back
#define fr first
#define sc second
#define sor(v) sort(v.begin(), v.end())
#define rev(v) reverse(v.begin(), v.end())
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using pint = pair<int,int>;
//using pll = pair<ll,ll>;
//using pqdec = priority_queue<int,vector<int>,greater<int>>;
//using pqdecl = priority_queue<ll,vector<ll>,greater<ll>>;
template <typename T>
using graph = vector<vector<T>>;
const ll LLMAX = 9223372*1e10;
const int IMAX = 214*1e7;
/*--------考察--------------------
----------CODING----------------*/
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    vector<int> v(26);
    rep(i,26) v[i] = i;
    int n,q; cin >> n >> q;
    vector<string> s(n);
    rep(i,n) cin >> s[i];
    rep(i,q){
        char aa,bb; cin >> aa >> bb;
        int a = aa - 'a', b = bb - 'a';
        rep(j,26){
            if(v[j] == a) v[j] = b;
        }
    }
    rep(i,n){
        for(auto& ss : s[i]){
            ss =  (char)('a' + v[(int)(ss - 'a')]);
        }
        cout << s[i] << '\n';
    }

}

提出情報

ジャッジ結果