Submission #2442876


Source Code Expand

Copy
/* main code starts from line 123. */

/* ---------- STL Libraries ---------- */

// IO library
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>

// algorithm library
#include <algorithm>
#include <cmath>
#include <numeric>

// container library
#include <deque>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>


/* ---------- Namespace ---------- */

using namespace std;


/* ---------- Type Abbreviation ---------- */

template <typename T>
using V = vector<T>;
template <typename T, typename U>
using P = pair<T, U>;

using ll = long long;
using PL = P<ll, ll>;
using PS = P<string, ll>;

using VI = V<int>;
using VVI = V<VI>;
using VL = V<ll>;
using VVL = V<VL>;
using VS = V<string>;
using VB = V<bool>;
using VVB = V<VB>;
using VPL = V<PL>;
using VPS = V<PS>;

#define fst first
#define snd second
#define pb push_back


/* ---------- conversion ---------- */

#define INT(c) static_cast<int>(c)
#define CHAR(n) static_cast<char>(n)
#define LL(n) static_cast<ll>(n)
#define DOUBLE(n) static_cast<double>(n)


/* ---------- container ---------- */

#define ALL(v) (v).begin(), (v).end()
#define SIZE(v) (LL((v).size()))

#define FIND(v, k) (v).find(k) != (v).end()
#define EACH(itr, v) for (auto itr = (v).begin(); itr != (v).end(); itr++)
#define REACH(i, v) for (auto itr = (v).rbegin(); itr != (v).rend(); itr++)

#define SORT(v) sort(ALL(v))
#define GSORT(v) sort(ALL(v), greater<decltype((v).front())>())


/* ---------- repetition ---------- */

#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define NREP(i, n) FOR(i, 1, n + 1)

#define RFOR(i, a, b) for (ll i = (a); i >= (b); i--)
#define RREP(i, n) RFOR(i, n - 1, 0)
#define RNREP(i, n) RFOR(i, n, 1)

// Usual REP runs from 0 to n-1 (R: n-1 to 0)
// Natural REP runs from 1 to n (R: n to 1)


/* ---------- Constants ---------- */

// const ll MOD = 1e9 + 7;
// const int INF = 1 << 25;
// const ll INF = 1LL << 50;
// const double PI = 3.14159265358979;
const ll dx[4] = {0, -1, 1, 0};
const ll dy[4] = {-1, 0, 0, 1};
// const ll dx[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
// const ll dy[8] = {-1, -1, -1, 0, 0, 1, 1, 1};


/* ---------- Short Functions ---------- */

template <typename T>
T sq(T a) {
    return a * a;
}


/* ---------- Debug ---------- */

#define GET_VAR_NAME(variable) #variable

#define test(x) cout << GET_VAR_NAME(x) << " = " << x << endl;
#define testP(p) cout << GET_VAR_NAME(p) << " = (" << (p).fst << ", " << (p).snd << ")" << endl;
#define testP2(a, b) cout << "(" << a << ", " << b << ")" << endl;


/* v-v-v-v-v-v-v-v-v Main Part v-v-v-v-v-v-v-v-v */

/* ---------- Global Variance ----------- */

int H, W;
VS S(310);
VVI dis(310, VI(310, 0));

/* ------------- Functions -------------- */

bool canvisit(PL p) {
    if (p.fst >= 0 && p.fst < H && p.snd >= 0 && p.snd < W) {
        if (S[p.fst][p.snd] == '.' && dis[p.fst][p.snd] == 0) {
            return true;
        }
    }
    return false;
}

/* ----------- Main Function ------------ */

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    cin >> H >> W;
    int bnum = 0;
    REP(i, H) {
        cin >> S[i];
        EACH(citr, S[i]) {
            if (*citr == '#') bnum++;
        }
    }

    queue<PL> mapq;
    mapq.push({0, 0});
    dis[0][0] = 1;

    while (!mapq.empty()) {
        PL from = mapq.front();
        REP(i, 4) {
            PL to = {from.fst + dx[i], from.snd + dy[i]};
            if (canvisit(to)) {
                dis[to.fst][to.snd] = dis[from.fst][from.snd] + 1;
                mapq.push(to);
            }
        }
        mapq.pop();
    }

    if (dis[H - 1][W - 1] == 0) {
        cout << -1 << endl;
    } else {
        cout << H * W - bnum - dis[H - 1][W - 1] << endl;
    }
    return 0;
}

Submission Info

Submission Time
Task D - Grid Repainting
User Misteer
Language C++14 (GCC 5.4.1)
Score 400
Code Size 3983 Byte
Status
Exec Time 2 ms
Memory 640 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 s1.txt, s2.txt
All 400 / 400 in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
in01.txt 1 ms 640 KB
in02.txt 1 ms 640 KB
in03.txt 1 ms 640 KB
in04.txt 1 ms 640 KB
in05.txt 1 ms 640 KB
in06.txt 1 ms 640 KB
in07.txt 1 ms 640 KB
in08.txt 1 ms 640 KB
in09.txt 1 ms 640 KB
in10.txt 1 ms 640 KB
in11.txt 1 ms 640 KB
in12.txt 1 ms 640 KB
in13.txt 1 ms 640 KB
in14.txt 1 ms 640 KB
in15.txt 2 ms 640 KB
in16.txt 2 ms 640 KB
in17.txt 2 ms 640 KB
in18.txt 2 ms 640 KB
s1.txt 1 ms 640 KB
s2.txt 1 ms 640 KB