# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
86734 | HellAngel | Divide and conquer (IZhO14_divide) | C++14 | 174 ms | 19576 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 int long long
using namespace std;
const int maxn = 3e5 + 7;
int n, m, x[maxn], g[maxn], r[maxn];
int BIT[maxn], cnt, ans;
vector<int> vt;
map<int, int> mp;
void Update(int x, int val)
{
for(; x < maxn; x += (x & -x))
{
BIT[x] = min(BIT[x], val);
}
}
int Get(int x)
{
int ans = INT_MAX;
for(; x > 0; x -= (x & -x))
{
ans = min(ans, BIT[x]);
}
return ans;
}
int32_t main()
{
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... |