# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
734378 | NeroZein | Two Currencies (JOI23_currencies) | C++17 | 4807 ms | 45536 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 int long long
using namespace std;
#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif
struct queries {
int u, v, gold, silver;
};
const int Log = 18;
const int N = 100005;
int n, m, q;
vector<int> g[N];
pair<int,int> e[N];
pair<int,int> ch[N];
int idd;
int up[Log][N];
int in[N], out[N], dep[N];
void Dfs (int v, int p) {
in[v] = ++idd;
for (int u : g[v]) {
if (u == p) continue;
# | 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... |