/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 320.0 KiB
#2 Accepted 6ms 3.027 MiB
#3 Accepted 5ms 2.555 MiB
#4 Accepted 5ms 2.617 MiB
#5 Accepted 5ms 2.562 MiB
#6 Accepted 5ms 2.672 MiB
#7 Wrong Answer 5ms 2.594 MiB
#8 Wrong Answer 2ms 580.0 KiB
#9 Wrong Answer 2ms 536.0 KiB
#10 Wrong Answer 5ms 2.598 MiB
#11 Wrong Answer 2ms 552.0 KiB
#12 Wrong Answer 3ms 800.0 KiB
#13 Wrong Answer 3ms 836.0 KiB
#14 Wrong Answer 3ms 840.0 KiB
#15 Wrong Answer 5ms 2.617 MiB

Code

// @sagorahmedmunna

#include <bits/stdc++.h>
using namespace std;

void test() {
  int n, k;
  cin >> n >> k;
  string a[n];
  for (auto& ai : a) {
    cin >> ai;
  }
  vector<string> s;
  for (int i = 0; i < n - k; i++) {
    string temp = "";
    for (int j = i; j <= i + k; j++) {
      temp += a[j];
    }
    s.push_back(temp);
  }
  string mx = s[0];
  for (auto& si : s) {
    mx = max(mx, si);
  }
  cout << mx << '\n';
}

int main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
  int t = 1; 
  cin >> t;
  for (int i = 1; i <= t; i++) {
    test();
  }
  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:47:48
Judged At
2024-10-03 13:29:54
Judged By
Score
30
Total Time
6ms
Peak Memory
3.027 MiB