/ SeriousOJ /

Record Detail

Runtime Error


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 324.0 KiB
#2 Runtime Error terminate called after throwing an instance of 'std::out_of_range' what(): stoi 2ms 580.0 KiB
#3 Runtime Error terminate called after throwing an instance of 'std::out_of_range' what(): stoi 2ms 584.0 KiB
#4 Runtime Error terminate called after throwing an instance of 'std::out_of_range' what(): stoi 2ms 576.0 KiB
#5 Runtime Error terminate called after throwing an instance of 'std::out_of_range' what(): stoi 2ms 664.0 KiB
#6 Runtime Error terminate called after throwing an instance of 'std::out_of_range' what(): stoi 2ms 676.0 KiB
#7 Runtime Error terminate called after throwing an instance of 'std::out_of_range' what(): stoi 2ms 676.0 KiB
#8 Runtime Error terminate called after throwing an instance of 'std::out_of_range' what(): stoi 2ms 572.0 KiB
#9 Runtime Error 2ms 580.0 KiB
#10 Runtime Error terminate called after throwing an instance of 'std::out_of_range' what(): stoi 2ms 580.0 KiB
#11 Runtime Error terminate called after throwing an instance of 'std::out_of_range' what(): stoi 2ms 532.0 KiB
#12 Runtime Error terminate called after throwing an instance of 'std::out_of_range' what(): stoi 2ms 532.0 KiB
#13 Runtime Error terminate called after throwing an instance of 'std::out_of_range' what(): stoi 2ms 532.0 KiB
#14 Runtime Error terminate called after throwing an instance of 'std::out_of_range' what(): stoi 2ms 616.0 KiB
#15 Runtime Error terminate called after throwing an instance of 'std::out_of_range' what(): stoi 2ms 672.0 KiB

Code


//on the name of Allah:)
#include<bits/stdc++.h>
#define int         long long
#define Endl        "\n"
#define pi          2 * acos(0.0)
#define mod         1000000007
#define Mul(a,b)    (a%mod * b%mod)%mod
#define Add(a,b)    (a%mod + b%mod)%mod
#define all(x)      (x).begin(),(x).end()
#define allr(x)     (x).rbegin(),(x).rend()
#define gcd(x, y)   (__gcd(x, y))
#define lcm(x, y)   ((x/gcd(x, y))*y)
#define faster      cin.tie(NULL), cout.tie(NULL);
#define TC          int t ; cin>>t ; for(int i=1;i<=t;i++)
const int N = 1e6 + 7;
using namespace std;
void s()
{
   int n,k;
   cin>>n>>k;
   vector<string>v(n);
   for(int i=0;i<n;i++)cin>>v[i];

   vector<string>x;
   int f=k;



            int st=0;
            int j=0;

    while(j<n-1)
    {   string res=v[st];
         for(int i=st+1;i<n;i++)
      {
         if(i<=n-1)
         {
             res=res+v[i];
              f--;
         }

         if(f==0)
         {  x.push_back(res);
             res=" ";
             f=k;
             st=i;
             break;
             }
      }
      j++;
    }

    vector<int>ans;
    for(int i=0;i<x.size();i++)ans.push_back(stoi(x[i]));
    int mx=*max_element(all(ans));

    cout<<mx<<endl;





    }



int32_t main()
{
    ios::sync_with_stdio(false);
    //faster
    TC
    {
        //cout<<"Case "<<i<<": ";
        s();

    }



}




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:03:37
Judged At
2024-10-03 13:24:25
Judged By
Score
5
Total Time
2ms
Peak Memory
676.0 KiB