Submission #2373874
Source Code Expand
#include <iostream> #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <ctime> #include <algorithm> #include <map> #include <set> #include <bitset> #include <vector> #include <complex> #include <queue> #include <stack> #include <sstream> #define mp(a, b) make_pair(a, b) using namespace std; typedef pair<pair<int, int>, pair<int, int> > pp; const int maxn = 805; char c[maxn][maxn]; int cnt[maxn][maxn]; int step[maxn][maxn]; bool mark[maxn][maxn]; int dx[4] = {-1, 1, 0, 0}; int dy[4] = {0, 0, -1, 1}; int asd(const int &x, const int &k) { return (x - 1) / k + 1; } int main() { std::ios::sync_with_stdio(false); int h, w, k; cin >> h >> w >> k; int posx = 0, posy = 0; for(int i = 1; i <= h; i ++) for(int j = 1; j <= w; j ++) { cin >> c[i][j]; if(c[i][j] == 'S') { posx = i; posy = j; } } if(posx == 1 || posx == h || posy == 1 || posy == w) { cout << 0 << endl; return 0; } priority_queue<pp, vector<pp>, greater<pp> > q; q.push(mp(mp(1, 0), mp(posx, posy))); int ans = max(h, w); while(!q.empty()) { pp p = q.top(); q.pop(); int a = p.first.first, b = p.first.second, x = p.second.first, y = p.second.second; if(mark[x][y]) continue; mark[x][y] = 1; ans = min(ans, min(min(asd(x - 1, k), asd(h - x, k)), min(asd(y - 1, k), asd(w - y, k)))); if(x == 1 || x == h || y == 1 || y == w) { cout << a << endl; return 0; } if(b < k) for(int i = 0; i < 4; i ++) if(c[x + dx[i]][y + dy[i]] == '.') q.push(mp(mp(a, b + 1), mp(x + dx[i], y + dy[i]))); } cout << ans + 1 << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Closed Rooms |
User | renjingyi |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1681 Byte |
Status | AC |
Exec Time | 38 ms |
Memory | 2816 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 | 11 ms | 2560 KB |
in10.txt | AC | 11 ms | 2560 KB |
in11.txt | AC | 11 ms | 2560 KB |
in12.txt | AC | 11 ms | 2560 KB |
in13.txt | AC | 11 ms | 2560 KB |
in14.txt | AC | 11 ms | 2560 KB |
in15.txt | AC | 12 ms | 2560 KB |
in16.txt | AC | 11 ms | 2560 KB |
in17.txt | AC | 11 ms | 2560 KB |
in18.txt | AC | 11 ms | 2560 KB |
in19.txt | AC | 11 ms | 2560 KB |
in2.txt | AC | 11 ms | 2560 KB |
in20.txt | AC | 2 ms | 2560 KB |
in21.txt | AC | 2 ms | 2304 KB |
in22.txt | AC | 2 ms | 2304 KB |
in23.txt | AC | 11 ms | 2560 KB |
in24.txt | AC | 11 ms | 2560 KB |
in25.txt | AC | 11 ms | 2560 KB |
in26.txt | AC | 13 ms | 2688 KB |
in27.txt | AC | 11 ms | 2560 KB |
in28.txt | AC | 25 ms | 2816 KB |
in29.txt | AC | 18 ms | 2688 KB |
in3.txt | AC | 11 ms | 2560 KB |
in30.txt | AC | 23 ms | 2816 KB |
in31.txt | AC | 11 ms | 2560 KB |
in32.txt | AC | 11 ms | 2560 KB |
in33.txt | AC | 38 ms | 2816 KB |
in34.txt | AC | 14 ms | 2688 KB |
in35.txt | AC | 11 ms | 2560 KB |
in36.txt | AC | 11 ms | 2560 KB |
in37.txt | AC | 11 ms | 2560 KB |
in38.txt | AC | 11 ms | 2560 KB |
in39.txt | AC | 11 ms | 2560 KB |
in4.txt | AC | 11 ms | 2560 KB |
in40.txt | AC | 11 ms | 2560 KB |
in5.txt | AC | 11 ms | 2560 KB |
in6.txt | AC | 11 ms | 2560 KB |
in7.txt | AC | 11 ms | 2560 KB |
in8.txt | AC | 11 ms | 2560 KB |
in9.txt | AC | 10 ms | 2560 KB |
sample1.txt | AC | 2 ms | 2304 KB |
sample2.txt | AC | 1 ms | 2304 KB |
sample3.txt | AC | 1 ms | 2304 KB |