/ SeriousOJ /

Record Detail

Runtime Error


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 624.0 KiB
#2 Accepted 6ms 540.0 KiB
#3 Accepted 14ms 988.0 KiB
#4 Accepted 15ms 852.0 KiB
#5 Accepted 12ms 776.0 KiB
#6 Accepted 14ms 956.0 KiB
#7 Accepted 84ms 1.059 MiB
#8 Accepted 20ms 540.0 KiB
#9 Accepted 21ms 776.0 KiB
#10 Accepted 20ms 796.0 KiB
#11 Accepted 173ms 4.16 MiB
#12 Accepted 694ms 19.672 MiB
#13 Accepted 15ms 1.699 MiB
#14 Accepted 14ms 1.277 MiB
#15 Accepted 15ms 1.504 MiB
#16 Accepted 18ms 1.5 MiB
#17 Accepted 16ms 1.508 MiB
#18 Accepted 545ms 19.621 MiB
#19 Accepted 18ms 1.527 MiB
#20 Accepted 454ms 19.598 MiB
#21 Time Exceeded ≥2092ms ≥70.547 MiB
#22 Accepted 200ms 70.406 MiB
#23 Accepted 201ms 70.398 MiB
#24 Accepted 206ms 70.551 MiB
#25 Accepted 84ms 7.484 MiB
#26 Runtime Error 562ms 70.691 MiB

Code

/*
 *Copyright (c) Swadheen Islam Robi (SIR01)
 *Created on Tue Dec 10 2024 3:07:03 PM
 */
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pie 2*(acos(0.0))
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define pb push_back
#define endl "\n"
#define lcm(a,b) (a*b)/(__gcd<ll>(a,b))
#define mod 1000000007
#define srt(v) sort(v.begin(),v.end())
#define rsrt(v) sort(v.rbegin(),v.rend())
#define ALLAHU_AKBAR ios::sync_with_stdio(false); cin.tie(nullptr);

void sir()
{
    // int y
    ll n,m; cin>>n>>m;
    char grid[n+1][m+1];
    bool got = false;
    ll cp = 0;
    for(ll i=1; i<=n; i++)
    {
        for(ll j=1; j<=m; j++)
        {
            cin>>grid[i][j];
            if(grid[i][j]=='+')got = true;
        }
    }
    if(!got){
        cout<<0<<endl;
        return;
    }
   
    vector<pair<ll,ll>>v;
    for(ll i=1; i<n; i++)
    {
        for(ll j=1; j<m; j++)
        {
            if(grid[i][j]=='+')
            {
                if(grid[i][j+1]=='+' && grid[i][j-1]=='+' && grid[i-1][j] =='+' && grid[i+1][j]=='+'){
                    v.pb({i,j});
                }
            }
        }
    }
    if(v.size()==0){
        cout<<1<<endl;
        return;
    }
    ll mx = -1, pmx = (min(n,m) * 2)-1;
    for(auto &p:v)
    {
        ll f = p.first, s = p.second;
        ll c = 0;
        ll x = 1;
        while(grid[f+x][s]=='+'&& grid[f-x][s]=='+'&& grid[f][s+x]=='+'&&grid[f][s-x]=='+' && (f+x<=n) && (f-x>=1)&& (s+x<=m)&& (s-x>=1)){
            c++; x++;
        }

        mx = max(mx, (4*c+1));
        //cout<<pmx<<" "<<c<<endl;
        if(mx == pmx){
            cout<<mx<<endl;
            return;
        }

    }
    cout<<mx<<endl;
}

int main() {
    ALLAHU_AKBAR

    ll t = 1;
    cin>>t;
    while(t--)
    {
        sir();
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1143 Plus of Pluses
Contest
LU IUJPC : Sylhet Division 2024 Replay Contest
Language
C++17 (G++ 13.2.0)
Submit At
2024-12-10 09:48:40
Judged At
2024-12-10 09:48:40
Judged By
Score
76
Total Time
2092ms
Peak Memory
70.691 MiB