提出 #52107617

---

ソースコード 拡げる

#include<iostream>
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
typedef long long LL;
typedef unsigned long long ULL;
using namespace std;
using namespace __gnu_pbds;
typedef  vector<int> vi;
typedef  vector<vi> vii;
typedef  vector<tuple<int,int,int>> vti3;


int mod1=(1e9+7);
ULL mod2=(1152921504606846976);

#define FOR(i,a,b) for(long i=a;i<b;i++)
#define pb push_back
#define ll long long
#define pob pop_back
#define fi first
#define si second
#define mdeb(x) cout << #x<<' '<< x <<"\n";
#define mdeb2(x,y) cout<< #x<<' '<<x<<' '<< #y<<' '<<y<<"\n";
#define mdeb3(x,y,z) cout<< #x<<' '<<x<<' '<< #y<<' '<<y<<' '<< #z<<' '<<z<<"\n";
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define less(x) order_of_key(x)
#define element(x) find_by_order(x)
#define mii map<int,int>
#define mp make_pair
#define msi map<string,int>
#define musi unorderd_map<string,int>
#define test_n LL N; cin>>N; while(N--)
#define pii pair<int,int>
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define all(x) x.begin(),x.end() 
void printans(int f){
    if(f){cout<<"YES\n";}else{ cout<<"NO\n";}
}

int r,c;
 
int sr,sc,tr,tc;

int itr=0;

vector<vector<int>> mval,energy,visi;
vector<string> mat;

void dfs(int x,int y){

    visi[x][y]=1;
  //  mdeb3(x,y,mval[x][y]);

    if(mval[x][y]){
        if(x){
            if(mat[x-1][y]!='#'){ mval[x-1][y]=max(mval[x-1][y],max(energy[x-1][y],mval[x][y]-1)); if(!visi[x-1][y]){ dfs(x-1,y); } }
        }
        if(x+1<r){
            if(mat[x+1][y]!='#'){ mval[x+1][y]=max(mval[x+1][y], max(energy[x+1][y], mval[x][y]-1 ) ); if(!visi[x+1][y]){ dfs(x+1,y); } }
        }
        if(y){
            if(mat[x][y-1]!='#'){ mval[x][y-1]=max(mval[x][y-1], max(energy[x][y-1], mval[x][y]-1 ) ); if(!visi[x][y-1]){ dfs(x,y-1); } }
        }
        if(y+1<c){
            if(mat[x][y+1]!='#'){ mval[x][y+1]=max(mval[x][y+1],max(energy[x][y+1], mval[x][y]-1 ) ); if(!visi[x][y+1]){ dfs(x,y+1); } }
        }
    }
}
 

int main(){
fastio;

 cin>>r>>c;
mat=vector<string>(r);
FOR(i,0,r){
    cin>>mat[i];
} 

FOR(i,0,r){
    FOR(j,0,c){
        if(mat[i][j]=='S'){ sr=i,sc=j; }else if(mat[i][j]=='T'){ tr=i,tc=j; }
    }
}



mval= vector<vector<int>>(r,vector<int>(c,-1e9));
energy=vector<vector<int>>(r,vector<int>(c,-1));


int n; cin>>n;
FOR(i,0,n){
    int x,y,e; cin>>x>>y>>e; x--; y--; energy[x][y]=e;
}

if(energy[sr][sc]<1){ cout<<"No\n"; return 0;}

mval[sr][sc]=energy[sr][sc];

//mdeb3(sr,sc,mval[sr][sc]);

FOR(i,0,1000){
    itr++;
  //  mdeb2(itr,"-------------")
    visi=vector<vector<int>>(r,vector<int>(c,0));
    dfs(sr,sc);
}

//mdeb3(tr,tc,mval[tr][tc]);

if(mval[tr][tc]>=0){
    cout<<"Yes\n";
}else{
    cout<<"No\n";
}


return 0;}

提出情報

ジャッジ結果