Submission #1263486

---

Source Code Expand

#include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <queue>
#include <ctime>
#include <cassert>
#include <cstdio>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <random>
#include <functional>

using namespace std;

#define F first
#define S second
#define pb push_back
#define epr(...) fprintf(stderr, __VA_ARGS__)
#define db(x) cerr << #x << " = " << x << endl
#define db2(x, y) cerr << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")\n"; 
#define db3(x, y, z) cerr << "(" << #x << ", " << #y << ", " << #z << ") = (" << x << ", " << y << ", " << z << ")\n"
#define dbv(a) cerr << #a << ": "; for (auto& xxxx: a) cerr << xxxx << " "; cerr << endl;
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)a.size()
#define pw(n) (1ll << (n))

#define equal equalll
#define less lesss
typedef long double dbl;
typedef long long ll;
const int N = 888;
const ll INF = 1.01e9;
typedef vector<int> vi;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, -1, 0, 1};

char s[N][N];

int main(){
#ifdef HOME 
    assert(freopen("in", "r", stdin));
#endif
    int n, m, k;
    scanf("%d%d%d",  &n, &m, &k);
    for (int i = 0; i < n; i++) {
        scanf("%s", s[i]);
    }

    int sx = -1;
    int sy = -1;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++) {
            if (s[i][j] == 'S') {
                sx = i;
                sy = j;
            }
        }
    queue<pair<int,int>> q;
    q.push({sx, sy});
    vector<vector<int>> dist(n, vector<int>(m, INF));
    dist[sx][sy] = 0;
    while (!q.empty()) {
        int x = q.front().F;
        int y = q.front().S;
        q.pop();
        for (int i = 0; i < 4; i++) {
            int xx = x + dx[i];
            int yy = y + dy[i];
            if (0 <= xx && xx < n && 0 <= yy && yy < m && s[xx][yy] == '.' && dist[xx][yy] > dist[x][y] + 1) {
                dist[xx][yy] = dist[x][y] + 1;
                q.push({xx, yy});
            }
        }
    }
    int best = INF;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            if (dist[i][j] <= k) {
                best = min(best, i);
                best = min(best, j);
                best = min(best, n - i - 1);
                best = min(best, m - j - 1);
            }
    
    if (sx == 0 || sy == 0 || sx == n - 1 || sy == m - 1) {
        puts("0");
    }
    else {
        printf("%d\n", 1 + (best + k - 1) / k);
    }

    
    
#ifdef HOME 
    epr("time = %d ms\n", (int)(clock() * 1000. / CLOCKS_PER_SEC));
#endif
    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:50:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d",  &n, &m, &k);
                                 ^
./Main.cpp:52:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%s", s[i]);
                          ^

Judge Result