Submission #229715

#	Time	Username	Problem	Language	Result	Execution time	Memory
229715		rrrr10000	Zoo (COCI19_zoo)	C++14	110 / 110	115 ms	17016 KiB

zoo

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) a.erase(unique(all(a)),a.end())
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){a%=mod;if(b==0)return 1;if(b&1)return a*modpow(a,b-1)%mod;ll k=modpow(a,b/2);return k*k%mod;}

int main(){
    vi dx={0,0,1,-1},dy={1,-1,0,0};
    ll n,m;cin>>n>>m;
    vvi v(n,vi(m));
    rep(i,n){
        string s;cin>>s;
        rep(j,m){
            if(s[j]=='T')v[i][j]=1;
            else if(s[j]=='B')v[i][j]=2;
        }
    }
    vvi dis(n,vi(m,inf));
    deque<P> q;
    q.pb(0,0);
    dis[0][0]=0;
    ll ans=1;
    while(!q.empty()){
        auto t=q.front();q.pop_front();
        ll x=t.fi,y=t.se;
        chmax(ans,dis[x][y]+1);
        rep(i,4){
            ll nx=x+dx[i],ny=y+dy[i];
            if(isin(nx,0ll,n-1)&&isin(ny,0ll,m-1)){
                if(v[nx][ny]){
                    if(chmin(dis[nx][ny],dis[x][y]+abs(v[x][y]-v[nx][ny]))){
                        if(v[nx][ny]!=v[x][y])q.pb(nx,ny);
                        else q.emplace_front(nx,ny);
                    }
                }
            }
        }
    }
    out(ans);
}

• Subtask 1: 45 / 45
• Subtask 2: 65 / 65