# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
955219 | abczz | Meetings 2 (JOI21_meetings2) | C++14 | 1467 ms | 79596 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 <iostream>
#include <vector>
#include <queue>
#include <array>
#include <map>
#define ll long long
using namespace std;
vector <ll> adj[200000];
bool C[200000];
vector <array<ll, 2>> U;
vector <ll> V[200000];
vector <vector<ll>> D;
bool ok;
ll n, k, a, b, f = 1e18, g, sz[200000], F[200000];
struct SegTree{
vector <ll> st{vector <ll> (800000, -1e18)};
vector <ll> updated;
void update(ll id, ll l, ll r, ll q, ll w) {
updated.push_back(id);
if (l == r) {
st[id] = max(st[id], w);
return;
}
ll mid = (l+r)/2;
if (q <= mid) update(id*2, l, mid, q, w);
else update(id*2+1, mid+1, r, q, w);
st[id] = max(st[id*2], st[id*2+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... |