# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
965691 | NeroZein | Two Currencies (JOI23_currencies) | C++17 | 6 ms | 18532 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;
#ifdef Nero
#include "Deb.h"
#else
#define debug(...)
#endif
const int LOG = 17;
const int N = 1e5 + 5;
const int M = 1e9 + 2;
int n, m, q;
vector<int> g[N];
pair<int, int> edge[N];
pair<int, int> checkpoint[N];
int idd;
int dep[N], up[LOG][N];
vector<int> vec[N];
pair<long long, int> tr[N * LOG];
int rt[N], lc[N * LOG], rc[N * LOG];
void dfs(int v, int p) {
for (int u : g[v]) {
if (u == p) continue;
dep[u] = dep[v] + 1;
up[0][u] = v;
# | 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... |