/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Accepted 6ms 532.0 KiB
#3 Accepted 5ms 616.0 KiB
#4 Accepted 4ms 620.0 KiB
#5 Accepted 6ms 532.0 KiB
#6 Accepted 8ms 612.0 KiB
#7 Accepted 9ms 624.0 KiB
#8 Accepted 4ms 580.0 KiB
#9 Accepted 4ms 532.0 KiB
#10 Accepted 11ms 532.0 KiB
#11 Accepted 4ms 532.0 KiB
#12 Accepted 7ms 532.0 KiB
#13 Accepted 14ms 532.0 KiB
#14 Accepted 10ms 596.0 KiB
#15 Accepted 11ms 532.0 KiB

Code

#include <bits/stdc++.h>

#ifdef LOCAL
#include "template.cpp.h"
#else
#define debug(...)
#endif

#define int long long
using namespace std;
#define cinv(v) for (auto &it:v) cin>>it;
#define coutv(v) for (auto &it:v) cout<< it<<' '; cout<<'\n';

string max(string &a, string &b) {
    if (a.size() != b.size()) return (a.size() > b.size() ? a : b);
    for (int i = 0; i < a.size(); ++i) {
        if (a[i] != b[i]) {
            return (a[i] > b[i] ? a : b);
        }
    }
    return a;
}

void shelby() {
    int n, k;
    cin >> n >> k;
    vector<string> v(n);
    cinv(v)
    string ans;
    for (int i = 0; i < n; ++i) {
        string tmp;
        for (int j = i, cnt = k; j < n && cnt >= 0; ++j, --cnt) tmp += v[j];
        ans = max(ans, tmp);
    }
    cout << ans << '\n';
}

signed main() {
    cin.tie(0)->ios_base::sync_with_stdio(0);
    int t = 1;
    cin >> t;
    for (int _ = 1; _ <= t; ++_) {
//        cout << "Case " << _ << ": ";
        shelby();
    }
}

Information

Submit By
Type
Submission
Problem
P1083 Number concatenation
Language
C++20 (G++ 13.2.0)
Submit At
2024-08-16 19:17:34
Judged At
2024-08-16 19:17:34
Judged By
Score
100
Total Time
14ms
Peak Memory
624.0 KiB