Submission #3722374

Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#include <cassert>

typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair

class UnionFind {
  vector<int> data;
 public:
  UnionFind(int size) : data(size, -1) { }
  bool unionSet(int x, int y) {
    x = root(x); y = root(y);
    if (x != y) {
      if (data[y] < data[x]) swap(x, y);
      data[x] += data[y]; data[y] = x;
    }
    return x != y;
  }
  bool findSet(int x, int y) { return root(x) == root(y); }
  int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
  int size(int x) { return -data[root(x)]; }
};


#define HW(h,w) (W*(h)+(w))

int solve(int H, int W, int K, vs& a) {
    vvi d(H, vi(W));
    for(int i=0,j=H-1; i<=j; ++i,--j){
        int k = (i+K-1)/K;
        rep(c,W) d[i][c] = d[j][c] = k;
    }
    for(int i=0,j=W-1; i<=j; ++i,--j){
        int k = (i+K-1)/K;
        rep(r,H) {
            d[r][i] = min(d[r][i], k);
            d[r][j] = min(d[r][j], k);
        }
    }

    int start = -1;
    UnionFind uf(H*W);
    rep(i,H) rep(j,W) {
        if (a[i][j] == '#') continue;

        int here = HW(i,j);
        if (a[i][j] == 'S') start = here;
        if (0 < i   && a[i-1][j]=='.') uf.unionSet( HW(i-1,j), here );
        if (i < H-1 && a[i+1][j]=='.') uf.unionSet( HW(i+1,j), here );
        if (0 < j   && a[i][j-1]=='.') uf.unionSet( HW(i,j-1), here );
        if (j < W-1 && a[i][j+1]=='.') uf.unionSet( HW(i,j+1), here );
    }
    int root0 = uf.root(start);

    int best = INT_MAX;
    rep(i,H) rep(j,W) {
        if (uf.root( HW(i,j) ) == root0) {
            best = min(best, d[i][j]);
        }
    }
    return 1+best;
}

int main() {
    int H, W, K; cin >> H >> W >> K;
    vs a(H); rep(i,H) cin >> a[i];
    cout << solve(H,W,K,a) << endl;
    return 0;
}

Submission Info

Submission Time
Task C - Closed Rooms
User naoya_t
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2866 Byte
Status
Exec Time 48 ms
Memory 6144 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 sample1.txt, sample2.txt, sample3.txt
All 0 / 700 sample1.txt, sample2.txt, sample3.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in2.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in3.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in4.txt, in40.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt, sample3.txt
Case Name Status Exec Time Memory
in1.txt 46 ms 6144 KB
in10.txt 46 ms 6144 KB
in11.txt 46 ms 6144 KB
in12.txt 46 ms 6144 KB
in13.txt 46 ms 6144 KB
in14.txt 46 ms 6144 KB
in15.txt 46 ms 6144 KB
in16.txt 46 ms 6144 KB
in17.txt 46 ms 6144 KB
in18.txt 46 ms 6144 KB
in19.txt 46 ms 6144 KB
in2.txt 46 ms 6144 KB
in20.txt 2 ms 384 KB
in21.txt 1 ms 256 KB
in22.txt 1 ms 256 KB
in23.txt 40 ms 6144 KB
in24.txt 40 ms 6144 KB
in25.txt 40 ms 6144 KB
in26.txt 48 ms 6144 KB
in27.txt 48 ms 6144 KB
in28.txt 48 ms 6144 KB
in29.txt 48 ms 6144 KB
in3.txt 46 ms 6144 KB
in30.txt 48 ms 6144 KB
in31.txt 48 ms 6144 KB
in32.txt 48 ms 6144 KB
in33.txt 44 ms 6144 KB
in34.txt 44 ms 6144 KB
in35.txt 44 ms 6144 KB
in36.txt 32 ms 6144 KB
in37.txt 32 ms 6144 KB
in38.txt 32 ms 6144 KB
in39.txt 45 ms 6144 KB
in4.txt 46 ms 6144 KB
in40.txt 45 ms 6144 KB
in5.txt 46 ms 6144 KB
in6.txt 46 ms 6144 KB
in7.txt 46 ms 6144 KB
in8.txt 46 ms 6144 KB
in9.txt 46 ms 6144 KB
sample1.txt 1 ms 256 KB
sample2.txt 1 ms 256 KB
sample3.txt 1 ms 256 KB