# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
37020 | nickyrio | Divide and conquer (IZhO14_divide) | C++14 | 73 ms | 42740 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 FOR(i, a, b) for (int i = a; i<= b; ++i)
#define FORD(i, a, b) for (int i = a; i>=b; --i)
#define REP(i, a) for (int i = 0; i<a; ++i)
#define N 1001000
#define pp pair<int, int>
#define bit(S, i) (((S) >> i) & 1)
#define IO cin.tie(NULL);cout.tie(NULL);
#define taskname "Test"
#define all(s) s.begin(), s.end()
using namespace std;
long long g[N], dp[N], d[N], x[N], BIT[N];
vector<long long> ranking;
int n;
void UpBIT(int u, long long val) {
for(; u > 0; u -= u & -u) BIT[u] = max(BIT[u], val);
}
long long GetBIT(int u) {
long long ans = -1e18;
for(; u <= n; u += u & -u) ans = max(ans, BIT[u]);
return ans;
}
int main() {
//freopen(taskname".inp","r",stdin);
//freopen(taskname".out","w",stdout);
IO;
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... |