# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
856983 | tvgk | Two Currencies (JOI23_currencies) | C++17 | 352 ms | 223760 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 task ""
#define se second
#define fi first
#define ll long long
#define ii pair<ll, ll>
const long mxN = 1e5 + 7;
#define int long long
ll lg, n, m, Time[mxN], source, dd[mxN], par[mxN][30], root, h[mxN], cnt, q, u[mxN], v[mxN], ticket;
ii cost[mxN];
vector<int> w[mxN], sta[mxN];
struct T
{
ll lt, rt, num, gt;
};
vector<T> tree[mxN * 4];
void Buildlog(int j)
{
lg = log2(h[j]);
for (int i = 1; i <= lg; i++)
par[j][i] = par[par[j][i - 1]][i - 1];
}
void Build(int j, int height)
{
dd[j] = 1;
# | 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... |