/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 324.0 KiB
#2 Accepted 526ms 620.0 KiB
#3 Accepted 518ms 616.0 KiB
#4 Wrong Answer 504ms 600.0 KiB
#5 Accepted 509ms 620.0 KiB
#6 Accepted 509ms 600.0 KiB
#7 Wrong Answer 616ms 600.0 KiB
#8 Wrong Answer 9ms 572.0 KiB
#9 Wrong Answer 2ms 532.0 KiB
#10 Wrong Answer 451ms 604.0 KiB
#11 Wrong Answer 2ms 532.0 KiB
#12 Wrong Answer 70ms 596.0 KiB
#13 Wrong Answer 1010ms 596.0 KiB
#14 Wrong Answer 469ms 588.0 KiB
#15 Wrong Answer 413ms 600.0 KiB

Code

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

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int t;
    cin >> t;
    while (t--)
    {
        int n, k;
        cin >> n >> k;
        vector<string> v(n);
        for (auto &a : v)
            cin >> a;
        string max_str = "";
        for (int ops = 0; ops <= k; ops++)
        {
            for (int i = 0; i < n - ops; i++)
            {
                string temp = "";
                for (int j = 0; j <= ops; j++)
                {
                    temp += v[i + j];
                }
                max_str = max(max_str, temp);
            }
        }

        cout << max_str << '\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:05:09
Judged At
2024-10-03 13:28:44
Judged By
Score
25
Total Time
1010ms
Peak Memory
620.0 KiB