Submission #1553768
Source Code Expand
#include<bits/stdc++.h> using namespace std; int H, W, K; int MAP[1000][1000]; int x, y, vis[1000][1000]; int ans = 2147483647; const int dx[4] = {0, 1, 0, -1}; const int dy[4] = {1, 0, -1, 0}; bool check(int x, int y) { if (x < 0 || x > H) return 0; if (y < 0 || y > W) return 0; if (MAP[x][y]) return 0; return 1; } void DFS(int x, int y, int now) { if (now > K) return; if (vis[x][y] <= now && vis[x][y] != 0) return; vis[x][y] = now; if (x == 1 || y == 1 || x == H || y == W) ans = min(ans, now); ans = min(ans, min(min((int)ceil((double)(x - 1) / K), (int)ceil((double)(y - 1) / K)), min((int)ceil((double)H - x / K), (int)ceil((double)W - y / K))) + 1); for (int i = 0; i < 4; i ++) { if (check(x + dx[i], y + dy[i])) DFS(x + dx[i], y + dy[i], now + 1); } } int main() { cin >> H >> W >> K; for (int i = 1; i <= H; i ++) { string s; cin >> s; for (int j = 1; j <= W; j ++) { if (s[j - 1] == '#') MAP[i][j] = 1; else { MAP[i][j] = 0; if (s[j - 1] == 'S') x = i, y = j; } } } DFS(x, y, 0); cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Closed Rooms |
User | xc01 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1243 Byte |
Status | WA |
Exec Time | 2107 ms |
Memory | 63104 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 27 ms | 5248 KB |
in10.txt | WA | 27 ms | 5248 KB |
in11.txt | AC | 26 ms | 5248 KB |
in12.txt | WA | 26 ms | 5248 KB |
in13.txt | AC | 26 ms | 5248 KB |
in14.txt | WA | 26 ms | 5248 KB |
in15.txt | AC | 26 ms | 5248 KB |
in16.txt | WA | 26 ms | 5248 KB |
in17.txt | WA | 26 ms | 5248 KB |
in18.txt | WA | 26 ms | 5248 KB |
in19.txt | AC | 26 ms | 5248 KB |
in2.txt | AC | 26 ms | 5376 KB |
in20.txt | AC | 3 ms | 5248 KB |
in21.txt | AC | 2 ms | 2304 KB |
in22.txt | AC | 2 ms | 2304 KB |
in23.txt | WA | 26 ms | 5248 KB |
in24.txt | WA | 26 ms | 5248 KB |
in25.txt | AC | 26 ms | 5248 KB |
in26.txt | AC | 32 ms | 5760 KB |
in27.txt | AC | 26 ms | 5248 KB |
in28.txt | WA | 477 ms | 7296 KB |
in29.txt | TLE | 2103 ms | 7296 KB |
in3.txt | WA | 26 ms | 5248 KB |
in30.txt | AC | 82 ms | 6400 KB |
in31.txt | AC | 26 ms | 5248 KB |
in32.txt | AC | 26 ms | 5248 KB |
in33.txt | TLE | 2107 ms | 63104 KB |
in34.txt | TLE | 2104 ms | 16640 KB |
in35.txt | WA | 25 ms | 5376 KB |
in36.txt | AC | 27 ms | 5248 KB |
in37.txt | WA | 25 ms | 5248 KB |
in38.txt | WA | 24 ms | 5248 KB |
in39.txt | WA | 25 ms | 5248 KB |
in4.txt | AC | 26 ms | 5248 KB |
in40.txt | AC | 25 ms | 5248 KB |
in5.txt | AC | 26 ms | 5248 KB |
in6.txt | WA | 26 ms | 5248 KB |
in7.txt | AC | 26 ms | 5248 KB |
in8.txt | AC | 26 ms | 5248 KB |
in9.txt | AC | 27 ms | 5376 KB |
sample1.txt | AC | 2 ms | 2304 KB |
sample2.txt | AC | 2 ms | 2304 KB |
sample3.txt | AC | 2 ms | 2304 KB |