/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Accepted 3ms 580.0 KiB
#3 Accepted 3ms 576.0 KiB
#4 Accepted 3ms 576.0 KiB
#5 Accepted 3ms 604.0 KiB
#6 Accepted 3ms 580.0 KiB
#7 Wrong Answer 3ms 604.0 KiB
#8 Wrong Answer 2ms 576.0 KiB
#9 Wrong Answer 2ms 808.0 KiB
#10 Wrong Answer 3ms 820.0 KiB
#11 Wrong Answer 1ms 532.0 KiB
#12 Wrong Answer 4ms 592.0 KiB
#13 Wrong Answer 3ms 580.0 KiB
#14 Wrong Answer 2ms 400.0 KiB
#15 Wrong Answer 3ms 580.0 KiB

Code

#include<bits/stdc++.h>
#define endl        '\n'
#define F           first
#define S           second
#define pb          push_back
#define yes         cout<<"YES\n"
#define no          cout<<"NO\n"
#define all(x)      x.begin(),x.end()
#define allr(x)     x.rbegin(),x.rend()
#define error1(x)   cerr<<#x<<" = "<<(x)<<endl
#define error2(a,b) cerr<<"("<<#a<<", "<<#b<<") = ("<<(a)<<", "<<(b)<<")\n";
#define coutall(v)  for(auto &it: v) cout << it << " "; cout << endl;
using namespace std;
using ll = long long;
using ld = long double;

void solve() {
    ll n, m, k, c = 0, ans = 0;
    string s1, s2;
    cin >> n >> k;
    vector<string> v(n);
    for (int i = 0; i < n; i++) {
        cin >> v[i];
    }
    s1 = "";
    for(int i = 0; i + k + 1 <= n; i++) {
        s2 = "";
        for(int j = i; j <= i + k; j++) {
            s2 += v[j];
        }
        s1 = max(s1, s2);
    }
    cout << s1 << endl;
    return;
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int tc = 1;
    cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case " << t << ": ";
        solve();
    }
    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 15:59:34
Judged At
2024-10-03 13:29:11
Judged By
Score
30
Total Time
4ms
Peak Memory
820.0 KiB