# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
856815 | bkhanh | Two Currencies (JOI23_currencies) | C++14 | 875 ms | 45524 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;
#define ll long long
#define fi first
#define se second
typedef pair <ll, ll> ii;
const ll N = 1e5 + 99;
struct st
{
ll s, t, z, w;
};
st qs[N];
ll n, m, q, up[N][20], In[N], Out[N], h[N], cnt;
ll num[N], diff[N], dd[N], ans[N];
ii edg[N];
vector <ll> adj[N];
vector <ii> vt;
void dfs(ll u)
{
In[u] = ++cnt;
for (ll v : adj[u])
{
if (up[u][0] == v) continue;
h[v] = h[u] + 1;
up[v][0] = u;
for (int i = 1; i <= 16; i++)
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |