# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
361587 | saarang123 | Rectangles (IOI19_rect) | C++14 | 5092 ms | 539172 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>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#pragma GCC target ("avx2")
#pragma GCC optimization ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
template<bool returnMax, bool returnIndex>
struct SparseTable {
int n, k;
vector<int> a;
vector<vector<int>> st;
void init(vector<int> a) {
this->a = a;
n = (int) a.size();
k = lg(n);
st.assign(n + 1, vector<int>(k + 1));
build();
}
int lg(int x) { return 31 - __builtin_clz(x); }
int merge(int x, int y) {
if (returnMax) return a[x] >= a[y] ? x : y;
return a[x] < a[y] ? x : y;
}
void build() {
for (int i = 0; i < n; i++) st[i][0] = i;
for (int j = 1; j <= k; j++)
for (int i = 0; i + (1 << j) - 1 < n; i++)
st[i][j] = merge(st[i][j - 1], st[i + (1 << (j - 1))][j - 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... |
# | 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... |