# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
926020 | andrei_boaca | Two Currencies (JOI23_currencies) | C++17 | 1459 ms | 54480 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;
typedef long long ll;
typedef pair<int,int> pii;
ll n,m,q,in[100005],out[100005],dp[21][100005],par[100005],timp,total[100005],init[100005],niv[100005];
vector<pii> g;
vector<int> muchii[100005];
struct date
{
ll p,c;
} v[100005];
bool byc(date a, date b)
{
return a.c<b.c;
}
struct qr
{
ll a,b,gold,silver,best;
} query[100005];
bool isancestor(int a,int b)
{
return in[a]<=in[b]&&out[a]>=out[b];
}
int LCA(int a,int b)
{
if(niv[a]>niv[b])
swap(a,b);
if(isancestor(a,b))
return a;
# | 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... |