# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
725493 | TheSahib | Zoo (COCI19_zoo) | C++17 | 98 ms | 5828 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>
#pragma GCC optimize("O3")
#define ll long long
#define pii pair<int, int>
using namespace std;
const int MAX = 1005;
pii dirs[4] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int n, m;
int grid[MAX][MAX];
bool visited[MAX][MAX];
vector<pii> lastNodes, nodes;
void dfs(pii cord){
visited[cord.first][cord.second] = 1;
for(pii d:dirs){
pii cord1 = {cord.first + d.first, cord.second + d.second};
if(cord1.first >= 0 && cord1.first < n && cord1.second >= 0 && cord1.second < m && !visited[cord1.first][cord1.second]){
if(grid[cord1.first][cord1.second] == grid[cord.first][cord.second]){
dfs(cord1);
}
else if(grid[cord1.first][cord1.second] == 3 - grid[cord.first][cord.second]){
nodes.push_back(cord1);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |