# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
345050 | limabeans | Zoo (COCI19_zoo) | C++17 | 66 ms | 4716 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;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
const int maxn = 1010;
int n, m;
string g[maxn];
bool viz[maxn][maxn];
int cc = 0;
vector<pair<int,int>> moves = { {-1,0}, {1,0}, {0,-1}, {0,1} };
vector<pair<int,int>> qq;
void dfs(int x, int y, char c) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |