/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 320.0 KiB
#2 Accepted 18ms 648.0 KiB
#3 Accepted 17ms 644.0 KiB
#4 Accepted 17ms 672.0 KiB
#5 Accepted 18ms 660.0 KiB
#6 Accepted 17ms 576.0 KiB
#7 Wrong Answer 17ms 656.0 KiB
#8 Wrong Answer 3ms 320.0 KiB
#9 Wrong Answer 2ms 324.0 KiB
#10 Wrong Answer 16ms 624.0 KiB
#11 Wrong Answer 2ms 328.0 KiB
#12 Wrong Answer 5ms 580.0 KiB
#13 Wrong Answer 12ms 584.0 KiB
#14 Wrong Answer 9ms 576.0 KiB
#15 Wrong Answer 15ms 640.0 KiB

Code

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

string add(const string& a, const string& b)
{
    return a + b;
}

int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        int n, k;
        cin >> n >> k;
        vector<string> v(n);
        for (int i = 0; i < n; i++)
        {
            cin >> v[i];
        }

        for (int j = 0; j < k; j++ )
        {
            int ind = -1;
            string tmp_mx = "";
            for (int i = 0; i < v.size() - 1; ++i)
            {
                string add_s = add(v[i], v[i + 1]);
                if (add_s > tmp_mx)
                {
                    tmp_mx = add_s;
                    ind = i;
                }
            }
            if (ind != -1)
            {
                v[ind] = tmp_mx;
                v.erase(v.begin() + ind + 1);
            }
        }

        string ans = *max_element(v.begin(), v.end());
        cout << ans << '\n';
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1083 Number concatenation
Contest
Bangladesh 2.0
Language
C++20 (G++ 13.2.0)
Submit At
2024-08-16 16:13:51
Judged At
2024-10-03 13:28:07
Judged By
Score
30
Total Time
18ms
Peak Memory
672.0 KiB