# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
126045 | tinder | Dungeon 2 (JOI16_dungeon2) | C++14 | 32 ms | 1400 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 "dungeon2.h"
#include <bits/stdc++.h>
using namespace std;
struct edge {
int id, l, r;
edge() {}
edge(int id, int l, int r) {
this -> id = id, this -> l = l, this -> r = r;
}
bool operator < (const edge &o) const {
id < o.id;
}
};
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxn = 2e2 + 5;
const int inf = 1e5;
int deg[maxn], pe[maxn];
int dad[maxn], lvl[maxn];
int N, M;
int ptr = 0;
map<int, int> t[maxn];
vector<edge> back[maxn];
int wot[maxn];
int g[maxn][maxn];
int AncAtLvl(int u, int l) {
assert(lvl[u] > l);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |