/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 520.0 KiB
#2 Accepted 5ms 532.0 KiB
#3 Accepted 5ms 632.0 KiB
#4 Accepted 5ms 624.0 KiB
#5 Accepted 5ms 628.0 KiB
#6 Accepted 5ms 628.0 KiB
#7 Wrong Answer 5ms 576.0 KiB
#8 Wrong Answer 2ms 576.0 KiB
#9 Wrong Answer 2ms 324.0 KiB
#10 Wrong Answer 5ms 580.0 KiB
#11 Wrong Answer 2ms 324.0 KiB
#12 Wrong Answer 3ms 436.0 KiB
#13 Wrong Answer 4ms 576.0 KiB
#14 Wrong Answer 3ms 616.0 KiB
#15 Wrong Answer 5ms 632.0 KiB

Code

#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "algo/debug.h"
#else
#define debug(...) 42
#endif

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int t;
  cin >> t;
  while(t--) {
    int n,k;
    cin >> n >> k;
    vector<string> a(n);
    for(int i=0;i<n;i++){
      cin >> a[i];
    }   
    deque<string> ass;
    string nn="0";
    string ans;
    for(int i=0;i<k+1;i++){
      ass.push_back(a[i]);
      ans+=a[i];
    }
    nn = max(nn,ans);
    ans.clear();
    for(int i=k+1;i<n;i++){
      ass.pop_front();
      ass.push_back(a[i]);
      for(auto as:ass){
        ans+=as;
      }
      nn = max(nn,ans);
      ans.clear();
    }
    cout << nn <<"\n";
    // m = max(m,s);
    // cout << m <<"\n";
  }
}

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 17:35:00
Judged At
2024-10-03 13:21:27
Judged By
Score
30
Total Time
5ms
Peak Memory
632.0 KiB