# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
825954 | vjudge1 | Dijamant (COCI22_dijamant) | C++17 | 211 ms | 240984 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;
using ll = long long;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
const int oo = 1e9;
int n, m, sol;
char a[2020][2020];
bool vis[2020][2020];
int min_sm, max_sm, min_diff, max_diff, check, cnt;
void dfs(int x, int y)
{
if ((x == 0) || (x == n + 1) || (y == 0) || (y == m + 1))
{
check = 0;
return;
}
if (vis[x][y] || a[x][y] == '#')
return;
vis[x][y] = 1;
cnt++;
min_sm = min(min_sm, x + y);
max_sm = max(max_sm, x + y);
min_diff = min(min_diff, x - y);
max_diff = max(max_diff, x - y);
for (int i = 0; i < 4; i++)
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |