# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
715537 | Behradm | Tracks in the Snow (BOI13_tracks) | C++11 | 2095 ms | 1027804 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.
/**
* In the name of GOD
* author : Behradm
**/
#include "bits/stdc++.h"
using namespace std;
#define sz(x) (int) ((x).size())
const int N = 4e3 + 5;
char s[N][N];
int tag[N][N];
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};
int n, m;
bool Good(int x, int y) {
return (0 <= x && x < n && 0 <= y && y < m && s[x][y] != '.');
}
void dfs(int i, int j, int c) {
tag[i][j] = c;
for (int k = 0; k < 4; k++) {
int x = i + dx[k], y = j + dy[k];
if (Good(x, y) && s[x][y] == s[i][j] && tag[x][y] == -1) {
dfs(x, y, c);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |