oj.uz

Submission #251442

# Submission time Handle Problem Language Result Execution time Memory
251442 2020-07-21T09:28:13 Z leaked Portal (COCI17_portal) C++14
48 / 120
 83 ms 5880 KB 
#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]={0,0,-1,1};
const ll ty[4]={-1,1,0,0};
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)));
char a[N][N];
int n,m;
int ans[N][N];
pii st,nd;
signed main()
{
    fast_io;
//    freopen("in.txt","r",stdin);
//    freopen("out.txt","w",stdout);
    cin>>n>>m;
    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};
            ans[i][j]=INT_MAX;
        }
    }
    priority_queue<pair<int,pii>,vector<pair<int,pii>>,greater<pair<int,pii>>>pq;
    auto here=[&](int x,int y){
        return x>=0 && y>=0 && y<m && x<n && a[x][y]!='#';
    };
    auto check_dst=[&](pii x,pii y){
        return abs(x.f-y.f)+abs(x.s-y.s);
    };
    auto upd=[&](pii x,int value){
        if(here(x.f,x.s) && ans[x.f][x.s]>value){
            ans[x.f][x.s]=value;
            pq.push({value,x});
        }
    };
    ans[st.f][st.s]=0;pq.push({0,st});
    while(!pq.empty()){
        auto cur=pq.top().s;auto dst=pq.top().f;
        pq.pop();
        if(ans[cur.f][cur.s]<dst) continue;
        pii aa[4];
        for(int j=0;j<4;j++){
            aa[j]=cur;
            while(a[aa[j].f][aa[j].s]!='#'){
                aa[j].f+=tx[j];
                aa[j].s+=ty[j];
            }
            aa[j].f-=tx[j];aa[j].s-=ty[j];
        }
        for(int i=0;i<4;i++){
            for(int j=0;j<4;j++){
                if(i==j) continue;
                upd(aa[j],check_dst(aa[i],cur)+1+dst);
            }
            upd({cur.f+tx[i],cur.s+ty[i]},1+dst);
        }
    }
    if(ans[nd.f][nd.s]==INT_MAX) cout<<"Nemoguce";
    else cout<<ans[nd.f][nd.s];
    return 0;
}
/*
4 5
#####
#..F#
#C..#
#####


*/

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 512 KB Output is correct
2 Incorrect 1 ms 512 KB Output isn't correct

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 512 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Incorrect 0 ms 512 KB Output isn't correct

Subtask #6
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 2048 KB Output is correct
2 Incorrect 1 ms 1280 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 1920 KB Output is correct
2 Incorrect 2 ms 2176 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 4224 KB Output is correct
2 Correct 29 ms 2944 KB Output is correct
3 Correct 20 ms 3200 KB Output is correct

Subtask #9
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 5248 KB Output is correct
2 Incorrect 6 ms 5376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #10
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 5880 KB Output is correct
2 Incorrect 7 ms 5504 KB Output isn't correct
3 Halted 0 ms 0 KB -