oj.uz

답안 #236152

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
236152 2020-05-31T09:55:51 Z ne4eHbKa Portal (COCI17_portal) C++17
120 / 120
 80 ms 7424 KB 
//{ <defines>
#include <bits/stdc++.h>
using namespace std;

//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,-O3")

#define fr(i, n) for(int i = 0; i < n; ++i)
#define fo(n) fr(i, n)

#define re return
#define ef else if
#define ifn(x) if(!(x))
#define _  << ' ' <<

#define ft first
#define sd second
#define ve vector
#define pb push_back
#define eb emplace_back

#define sz(x) int((x).size())
#define bnd(x) x.begin(), x.end()
#define clr(x, y) memset((x), (y), sizeof (x))

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef ve<int> vi;

inline ll time() {re chrono :: system_clock().now().time_since_epoch().count();}
mt19937 rnd(time());
mt19937_64 RND(time());

template<typename t> inline void umin(t &a, t b) {a = min(a, b);}
template<typename t> inline void umax(t &a, t b) {a = max(a, b);}

int md = 998244353;

inline int m_add(int&a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_sum(int a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_mul(int&a, int b) {re a = 1ll * a * b % md;}
inline int m_prod(int a, int b) {re 1ll * a * b % md;}

int m_bpow(ll A, ll b) {
    int a = A % md;
    ll ans = 1;
    for(ll p = 1ll << 63 - __builtin_clzll(b); p; p >>= 1) {
        (ans *= ans) %= md;
        if(p & b)
            (ans *= a) %= md;
    }
    re ans;
}

//const ld pi = arg(complex<ld>(-1, 0));
//const ld pi2 = pi + pi;
const int oo = 2e9;
const ll OO = 4e18;
//} </defines>
const int N = 505;

int n, m;
int l[N][N], r[N][N], d[N][N], u[N][N], w[N][N], t[N][N], di[N][N];
int cx, cy, fx, fy;

void solve() {
    cin >> n >> m;
    fo(n) fr(j, m) {
        char c; cin >> c;
        if(c == 'C') cx = i, cy = j;
        if(c == 'F') fx = i, fy = j;
        w[i][j] = c == '#';
    }
    clr(t, 127);
    #define fd(a, b) for(int a = b - 1; a >= 0; --a)
    fr(i, n) { int
        p = 0; fr(j, m) umin(t[i][j], l[i][j] = w[i][j] ? p = 0 : ++p);
        p = 0; fd(j, m) umin(t[i][j], r[i][j] = w[i][j] ? p = 0 : ++p);
    }
    fr(j, m) { int
        p = 0; fr(i, n) umin(t[i][j], u[i][j] = w[i][j] ? p = 0 : ++p);
        p = 0; fd(i, n) umin(t[i][j], d[i][j] = w[i][j] ? p = 0 : ++p);
    }
    clr(di, 127);
    struct cmp {
        bool operator() (const pii &a, const pii &b) const {
            int &A = di[a.ft][a.sd];
            int &B = di[b.ft][b.sd];
            re A == B ? a < b : A < B;
        }
    };
    set<pii, cmp> q;
    q.emplace(cx, cy);
    di[cx][cy] = 0;
    for(; !q.empty(); q.erase(q.begin())) {
        pii ps = *q.begin();
        int x = ps.ft, y = ps.sd, s = di[x][y];
        #define mp make_pair
        for(auto v : initializer_list< pair<pii, int> > {
            mp( mp(x, y - l[x][y] + 1), s + t[x][y] ),
            mp( mp(x, y + r[x][y] - 1), s + t[x][y] ),
            mp( mp(x - u[x][y] + 1, y), s + t[x][y] ),
            mp( mp(x + d[x][y] - 1, y), s + t[x][y] ),
            mp( mp(x - 1, y - 0), s + 1 ),
            mp( mp(x + 1, y + 0), s + 1 ),
            mp( mp(x - 0, y - 1), s + 1 ),
            mp( mp(x + 0, y + 1), s + 1 )
        }) {
            int x = v.ft.ft, y = v.ft.sd, s = v.sd;
            if(x < 0 || y < 0 || x >= n || y >= m || w[x][y] || di[x][y] <= s) continue;
            if(q.count(v.ft)) q.erase(v.ft);
            di[x][y] = s;
            q.emplace(v.ft);
        }
    }
    if(di[fx][fy] > +oo) cout << "nemoguce\n";
    else cout << di[fx][fy] << endl;
}

int main() {
#ifdef _LOCAL
    freopen("in.txt", "r", stdin);
    int tests; cin >> tests;
    for(int test = 1; test <= tests; ++test) {
		cerr << "case #" << test << endl;
        solve();
        cerr << endl;
    }
#else
//    freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
    ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
    solve();
#endif
    return 0;
}

Compilation message

portal.cpp: In function 'int m_bpow(ll, ll)':
portal.cpp:50:26: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
     for(ll p = 1ll << 63 - __builtin_clzll(b); p; p >>= 1) {
                       ~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2432 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 2432 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2432 KB Output is correct
2 Correct 6 ms 2432 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2432 KB Output is correct
2 Correct 6 ms 2560 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2560 KB Output is correct
2 Correct 6 ms 2560 KB Output is correct
3 Correct 5 ms 2560 KB Output is correct

Subtask #6
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 4352 KB Output is correct
2 Correct 7 ms 3328 KB Output is correct
3 Correct 15 ms 3328 KB Output is correct

Subtask #7
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 3964 KB Output is correct
2 Correct 8 ms 4352 KB Output is correct
3 Correct 12 ms 3584 KB Output is correct

Subtask #8
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 6264 KB Output is correct
2 Correct 32 ms 4864 KB Output is correct
3 Correct 22 ms 5248 KB Output is correct

Subtask #9
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 6912 KB Output is correct
2 Correct 15 ms 7296 KB Output is correct
3 Correct 33 ms 5376 KB Output is correct
4 Correct 30 ms 6272 KB Output is correct

Subtask #10
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 80 ms 7424 KB Output is correct
2 Correct 17 ms 7296 KB Output is correct
3 Correct 51 ms 7296 KB Output is correct
4 Correct 54 ms 7296 KB Output is correct