/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Wrong Answer 1ms 532.0 KiB
#3 Wrong Answer 119ms 1.66 MiB
#4 Wrong Answer 20ms 2.496 MiB
#5 Wrong Answer 1ms 324.0 KiB
#6 Wrong Answer 127ms 1.637 MiB
#7 Wrong Answer 115ms 2.078 MiB
#8 Wrong Answer 24ms 780.0 KiB
#9 Wrong Answer 38ms 4.148 MiB
#10 Wrong Answer 69ms 3.07 MiB
#11 Accepted 28ms 3.918 MiB
#12 Wrong Answer 28ms 5.398 MiB

Code

#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long int
#define vv vector<long long>
#define mpp map<long long,long long>
#define ss set<long long>
#define vp vector<pair<long long, long long>>
#define MOD 1000000007
#define YES cout<<"YES"<<endl
#define NO cout<<"NO"<<endl
#define all_v v.begin(),v.end()
#define all_a a.begin(),a.end()
#define all_n for(int i=0;i<n;i++)
void requisite(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
}
int main() {
    requisite();
    ll t;
    cin>>t;
    while (t--){
        string s;
        cin>>s;
        ll q;
        cin>>q;
        bool rev=false;
        string beg;
        string end;
        for (int i = 0; i < q; ++i) {
            char c;
            ll a,b;
            cin>>a;
            if (a==1){
                rev=(!rev);
                swap(beg,end);
            }
            else{
                cin>>b>>c;
                if (b==1){
                    beg.push_back(c);
                }
                else{
                    end.push_back(c);
                }
            }
        }
        if (rev){
           reverse(s.begin(), s.end());
           beg.append(s);
           beg.append(end);
           cout<<beg<<endl;
        }
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1088 Mr. Heart's String Challenge
Contest
Brain Booster #5
Language
C++17 (G++ 13.2.0)
Submit At
2024-09-05 16:17:40
Judged At
2024-10-03 13:08:08
Judged By
Score
15
Total Time
127ms
Peak Memory
5.398 MiB