# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
792765 | daoquanglinh2007 | Two Currencies (JOI23_currencies) | C++17 | 945 ms | 45676 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 int long long
const int NM = 1e5, LOG = 16;
struct checkpt{
int v, c;
};
struct query{
int id, s, t, lca, x, y, l, r, mid, res;
};
int N, M, Q, u[NM+5], v[NM+5], t = 0;
vector <int> adj[NM+5];
int parent[NM+5], h[NM+5], st[NM+5], en[NM+5];
int jump[NM+5][LOG+5];
checkpt a[NM+5];
query b[NM+5];
int bit[2*NM+5], bit2[2*NM+5];
int ans[NM+5];
void DFS(int u){
st[u] = ++t;
for (int i = 0; i < adj[u].size(); i++){
int v = adj[u][i];
if (h[v] != -1) continue;
parent[v] = u;
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... |