# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
140582 | khrbuddy03 | 토마토 (KOI13_tomato) | C++14 | 108 ms | 7928 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int inf = 1009;
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, -1, 1};
int b[inf][inf];
bool vis[inf][inf];
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n, m; cin >> n >> m;
swap(n, m);
queue<pair<int, pair<int, int>>> q;
for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) {
cin >> b[i][j];
if (b[i][j] == 1) {
q.push(make_pair(0, make_pair(i, j)));
vis[i][j] = 1;
}
}
int ans = 0;
while (!q.empty()) {
int dist = q.front().first;
ans = max(ans, dist);
pair<int, int> here = q.front().second;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |