/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 320.0 KiB
#2 Accepted 2ms 580.0 KiB
#3 Accepted 2ms 600.0 KiB
#4 Accepted 2ms 532.0 KiB
#5 Accepted 2ms 532.0 KiB
#6 Accepted 2ms 532.0 KiB
#7 Wrong Answer 2ms 532.0 KiB
#8 Wrong Answer 2ms 532.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
    int t;
    cin >> t;
    while(t--){
        int n, k;
        cin >> n >> k;
        string ans = "0", tmp;
        string s[n];
        int sz[n];
        for(int i = 0; i < n; i++){
            cin >> s[i];
            tmp += s[i];
            int id = i - k - 1;
            sz[i] = s[i].size();
            if(id >= 0) tmp = tmp.substr(sz[id], tmp.size() - (sz[id]));
            ans = max(ans, tmp);
        }
        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:25:30
Judged At
2024-11-11 03:14:49
Judged By
Score
30
Total Time
2ms
Peak Memory
600.0 KiB