# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1089502 | Gervid | Zoo (COCI19_zoo) | C++17 | 79 ms | 2908 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 <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <limits.h>
#include <algorithm>
#include <math.h>
using namespace std;
struct node
{
int x, y;
int layer;
const bool operator< (const node other) const
{
return layer > other.layer;
}
};
int r, c;
bool outofbounds(node n)
{
return !(0 <= n.x && n.x < r && 0 <= n.y && n.y < c);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |