提出 #73818448


ソースコード 拡げる

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, Q;
    cin >> N >> Q;
    vector<string> input(N);
    for(int i = 0; i<N; i++){
        cin >> input[i];
    }

    vector<pair<char, char>> change;
    for(int i = 0; i<Q; i++){
        char a, b;
        cin >> a >> b;
        change.push_back({a, b});
    }

    vector<string> ans(N);
    for(int i = 0; i<N; i++){
        for(int j = 0; j<Q; j++){
            replace(input[i].begin(), input[i].end(), change[j].first, change[j].second);
        }
        ans[i] = input[i];
    }

    for(int i = 0; i<N; i++){
        cout << ans[i] << "\n";
    }

    return 0;
}

提出情報

提出日時
問題 C - 文字の一括変換
ユーザ MinChel
言語 C++23 (GCC 15.2.0)
得点 0
コード長 787 Byte
結果 TLE
実行時間 > 2000 ms
メモリ 9984 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 0 / 300
結果
AC × 5
AC × 48
TLE × 22
セット名 テストケース
Sample sample01.txt, sample02.txt, sample03.txt, sample04.txt, sample05.txt
All sample01.txt, sample02.txt, sample03.txt, sample04.txt, sample05.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in56.txt, in57.txt, in58.txt, in59.txt, in60.txt, in61.txt, in62.txt, in63.txt, in64.txt, in65.txt
ケース名 結果 実行時間 メモリ
in01.txt AC 2 ms 3484 KiB
in02.txt AC 1 ms 3520 KiB
in03.txt AC 1 ms 3576 KiB
in04.txt AC 1 ms 3520 KiB
in05.txt AC 1 ms 3548 KiB
in06.txt AC 1 ms 3640 KiB
in07.txt AC 1 ms 3428 KiB
in08.txt AC 1 ms 3664 KiB
in09.txt AC 1 ms 3520 KiB
in10.txt AC 1 ms 3512 KiB
in11.txt TLE > 2000 ms 9872 KiB
in12.txt TLE > 2000 ms 9148 KiB
in13.txt AC 10 ms 9528 KiB
in14.txt AC 9 ms 9564 KiB
in15.txt AC 9 ms 9540 KiB
in16.txt TLE > 2000 ms 4776 KiB
in17.txt TLE > 2000 ms 9948 KiB
in18.txt TLE > 2000 ms 9840 KiB
in19.txt TLE > 2000 ms 4736 KiB
in20.txt TLE > 2000 ms 4872 KiB
in21.txt TLE > 2000 ms 4804 KiB
in22.txt AC 1 ms 3520 KiB
in23.txt AC 1 ms 3520 KiB
in24.txt TLE > 2000 ms 4872 KiB
in25.txt TLE > 2000 ms 4680 KiB
in26.txt AC 1 ms 3540 KiB
in27.txt AC 1 ms 3428 KiB
in28.txt TLE > 2000 ms 9924 KiB
in29.txt AC 1 ms 3484 KiB
in30.txt AC 1 ms 3512 KiB
in31.txt AC 1 ms 3576 KiB
in32.txt AC 1 ms 3548 KiB
in33.txt AC 1 ms 3440 KiB
in34.txt AC 1 ms 3520 KiB
in35.txt AC 1 ms 3640 KiB
in36.txt AC 1 ms 3444 KiB
in37.txt AC 1 ms 3432 KiB
in38.txt AC 1 ms 3588 KiB
in39.txt AC 1 ms 3588 KiB
in40.txt AC 1 ms 3484 KiB
in41.txt TLE > 2000 ms 9916 KiB
in42.txt TLE > 2000 ms 4768 KiB
in43.txt TLE > 2000 ms 3868 KiB
in44.txt TLE > 2000 ms 4804 KiB
in45.txt TLE > 2000 ms 4804 KiB
in46.txt TLE > 2000 ms 4664 KiB
in47.txt TLE > 2000 ms 9908 KiB
in48.txt TLE > 2000 ms 9984 KiB
in49.txt TLE > 2000 ms 9156 KiB
in50.txt AC 1 ms 3512 KiB
in51.txt AC 1 ms 3548 KiB
in52.txt AC 1 ms 3560 KiB
in53.txt AC 1 ms 3548 KiB
in54.txt AC 1 ms 3432 KiB
in55.txt AC 1 ms 3560 KiB
in56.txt AC 1 ms 3484 KiB
in57.txt AC 1 ms 3484 KiB
in58.txt AC 1 ms 3524 KiB
in59.txt AC 1 ms 3440 KiB
in60.txt AC 1 ms 3432 KiB
in61.txt AC 1 ms 3484 KiB
in62.txt AC 1 ms 3664 KiB
in63.txt AC 1 ms 3500 KiB
in64.txt TLE > 2000 ms 9836 KiB
in65.txt TLE > 2000 ms 9808 KiB
sample01.txt AC 1 ms 3500 KiB
sample02.txt AC 1 ms 3640 KiB
sample03.txt AC 1 ms 3428 KiB
sample04.txt AC 1 ms 3440 KiB
sample05.txt AC 1 ms 3572 KiB