# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
590921 | Namnamseo | Stray Cat (JOI20_stray) | C++17 | 45 ms | 16868 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 "Anthony.h"
#include <bitset>
#include <vector>
using namespace std;
using vi=vector<int>;
namespace {
const int maxn = int(2e4) + 10;
int n;
struct Edge { int l, r; } ev[maxn];
vector<int> es[maxn];
int lev[maxn];
int col[maxn];
void bfs() {
static int q[maxn];
static bitset<maxn> vis;
int f = 0, t = 1; vis.set(0);
while (f < t) {
int x = q[f++];
for (int ei : es[x]) {
int y = ev[ei].l + ev[ei].r - x;
if (vis[y]) continue;
vis.set(y);
lev[y] = lev[x]+1;
q[t++] = y;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |