/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 540.0 KiB
#2 Accepted 3ms 540.0 KiB
#3 Accepted 3ms 796.0 KiB
#4 Accepted 4ms 620.0 KiB
#5 Accepted 3ms 540.0 KiB
#6 Accepted 4ms 540.0 KiB
#7 Wrong Answer 3ms 540.0 KiB
#8 Wrong Answer 2ms 540.0 KiB
#9 Wrong Answer 1ms 556.0 KiB
#10 Wrong Answer 4ms 488.0 KiB
#11 Wrong Answer 1ms 344.0 KiB
#12 Wrong Answer 2ms 604.0 KiB
#13 Wrong Answer 3ms 540.0 KiB
#14 Wrong Answer 3ms 796.0 KiB
#15 Wrong Answer 3ms 616.0 KiB

Code

#include <bits/stdc++.h>
using namespace std;
#define SC               scanf
#define PF               printf
#define ull              unsigned long long
#define ld               long double
#define F                first
#define S                second
#define pb               push_back
#define sort_a(a)        sort(a.begin(),a.end());
#define sort_d(a)        sort(a.rbegin(),a.rend());
#define READ(f)          freopen(f, "r", stdin)
#define WRITE(f)         freopen(f, "w", stdout)
#define rev(s)           reverse(s.begin(),s.end())
#define P(ok)            cout << (ok ? "YES\n": "NO\n")
#define __Heart__              ios_base :: sync_with_stdio(false); cin.tie(NULL);
#define ll long long
typedef pair< ll , ll>                   PII;
void solve()
{
    int n , k; cin >> n >> k ;
    vector < string > v(n) ;
    for(auto &x : v) cin >> x ;
    string Ans = "" ;
    for(int i = 0 ; i < n - k ; i++){
        int j = i ;
        string cur = "" ;
        while(j <= i + k){
            cur += v[j] ;
            j++ ;
        }
        Ans = max(Ans , cur) ;
    }
    cout << Ans << "\n" ;
}
int main()
{
     __Heart__
     int t ; cin >> t ; while(t--) solve() ;
}

Information

Submit By
Type
Submission
Problem
P1083 Number concatenation
Language
C++20 (G++ 13.2.0)
Submit At
2024-08-08 23:57:36
Judged At
2024-08-08 23:57:36
Judged By
Score
30
Total Time
4ms
Peak Memory
796.0 KiB