# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
88462 | tieunhi | Global Warming (CEOI18_glo) | C++14 | 79 ms | 9244 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 pii pair<int, int>
#define mp make_pair
#define F first
#define S second
#define PB push_back
#define FOR(i, u, v) for (int i = u; i <= v; i++)
#define FORD(i, v, u) for (int i = v; i >= u; i--)
#define N 100005
#define maxc 1ll*100000000000000007
#define ll long long
using namespace std;
int n, d, a[N], b[N], rr[N*2], cur, rig[N];
struct BIT
{
int t[N];
void reset()
{
memset(t, 0, sizeof t);
}
void upd(int x, int val)
{
for (; x < N; x += (x & -x)) t[x] = max(t[x], val);
}
int get(int x)
{
int ans = 0;
for (; x; x -= (x & -x)) ans = max(ans, t[x]);
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |