# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
910946 | Tuanlinh123 | Meetings 2 (JOI21_meetings2) | C++17 | 984 ms | 57480 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>
#define ll long long
#define pll pair<ll, ll>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ld long double
using namespace std;
const ll maxn=200005;
vector <ll> A[maxn];
ll child[maxn], used[maxn], ans[maxn];
ll Time, tin[maxn], tout[maxn], dis[maxn];
struct SegTree
{
ll n;
vector <ll> St;
SegTree(ll n): n(n) {St.assign(n*4+1, -1);}
void update(ll i, ll Start, ll End, ll idx, ll val)
{
if (Start==End)
{
St[i]=val;
return;
}
ll mid=(Start+End)/2;
if (mid>=idx) update(i*2, Start, mid, idx, val);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |