#include<bits/stdc++.h>
using namespace std;
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
////
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("-O3")
// #pragma GCC optimize("no-stack-protector")
// #pragma GCC optimize("fast-math")
//////#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cout << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cout << endl; }
eni(!=) cout << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
//#define ull unsigned long long
typedef unsigned long long ull;
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (ll)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)
//using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
void binary(ll val,int to) {for(int i=0;i<to;i++) cerr<<(pw(i) & val ? 1 : 0); cerr<<endl;}
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }
ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll R=1e4;
const ll tx[4]={1,0,-1,0};
const ll ty[4]={0,1,0,-1};
const char rev_to[4]={'E','W','N','S'};
const int N=5e3+1;
const int M=1e9+7;
//typedef tree<pii,null_type,less<pii>,rb_tree_tag,tree_order_statistics_node_update> st;
void bad(){
cout<<-1;
exit(0);
}
typedef struct node* nt;
auto rnd=bind(uniform_int_distribution<ll>(1,1e18),mt19937(time(0)));
pii nxt[N][N][4];
signed main()
{
fast_io;
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
int n,m;
cin>>n>>m;
vector<vector<char>>a(n,vector<char>(m));
pii st,nd;
for(int i=0;i<n;i++)for(int j=0;j<m;j++) {
cin>>a[i][j];
if(a[i][j]=='C')st={i,j};
if(a[i][j]=='F')nd={i,j};
}
//0->L,1->R,2->U,3->D;
{
for(int i=0;i<n;i++){
int prev=-1;
for(int j=0;j<m;j++){
if(a[i][j]=='#'){
prev=j;
}
nxt[i][j][0]={i,prev+1};
}
}
for(int i=0;i<n;i++){
int prev=m;
for(int j=m-1;j>=0;j--){
if(a[i][j]=='#'){
prev=j;
}
nxt[i][j][1]={i,prev-1};
}
}
for(int j=0;j<m;j++){
int prev=-1;
for(int i=0;i<n;i++){
if(a[i][j]=='#'){
prev=i;
}
nxt[i][j][2]={prev+1,j};
}
}
for(int j=0;j<m;j++){
int prev=n;
for(int i=n-1;i>=0;i--){
if(a[i][j]=='#'){
prev=i;
}
nxt[i][j][3]={prev-1,j};
}
}
}
vector<vector<int>>ans(n,vector<int>(m,2e9));
priority_queue<pair<int,pii>,vector<pair<int,pii>>,greater<pair<int,pii>>>pq;
pq.push({0,st});
auto here=[&](int i,int j){
return i>=0 && j>=0 && i<n && j<m && a[i][j]!='#';
};
auto check_dst=[&](pii f,pii s){
return abs(f.f-s.f)+abs(f.s-s.s);
};
auto upd=[&](pii f,int how){
if(ans[f.f][f.s]>how){
ans[f.f][f.s]=how;
pq.push({how,f});
}
};
ans[st.f][st.s]=0;
while(!pq.empty()){
auto c=pq.top().s;auto dst=pq.top().f;
pq.pop();
// debug()<<imie(ans);
if(ans[c.f][c.s]<dst) continue;
for(int i=0;i<4;i++){
for(int j=0;j<4;j++){
if(i==j) continue;
pii f=nxt[c.f][c.s][i],s=nxt[c.f][c.s][j];
upd(f,check_dst(c,s)+1+dst);
upd(s,check_dst(c,f)+1+dst);
}
}
for(int i=0;i<4;i++){
int nx=c.f+tx[i],ny=c.s+ty[i];
if(here(nx,ny)){
upd({nx,ny},dst+1);
}
}
}
if(ans[nd.f][nd.s]==2e9){
cout<<"Nemoguce";
exit(0);
}
cout<<ans[nd.f][nd.s];
return 0;
}
/*
vodevovode
2
5 8 3 6
2 5 3 6
*/
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
Output is correct |
| 2 |
Correct |
0 ms |
384 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
0 ms |
384 KB |
Output is correct |
| 3 |
Incorrect |
0 ms |
384 KB |
Output isn't correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
6 ms |
1920 KB |
Output is correct |
| 2 |
Incorrect |
2 ms |
1536 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
18 ms |
3200 KB |
Output is correct |
| 2 |
Incorrect |
2 ms |
3072 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
50 ms |
7552 KB |
Output is correct |
| 2 |
Correct |
28 ms |
5504 KB |
Output is correct |
| 3 |
Correct |
17 ms |
4864 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
68 ms |
10240 KB |
Output is correct |
| 2 |
Incorrect |
11 ms |
9856 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
89 ms |
11768 KB |
Output is correct |
| 2 |
Incorrect |
14 ms |
11648 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
