# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
229474 | grt | Zoo (COCI19_zoo) | C++17 | 71 ms | 7296 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>
#define PB push_back
#define ST first
#define ND second
#define _ ios_base::sync_with_stdio(0); cin.tie(0);
//mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
using namespace std;
using ll = long long;
using pi = pair<int,int>;
using vi = vector<int>;
const int nax = 1010;
int n,m;
char t[nax][nax];
bool visited[nax][nax];
int dist[nax][nax];
int dx[4] = {0,0,1,-1};
int dy[4] = {1,-1,0,0};
queue<pi>Q1,Q2;
bool valid(int &x,int &y) {
return 0<=x&&x<n&&0<=y&&y<m;
}
void bfs() {
Q1.push({0,0});
visited[0][0] = 1;
while(!Q1.empty()) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |