# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
924319 | AlphaMale06 | Two Currencies (JOI23_currencies) | C++17 | 1998 ms | 167552 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 pb push_back
#define F first
#define S second
#define int long long
const int N = 1e5+5;
struct node{
int val, cnt, lc, rc;
};
node pers[50*N];
int tin[N], tout[N], h[N];
vector<pair<int, int>> cst;
vector<int> adj[N];
int timer=0;
int n, m, q;
vector<pair<int, int>> edges;
int p[N][18];
vector<int> roots;
int nodenum=0;
void dfs(int v, int par){
p[v][0]=par;
for(int i=1; i<18; i++){
p[v][i]=p[p[v][i-1]][i-1];
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... |