Submission #1794247
Source Code Expand
#include <bits/stdc++.h> using namespace std; int u[100001]; int d1[] = {1, -1, 0, 0}; int d2[] = {0, 0, 1, -1}; int d[1001][1001]; queue <pair <int, int> > q; char a[1001][1001]; main () { ios_base::sync_with_stdio (0); cin.tie (0); int n, m, k; cin >> n >> m >> k; int starti, startj; for (int i = 1;i <= n;i ++) { for (int j = 1;j <= m;j ++) { cin >> a[i][j]; if (a[i][j] == 'S') { starti = i; startj = j; } } } for (int i = 1;i <= n;i ++) { for (int j = 1;j <= m;j ++) { d[i][j] = 1e9 + 7; } } d[starti][startj] = 0; q.push (make_pair (starti, startj)); while (q.size ()) { int r = q.front ().first; int c = q.front ().second; q.pop (); for (int i = 0;i <= 3;i ++) { int x = d1[i]; int y = d2[i]; if (r + x < 1 || r + x > n || c + y < 1 || c + y > m) continue; if (d[r][c] + 1 < d[r + x][y + c] && a[r + x][y + c] == '.') { q.push (make_pair (r + x, c + y)); d[r + x][y + c] = d[r][c] + 1; } } } int ans = 1e9 + 7; for (int i = 1;i <= n;i ++) { for (int j = 1;j <= m;j ++) { if (d[i][j] == 1e9 + 7) continue; int mn = min ({n - i, i - 1, m - j, j - 1}); int jkl = mn / k; if (mn % k) jkl ++; ans = min (ans, jkl + 1); } } cout << ans; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Closed Rooms |
User | almasalmas |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1324 Byte |
Status | WA |
Exec Time | 35 ms |
Memory | 4224 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 | AC | 10 ms | 4224 KB |
in10.txt | WA | 10 ms | 4224 KB |
in11.txt | AC | 10 ms | 4224 KB |
in12.txt | AC | 10 ms | 4224 KB |
in13.txt | AC | 10 ms | 4224 KB |
in14.txt | AC | 10 ms | 4224 KB |
in15.txt | AC | 10 ms | 4224 KB |
in16.txt | AC | 10 ms | 4224 KB |
in17.txt | AC | 10 ms | 4224 KB |
in18.txt | AC | 12 ms | 4224 KB |
in19.txt | AC | 10 ms | 4224 KB |
in2.txt | AC | 11 ms | 4224 KB |
in20.txt | AC | 3 ms | 4224 KB |
in21.txt | AC | 1 ms | 256 KB |
in22.txt | AC | 1 ms | 256 KB |
in23.txt | AC | 10 ms | 4224 KB |
in24.txt | AC | 10 ms | 4224 KB |
in25.txt | AC | 10 ms | 4224 KB |
in26.txt | WA | 35 ms | 4224 KB |
in27.txt | WA | 34 ms | 4224 KB |
in28.txt | AC | 34 ms | 4224 KB |
in29.txt | AC | 34 ms | 4224 KB |
in3.txt | WA | 10 ms | 4224 KB |
in30.txt | WA | 35 ms | 4224 KB |
in31.txt | WA | 35 ms | 4224 KB |
in32.txt | WA | 34 ms | 4224 KB |
in33.txt | AC | 25 ms | 4224 KB |
in34.txt | AC | 25 ms | 4224 KB |
in35.txt | WA | 27 ms | 4224 KB |
in36.txt | AC | 10 ms | 4224 KB |
in37.txt | AC | 10 ms | 4224 KB |
in38.txt | AC | 10 ms | 4224 KB |
in39.txt | WA | 29 ms | 4224 KB |
in4.txt | AC | 10 ms | 4224 KB |
in40.txt | WA | 29 ms | 4224 KB |
in5.txt | AC | 10 ms | 4224 KB |
in6.txt | AC | 10 ms | 4224 KB |
in7.txt | AC | 10 ms | 4224 KB |
in8.txt | AC | 10 ms | 4224 KB |
in9.txt | AC | 10 ms | 4224 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |