# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
723330 | Mr_Husanboy | Event Hopping (BOI22_events) | C++17 | 1575 ms | 19940 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>
using namespace std;
#define all(a) (a).begin(), (a).end()
template<typename T>
int len(T &a){
return a.size();
}
using ll = long long;
const int inf = 1e9;
const ll infl = 1e18;
#define ff first
#define ss second
struct Sparse{
vector<vector<pair<int,int>>> t;
int n, logn;
pair<int,int> join(pair<int,int> a, pair<int,int> b){
return min(a, b);
}
auto build(vector<int> &a){
n = len(a);
logn = 32 - __builtin_clz(n);
t.assign(n, vector<pair<int,int>> (logn, pair{inf, 0}));
for(int i = 0; i < n; i ++){
t[i][0] = {a[i], i};
}
for(int j = 1; j < logn; j ++){
for(int i = 0; i + (1 << j) <= n; i ++){
t[i][j] = join(t[i][j - 1], t[i + (1 << (j - 1))][j - 1]);
# | 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... |