Submission #2834922
Source Code Expand
#include <iostream> #include <vector> #include <string> #include <queue> using namespace std; int solve(const vector<string>& board, int K){ const int H = board.size(); const int W = board[0].size(); queue<pair<int,int>> qu; vector<vector<int>> step(H, vector<int>(W, -1)); for(int i=0;i<H;i++){ for(int j=0;j<W;j++){ if(board[i][j] == 'S'){ qu.emplace(i, j); step[i][j] = 0; } } } while(!qu.empty()){ auto p = qu.front(); qu.pop(); int h = p.first, w = p.second; if(h == 0 || h == H-1 || w == 0 || w == W-1) return 1; if(step[h][w] == K) continue; int dx[] = {-1, 0, 1, 0}; int dy[] = {0, -1, 0, 1}; for(int d=0;d<4;d++){ int nh = h + dx[d], nw = w + dy[d]; if(nh < 0 || H <= nh || nw < 0 || W <= nw) continue; if(board[nh][nw] == '#') continue; if(step[nh][nw] != -1) continue; step[nh][nw] = step[h][w] + 1; qu.emplace(nh, nw); } } int res = 100000000; for(int i=0;i<H;i++){ for(int j=0;j<W;j++){ if(step[i][j] == -1) continue; res = min(res, (i+K-1)/K); res = min(res, (j+K-1)/K); res = min(res, (H-1-i+K-1)/K); res = min(res, (W-1-j+K-1)/K); } } return res + 1; } int main(){ int H, W, K; while(cin >> H >> W >> K){ vector<string> board(H); for(auto& s : board) cin >> s; cout << solve(board, K) << endl; } }
Submission Info
Submission Time | |
---|---|
Task | C - Closed Rooms |
User | pes |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1366 Byte |
Status | AC |
Exec Time | 27 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 | 25 ms | 3584 KB |
in10.txt | AC | 25 ms | 3584 KB |
in11.txt | AC | 25 ms | 3584 KB |
in12.txt | AC | 25 ms | 3584 KB |
in13.txt | AC | 25 ms | 3584 KB |
in14.txt | AC | 25 ms | 3584 KB |
in15.txt | AC | 25 ms | 3584 KB |
in16.txt | AC | 25 ms | 3584 KB |
in17.txt | AC | 25 ms | 3584 KB |
in18.txt | AC | 25 ms | 3584 KB |
in19.txt | AC | 25 ms | 3584 KB |
in2.txt | AC | 25 ms | 3584 KB |
in20.txt | AC | 2 ms | 384 KB |
in21.txt | AC | 1 ms | 256 KB |
in22.txt | AC | 1 ms | 256 KB |
in23.txt | AC | 25 ms | 3584 KB |
in24.txt | AC | 25 ms | 3584 KB |
in25.txt | AC | 25 ms | 3584 KB |
in26.txt | AC | 25 ms | 3584 KB |
in27.txt | AC | 25 ms | 3584 KB |
in28.txt | AC | 26 ms | 3584 KB |
in29.txt | AC | 25 ms | 3584 KB |
in3.txt | AC | 25 ms | 3584 KB |
in30.txt | AC | 27 ms | 3584 KB |
in31.txt | AC | 25 ms | 3584 KB |
in32.txt | AC | 25 ms | 3584 KB |
in33.txt | AC | 26 ms | 3584 KB |
in34.txt | AC | 25 ms | 3584 KB |
in35.txt | AC | 25 ms | 3584 KB |
in36.txt | AC | 25 ms | 3584 KB |
in37.txt | AC | 25 ms | 3584 KB |
in38.txt | AC | 25 ms | 3584 KB |
in39.txt | AC | 25 ms | 3584 KB |
in4.txt | AC | 25 ms | 3584 KB |
in40.txt | AC | 25 ms | 3584 KB |
in5.txt | AC | 25 ms | 3584 KB |
in6.txt | AC | 25 ms | 3584 KB |
in7.txt | AC | 25 ms | 3584 KB |
in8.txt | AC | 25 ms | 3584 KB |
in9.txt | AC | 25 ms | 3584 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |