Submission #1268285
Source Code Expand
#include<bits/stdc++.h> using namespace std; #define rep(i,a,b) for(int i=a;i<b;i++) int H, W, K; string A[808]; //----------------------------------------------------------------- int vis[808][808]; int dx[4] = { 0, 1, 0, -1 }, dy[4] = { -1, 0, 1, 0 }; void bfs(int sx, int sy) { queue<int> que; vis[sy][sx] = 1; que.push(sy * 1010 + sx); rep(k, 0, K) { queue<int> nque; while (!que.empty()) { int q = que.front(); que.pop(); int y = q / 1010, x = q % 1010; rep(i, 0, 4) { int xx = x + dx[i]; int yy = y + dy[i]; if (xx < 0 || W <= xx) continue; if (yy < 0 || H <= yy) continue; if (A[yy][xx] == '#') continue; if (vis[yy][xx]) continue; vis[yy][xx] = 1; nque.push(yy * 1010 + xx); } } swap(nque, que); } } //----------------------------------------------------------------- int main() { cin >> H >> W >> K; rep(y, 0, H) cin >> A[y]; int sx, sy; rep(y, 0, H) rep(x, 0, W) if (A[y][x] == 'S') sx = x, sy = y; if (sx == 0 || sx == W - 1 || sy == 0 || sy == H - 1) { printf("0\n"); return 0; } bfs(sx, sy); int ans = 1010101010; rep(y, 0, H) rep(x, 0, W) if (vis[y][x]) { int up = y; int down = H - 1 - y; int left = x; int right = W - 1 - x; int d = min(min(up, down), min(left, right)); if (d == 0) ans = 1; int a = d / K; if (d % K) a++; ans = min(ans, a + 1); } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - Closed Rooms |
User | hamayanhamayan |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1727 Byte |
Status | AC |
Exec Time | 179 ms |
Memory | 3584 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 700 / 700 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt, sample3.txt |
All | 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 | AC | 24 ms | 1152 KB |
in10.txt | AC | 24 ms | 1152 KB |
in11.txt | AC | 24 ms | 1152 KB |
in12.txt | AC | 24 ms | 1152 KB |
in13.txt | AC | 24 ms | 1152 KB |
in14.txt | AC | 24 ms | 1152 KB |
in15.txt | AC | 24 ms | 1152 KB |
in16.txt | AC | 24 ms | 1152 KB |
in17.txt | AC | 24 ms | 1152 KB |
in18.txt | AC | 24 ms | 1152 KB |
in19.txt | AC | 24 ms | 1152 KB |
in2.txt | AC | 24 ms | 1152 KB |
in20.txt | AC | 2 ms | 256 KB |
in21.txt | AC | 1 ms | 256 KB |
in22.txt | AC | 1 ms | 256 KB |
in23.txt | AC | 24 ms | 1152 KB |
in24.txt | AC | 24 ms | 1152 KB |
in25.txt | AC | 24 ms | 1152 KB |
in26.txt | AC | 24 ms | 1536 KB |
in27.txt | AC | 24 ms | 1152 KB |
in28.txt | AC | 31 ms | 2944 KB |
in29.txt | AC | 39 ms | 3584 KB |
in3.txt | AC | 24 ms | 1152 KB |
in30.txt | AC | 26 ms | 2048 KB |
in31.txt | AC | 24 ms | 1152 KB |
in32.txt | AC | 24 ms | 1152 KB |
in33.txt | AC | 179 ms | 3584 KB |
in34.txt | AC | 60 ms | 3584 KB |
in35.txt | AC | 24 ms | 1280 KB |
in36.txt | AC | 45 ms | 1152 KB |
in37.txt | AC | 24 ms | 1152 KB |
in38.txt | AC | 24 ms | 1152 KB |
in39.txt | AC | 24 ms | 1152 KB |
in4.txt | AC | 162 ms | 1152 KB |
in40.txt | AC | 24 ms | 1152 KB |
in5.txt | AC | 162 ms | 1152 KB |
in6.txt | AC | 24 ms | 1152 KB |
in7.txt | AC | 24 ms | 1152 KB |
in8.txt | AC | 24 ms | 1152 KB |
in9.txt | AC | 24 ms | 1152 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |